Genome Rearrangement by Reversals and Insertions/Deletions of Contiguous Segments
- 1 January 2000
- book chapter
- Published by Springer Nature
- p. 222-234
- https://doi.org/10.1007/3-540-45123-4_20
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Transforming men into mice (polynomial algorithm for genomic distance problem)Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Formulations and hardness of multiple sorting by reversalsPublished by Association for Computing Machinery (ACM) ,1999
- The Organelle Genome Database Project (GOBASE)Nucleic Acids Research, 1998
- Faster and simpler algorithm for sorting signed permutations by reversalsPublished by Association for Computing Machinery (ACM) ,1997
- Sorting by reversals is difficultPublished by Association for Computing Machinery (ACM) ,1997
- Fast sorting by reversalPublished by Springer Nature ,1996
- Transforming cabbage into turnipPublished by Association for Computing Machinery (ACM) ,1995
- Polynomial-time algorithm for computing translocation distance between genomesPublished by Springer Nature ,1995