Biology Reference
In-Depth Information
[8] Elias I. Settling the intractability of multiple alignment. J Comput Biol
2006;13:1323-39.
[9] Desper R, Gascuel O. Theoretical foundation of the balancedminimumevolution
method of phylogenetic inference and its relationship to weighted least-squares
tree fitting. Mol Biol Evo 2004;2:587-98.
[10] Felsenstein J. Cases in which parsimony and compatibility methods will be
positively misleading. Syst Zool 1978;27:401-10.
[11] DeBryRW. The consistency of several phylogeny-inferencemethods under vary-
ing evolutionary rates. Mol Biol Evol 1992;9:537-51.
[12] Denis F, Gascuel O. On the consistency of the minimum evolution principle of
phylogenetic inference. Discrete Appl Math 2003;127:63-77.
[13] Roch S. Toward extracting all phylogenetic information from matrices of evo-
lutionary distances. Science 2010;327:1376-9.
[14] Pauplin Y. Direct calculation of a tree length using a distance matrix. J Mol Evol
2000;51:41-7.
[15] Desper R, Gascuel O. Fast and accurate phylogeny reconstruction algorithms
based on the minimum-evolution principle. J Comp Bio 2002;9:687-705.
[16] Saitou N, Nei M. The neighbor joining method: a newmethod for reconstructing
phylogenetic trees. Mol Biol Evol 1987;4:406-25.
[17] Cueto MA, Matsen FA. Polyhedral geometry of phylogenetic rogue taxa; 2010.
Preprint <arXiv:1001.5241>.
[18] Billera LP, Holmes SJ, Vogtman K. The geometry of space of phylogenetic trees.
Adv Appl Math 2001;27:733-67.
[19] Nye T. Principle component analysis in the space of phylogenetic trees. Ann
Stat 2011;39:2716-39.
[20] Owen M. Computing geodesic distances in tree space. SIAM J Discrete Math
2011;25:1506-29.
[21] Owen M, Provan JS. A fast algorithm for computing geodesics in tree space.
IEEE/ACM Trans Comput Biol Bioinform 2011;8:2-13.
[22] Day W. Computational complexity of inferring phylogenies from dissimilarity
matrices. Bull Math Biol 1987;49:461-7.
[23] Haws D, Hodge T, Yoshida R. Optimality of the neighbor joining algorithm
and faces of the balanced minimum evolution polytope. Bull Math Biol 2011.
doi:10.1007/s11538-011-9640-x.
[24] Studier JA, Keppler KJ. A note on the neighbor-joining method of Saitou and
Nei. Mol Biol Evol 1988;5:729-31.
[25] Mihaescu R, Levy D, Pachter L. Why neighbor-joining works. Algorithmica
2009;54:1-24.
[26] Eickmeyer K, Yoshida R. The geometry of the neighbor-joining algorithm for
small trees. Lecture notes in computer science. Springer-Verlag, vol. 1547; 2008.
p. 81-95.
[27] Eickmeyer K, Huggins P, Pachter L, Yoshida R. On the optimality of the
neighbor-joining algorithm. Algorithms Mol Biol 2008;3. <http://www.almob.
org/content/3/1/5> .
 
 
Search WWH ::




Custom Search