Advances on sorting by reversals

Discrete Applied Mathematics

Volumn 155, Issue 6-7, 2007, Pages 881-888

  Tannier, Eric ^a   Bergeron, Anne ^b   Sagot, Marie France ^a  

^a UNIVERSITÉ LYON 1   (France)

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

Author keywords

Computational biology; Genome rearrangement; Reversal sorting

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; GENES; MATHEMATICAL TRANSFORMATIONS; MOLECULAR BIOLOGY; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING;

COMPUTATIONAL BIOLOGY; GENOME REARRANGEMENT; REVERSAL SORTING; SIGNED PERMUTATIONS;

PROBABILITY;

EID: 33846805665     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2005.02.033     Document Type: Article

References (9)

1. Bader D.A., Moret B.M.E., and Yan M. A linear-time algorithm for computing inversion distance between signed permutations with an experimental study. Proceedings of the Workshop on Algorithms and Data Structures (2001) 365-376
2. Berman P., and Hannenhalli S. Fast sorting by reversals. Proceedings of the CPM'96, Lecture Notes in Computer Science vol. 1075 (1996), Springer, Berlin 168-185
3. A. Bergeron, J. Mixtacki, J. Stoye, The inversion distance problem, in: O. Gascuel (Ed.), Mathematics of Evolution and Phylogeny, Chapter 10, Oxford University Press, Oxford, 2005, pp. 262-290.
4. Hannenhalli S., and Pevzner P. Transforming cabbage into turnip (polynomial algorithm for sorting signed permutations by reversals). J. Assoc. Comput. Mach. 46 (1999) 1-27
5. Kaplan H., Shamir R., and Tarjan R.E. Faster and simpler algorithm for sorting signed permutations by reversals. SIAM J. Comput. 29 (1999) 880-892
6. Kaplan H., and Verbin E. Efficient data structures and a new randomized approach for sorting signed permutations by reversals. Proceedings of the CPM'03, Lecture Notes in Computer Science vol. 2676 (2003), Springer, Berlin 170-185
7. Ozery-Flato M., and Shamir R. Two notes on genome rearrangement. J. Bioinformatics Computat. Biology 1 (2003) 71-94
8. Sleator D.D., and Tarjan R.E. Self-adjusting binary search trees. J. Assoc. Comput. Mach. 32 (1985) 652-686
9. Tannier E., and Sagot M.-F. Sorting by reversals in subquadratic time. Proceedings of the CPM'04, Lecture Notes in Computer Science vol. 3109 (2004), Springer, Berlin 1-13