A 2-approximation algorithm for genome rearrangements by reversals and transpositions
- 17 January 1999
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 210 (2) , 327-339
- https://doi.org/10.1016/s0304-3975(98)00092-9
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- Genome Rearrangements and Sorting by ReversalsSIAM Journal on Computing, 1996
- Exact and approximation algorithms for sorting by reversals, with application to genome rearrangementAlgorithmica, 1995
- Plant mitochondrial DNA evolved rapidly in structure, but slowly in sequenceJournal of Molecular Evolution, 1988