Phylogenetic reconstruction from gene-rearrangement data with unequal gene content

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

Volumn 2748, Issue , 2003, Pages 37-46

  Tang, Jijun ^a   Moret, Bernard M E ^a  

^a University of New Mexico   (United States)

Author keywords

Computational biology; Edit distance; Experimental assessment; Gene duplications; Gene order data; Hannenhalli Pevzner theory; Inversion distance; Lower bounds; Phylogenetic reconstruction; Reversal distance; Signed permutations; Whole genome data

Indexed keywords

BIOINFORMATICS; BIOLOGY; COMPUTATION THEORY;

COMPUTATIONAL BIOLOGY; EDIT DISTANCE; EXPERIMENTAL ASSESSMENT; GENE DUPLICATIONS; GENE ORDERS; HANNENHALLI-PEVZNER THEORY; INVERSION DISTANCE; LOWER BOUNDS; PHYLOGENETIC RECONSTRUCTION; REVERSAL DISTANCE; SIGNED PERMUTATIONS; WHOLE-GENOME DATA;

GENES;

EID: 35248841995     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45078-8_4     Document Type: Article

References (30)

1. D.A. Bader, B.M.E. Moret, T. Warnow, S.K. Wyman, and M. Yan. GRAPPA (Genome Rearrangements Analysis under Parsimony and other Phylogenetic Algorithms). www.cs.unm.edu/∼moret/GRAPPA/.
2. 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. J. Comput. Biol., 8(5):483-491, 2001.
3. A preliminary version appeared in WADS'01, pp. 365-376.
4. G. Bourque and P. Pevzner. Genome-scale evolution: reconstructing gene orders in the ancestral species. Genome Research, 12:26-36, 2002.
5. D. Bryant. The complexity of calculating exemplar distances. In D. Sankoff and J. Nadeau, editors, Comparative Genomics: Empirical and Analytical Approaches to Gene Order Dynamics, Map Alignment, and the Evolution of Gene Families, pages 207-212. Kluwer Academic Pubs., Dordrecht, Netherlands, 2000.
6. D. Bryant. A lower bound for the breakpoint phylogeny problem. In Proc. 11th Ann. Symp. Combin. Pattern Matching (CPM'00), volume 1848 of Lecture Notes in Computer Science, pages 235-247. Springer-Verlag, 2000.
7. A. Caprara. Sorting by reversals is difficult. In Proc. 1st Int'l Conf. on Comput. Mol. Biol. RECOMB97, pages 75-83. ACM Press, 1997.
8. A. Caprara. Formulations and hardness of multiple sorting by reversals. In Proc. 3rd Int'l Conf. on Comput. Mol. Biol. RECOMB99, pages 84-93. ACM Press, 1999.
9. A. Caprara. On the practical solution of the reversal median problem. In Proc. 1st Workshop on Algs. in Bioinformatics WABI 2001, volume 2149 of Lecture Notes in Computer Science, pages 238-251. Springer-Verlag, 2001.
10. M.E. Cosner, R. K. Jansen, B.M.E. Moret, L. A. Raubeson, L.-S. Wang, T. Warnow, and S. K. Wyman. An empirical comparison of phylogenetic methods on chloroplast gene order data in Campanulaceae. In D. Sankoff and J. Nadeau, editors, Comparative Genomics: Empirical and Analytical Approaches to Gene Order Dynamics, Map Alignment, and the Evolution of Gene Families, pages 99-121. Kluwer Academic Pubs., Dordrecht, Netherlands, 2000.
11. S.R. Downie and J.D. Palmer. Use of chloroplast DNA rearrangements in reconstructing plant phylogeny. In P. Soltis, D. Soltis, and J.J. Doyle, editors, Plant Molecular Systematics, pages 14-35. Chapman and Hall, 1992.
12. N. El-Mabrouk. Genome rearrangement by reversals and insertions/deletions of contiguous segments. In Proc. 11th Ann. Symp. Combin. Pattern Matching (CPM'00), volume 1848 of Lecture Notes in Computer Science, pages 222-234. Springer-Verlag, 2000.
13. S. Hannenhalli and P.A. Pevzner. Transforming cabbage into turnip (polynomial algorithm for sorting signed permutations by reversals). In Proc. 27th Ann. Symp. Theory of Computing STOC 95, pages 178-189. ACM Press, 1995.
14. D. Huson, S. Nettles, K. Rice, T. Warnow, and S. Yooseph. The hybrid tree reconstruction method. ACM J. Experimental Algorithmics, 4(5), 1999. http://www.jea.acm.org/1999/HusonHybrid/.
15. D. Huson, S. Nettles, and T. Warnow. Disk-covering, a fast converging method for phylogenetic tree reconstruction. J. Comput. Biol., 6(3):369-386, 1999.
16. D. Huson, L. Vawter, and T. Warnow. Solving large-scale phylogenetic problems using DCM-2. In Proc. 7th Int'l Conf. on Intelligent Systems for Molecular Biology (ISMB99), pages 118-129. AAAI Press, 1999.
17. B. Larget, J.B. Kadane, and D. Simon. A Markov chain Monte Carlo approach to reconstructing ancestral genome rearrangements. Technical report, Carnegie Mellon University, Pittsburgh, PA, 2002. Available at www.stat.cmu.edu/tr/tr765/.
18. M. Marron, K.M. Swenson, and B.M.E. Moret. Genomic distances under deletions and insertions. In Proc. 9th Ann. Int'l Conf. Computing and Combinatorics (COCOON'03), Lecture Notes in Computer Science. Springer-Verlag, 2003. Accepted, to appear.
19. B.M.E. Moret, A.C. Siepel, J. Tang, and T. Liu. Inversion medians outperform breakpoint medians in phylogeny reconstruction from gene-order data. In R. Guigo and D. Gusfield, editors, Proc. 2nd Int'l Workshop Algorithms in Bioinformatics (WABI'02), volume 2452 of Lecture Notes in Computer Science, pages 521-536. Springer-Verlag, 2002.
20. B.M.E. Moret, J. Tang, L.-S. Wang, and T. Wamow. Steps toward accurate reconstructions of phylogenies from gene-order data. J. Comput. Syst. Sci., 65(3):508-525, 2002.
21. R.G. Olmstead and J.D. Palmer. Chloroplast DNA systematics: a review of methods and data analysis. Amer. J. Bot., 81:1205-1224, 1994.
22. J.D. Palmer. Chloroplast and mitochondrial genome evolution in land plants. In R. Herrmann, editor, Cell Organelles, pages 99-133. Springer Verlag, 1992.
23. I. Pe'er and R. Shamir. The median problems for breakpoints are NP-complete. Elec. Colloq. on Comput. Complexity, 71, 1998.
24. L.A. Raubeson and R.K. Jansen. Chloroplast DNA evidence on the ancient evolutionary split in vascular land plants. Science, 255:1697-1699, 1992.
25. N. Saitou and M. Nei. The neighbor-joining method: A new method for reconstructing phylogenetic trees. Mol. Biol. Evol., 4:406-425, 1987.
26. D. Sankoff. Genome rearrangement with gene families. Bioinformatics, 15(11):909-917, 1999.
27. D. Sankoff and M. Blanchette. Multiple genome rearrangement and breakpoint phylogeny. J. Comput. Biol., 5:555-570, 1998.
28. D. Sankoff and J. Nadeau, editors. Comparative Genomics: Empirical and Analytical Approaches to Gene Order Dynamics, Map Alignment, and the Evolution of Gene Families. Kluwer Academic Pubs., Dordrecht, Netherlands, 2000.
29. A.C. Siepel and B.M.E. Moret. Finding an optimal inversion median: Experimental results. In O. Gascuel and B.M.E. Moret, editors, Proc. 1st Int'l Workshop Algorithms in Bioinformatics (WABI'01), volume 2149 of Lecture Notes in Computer Science, pages 189-203. Springer-Verlag, 2001.
30. J. Tang and B.M.E. Moret. Scaling up accurate phylogenetic reconstruction from gene-order data. In Proc. 11th Int'l Conf. on Intelligent Systems for Molecular Biology (ISMB03), volume 19, Suppl. 1 of Bioinformatics, pages 1305-1312. Oxford U. Press, 2003.