Fast and reliable reconstruction of phylogenetic trees with very short edges extended abstract

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2008, Pages 379-388

  Gronau, Ilan ^a   Moran, Shlomo ^a   Snir, Sagi ^b  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b Netanya Academic College   (Ireland)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CONTROL THEORY; REPAIR; RESTORATION; TREES (MATHEMATICS);

HIGH PROBABILITY; INPUT SEQUENCE; LOWER BOUNDS; PHYLOGENETIC RECONSTRUCTION; RECONSTRUCTION ALGORITHMS; SEQUENCE LENGTHS;

GRAPH THEORY;

EID: 58449096222     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (21)

1. V. Berry and D. Bryant. Faster reliable phylogeuetie analysis. In RECOMB '99: Proceedings of the third annual international conference on Computational molecular biology, pages 59-68, 1999.
2. W. Beyer, M. Singh, T. Smith, and M. Waterman. Additive evolutionary trees. J Theor Biol, 64(2):199-213, January 1977.
3. P. Buneman. The recovery of trees from measures of dissimilarity. Mathematics in the Archeological and Historical Sciences, pages 387-395, 1971.
4. J. Cavender. Taxonomy with confidence. Math Biosci, 40:271-280, 1978.
5. T. Gormen, C. Leiserson, R. Rivest, and C. Stein. Introduction to Algorithms. MITP, 2001. 2nd edition.
6. M. Cryan, L. Goldberg, and P. Goldberg. Evolutionary trees can be learned in polynomial time in the two-state general markov model. SIAM Journal on Computing, 31 (2):375-397, 2001.
7. M. Gsürös. Fast recovery of evolutionary trees with thousands of nodes. Journal of Computational Biology, 9(2):277-297, 2002.
8. M. Gsürös and M. Kao. Recovering evolutionary trees through harmonic greedy triplets. In SODA: ACM-SIAM Symposium on Discrete Algorithms, pages 261-270, 1999.
9. J. Culberson and P. Rudnicki. A fast algorithm for constructing trees from distance matrices. Information Processing Letters, 30(4):215-220, February 1989.
10. C. Daskalakis, C. Hill, A. Jaffe, R. Mihaescu, E. Mossel, and S. Rao. Maximal accurate forests from distance matrices. In RECOMB '06: Proceedings of the tenth annual international conference on Computational molecular biology, pages 281-295, 2006.
11. G. Daskalakis, E. Mossel, and S. Roch. Optimal phylogenetic reconstruction, In STOC '06: Proceedings of the thirty-eighth annual ACM symposium on Theory of computing, pages 159-168, 2006,
12. P. Erdos, M, Steel, L. Szekely, and T. Warnow. A few logs suffice to build (almost) all trees (I). Random Structures and Algorithms, 14:153-184, 1999,
13. P. Erdos, M. Steel, L. Szekely, and T. Warnow. A few logs suffice to build (almost) all trees (II). Theoretical Computer Science, 221:77-118, 1999.
14. J. Farris. A probability model for inferring evolutionary trees. Systematic Zoology, 22:250-256, 1973.
15. D. Huson, S. Nettles, and T. Warnow. Disk-Govering, a fast-converging method for phylogeuetie tree reconstruction. J Comp Biol, 6:369-386, 1999.
16. V. King, L. Zhang, and Y. Zhou. On the complexity of distance-based evolutionary tree reconstruction. In SODA: ACM-SIAM Symposium on Discrete Algorithms, pages 444-453, 2003.
17. B. Moret, K. St. John, and T. Warnow. Absolute convergence: true trees from short sequences. In SODA: ACM-SIAM Symposium on Discrete Algorithms, pages 186-195, 2001.
18. E. Mossel. Phase transitions in phylogeny. Trans Airier Math Soc, 356:2379-2404, 2004.
19. E. Mossel. distorted metrics on trees and phylogenetic forests. ACM Transactions on computational biology and bioinformatics, 4:108-116, 2007.
20. J. Neymann. Molecular studies of evolution: A source of novel statistical problems. In S. Gupta and Y. Jackel, editors, Statistical Decision Theory and Related Topics, pages 1-27. Academic Press, New York, 1971.
21. L. Wasserman. All of Statistics. Springer, New York, 2004.