Sorting signed permutations by reversals, revisited
- 1 May 2005
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 70 (3) , 321-341
- https://doi.org/10.1016/j.jcss.2004.12.002
Abstract
No abstract availableKeywords
This publication has 23 references indexed in Scilit:
- A Linear-Time Algorithm for Computing Inversion Distance between Signed Permutations with an Experimental StudyJournal of Computational Biology, 2001
- A Very Elementary Presentation of the Hannenhalli-Pevzner TheoryPublished by Springer Nature ,2001
- 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
- Scalable parallel geometric algorithms for coarse grained multicomputersPublished by Association for Computing Machinery (ACM) ,1993
- A data structure useful for finding Hamiltonian cyclesTheoretical Computer Science, 1990
- Cascading Divide-and-Conquer: A Technique for Designing Parallel AlgorithmsSIAM Journal on Computing, 1989
- Optimal algorithms for List Indexing and Subset RankPublished by Springer Nature ,1989
- Parallelism in random access machinesPublished by Association for Computing Machinery (ACM) ,1978