Reversal Distance without Hurdles and Fortresses

This publication has 9 references indexed in Scilit:

• On the Similarity of Sets of Permutations and Its Applications to Genome Comparison
  Published by Springer Nature ,2003
• Common intervals and sorting by reversals: a marriage of necessity
  Bioinformatics, 2002
• A Very Elementary Presentation of the Hannenhalli-Pevzner Theory
  Published by Springer Nature ,2001
• A Faster and Simpler Algorithm for Sorting Signed Permutations by Reversals
  SIAM Journal on Computing, 2000
• Transforming cabbage into turnip
  Journal of the ACM, 1999
• Polynomial-time algorithm for computing translocation distance between genomes
  Discrete Applied Mathematics, 1996
• Fast sorting by reversal
  Published by Springer Nature ,1996
• Efficient bounds for oriented chromosome inversion distance
  Published by Springer Nature ,1994
• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
  Journal of Computer and System Sciences, 1976