Advances in phylogeny reconstruction from gene order and content data

Methods in Enzymology

Volumn 395, Issue , 2005, Pages 673-700

  Moret, Bernard M E ^a   Warnow, Tandy ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

BACTERIUM; CHLOROPLAST; CHROMOSOME; DATA ANALYSIS; DNA SEQUENCE; EUKARYOTE; GENE DUPLICATION; GENE ORDER; GENE TRANSLOCATION; GENOME; MAXIMUM LIKELIHOOD METHOD; MITOCHONDRION; MOLECULAR GENETICS; NUCLEOTIDE SEQUENCE; PARSIMONY ANALYSIS; PHYLOGENY; PRIORITY JOURNAL; RESEARCH; REVIEW; STOCHASTIC MODEL;

EID: 19944420815     PISSN: 00766879     EISSN: None     Source Type: Book Series    
DOI: 10.1016/S0076-6879(05)95035-0     Document Type: Article

References (88)

1. Atteson K. The performance of the neighbor-joining methods of phylogenetic reconstruction. Algorithmica. 25:(2/3):1999;251-278
2. Bader D., Moret B., Yan M. A linear-time algorithm for computing inversion distance between signed permutations with an experimental study a preliminary version appeared in WADS '01, 365-376. J. Comput. Biol. 8:(5):2001;483-491
3. Bafna V., Pevzner P. Sorting permutations by transpositions. "Proceedings of the 6th Annual ACM/SIAM Sympasium Discrete Algs. (SODA'95)," 1995;614-623 SIAM Press, Philadelphia
4. Bender M., Ge D., He S., Hu H., Pinter R., Skiena S., Swidan F. Improved bounds on sorting with length-weighted reversals. "Proceedings of the 15th Annual ACM/SIAM Symposium on Discrete Algs. (SODA'04)," 2004;912-921 SIAM Press, Philadelphia
5. Boore J., Brown W. Big trees from little genomes: Mitochondrial gene order as a phylogenetic tool. Curr. Opini. Genet. Dev. 8:(6):1998;668-674
6. Boore J., Collins T., Stanton D., Daehler L., Brown W. Deducing the pattern of arthropod phylogeny from mitochondrial DNA rearrangements. Nature. 376:1995;163-165
7. Bourque G., Pevzner P. Genome-scale evolution: Reconstructing gene orders in the ancestral species. Genome Res. 12:2002;26-36
8. Bruno W.J., Socci N.D., Halpern A.L. Weighted neighbor joining: A likelihood-based approach to distance-based phylogeny reconstruction. Mol. Biol. Evol. 17:(1):2000;189-197
9. Bryant D. The complexity of calculating exemplar distances. Sankoff D., Nadeau J. "Comparative Genomics: Empirical and Analytical Approaches to Gene Order Dynamics, Map Alignment, and the Evolution of Gene Families" 2000;207-212 Dordrecht, Netherlands, Kluwer Academic
10. Caprara A. Formulations and hardness of multiple sorting by reversals. "Proceedings of the 3rd Annual International Conference Comput. Mol. Biol. (RECOMB'99)," 1999;84-93 ACM Press, New York
11. Caprara A. On the practical solution of the reversal median problem. "Proceedings of the 1st International Workshop Algs. in Bioinformatics (WABI'01)," Vol. 2149:2001;238-251 Springer Verlag. of Lecture Notes in Computer Science
12. Cosner M., Jansen R., Moret B., Raubeson L., Wang L., Warnow T., Wyman S. An empirical comparison of phylogenetic methods on chloroplast gene order data in Campanulaceae. Sankoff D., Nadeau J. "Comparative Genomics" 2000a;99-122 Kluwer Academic Publishers, Dordrecht Netherlands
13. Cosner M., Jansen R., Moret B., Raubeson L., Wang L., Warnow T., Wyman S. A new fast heuristic for computing the breakpoint phylogeny and experimental phylogenetic analyses of real and synthetic data. "Proceedings of the 8th International Conference on Intelligent Systems for Molecular Biology (ISMB'00)," 2000b;104-115 AAAI (American Association for Artificial Intelligence), Menlo Park, CA
14. Day W. Computationally difficult parsimony problems in phylogenetic systematics. J. Theoret. Biol. 103:1983;429-438
15. Downie S., Palmer J. Use of chloroplast DNA rearrangements in Reconstructing plant phylogeny. Soltis P., Soltis D., Doyle J. "Plant Molecular Systematics" 1992;14-35 Chapman and Hall
16. Earnest-DeYoung J., Lerat E., Moret B. Reversing gene erosion: Reconstructing ancestral bacterial genomes from gene-content and gene-order data. "Proceedings of the 4th International Workshop Algs. in Bioinformatics (WABI'04)," 2004;. Lecture Notes in Computer Science. Springer Verlag.
17. El-Mabrouk N. Genome rearrangement by reversals and insertions/deletions of contiguous segments. "Proceedings of the 11th Annual Symposium Combin. Pattern Matching (CPM'00)," Vol. 1848:2000;222-234 Springer Verlag. of Lecture Notes in Computer Science
18. Felsenstein J. Evolutionary trees from DNA sequences: A maximum likelihood approach. J. Mol. Evol. 17:1981;368-376
19. Felsenstein J. Phylogenetic Inference Package (PHYLIP), Version 3.5. 1993;University of Washington, Seattle
20. Fitch W.M. On the problem of discovering the most parsimonious tree. Am. Naturalist. 111:1977;223-257
21. Gascuel O. BIONJ: An improved version of the NJ algorithm based on a simple model of sequence data. Mol. Biol. Evol. 14:(7):1997;685-695
22. Goloboff P. Analyzing large datasets in reasonable times: Solutions for composite optima. Cladistics. 15:1999;415-428
23. Guindon S., Gascuel O. PHYML - a simple, fast, and accurate algorithm to estimate large phylogenies by maximum likelihood. Syst. Biol. 52:(5):2003;696-704
24. Hannenhalli S., Pevzner P. Transforming cabbage into turnip (polynomial algorithm for sorting signed permutations by reversals). "Proceedings of the 27th Annual ACM Symposium Theory of Comput. (STOC'95)," 1995a;178-189 ACM Press, New York
25. Hannenhalli S., Pevzner P. Transforming mice into men (polynomial algorithm for genomic distance problems). "Proceedings of the 36th Annual IEEE Symposium Foundations of Comput. Sci. (FOCS'95)," 1995b;581-592 IEEE Press, Piscataway, NJ
26. Hartman T. A simpler 1.5-approximation algorithm for sorting by transpositions. "Proceedings of the 14th Annual Symposium Combin. Pattern Matching (CPM'03)," Vol. 2676:2003;156-169 Springer Verlag. of Lecture Notes in Computer Science
27. Hartman T., Sharan R. A 1.5-approximation algorithm for sorting by transpositions and transreversals. "Proceedings of the 4th International Workshop Algs. in Bioinformatics (WABI'04)," Vol. 3240:2004;50-61 Springer Verlag. of Lecture Notes in Computer Science
28. Heard S. Patterns in phylogenetic tree balance with variable and evolving speciation rates. Evol. 50:1996;2141-2148
29. Huson D., Nettles S., Warnow T. Disk-covering, a fast converging method for phylogenetic tree reconstruction. J. Comput. Biol. 6:(3):1999a;369-386
30. Huson D., Smith K., Warnow T. Correcting large distances for phylogenetic reconstruction. "Proceedings of the 3rd International Workshop Alg. Engineering (WAE'99)," Vol. 1668:1999b;273-286 Springer Verlag. of Lecture Notes in Computer Science
31. Jansen R., Palmer J. A chloroplast DNA inversion marks an ancient evolutionary split in the sunflower family (Asteraceae). Proc. Natl. Acad. Sci. USA. 84:1987;5818-5822
32. Kaplan H., Shamir R., Tarjan R. Faster and simpler algorithm for sorting signed permutations by reversals. SIAM J. Computing. 29:(3):1999;880-892
33. Kim J., Warnow T. Phylogenetic tree estimation. "Proceedings of the 7th International Conference on Intelligent Systems for Moleculor Biology (ISMB'99)," 1999;Tutorial
34. Kumar S., Tamura K., Jakobsen I.B., Nei M. MEGA2: Molecular evolutionary genetics analysis software. Bioinformatics. 17:(12):2001;1244-1245
35. Larget B., Simon D., Kadane J. Bayesian phylogenetic inference from animal mitochondrial genome arrangements. J. R. Stat. Soc. B. 64:(4):2002;681-694
36. Lefebvre J.-F., El-Mabrouk N., Tillier E., Sankoff D. Detection and validation of single gene inversions. "Proceedings of the 11th International Conference on Intelligent Systems for Mol. Biol. (ISMB'03)," Vol. 19:2003;i190-i196 Oxford University Press. of Bioinformatics
37. Li G., Qi X., Wang X., Zhu B. A linear-time algorithm for computing translocation distance between signed genomes. "Proceedings of the 15th Annual Symposium Combin. Pattern Matching (CPM'04)," Vol. 3109:2004;Springer Verlag. of Lecture Notes in Computer Science.
38. Li W.-H. "Molecular Evolution." 1997;Sinauer Associates
39. Linder C., Moret B., Nakhleh L., Warnow T. Network (reticulated) evolution: Biology, models, and algorithms. "Proceedings of the 9th Pacific Sympoliyin on Biocomputing (PSB'04)." 2004;Tutorial
40. Liu T., Moret B., Bader D. An exact, linear-time algorithm for computing genomic distances under inversions and deletions. Tech. Rep. 2003;University of New Mexico. TR-CS-2003-31
41. Ma B., Li M., Zhang L. On reconstructing species trees from gene trees in terms of duplications and losses. "Proceedings of the 2nd Annual International Conference Comput. Molecular Biology (RECOMB'98)," 1998;182-191 ACM Press, New York
42. Maddison W. A method for testing the correlated evolution of two binary characters: Are gains or losses concentrated on certain branches of a phylogenetic tree? Evol. 44:1990;539-557
43. Maddison W. Gene trees in species trees. Syst. Biol. 46:(3):1997;523-536
44. Marron M., Swenson K., Moret B. Genomic distances under deletions and insertions. "Proceedings of the 9th International Conf. Computing and Combinatorics (COCOON'03)," Vol. 2697:2003;537-547 Springer Verlag. of Lecture Notes in Computer Science
45. McLysaght A., Baldi P., Gaut B. Extensive gene gain associated with adaptive evolution of poxviruses. Proc. Natl. Acad. Sci. USA. 100:2003;15655-15660
46. Meidanis J., Walter M., Dias Z. Reversal distance of signed circular chromosomes, unpublished. 2000
47. Mooers A., Heard S. Inferring evolutionary process from phylogenetic tree shape. Q. Rev. Biol. 72:1997;31-54
48. Moret B., Bader D., Warnow T. High-performance algorithm engineering for computational phylogenetics. J. Supercomputing. 22:2002a;99-111
49. Moret B., Roshan U., Warnow T. Sequence length requirements for phylogenetic methods. "Proceedings of the 2nd International Workshop Algs. in Bioinformatics (WABI'02)," Vol. 2452:2002b;343-356 Springer Verlag. of Lecture Notes in Computer Science
50. Moret B., Siepel A., Tang J., Liu T. Inversion medians outperform break-point medians in phylogeny reconstruction from gene-order data. "Proceedings of the 2nd International Workshop Algs. in Bioinformatics (WABI'02)," Vol. 2452:2002c;521-536 Springer Verlag. of Lecture Notes in Computer Science
51. Moret B., Tang J., Wang L.-S., Warnow T. Steps toward accurate reconstructions of phylogenies from gene-order data. J. Comput. Syst. Sci. 65:(3):2002d;508-525
52. Moret B., Tang J., Warnow A.T. Reconstructing phylogenies from gene-content and gene-order data. O. Gascuel. "Mathematics of Evolution and Phylogeny" 2004;Oxford University Press
53. Moret B., Wang L.-S., Warnow T. New software for computational phylogenetics. IEEE Computer. 35:(7):2002e;55-64
54. Moret B., Wang L.-S., Warnow T., Wyman S. New approaches for reconstructing phylogenies from gene-order data. "Proceedings 9th International Conference on Intelligent Systems for Molecular Biology (ISMB'01)," Vol. 17:2001a;S165-S173. of Bioinformatics
55. Moret B., Wyman S., Bader D., Warnow T., Yan M. A new implementation and detailed study of breakpoint analysis. "Proceedings of the 6th Pacific Symposium on Biocomputing (PSB'01)," 2001b;583-594 World Scientific Pub
56. Nadeau J., Taylor B. Lengths of chromosome segments conserved since divergence of man and mouse. Proc. Natl. Acad. Sci. USA. 81:1984;814-818
57. Nakhleh L., Moret B., Roshan U., John K.S., Warnow T. The accuracy of fast phylogenetic methods for large datasets. "Proceedings of the 7th Pacific Symposium on Biocomputing (PSB'02)," 2002;211-222 World Scientific Pub
58. Nakhleh L., Roshan U., St. John K., Sun J., Warnow T. Designing fast converging phylogenetic methods. "Proceedings of the 9th International Conf. on Intelligent Systems for Mol. Biol. (ISMB'01)," Vol. 17:2001a;S190-S198 Oxford University Press. of Bioinformatics
59. Nakhleh L., Roshan U., St. John K., Sun J., Warnow T. The performance of phylogenetic methods on trees of bounded diameter. "Procedings 1st International Workshop Algs. in Bioinformatics (WABI'01)," Vol. 2149:2001b;214-226 Springer Verlag. of Lecture Notes in Computer Science
60. Olsen G., Matsuda H., Hagstrom R., Overbeek R. FastDNAml: A tool for construction of phylogenetic trees of DNA sequences using maximum likelihood. Comput. Applied Biosci. 10:(1):1994;41-48
61. Page R. GeneTree: Comparing gene and species phylogenies using reconciled trees. Bioinformatic. 14:(9):1998;819-820
62. Page R., Charleston M. From gene to organismal phylogeny: Reconciled trees and the gene tree/species tree problem. Mol. Phyl. Evol. 7:1997a;231-240
63. Page R., Charleston M. Reconciled trees and incongruent gene and species trees. Mirkin B., McMorris F.R., Roberts F.S., Rzehtsky A. "Mathematical Hierarchies in Biology" Vol. 37:1997b;American Mathematical Society
64. Palmer J. Chloroplast and mitochondrial genome evolution in land plants. Herrmann R. "Cell Organelles" 1992;99-133 Springer Verlag
65. Pamilo P., Nei M. Relationship between gene trees and species trees. Mol. Biol. Evol. 5:1998;568-583
66. Pe'er I., Shamir R. The median problems for breakpoints are NP-complete. Elec. Colloq. Comput. Complexity. 71:1998
67. Pevzner P., Tesler G. Human and mouse genomic sequences reveal extensive breakpoint reuse in mammalian evolution. Proc. Natl. Acad. Sci. USA. 100:(13):2003;7672-7677
68. Rokas A., Holland P.W.H. Rare genomic changes as a tool for phylogenetics. Trends Ecol. Evol. 15:2000;454-459
69. Roshan U., Moret B., Williams T., Warnow T. Rec-I-DCM3: A fast algorithmic technique for reconstructing large phylogenetic trees. "Proceedings 3rd IEEE Computational Systems Bioinformatics Conf. CSB'04." 2004;IEEE Press, Piscataway, NJ
70. Saitou N., Nei M. The neighbor-joining method: A new method for reconstructing phylogenetic trees. Mol. Biol. Evol. 4:1987;406-425
71. Sankoff D. Genome rearrangement with gene families. Bioinformatics. 15:(11):1999;. 990-917.
72. Sankoff D., Blanchette M. Multiple genome rearrangement and breakpoint phylogeny. J. Comput. Biol. 5:1998;555-570
73. Sankoff D., Ferretti V., Nadeau J. Conserved segment identification. J. Comput. Biol. 4:(4):1997;559-565
74. Sankoff D., Nadeau J. Conserved synteny as a measure of genomic distance. Disc. Appl. Math. 71:(1-3):1996;247-257
75. Siepel A., Moret B. Finding an optimal inversion median: Experimental results. "Proccedings 1st International Workshop Algs. in Bioinformatics (WABI'01)," Vol. 2149:2001;189-203 Springer Verlag. of Lecture Notes in Computer Science
76. Steel M.A. The maximum likelihood point for a phylogenetic tree is not unique. Syst. Biol. 43:(4):1994;560-564
77. Stein D., Conant D., Ahearn M., Jordan E., Kirch S., Hasebe M., Iwatsuki K., Tan M., Thomson J. Structural rearrangements of the chloroplast genome provide an important phylogenetic link in ferns. Proc. Natl. Acad. Sci. USA. 89:1992;1856-1860
78. Swenson K., Marron M., Earnest-DeYoung J., Moret B. Approximating the true evolutionary distance between two genomes. Tech. Rep. 2004;University of New Mexico. TR-CS-2004-15
79. Swofford D. PAUP*: Phylogenetic analysis using parsimony. 2001;. (*and other methods), version 4.0b8. Sunderland, MA.
80. Swofford D., Olsen G., Waddell P., Hillis D. Phylogenetic inference. Hillis D.M., Mable B.K., Moritz C. "Molecular Systematics" 1996;407-514 Sinauer Assoc
81. Tang J., Moret B. Phylogenetic reconstruction from gene rearrangement data with unequal gene contents. "Procedings 8th International Workshop on Algs. and Data Structures (WADS'03)," Vol. 2748:2003a;37-46 Springer Verlag. of Lecture Notes in Computer Science
82. Tang J., Moret B. Scaling up accurate phylogenetic reconstruction from gene-order data. "Proceedings 11th International Conf. on Intelligent Systems for Mol. Biol. (ISMB'03)," Vol. 19:2003b;i305-i312 Oxford University Press. of Bioinformatics
83. Tang J., Moret B., Cui L., dePamphilis C. Phylogenetic reconstruction from arbitrary gene-order data. "Proceedings 4th IEEE Symp. on Bioinformatics and Bioengineering BIBE'04," 2004;592-599 IEEE Press, Piscataway, NJ
84. Tannier E., Sagot M. Sorting by reversals in subquadratic time. "Proceedings 15th Ann. Symp. Combin. Pattern Matching (CPM'04)," Vol. 3109:2004;Springer Verlag. of Lecture Notes in Computer Science
85. Tesler G. Efficient algorithms for multichromosomal genome rearrangements. J. Comput. Syst. Sci. 65:(3):2002;587-609
86. Wang L.-S., Jansen R., Moret B., Raubeson L., Warnow T. Fast phylogenetic methods for genome rearrangement evolution: An empirical study. "Proceedings 7th Pacific Symp. on Biocomputing (PSB'02)" 2002;524-535 World Scientific Pub
87. Wang L.-S., Warnow T. Estimating true evolutionary distances between genomes. "Proceedings 33rd Ann. ACM Symp. Theory of Comput. (STOC'01)," 2001;637-646 ACM Press, New York
88. Wang L.-S., Warnow T. Distance-based genome rearrangement phylogeny. Gascuel O. "Mathematics of Evolution and Phylogeny" 2004;Oxford University Press