Reversal and transposition distance of linear chromosomes
Authors:
- M.E.M.T. WalterMWM.E.M.T. Walter
- Z. DiasZDZ. Dias
- J. MeidanisJMJ. Meidanis
- 27 November 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 96-102
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Transforming men into mice (polynomial algorithm for genomic distance problem)2002
- A 2-approximation algorithm for genome rearrangements by reversals and transpositionsTheoretical Computer Science, 1999
- Transforming cabbage into turnipJournal of the ACM, 1999
- Sorting by TranspositionsSIAM Journal on Discrete Mathematics, 1998
- Sorting by reversals is difficult1997
- Sorting permutations by block-interchangesInformation Processing Letters, 1996
- Genome Rearrangements and Sorting by ReversalsSIAM Journal on Computing, 1996
- Fast sorting by reversal1996
- Exact and approximation algorithms for sorting by reversals, with application to genome rearrangementAlgorithmica, 1995
- Efficient bounds for oriented chromosome inversion distance1994