Martin Farach
Sampath Kannan
- 1.R. Agarwala, V. Bafna, M. Farach, B. Naray~nan, M. Paterson, and M. Thorup. On the approximability of numerical taxonomy: Fitting distances by tree metrics. Proc. o} the 7th Annual A CM-SIAM Symposium on Discrete Algorithms, 1996. Google Scholar
Digital Library
- 2.J. Cavender. Taxonomy with confidence. Mathematical Biosciences, 40:271-280, 1978.Google ScholarCross Ref
- 3.W.H.E. Day, D.S. Johnson, and D. Sankoff. The computational complexity of inferring rooted phylogenies by parsimony. Mathematical Biosciences, 81:33-42, 1986.Google ScholarCross Ref
- 4.M. Farach, S. Kannan, and T. Warnow. A l~obust model for finding optimal evolutionary trees. Algorithmica, 13:155-179, 1993.Google ScholarCross Ref
- 5.J. Felsenstein. Cases in which parsimony oc compatibility methods will be positively misleading. Syst. Zool., 22:240-249, 1978.Google ScholarCross Ref
- 6.J. Felsenstein. Numerical methods for infecrinng evolutionary trees. The Quarterly Review of Biology, 57(4), 1982.Google ScholarCross Ref
- 7.J. Felsenstein. Statistical inference of phylogenies. J. R. Statist. Soc. A, 1983.Google ScholarCross Ref
- 8.J. Felsenstein. Phylogenies from molecular sequences: inference and reliability. Annual Review o/ Genetics, 22:521-65, 1988.Google Scholar
- 9.R.L. Kashyap and S. Subas. Statistical estimation of parameters in a phylogenetic tree using a dynamic model of the substitutional process. J. theor. Biol., 47:74-101, 1974.Google Scholar
- 10.Michael Kearns, Yishay Mansour, Dana Ron, Ronitt Rubinfeld, Robert E. Schapire, and Linda Sellie. On the learnability of discrete distributions {extended abstract). Proc. of the ~6th Ann. A CM Symp. on Theory of Computing, pages 273-282, 1994. Google ScholarDigital Library
- 11.Rajeev Motwani and Prabhakar Raghavaa. Randomized Algorithms. Cambridge University Press, 1995. Google ScholarDigital Library
- 12.N. Saitou and M. Nei. The neighbor-joining method: a new method for reconstructing phylogentic trees. Mol. Biol. Evol., 4:406-424, 1987.Google Scholar
- 13.M. Steel, M.D. Hendy, and D. Penny. A discrete fourier analysis for evolutionary trees. Proceedings of the National Academy of Science, 91:3339-3343, 1994.Google ScholarCross Ref
- 14.D. L. Swofford and G. J. Olsen. Phylogeny reconstruction. In D. M. Hillis and C. Moritz, editors, Molecular Systematics, pages 411-501. Sinauer Associates Inc., Sunderland, MA., 1990.Google Scholar
Index Terms
- Efficient algorithms for inverting evolution
Recommendations
Efficient algorithms for team formation with a leader in social networks
Given a project with a set of required skills, it is an important and challenging problem of find a team of experts that have not only the required skill set but also the minimal communication cost. Furthermore, in view of the benefits of greater ...
Comments