A more efficient algorithm for perfect sorting by reversals

Information Processing Letters

Volumn 106, Issue 3, 2008, Pages 90-95

  Bérard, Sèverine ^a,b   Chauve, Cedric ^c,d   Paul, Christophe ^e  

^a CEMAGREF   (France)

^b UNIV MONTPELLIER   (France)

^c SIMON FRASER UNIVERSITY   (Canada)

^d UNIVERSITÉ DU QUÉBEC À MONTRÉAL   (Canada)

^e CNRS   (France)

Author keywords

Algorithms; Common intervals; Sorting by reversals

Indexed keywords

COMPUTATIONAL COMPLEXITY; PARAMETER ESTIMATION; PROBLEM SOLVING; SORTING;

COMMON INTERVALS; SORTING BY REVERSALS;

ALGORITHMS;

EID: 40149102013     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2007.10.012     Document Type: Article

References (10)

1. Bérard S., Bergeron A., Chauve C., and Paul C. Perfect sorting by reversals is not always difficult. IEEE/ACM Trans. Comput. Biology Bioinform. 4 1 (2007) 4-16
2. Bergeron A., Chauve C., de Montgolfier F., and Raffinot M. Computing common intervals of K permutations, with applications to modular decomposition of graphs. Proc. 13th Annual European Symposium on Algorithms. Lecture Notes in Comput. Sci. vol. 3669 (2005), Springer 779-790
3. Bui-Xuan B.-M., Habib M., and Paul C. Revisiting T. Uno and M. Yagiura's algorithm. Proc. 16th International Symposium on Algorithms and Computation. Lecture Notes in Comput. Sci. vol. 3827 (2005), Springer 146-155
4. Caprara A. Sorting permutations by reversals and Eulerian cycle decompositions. SIAM J. Discrete Math. 12 1 (1999) 91-110
5. C. Chauve, M. Mishna, Average-case analysis of perfect sorting by reversals, 2007
6. Downey R.G., and Fellows M.R. Parameterized Complexity (1999), Springer
7. Diekmann Y., Sagot M.-F., and Tannier E. Evolution under reversals: parsimony and conservation of common intervals. IEEE/ACM Trans. Comput. Biology Bioinform. 4 2 (2007) 301-309
8. Figeac M., and Varré J.-S. Sorting by reversals with common intervals. Proc. 4th International Workshop on Algorithms. Bioinformatics, in Lecture Notes in Bioinformatics vol. 3240 (2004), Springer 26-37
9. In: Gascuel O. (Ed). Mathematics of Evolution and Phylogeny (2005), Oxford University Press
10. Tannier E., Bergeron A., and Sagot M.-F. Advances on sorting by reversals. Discrete Applied Math. 155 6-7 (2007) 881-888