Improving inversion median computation using commuting reversals and cycle information

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

Volumn 4751 LNBI, Issue , 2007, Pages 30-44

  Arndt, William ^a   Tang, Jijun ^a  

^a University of South Carolina   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BIOINFORMATICS; COMPUTATION THEORY; DATA REDUCTION; DATA STRUCTURES; OPTIMIZATION; PROBLEM SOLVING;

BIOLOGISTS; GENOME REARRANGEMENTS; INVERSION MEDIAN COMPUTATION; UNICHROMISOMAL GENOMES;

GENES;

EID: 38349003267     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-74960-8_3     Document Type: Conference Paper

References (26)

1. Bader, D.A., Moret, B.M.E., Yan, M.: A fast linear-time algorithm for inversion distance with an experimental comparison. J. Comput. Biol. 8(5), 483-491 (2001)
2. Bernt, M., Merkle, D., Middendorf, M.: Genome rearrangement based on reversals that preserve conserved intervals. IEEE/ACM Trans. on Comput. Biol, and Bioinfo. 3(3), 275-288 (2006)
3. Bernt, M., Merkle, D., Middendorf, M.: Using median sets for inferring phylogenetic trees. Bioinformatics 23(2), 129-135 (2007)
4. Blanchette, M., Sankoff, D.: The median problem for breakpoints in comparative genomics. In: Jiang, T., Lee, D.T. (eds.) COCOON 1997. LNCS, vol. 1276, pp. 251-263. Springer, Heidelberg (1997)
5. Blanchette, M., Bourque, G., Sankoff, D.: Breakpoint phylogenies. In: Miyano, S., Takagi, T. (eds.) Genome Informatics, pp. 25-34. Univ. Academy Press (1997)
6. Bergeron, A., Chauve, C., Hartman, T., St-Onge, K.: On the Properties of Sequences of Reversals that Sort a Signed Permutation. Journal Ouvertes Biologie, Informatique, Mathematiques (JOBIM 2002), 99-108 (2002)
7. Bourque, G., Pevzner, P.: Genome-scale evolution: Reconstructing gene orders in the ancestral species. Genome Research 12, 26-36 (2002)
8. Caprara, A.: Formulations and hardness of multiple sorting by reversals. In: Proc. 3rd Int'l Conf. on Comput. Mol. Biol. RECOMB99, pp. 84-93. ACM Press, New York (1999)
9. Caprara, A.: Sorting permutations by reversals and Eulerian cycle decompositions. SIAM J. Discrete Math. 12(1), 91-110 (1999)
10. Caprara, A.: On the practical solution of the reversal median problem. In: Gascuel, O., Moret, B.M.E. (eds.) WABI 2001. LNCS, vol. 2149, pp. 238-251. Springer, Heidelberg (2001)
11. Downie, S., Palmer, J.: Use of chloroplast DNA rearrangements in reconstructing plant phylogeny. In: Soltis, P., et al. (eds.) Plant Molecular Systematics, pp. 14-35 (1992)
12. Eriksen, N.: Reversal and Transposition Medians. Theoretical Computer Sicence 374, 111-126 (2007)
13. Hannenhalli, S., Pevzner, P.A.: Transforming cabbage into turnip (polynomial algorithm for sorting signed permutations by reversals). In: Proc. 27th Ann. Symp. Theory of Computing STOC'95, pp. 178-189. ACM Press, New York (1995)
14. Hannenhalli, S., Pevzner, P.A.: To cut... or not to cut (applications of comparative physical maps in molecular evolution). In: Proc. 7th ACM-SIAM Symp. on Discrete Algorithms (SODA'96), pp. 304-313. SIAM Press (1996)
15. Larget, B., Simon, D.L., Kadane, J.B., Sweet, D.: A Bayesian analysis of metazoan mitochondrial genome arrangements. Mol. Biol, and Evol. 22(3), 486-495 (2005)
16. Moret, B.M.E., Siepel, A., Tang, J., Liu, T.: Inversion medians outperform breakpoint medians in phylogeny reconstruction from gene-order data. In: Guigó, R., Gusfield, D. (eds.) WABI 2002. LNCS, vol. 2452, pp. 521-536. Springer, Heidelberg (2002)
17. Moret, B.M.E., Wyman, S., Bader, D.A., Warnow, T., Yan, M.: A new implementation and detailed study of breakpoint analysis. In: Proc. 6th Pacific Symp. on Biocomputing (PSB 01), pp. 583-594. World Scientific Pub, Singapore (2001)
18. Moret, B.M.E., Tang, J., Warnow, T.: Reconstructing phylogenies from gene-content and gene-order data. In: Gascuel, O. (ed.) Mathematics of Evolution and Phylogeny, pp. 321-352. Oxford Univ. Press, Oxford, UK (2005)
19. Palmer, J.: Chloroplast and mitochondria genome evolution in land plants. In: Herrmann, R. (ed.) Cell Organelles, pp. 99-133 (1992)
20. Pe'er, I., Shamir, R.: The median problems for breakpoints are NP-complete. Elec. Colloq. on Comput. Complexity 71 (1998)
21. Pevzner, P., Tesler, G.: Human and mouse genomic sequences reveal extensive breakpoint reuse in mammalian evolution. Proc. of Natl. Acad. of Sci. USA 100, 7672-7677 (2003)
22. Raubeson, L., Jansen, R.: Chloroplast DNA evidence on the ancient evolutionary split in vascular land plants. Science 255, 1697-1699 (1992)
23. Saitou, N., Nei, M.: The neighbor-joining method: A new method for reconstructing phylogenetic trees. Mol. Biol. Evol. 4, 406-425 (1987)
24. Sankoff, D., Blanchette, M.: Multiple genome rearrangement and breakpoint phylogeny. J. Comput. Biol. 5, 555-570 (1998)
25. Siepel, A., Moret, B.M.E.: Finding an optimal inversion median: experimental results. In: Gascuel, O., Moret, B.M.E. (eds.) WABI 2001. LNCS, vol. 2149, pp. 189-203. Springer, Heidelberg (2001)
26. Siepel, A.: An algorithm to enumerate sorting reversals for signed permutations. J. Comput. Biol. 10, 575-597 (2003)