A Linear-Time Algorithm for Computing Inversion Distance between Signed Permutations with an Experimental Study
- 2 August 2001
- book chapter
- Published by Springer Nature
- p. 365-376
- https://doi.org/10.1007/3-540-44634-6_34
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Genome rearrangements and sorting by reversalsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A New Implementation and Detailed Study of Breakpoint AnalysisPacific Symposium on Biocomputing, 2000
- A Faster and Simpler Algorithm for Sorting Signed Permutations by ReversalsSIAM Journal on Computing, 2000
- Sorting Permutations by Reversals and Eulerian Cycle DecompositionsSIAM Journal on Discrete Mathematics, 1999
- Sorting by TranspositionsSIAM Journal on Discrete Mathematics, 1998
- Sorting by reversals is difficultPublished by Association for Computing Machinery (ACM) ,1997
- Genome Rearrangements and Sorting by ReversalsSIAM Journal on Computing, 1996
- Feature Article—Toward an Experimental Method for Algorithm SimulationINFORMS Journal on Computing, 1996
- Fast sorting by reversalPublished by Springer Nature ,1996
- Transforming cabbage into turnipPublished by Association for Computing Machinery (ACM) ,1995