Efficient data structures and a new randomized approach for sorting signed permutations by reversals

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2676, Issue , 2003, Pages 170-185

  Kaplan, Haim ^a   Verbin, Elad ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA STRUCTURES; MOLECULAR BIOLOGY; PATTERN MATCHING; RANDOM PROCESSES;

COMPUTATIONAL MOLECULAR BIOLOGY; EFFICIENT DATA STRUCTURES; IDENTITY PERMUTATION; RANDOM PERMUTATIONS; RANDOMIZED ALGORITHMS; RANDOMIZED APPROACH; SIGNED PERMUTATIONS; SORTING SIGNED PERMUTATIONS BY REVERSALS;

SORTING;

EID: 35248859756     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44888-8_13     Document Type: Article

References (14)

1. D. A. Bader, B. M. E. Moret, and M. Yan, A linear-time algorithm for computing inversion distance between signed Permutations with an experimental study, Workshop on Algorithms and Data Structures, 2001, pp. 365-376.
2. V. Bafna and P. A. Pevzner, Genome rearragements und sorting by reversals, SIAM Journal on Computing 25 (1996), no. 2, 272-289.
3. A. Bergeron, A very elementary presentation of the hannenhalli-pevzner theory, CPM (2001), 106-117.
4. A. Bergeron, C. Chauve, T. Hartman, and K. Saint-Onge, On the properties of sequences of reversals that sort a signed Permutation, proceedings of JOBIM, June 2002, pp. 99-108.
5. A. Caprara, Sorting by reversals is difficult, Proceedings of the First International Conference on Computational Molecular Biology (RECOMB), ACM Press, 1997, pp. 75-83.
6. M. Chrobak, T. Szymacha, and A. Krawczyk, A data structure useful for finding hamiltonian cycles, Theoretical Computer Science 71 (1990), no. 3, 419-424.
7. M. L. Fredman, D. S. Johnson, L. A. McGeoch, and G. Ostheimer, Data structures for traveling salesmen, Journal of Algorithms 18 (1995), no. 3, 432-479.
8. S. Hannenhalli and P. A. Pevzner, Transforming cabbage into turnip (polynomial algorithm for sorting signed Permutations by reversals), Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing (Las Vegas, Nevada), 29 May-1 June 1995, pp. 178-189.
9. T. Hartman, A simpler 1.5-approximation algorithm for sorting by transpositions, CPM '03, in these proceedings.
10. H. Kaplan, R. Shamir, and R. E. Tarjan, A faster and simpler algorithm for sorting signed permutations by reversals, SIAM J. Comput. 29 (1999), no. 3, 880-892.
11. M. Ozery-Flato and R. Shamir, Two notes on genome rearrangements, Journal of Bioinformatics and Computational Biology (to appear).
12. P. A. Pevzner, Computational molecular biology: An algorithmic approach, The MIT Press, Cambridge, MA, 2000.
13. R. Y. Pinter and S. Skiena, Genomic sorting with length-weighted reversals, manuscript.
14. D.D. Sleator and R.E. Tarjan, Self-adjusting binary search trees, J. Assoc. Comput. Mach. 32 (1985), 652-686.