Biology – Quantitative Biology – Populations and Evolution
Scientific paper
2009-01-12
Biology
Quantitative Biology
Populations and Evolution
Please contact me with any questions or comments!
Scientific paper
This paper introduces constNJ, the first algorithm for phylogenetic reconstruction of sets of trees with constrained pairwise rooted subtree-prune regraft (rSPR) distance. We are motivated by the problem of constructing sets of trees which must fit into a recombination, hybridization, or similar network. Rather than first finding a set of trees which are optimal according to a phylogenetic criterion (e.g. likelihood or parsimony) and then attempting to fit them into a network, constNJ estimates the trees while enforcing specified rSPR distance constraints. The primary input for constNJ is a collection of distance matrices derived from sequence blocks which are assumed to have evolved in a tree-like manner, such as blocks of an alignment which do not contain any recombination breakpoints. The other input is a set of rSPR constraints for any set of pairs of trees. ConstNJ is consistent and a strict generalization of the neighbor-joining algorithm; it uses the new notion of "maximum agreement partitions" to assure that the resulting trees satisfy the given rSPR distance constraints.
No associations
LandOfFree
constNJ: an algorithm to reconstruct sets of phylogenetic trees satisfying pairwise topological constraints does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with constNJ: an algorithm to reconstruct sets of phylogenetic trees satisfying pairwise topological constraints, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and constNJ: an algorithm to reconstruct sets of phylogenetic trees satisfying pairwise topological constraints will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-532967