On the Similarity of Sets of Permutations and Its Applications to Genome Comparison
- 24 June 2003
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Transforming men into mice (polynomial algorithm for genomic distance problem)Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Exploring the Set of All Minimal Sequences of Reversals — An Application to Test the Replication-Directed Reversal HypothesisPublished by Springer Nature ,2002
- Common intervals and sorting by reversals: a marriage of necessityBioinformatics, 2002
- A Linear-Time Algorithm for Computing Inversion Distance between Signed Permutations with an Experimental StudyJournal of Computational Biology, 2001
- Finding All Common Intervals of k PermutationsPublished by Springer Nature ,2001
- A Faster and Simpler Algorithm for Sorting Signed Permutations by ReversalsSIAM Journal on Computing, 2000
- Gene Order Breakpoint Evidence in Animal Mitochondrial PhylogenyJournal of Molecular Evolution, 1999
- Transforming cabbage into turnipJournal of the ACM, 1999
- Sorting by TranspositionsSIAM Journal on Discrete Mathematics, 1998
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithmsJournal of Computer and System Sciences, 1976