Subject
General Computer Science,Theoretical Computer Science
Reference15 articles.
1. A linear-time algorithm for computing inversion distance between signed permutations with an experimental study;Bader;J. Comput. Biol.,2001
2. V. Bafna, P. Pevzner, Genome rearrangements and sorting by reversals, Proc. 34th IEEE Symp. of the Foundations of Computer Science, 1994, pp. 148–157.
3. Sorting by transpositions;Bafna;SIAM J. Discrete Math.,1998
4. A. Bergeron, A very elementary presentation of the Hannenhalli–Pevzner Theory, Proc. 12th Annu. Symp. on Combinatorial Pattern Matching, 2001, pp. 106–117.
5. P. Berman, S. Hannenhalli, Fast sorting by reversals, Proc. 7th Annu. Symp. on Combinatorial Pattern Matching, 1996, pp. 168–185.
Cited by
42 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Rearrangement Distance Problems: An updated survey;ACM Computing Surveys;2024-04-26
2. Sorting Signed Permutations by Inverse Tandem Duplication Random Losses;IEEE/ACM Transactions on Computational Biology and Bioinformatics;2021-11-01
3. Sorting Permutations by Intergenic Operations;IEEE/ACM Transactions on Computational Biology and Bioinformatics;2021-11-01
4. Reversals and transpositions distance with proportion restriction;Journal of Bioinformatics and Computational Biology;2021-06-23
5. Length-weighted $$\lambda $$-rearrangement distance;Journal of Combinatorial Optimization;2020-11-18