Subject
General Computer Science,Theoretical Computer Science
Reference16 articles.
1. Sorting by reversals: genome rearrangements in plant organelles and evolutionary history of x chromosome;Bafna;Mole. Biol. Evol.,1995
2. Genome rearrangement and sorting by reversals;Bafna;SIAM J. Comput.,1996
3. P. Berman, M. Karpinski, On some tighter inapproximability results, ECCC Report No. 65, University of Trier, 1998.
4. A. Caprara, Sorting by reversal is difficult, Proc. First Annu. Internat. Conf. on Computational Molecular Biology 1997, pp. 75–83.
5. Polynomial time algorithm for computing translocation distance between genomes;Hannenhalli;Discrete Appl. Math.,1996
Cited by
20 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献