Polynomial-time algorithm for computing translocation distance between genomes
- 1 December 1996
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 71 (1-3), 137-151
- https://doi.org/10.1016/s0166-218x(96)00061-3
Abstract
No abstract availableKeywords
Funding Information
- National Science Foundation
- National Institutes of Health (IROI HG00987)
- U.S. Department of Energy (DE-FG02-94ER6 19 19)
This publication has 11 references indexed in Scilit:
- Genome rearrangements and sorting by reversalsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Transforming men into mice (polynomial algorithm for genomic distance problem)Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Sorting by TranspositionsSIAM Journal on Discrete Mathematics, 1998
- Genome Sequence Comparison and Scenarios for Gene Rearrangements: A Test CaseGenomics, 1995
- Sorting by Reversals: Genome Rearrangements in Plant Organelles and Evolutionary History of X ChromosomeMolecular Biology and Evolution, 1995
- Efficient bounds for oriented chromosome inversion distanceLecture Notes in Computer Science, 1994
- A Genetic Linkage Map of the Mouse: Current Applications and Future ProspectsScience, 1993
- Gene order comparisons for phylogenetic inference: evolution of the mitochondrial genome.Proceedings of the National Academy of Sciences, 1992
- Edit distance for genome comparison based on non-local operationsLecture Notes in Computer Science, 1992
- [26] Genomic divergence through gene rearrangementMethods in Enzymology, 1990