Efficient algorithms for multichromosomal genome rearrangements
- 30 November 2002
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 65 (3) , 587-609
- https://doi.org/10.1016/s0022-0000(02)00011-9
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- GRIMM: genome rearrangements web serverBioinformatics, 2002
- A Linear-Time Algorithm for Computing Inversion Distance between Signed Permutations with an Experimental StudyJournal of Computational Biology, 2001
- A New Implementation and Detailed Study of Breakpoint AnalysisPacific Symposium on Biocomputing, 2000
- A Faster and Simpler Algorithm for Sorting Signed Permutations by ReversalsSIAM Journal on Computing, 2000
- Formulations and hardness of multiple sorting by reversalsPublished by Association for Computing Machinery (ACM) ,1999
- Transforming cabbage into turnipJournal of the ACM, 1999
- Exact and approximation algorithms for sorting by reversals, with application to genome rearrangementAlgorithmica, 1995
- Efficient bounds for oriented chromosome inversion distancePublished by Springer Nature ,1994