Proceedings. 2004 IEEE Computational Systems Bioinformatics Conference, 2004. CSB 2004.
DOI: 10.1109/csb.2004.1332422
|View full text |Cite
|
Sign up to set email alerts
|

Rec-I-DCM3: a fast algorithmic technique for reconstructing large phylogenetic trees

Abstract: Phylogenetic trees are commonly reconstructed based on hard optimization problems such as maximum parsimony (MP) and maximum likelihood (ML

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

2
123
0

Publication Types

Select...
5
3
1

Relationship

0
9

Authors

Journals

citations
Cited by 73 publications
(125 citation statements)
references
References 23 publications
2
123
0
Order By: Relevance
“…The CIPRES Portal V 1.0 permitted users to run the community tree inference tools GARLI [9], RAxML [10], PAUP [11], and MrBayes [12], both as standalone tools, and with the tool Rec-I-DCM3, a disc covering method to speed and improve inference of large trees [13]. The demand for Tree Inference analyses on the CIPRES Portal quickly exceeded the computational resources available to the project, pointing to a need to redesign the CIPRES Portal for greater scalability while minimizing costs for the sake of sustainability.…”
Section: Introductionmentioning
confidence: 99%
“…The CIPRES Portal V 1.0 permitted users to run the community tree inference tools GARLI [9], RAxML [10], PAUP [11], and MrBayes [12], both as standalone tools, and with the tool Rec-I-DCM3, a disc covering method to speed and improve inference of large trees [13]. The demand for Tree Inference analyses on the CIPRES Portal quickly exceeded the computational resources available to the project, pointing to a need to redesign the CIPRES Portal for greater scalability while minimizing costs for the sake of sustainability.…”
Section: Introductionmentioning
confidence: 99%
“…a fraction of the species), infer optimal trees for these subsets, then finally combine these trees into a larger tree. The first implementations of this strategy have been based on quartets including four species 175 and DISK-COVERING METHODS using larger species subsets are currently being developed 176 . The combination of the supermatrix and supertree approaches (BOX 2) might thus represent a solution for reconstructing -32 -phylogenomic trees with thousands of species in order to eventually obtain a full picture of the tree of life 40,177 .…”
mentioning
confidence: 99%
“…The above experimental results show that our strategies on the B&B phylogeny reconstruction are efficient. [Huson et al, 1999a, Huson et al, 1999b, Nakhleh et al, 2001, Roshan et al, 2004b] are a family of divide-and-conquer methods designed to "boost" the performance of existing phylogenetic reconstruction methods. All DCMs proceed in four major phases: (i) decomposing the dataset, (ii) solving the subproblems, (iii) merging the subproblems, and (iv) refining the resulting tree.…”
Section: Resultsmentioning
confidence: 99%