Sorting by Reversals with Common Intervals
- 1 January 2004
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Transforming men into micePublished by Association for Computing Machinery (ACM) ,2003
- Exploring the Set of All Minimal Sequences of Reversals — An Application to Test the Replication-Directed Reversal HypothesisPublished by Springer Nature ,2002
- Short inversions and conserved gene clusterBioinformatics, 2002
- Algorithms for Finding Gene ClustersPublished by Springer Nature ,2001
- (1+ε)-Approximation of Sorting by Reversals and TranspositionsPublished by Springer Nature ,2001
- 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
- Fast Algorithms to Enumerate All Common Intervals of Two PermutationsAlgorithmica, 2000
- Genome Rearrangement by Reversals and Insertions/Deletions of Contiguous SegmentsPublished by Springer Nature ,2000
- Exact and approximation algorithms for sorting by reversals, with application to genome rearrangementAlgorithmica, 1995