Efficiencies of fast algorithms of phylogenetic inference under the criteria of maximum parsimony, minimum evolution, and maximum likelihood when a large number of sequences are used.

@article{Takahashi2000EfficienciesOF,
  title={Efficiencies of fast algorithms of phylogenetic inference under the criteria of maximum parsimony, minimum evolution, and maximum likelihood when a large number of sequences are used.},
  author={Kenichi Takahashi and Masatoshi Nei},
  journal={Molecular biology and evolution},
  year={2000},
  volume={17 8},
  pages={
          1251-8
        }
}
In phylogenetic inference by maximum-parsimony (MP), minimum-evolution (ME), and maximum-likelihood (ML) methods, it is customary to conduct extensive heuristic searches of MP, ME, and ML trees, examining a large number of different topologies. However, these extensive searches tend to give incorrect tree topologies. Here we show by extensive computer simulation that when the number of nucleotide sequences (m) is large and the number of nucleotides used (n) is relatively small, the simple MP or… CONTINUE READING

Figures, Tables, and Topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-10 OF 163 CITATIONS, ESTIMATED 86% COVERAGE

FILTER CITATIONS BY YEAR

1999
2019

CITATION STATISTICS

  • 13 Highly Influenced Citations

References

Publications referenced by this paper.
SHOWING 1-2 OF 2 REFERENCES

The reconstruction of evolution

  • J. FELSENSTEIN
  • Heredity