The median problem for breakpoints in comparative genomics
- 1 January 1997
- book chapter
- Published by Springer Nature
- p. 251-263
- https://doi.org/10.1007/bfb0045092
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Transforming men into mice (polynomial algorithm for genomic distance problem)Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- On the complexity and approximation of syntenic distancePublished by Association for Computing Machinery (ACM) ,1997
- 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
- Parametric genome rearrangementGene, 1996
- Genome Rearrangements and Sorting by ReversalsSIAM Journal on Computing, 1996
- Original SyntenyPublished by Springer Nature ,1996
- Exact and approximation algorithms for sorting by reversals, with application to genome rearrangementAlgorithmica, 1995
- Polynomial-time algorithm for computing translocation distance between genomesPublished by Springer Nature ,1995
- Efficient bounds for oriented chromosome inversion distancePublished by Springer Nature ,1994