Maximum likelihood phylogenetic reconstruction using gene order encodings

IEEE SSCI 2011 - Symposium Series on Computational Intelligence - CIBCB 2011: 2011 IEEE Symposium on Computational Intelligence in Bioinformatics and Computational Biology

Volumn , Issue , 2011, Pages 117-122

  Hu, Fei ^a   Gao, Nan ^a   Zhang, Meng ^b   Tang, Jijun ^a  

^a University of South Carolina   (United States)

^b JILIN UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY ENCODINGS; DATA SETS; ENCODINGS; EVOLUTIONARY HISTORY; GENE ORDERS; LARGE-SCALE ANALYSIS; MAXIMUM PARSIMONY; MULTI STATE; NUCLEAR GENOMES; PHYLOGENETIC ANALYSIS; PHYLOGENETIC RECONSTRUCTION; SIMULATED DATASETS;

ARTIFICIAL INTELLIGENCE; BINARY SEQUENCES; BIOINFORMATICS; BIOLOGY; ENCODING (SYMBOLS); EXPERIMENTS; MAXIMUM LIKELIHOOD ESTIMATION;

GENE ENCODING;

EID: 80053100096     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CIBCB.2011.5948459     Document Type: Conference Paper

References (25)

1. Rokas A, Holland P: Rare genomic changes as a tool for phylogenetics. Trends in Ecology and Evolution 2000, 15:454-459.
2. Saitou N, Nei M: The neighbor-joining method: A new method for reconstructing phylogenetic trees. Mol. Biol. Evol. 1987, 4:406-425.
3. Desper R, Gascuel O: Fast and accurate phylogeny reconstruction algorithms based on the minimum evolution principle. J. Comput. Biol. 2002, 9:687-705. (Pubitemid 36042994)
4. Moret B, Wyman S, Bader D, Warnow T, Yan M: A new implementation and detailed study of breakpoint analysis. In Proceedings of the 6th Pacific Symp. on Biocomputing (PSB'01) 2001:583-594.
5. Bourque G, Pevzner P: Genome-scale evolution: reconstructing gene orders in the ancestral species. Genome Research 2002, 12:26-36. (Pubitemid 34065587)
6. Stamatakis A: RAxML-VI-HPC: maximum likelihood-based phylogenetic analyses with thousands of taxa and mixed models. bioinformatics 2006, 22:2688-2690.
7. Hannenhalli S, Pevzner P: Transforming cabbage into turnip (polynomial algorithm for sorting signed permutations by reversals. In Proceedings of the 27th Ann. Symp. Theory of Computing (STOC'95) 1995:99-124.
8. Bader D, Moret B, Yan M: A Linear-Time Algorithm for Computing Inversion Distance between Signed Permutations with an Experimental Study. In Proc. 7th Int'l Workshop on Algorithms and Data Structures (WADS 2001), Volume 2125 of Lecture Notes in Computer Science, Providence, RI: Springer-Verlag 2001:365-376.
9. Yancopoulos S, Attie O, Friedberg R: Efficient sorting of genomic permutations by translocation, inversion and block interchange. Bioinformatics 2005, 21:3340-3346. (Pubitemid 41222437)
10. Larget B, Kadane J, Simon D: A Bayesian approach to the estimation of ancestral genome arrangements. Mol. Phy. Evol. 2005, 36:214-223. (Pubitemid 40793692)
11. Wang L, Jansen R, Moret B, Raubeson L, Warnow T: Distance-based genome rearrangement phylogeny. J. Mol. Evol. 2006, 63:473-483. (Pubitemid 44611734)
12. Moret B, Wang L, Warnow T, Wyman S: New approaches for reconstructing phylogenies from gene order data. Bioinformatics 2001, 17:S165-S173. (Pubitemid 33793507)
13. Lin Y, Moret B: Estimating true evolutionary distances under the DCJ model. Bioinformatics 2008, 24:i114-i122. (Pubitemid 351911664)
14. 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. In Proceedings of the 8th Intl. Conf. on Intel. Sys. for Mol. Bio. (ISMB'00) 2000.
15. Swofford D: PAUP*. Phylogenetic Analysis Using Parsimony (*and Other Methods). Version 4. Sunderland, MA 2003.
16. Moret B, Wang L, Warnow T, Wyman S: New approaches for reconstructing phylogenies based on gene order. In Proceedings of the 9th Intl. Conf. on Intel. Sys. for Mol. Bio. (ISMB'01) 2001:165-173.
17. Felsenstein J: Evolutionary trees from DNA sequences: a maximum-likelihood approach. Journal of molecular evolution 1981, 17:368-376.
18. Schmidt Heiko A., Strimmer Korbinian, Vingron Martin, von Haeseler Arndt: TREE-PUZZLE: maximum likelihood phylogenetic analysis using quartets and parallel computing. bioinformatics 2002, 18:502-504.
19. Zwickl D. J., Strimmer Korbinian, Vingron Martin, von Haeseler Arndt: Genetic algorithm approaches for the phylogenetic analysis of large biological sequence. Ph.D. dissertation, The University of Texas at Austin.
20. Stamatakis A, Hoover P, Rougemont J: A rapid bootstrap algorithm for the RAxML web-servers. Syst. Biol. 2008, 75:758-771.
21. Bryant D: A lower bound for the breakpoint phylogeny problem. In Proc. 11th Ann. Symp. Combinatorial Pattern Matching CPM'00. Edited by Giancarlo R, Sankoff D, Springer 2000:235-247.
22. Sorenson MD, Fleischer RC: Multiple independent transpositions of mitochondrial DNA control region sequences to the nucleus. In Proc. National Academy of Sciences USA, Volume 93 1996:15239-15243. (Pubitemid 27009583)
23. A C: The Reversal Median Problem. INFORMS Journal on Computing 2003, 15(1):93-113.
24. Robinson D, Foulds L: Comparison of phylogenetic trees. Mathematical Biosciences 1981, 53:131-147. (Pubitemid 11129084)
25. Swofford D, Olson G, Waddell P, Hillis D: Phylogenetic inferences. In Molecular Systematics, 2nd edition. Edited by Hillis DM, Moritz C, Mable B 1996.