An Incremental Phylogenetic Tree Algorithm Based on Repeated Insertions of Species

Authors

Peter Revesz, University of Nebraska-LincolnFollow
Zhiqiang Li, University of Nebraska-LincolnFollow

Date of this Version

10-1-2015

Citation

P. Z. Revesz, Z. Li, An incremental phylogenetic tree algorithm based on repeated insertions of species, In: Mathematical Models and Computational Methods (joint proceedings of AMCSE-MMMAS-EAS), Imre J. Rudas, editor, INASE Press, pp. 40-44, October 2015.

Comments

OPEN ACCESS

Abstract

In this paper, we introduce a new phylogenetic tree algorithm that generates phylogenetic trees by repeatedly inserting species one-by-one. The incremental phylogenetic tree algorithm can work on proteins or DNA sequences. Computer experiments show that the new algorithm is better than the commonly used UPGMA and Neighbor Joining algorithms.