A very elementary presentation of the Hannenhalli–Pevzner theory
- 1 March 2005
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 146 (2) , 134-145
- https://doi.org/10.1016/j.dam.2004.04.010
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- An algorithm to enumerate all sorting reversalsPublished by Association for Computing Machinery (ACM) ,2002
- A Linear-Time Algorithm for Computing Inversion Distance between Signed Permutations with an Experimental StudyJournal of Computational Biology, 2001
- Computational Molecular BiologyPublished by MIT Press ,2000
- A Faster and Simpler Algorithm for Sorting Signed Permutations by ReversalsSIAM Journal on Computing, 2000
- Transforming cabbage into turnipJournal of the ACM, 1999
- Sorting by reversals is difficultPublished by Association for Computing Machinery (ACM) ,1997
- Edit distance for genome comparison based on non-local operationsPublished by Springer Nature ,1992