A Practical Algorithm for Reconstructing Level-1 Phylogenetic Networks
暂无分享,去创建一个
Leo van Iersel | Steven Kelk | Katharina T. Huber | Radoslaw Suchecki | K. Huber | Radosław Suchecki | S. Kelk | L. Iersel
[1] Daniel H. Huson,et al. Dendroscope: An interactive viewer for large phylogenetic trees , 2007, BMC Bioinformatics.
[2] Satish Rao,et al. Using Max Cut to Enhance Rooted Trees Consistency , 2006, IEEE/ACM Transactions on Computational Biology and Bioinformatics.
[3] Leo van Iersel,et al. Uniqueness, Intractability and Exact Algorithms: Reflections on Level-k Phylogenetic Networks , 2007, J. Bioinform. Comput. Biol..
[4] Philippe Gambette,et al. On encodings of phylogenetic networks of bounded level , 2009, Journal of mathematical biology.
[5] G. Valiente,et al. Metrics for Phylogenetic Networks II: Nodal and Triplets Metrics , 2009, IEEE/ACM Transactions on Computational Biology and Bioinformatics.
[6] Michel Habib,et al. Level-k Phylogenetic Networks Are Constructable from a Dense Triplet Set in Polynomial Time , 2009, CPM.
[7] Olivier Gascuel,et al. Reconstructing evolution : new mathematical and computational advances , 2007 .
[8] Daniel H. Huson,et al. Phylogenetic Networks: Contents , 2010 .
[9] Gabriel Cardona,et al. A distance metric for a class of tree-sibling phylogenetic networks , 2008, Bioinform..
[10] Wing-Kin Sung,et al. Algorithms for combining rooted triplets into a galled phylogenetic network , 2005, SODA '05.
[11] Martin Vingron,et al. TREE-PUZZLE: maximum likelihood phylogenetic analysis using quartets and parallel computing , 2002, Bioinform..
[12] O. Bininda-Emonds. Phylogenetic Supertrees: Combining Information To Reveal The Tree Of Life , 2004 .
[13] Steven Kelk,et al. LEV1ATHAN: A level-1 heuristic , 2009 .
[14] L. Stougie,et al. Constructing Level-2 Phylogenetic Networks from Triplets , 2007, IEEE/ACM Transactions on Computational Biology and Bioinformatics.
[15] Gabriel Cardona,et al. Comparison of Tree-Child Phylogenetic Networks , 2007, IEEE/ACM Transactions on Computational Biology and Bioinformatics.
[16] Wing-Kin Sung,et al. Inferring a Level-1 Phylogenetic Network from a Dense Set of Rooted Triplets , 2004, COCOON.
[17] Ming Li,et al. Computing the quartet distance between evolutionary trees , 2000, SODA '00.
[18] Bang Ye Wu,et al. Constructing the Maximum Consensus Tree from Rooted Triples , 2004, J. Comb. Optim..
[19] Daniel H. Huson,et al. Phylogenetic Networks - Concepts, Algorithms and Applications , 2011 .
[20] Leo van Iersel,et al. Constructing the Simplest Possible Phylogenetic Network from Triplets , 2008, Algorithmica.
[21] A. Oskooi. Molecular Evolution and Phylogenetics , 2008 .
[22] Luay Nakhleh,et al. Phylogenetic networks , 2004 .
[23] Steven Kelk,et al. Worst-case optimal approximation algorithms for maximizing triplet consistency within phylogenetic networks , 2007, J. Discrete Algorithms.
[24] Gabriel Cardona,et al. Extended Newick: it is time for a standard representation of phylogenetic networks , 2008, BMC Bioinformatics.
[25] M. Kimura. A simple method for estimating evolutionary rates of base substitutions through comparative studies of nucleotide sequences , 1980, Journal of Molecular Evolution.
[26] Alfred V. Aho,et al. Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational Expressions , 1981, SIAM J. Comput..
[27] G. Valiente,et al. Metrics for Phylogenetic Networks I: Generalizations of the Robinson-Foulds Metric , 2009, IEEE/ACM Transactions on Computational Biology and Bioinformatics.
[28] M. Salemi,et al. The phylogenetic handbook : a practical approach to DNA and protein phylogeny , 2003 .
[29] J. Davenport. Editor , 1960 .
[30] Bernard M. E. Moret,et al. NetGen: generating phylogenetic networks with diploid hybrids , 2006, Bioinform..
[31] Emden R. Gansner,et al. Drawing graphs with dot , 2006 .
[32] Francesc Rosselló,et al. All that Glisters is not Galled , 2009, Mathematical biosciences.