Root Digger: a root placement program for phylogenetic trees
نویسندگان
چکیده
منابع مشابه
Phylogenetic k-Root and Steiner k-Root
Given a graph G = (V; E) and a positive integer k, the Phylogenetic k-Root Problem asks for a (unrooted) tree T without degree-2 nodes such that its leaves are labeled by V and (u; v) 2 E if and only if dT (u; v) k. If the vertices in V are also allowed to be internal nodes in T , then we have the Steiner k-Root Problem. Moreover, if a particular subset S of V are required to be internal nodes ...
متن کاملVerified Root-Balanced Trees
Andersson introduced general balanced trees, search trees based on the design principle of partial rebuilding: perform update operations naively until the tree becomes too unbalanced, at which point a whole subtree is rebalanced. We define and analyze a functional version of general balanced trees which we call root-balanced trees. Using a lightweight model of execution time, amortized logarith...
متن کاملInferring the root of a phylogenetic tree.
Phylogenetic trees can be rooted by a number of criteria. Here, we introduce a Bayesian method for inferring the root of a phylogenetic tree by using one of several criteria: the outgroup, molecular clock, and nonreversible model of DNA substitution. We perform simulation analyses to examine the relative ability of these three criteria to correctly identify the root of the tree. The outgroup an...
متن کاملStochastic Steiner Trees Without a Root
This paper considers the Steiner tree problem in the model of twostage stochastic optimization with recourse. This model, the focus of much recent research [1–4], tries to capture the fact that many infrastructure planning problems have to be solved in the presence of uncertainty, and that we have make decisions knowing merely market forecasts (and not the precise set of demands); by the time t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: BMC Bioinformatics
سال: 2021
ISSN: 1471-2105
DOI: 10.1186/s12859-021-03956-5