A New Algorithm for Reconstruction of Phyiogenetic Tree
The abstract should summarize the contents of the paper and should contain at least 70 and at most 150 words.It should be set in 9-point font size and should be inset 1.0 cm from the right and left margins.There should be two blank (10-point) lines before and after the abstract.This document is in the required format.In this paper,we present a new algorithm for reconstructing large phylogenetic tree.This algorithm is based on a family of Disk-Covering Methods (DCMs) which are divide-and-conquer techniques by dividing input dataset into smaller overlapping subset,constructing phylogenetic trees separately using some base methods and merging these subtrees into a single one.Provided the high memory efficiency of RAxML (which the program inherited from fastDNAml) compared to other programs and the good performance on largereal-world data it appears to be best-suited for use as the base method.The experiments clearly show that the proposed algorithm improves over standalone RAxML on all datasets,i.e,yields better likelihood values than RAxMLin the same amount of time.This results serve as an argument for the choice of the proposed algorithm instead of stand-alone RAxML.
Phylogenetic tree divide-and-conquer DCM
ZhiHua Du Zhen Ji
ShenZhen Unvierstiy,Shenzhen,China
国际会议
4th Asia Information Retrieval Symposium(AIRS 2008)(第四届亚洲信息检索研讨会)
哈尔滨
英文
472-477
2008-01-16（万方平台首次上网日期，不代表论文的发表时间）