An Algorithm to Enumerate Sorting Reversals for Signed Permutations

Journal of Computational Biology

Volumn 10, Issue 3-4, 2003, Pages 575-597

  Siepel, Adam C ^a,b,c  

^a University of New Mexico   (United States)

^b NATIONAL CENTER FOR GENOME RESOURCES   (United States)

^c University of California Santa Cruz   (United States)

Author keywords

Genome rearrangements; Sorting by reversals

Indexed keywords

ALGORITHM; CHROMOSOME; CHROMOSOME INVERSION; CONFERENCE PAPER; GENE ORDER; GENE REARRANGEMENT; GENE SEQUENCE; GENOME; PRIORITY JOURNAL;

ALGORITHMS; CHROMOSOME MAPPING; COMPUTATIONAL BIOLOGY; DATA INTERPRETATION, STATISTICAL; EVOLUTION, MOLECULAR; GENE ORDER; SEQUENCE ANALYSIS, DNA;

EID: 0242690450     PISSN: 10665277     EISSN: None     Source Type: Journal    
DOI: 10.1089/10665270360688200     Document Type: Conference Paper

References (15)

1. Bader, D.A., Moret, B.M.E., and Yan, M. 2001. A linear-time algorithm for computing inversion distance between signed permutations with an experimental study. Proc. 7th Int. Workshop on Algorithms and Data Structures, Lecture Notes in Computer Science, vol. 2125, 365-376.
2. Bafna, V., and Pevzner, P.A. 1993. Genome rearrangements and sorting by reversals. Proc. 34th Ann. IEEE Symposium on Foundations of Computer Science, 148-157.
3. Bergeron, A. 2001. A very elementary presentation of the Hannenhalli-Pevzner theory. Proc. 12th Ann. Symposium on Combinatorial Pattern Matching, Lecture Notes in Computer Science, vol. 2089, 106-117.
4. Bergeron, A., and Strasbourg, F. 2001. Experiments in computing sequences of reversals. Proc. 1st Int. Workshop on Algorithms in Bioinformatics, Lecture Notes in Computer Science, vol. 2149, 164-174.
5. Berman, P., and Hannenhalli, S. 1996. Fast sorting by reversal. Proc. 7th Ann. Symposium on Combinatorial Pattern Matching, 168-185.
6. Blanchette, M., Kunisawa, T., and Sankoff, D. 1996. Parametric genome rearrangement. Gene 172, GC11-GC17.
7. Bourque, G., and Pevzner, P.A. 2002. Genome-scale evolution: Reconstructing gene orders in the ancestral species. Genome Res. 12, 26-36.
8. Caprara, A. 1997. Sorting by reversals is difficult. Proc. 1st Ann. Int. Conf. Computational Molecular Biology, 75-83.
9. Hannenhalli, S., and Pevzner, P.A. 1995. Transforming cabbage into turnip (polynomial algorithm for sorting signed permutations by reversals). Proc. 27th Ann. ACM Symposium on the Theory of Computing, 178-189.
10. Kaplan, H., Shamir, R., and Tarjan, R.E. 1999. A faster and simpler algorithm for sorting signed permutations by reversals. SIAM J. Comput. 29(3), 880-892.
11. McLysaght, A., Seoighe, C., and Wolfe, K.H. 2000. High frequency of inversions during eukaryote gene order evolution. In Sankoff, D., and Nadeau, J.H., eds., Comparative Genomics, 47-58, Kluwer Academic Press, NY.
12. Moret, B.M.E., Siepel, A., Tang, J., and Liu, T. 2002. Inversion medians outperform break-point medians in phylogeny reconstruction from gene-order data. Proc. 2nd Int. Workshop on Algorithms in Bioinformatics, Lecture Notes in Computer Science, vol. 2452, 521-536.
13. Sankoff, D., and El-Mabrouk, N. 2002. Genome rearrangement. In Jiang, T., Xu, Y., and Zhang, M., eds., Current Topics in Computational Molecular Biology, 135-156, MIT Press, New Haven, CT.
14. Setubal, J., and Meidanis, J. 1997. Introduction to Computational Molecular Biology, PWS Publishing, Boston, MA.
15. Siepel, A. 2001. Exact Algorithms for the Reversal Median Problem. Master's thesis, University of New Mexico, Albuquerque, New Mexico. Available at www.cse.ucsc.edu/~acs/masters-thesis.html.