A more efficient algorithm for perfect sorting by reversals

[1]  Michael R. Fellows,et al.  Parameterized Complexity , 1998 .

[2]  Alberto Caprara,et al.  Sorting Permutations by Reversals and Eulerian Cycle Decompositions , 1999, SIAM J. Discret. Math..

[3]  A. ADoefaa,et al.  ? ? ? ? f ? ? ? ? ? , 2003 .

[4]  S. Griffis.  EDITOR , 1997, Journal of Navigation.

[5]  Jean-Stéphane Varré,et al.  Sorting by Reversals with Common Intervals , 2004, WABI.

[6]  Michel Habib,et al.  Revisiting T. Uno and M. Yagiura's Algorithm , 2005, ISAAC.

[7]  Olivier Gascuel,et al.  Mathematics of Evolution and Phylogeny , 2005 .

[8]  M. Sagot,et al.  Evolution under Reversals: Parsimony and Conservation of Common Intervals , 2007, IEEE/ACM Transactions on Computational Biology and Bioinformatics.

[9]  Anne Bergeron,et al.  Advances on sorting by reversals , 2007, Discret. Appl. Math..

[10]  Christophe Paul,et al.  Perfect Sorting by Reversals Is Not Always Difficult , 2005, IEEE/ACM Transactions on Computational Biology and Bioinformatics.

[11]  Mathieu Raffinot,et al.  Computing Common Intervals of K Permutations, with Applications to Modular Decomposition of Graphs , 2005, SIAM J. Discret. Math..