
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Noga Alon, Benny Chor, Fabio Pardi, Anat Rapoport, "Approximate Maximum Parsimony and Ancestral Maximum Likelihood," IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol. 7, no. 1, pp. 183187, JanuaryMarch, 2010.  
BibTex  x  
@article{ 10.1109/TCBB.2008.13, author = {Noga Alon and Benny Chor and Fabio Pardi and Anat Rapoport}, title = {Approximate Maximum Parsimony and Ancestral Maximum Likelihood}, journal ={IEEE/ACM Transactions on Computational Biology and Bioinformatics}, volume = {7}, number = {1}, issn = {15455963}, year = {2010}, pages = {183187}, doi = {http://doi.ieeecomputersociety.org/10.1109/TCBB.2008.13}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE/ACM Transactions on Computational Biology and Bioinformatics TI  Approximate Maximum Parsimony and Ancestral Maximum Likelihood IS  1 SN  15455963 SP183 EP187 EPD  183187 A1  Noga Alon, A1  Benny Chor, A1  Fabio Pardi, A1  Anat Rapoport, PY  2010 KW  Phylogenetic reconstruction KW  ancestral maximum likelihood KW  maximum parsimony KW  Steiner trees KW  approximation algorithms. VL  7 JA  IEEE/ACM Transactions on Computational Biology and Bioinformatics ER   
[1] L. AddarioBerry, B. Chor, M. Hallett, J. Lagergren, A. Panconesi, and T. Wareham, "Ancestral Maximum Likelihood of Evolutionary Trees Is Hard," J. Bioinformatics and Computational Biology, vol. 2, no. 2, pp. 257271, 2004.
[2] D. Barry and J.A. Hartigan, "Statistical Analysis of Hominoid Molecular Evolution," Statistical Science, vol. 2, pp. 191210, 1987.
[3] P. Berman and V. Ramaiyer, "Improved Approximations for the Steiner Tree Problem," J. Algorithms, vol. 17, pp. 381408, 1994.
[4] T. Cover and J. Thomas, Elements of Information Theory. John Wiley & Sons, 1991.
[5] J. Felsenstein, "Evolutionary Trees from DNA Sequences: A Maximum Likelihood Approach," J. Molecular Evolution, vol. 17, pp. 368376, 1981.
[6] W.M. Fitch, "Toward Defining the Course of Evolution: Minimum Change for Specified Tree Topology," Systematic Zoology, vol. 20, pp. 406416, 1971.
[7] L.R. Foulds and R.L. Graham, "The Steiner Problem in Phylogeny Is NPComplete," Advances in Applied Math., vol. 3, pp. 4349, 1982.
[8] N. Goldman, "Maximum Likelihood Inference of Phylogenetic Trees, with Special Reference to a Poisson Process Model of DNA Substitution and to Parsimony Analyses," Systematic Zoology, vol. 39, pp. 345361, 1990.
[9] S. Hougardy and H.J. Prömel, "A 1.598 Approximation Algorithm for the Steiner Problem in Graphs," Proc. 10th ACMSIAM Symp. Discrete Algorithms (SODA '99), pp. 448453, 1999.
[10] T.H. Jukes and C.R. Cantor, "Evolution of Protein Molecules," Mammalian Protein Metabolism, H.N. Munro, ed., pp. 21132, Academic Press, 1969.
[11] R. Karp, "Reducibility among Combinatorial Problems," Complexity of Computer Computations, R.E. Miller and J.W. Thatcher, eds., pp. 85103, Plenum Press, 1972.
[12] M. Kimura, "Estimation of Evolutionary Sequences between Homologous Nucleotide Sequences," Proc. Nat'l Academy of Sciences USA, vol. 78, pp. 454458, 1981.
[13] J. Neyman, "Molecular Studies of Evolution: A Source of Novel Statistical Problems," Statistical Decision Theory and Related Topics, S. Gupta and Y. Jackel, eds., pp. 127, Academic Press, 1971.
[14] T. Pupko, I. Pe'er, R. Shamir, and D. Graur, "A Fast Algorithm for Joint Reconstruction of Ancestral AminoAcid Sequences," Molecular Biology and Evolution, vol. 17, no. 6, pp. 890896, 2000.
[15] G. Robins and A. Zelikovsky, "Tighter Bounds for Graph Steiner Tree Approximation," SIAM J. Discrete Math., vol. 19, no. 1, pp. 122134, 2005.
[16] M. Steel and D. Penny, "Parsimony, Likelihood, and the Role of Models in Molecular Phylogenetics," Molecular Biology and Evolution, vol. 17, no. 6, pp. 839850, 2000.
[17] H. Takahashi and A. Matsuyama, "An Approximate Solution for the Steiner Problem in Graphs," Math. Japonica 4, pp. 573577, 1980.
[18] A.Z. Zelikovsky, "An 11/6Approximation Algorithm for the Steiner Problem on Graphs," Proc. Fourth Czechoslovakian Symp. Combinatorics, Graphs and Complexity, J. Nesetril and M. Fiedler, eds., Annals of Discrete Math., vol. 51, pp. 351354, 1992.