Quartet consistency count method for reconstructing phylogenetic trees
Commun. Korean Math. Soc. 2010 Vol. 25, No. 1, 149-160
https://doi.org/10.4134/CKMS.2010.25.1.149
Printed March 1, 2010
Jin-Hwan Cho, Dosang Joe, and Young Rock Kim
The University of Suwon, Konkuk University, and Hankuk University of Foreign Studies
Abstract : Among the distance based algorithms in phylogenetic tree reconstruction, the neighbor-joining algorithm has been a widely used and effective method. We propose a new algorithm which counts the number of consistent quartets for cherry picking with tie breaking. We show that the success rate of the new algorithm is almost equal to that of neighbor-joining. This gives an explanation of the qualitative nature of neighbor-joining and that of dissimilarity maps from DNA sequence data. Moreover, the new algorithm always reconstructs correct trees from quartet consistent dissimilarity maps.
Keywords : neighbor-joining, phylogenetic tree, quartet consistency count, sequence generation, tree construction algorithm
MSC numbers : 92D15, 68R10, 05C05, 68Q25
Downloads: Full-text PDF  


Copyright © Korean Mathematical Society.
The Korea Science Technology Center (Rm. 411), 22, Teheran-ro 7-gil, Gangnam-gu, Seoul 06130, Korea
Tel: 82-2-565-0361  | Fax: 82-2-565-0364  | E-mail: paper@kms.or.kr   | Powered by INFOrang Co., Ltd