Efficient Data Structures and a New Randomized Approach for Sorting Signed Permutations by Reversals
- 27 May 2003
- book chapter
- Published by Springer Nature
- p. 170-185
- https://doi.org/10.1007/3-540-44888-8_13
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- TWO NOTES ON GENOME REARRANGEMENTJournal of Bioinformatics and Computational Biology, 2003
- A Linear-Time Algorithm for Computing Inversion Distance between Signed Permutations with an Experimental StudyPublished by Springer Nature ,2001
- A Very Elementary Presentation of the Hannenhalli-Pevzner TheoryPublished by Springer Nature ,2001
- Computational Molecular BiologyPublished by MIT Press ,2000
- A Faster and Simpler Algorithm for Sorting Signed Permutations by ReversalsSIAM Journal on Computing, 2000
- Sorting by reversals is difficultPublished by Association for Computing Machinery (ACM) ,1997
- Genome Rearrangements and Sorting by ReversalsSIAM Journal on Computing, 1996
- Data Structures for Traveling SalesmenJournal of Algorithms, 1995
- Transforming cabbage into turnipPublished by Association for Computing Machinery (ACM) ,1995
- A data structure useful for finding Hamiltonian cyclesTheoretical Computer Science, 1990