Improving reversal median computation using commuting reversals and cycle information

Journal of Computational Biology

Volumn 15, Issue 8, 2008, Pages 1079-1092

  Arndt, William ^a   Tang, Jijun ^a,b  

^a University of South Carolina   (United States)

^b UNIVERSITY OF SOUTH CAROLINA   (United States)

Author keywords

Algorithms; Combinatorial optimization; Computational molecular biology; Genomic rearrangements; Phylogenetic analyses

Indexed keywords

CHROMOSOME ANALYSIS; CONFERENCE PAPER; GENE REARRANGEMENT; GENETIC ALGORITHM; GENETIC ANALYSIS; GENETIC DISTANCE; MATHEMATICAL GENETICS; PHYLOGENY; PRIORITY JOURNAL;

ALGORITHMS; ANIMALS; COMPUTATIONAL BIOLOGY; EVOLUTION, MOLECULAR; GENOME; MODELS, GENETIC; PHYLOGENY; SOFTWARE;

EID: 52449096724     PISSN: 10665277     EISSN: None     Source Type: Journal    
DOI: 10.1089/cmb.2008.0116     Document Type: Conference Paper

References (27)

1. Bader, D., Moret, B., and Yan, M. 2001. A fast linear-time algorithm for reversal distance with an experimental comparison. J. Comput. Biol. 8, 483-491.
2. Belda, E., Moya, A., and Silva, F. 2005. Genome rearrangement distances and gene order phylogeny in γ-proteobacteria. Mol. Biol. Evol. 22, 1456-1467.
3. Bergeron, A., Chauve, C., Hartman, T., et al. 2002. On the properties of sequences of reversals that sort a signed permutation. J. Biol. Inform. Math., 99-108.
4. Bernt M., Merkle, D., and Middendorf, M. 2007. Using median sets for inferring phylogenetic trees. Bioinformatics 23, 129-135.
5. Bhutkar, A., Gelbart, W., and Smith, T. 2007. Inferring genome-scale rearrangement phylogeny and ancestral gene order: a Drosophila case study. Genome Biol. 8, R236.
6. Blanchette, M., Bourque, G., and Sankoff, D. 1997. Breakpoint phylogenies, 25-34. In Miyano, S., and Takagi, T., eds., Genome Informatics. Universal Academy Press, Tokyo.
7. Blanchette, M., and Sankoff, D. 1997. The median problem for breakpoints in comparative genomics. Lect. Notes Comput. Sci. 1276, 251-263.
8. Bourque, G., and Pevzner, P. 2002. Genome-scale evolution: reconstructing gene orders in the ancestral species. Genome Res. 12, 26-36.
9. Braga, M., Sagot, M., Scornavacca, C., et al. 2007. The solution space of sorting by reversals. Lect. Notes Bioinform. 4463, 293-304.
10. Caprara, A. 1999a. Formulations and hardness of multiple sorting by reversals. RECOMB 1999 84-93.
11. Caprara, A. 1999b. Sorting permutations by reversals and Eulerian cycle decompositions. SIAM J. Discrete Math. 12, 91-110.
12. Caprara, A. 2001. On the practical solution of the reversal median problem. Lect. Notes Comput. Sci. 2149, 238-251.
13. Downie, S.R., and Palmer, J.-D. 1992. Use of chloroplast DNA rearrangements in reconstructing plant phylogeny, 14-35. In: Soltis, D., Soltis, P., and Doyle, J.J., eds. Molecular Systematics of Plants. Chapman and Hall, New York.
14. Eriksen, N. 2007. Reversal and transposition medians. Theoret. Comput. Sci. 374, 111-126.
15. Hannenhalli, S., and Pevzner, P. 1995. Transforming cabbage into turnip (polynomial algorithm for sorting signed permutations by reversals). Proc. 27th Annu. Symp. Theory Comput. 178-189.
16. Hannenhalli, S., and Pevzner, P. 1996. To cut . . . or not to cut (applications of comparative physical maps in molecular evolution). Proc. 7th ACM-SIAM Symp. Discrete Algorithms 304-313.
17. Moret, B., Siepel, A., Tang, J., et al. 2002. Inversion medians outperform breakpoint medians in phylogeny reconstruction from gene-order data. Lect. Notes Comput. Sci. 2452, 521-536.
18. Moret, B., Tang, J., and Warnow, T. 2005. Reconstructing phylogenies from gene-content and gene-order data, 321-352. In Gascuel, O., ed. Mathematics of Evolution and Phylogeny. Oxford University Press, New York.
19. Moret, B., Wyman, S., Bader, D., et al. 2001. A new implementation and detailed study of breakpoint analysis. Proc. 6th Pacif. Symp. Biocomput. 583-594.
20. Pe'er, I., and Shamir, R. 1998. The median problems for breakpoints are NP-complete. Elec. Colloq. Comput. Complexity 71.
21. Pevzner, P., and Tesler, G. 2003. Human and mouse genomic sequences reveal extensive breakpoint reuse in mammalian evolution. Proc. Natl. Acad. Sci. USA 100, 7672-7677.
22. Robinson, D., and Foulds, L. 1981. Comparison of phylogenetic trees. Math. Biosci. 53, 131-147.
23. Saitou, N., and Nei, M. 1987. The neighbor-joining method: a new method for reconstructing phylogenetic trees. Mol. Biol. Evol. 4, 406-425.
24. Sankoff, D., and Blanchette, M. 1998. Multiple genome rearrangement and breakpoint phylogeny. J. Comput. Biol. 5, 555-570.
25. Siepel, A. 2001. Exact algorithms for the reversal median problem [Master's thesis]. University of New Mexico, Albuquerque, NM.
26. Siepel, A. 2003. An algorithm to enumerate sorting reversals for signed permutations. J. Comput. Biol. 10, 575-597.
27. Siepel, A., and Moret, B. 2001. Finding an optimal inversion median: experimental results. Lect. Notes Comput. Sci. 2149, 189-203.