Fast algorithms for computing phylogenetic divergence time
نویسندگان
چکیده
منابع مشابه
New Algorithms for Computing Phylogenetic Biodiversity
A common problem that appears in many case studies in ecology is the following: given a rooted phylogenetic tree T and a subset R of its leaf nodes, we want to compute the distance between the elements in R. A very popular distance measure that is used for this reason is the Phylogenetic Diversity (PD), which is defined as the cost of the minimum weight Steiner tree in T that spans the nodes in...
متن کاملFast Algorithms for Large-Scale Phylogenetic Reconstruction
One of the most fundamental computational problems in biology is that of inferring evolutionary histories of groups of species from sequence data. Such evolutionary histories, known as phylogenies are usually represented as binary trees where leaves represent extant species, whereas internal nodes represent their shared ancestors. As the amount of sequence data available to biologists increases...
متن کاملFast Algorithms for Computing the Tripartition-Based Distance Between Phylogenetic Networks
Consider two phylogenetic networks N and N ′ of size n. The tripartition-based distance finds the proportion of tripartitions which are not shared by N and N . This distance is proposed by Moret et al (2004) and is a generalization of Robinson-Foulds distance, which is orginally used to compare two phylogenetic trees. This paper gives an O(min{kn log n, n logn+ hn})-time algorithm to compute th...
متن کاملAlgorithms for Segmenting Time Series
As with most computer science problems, representation of the data is the key to ecient and eective solutions. Piecewise linear representation has been used for the representation of the data. This representation has been used by various researchers to support clustering, classication, indexing and association rule mining of time series data. A variety of algorithms have been proposed to obtain...
متن کاملFast Algorithms for Computing Tree LCS
The LCS of two rooted, ordered, and labeled trees F and G is the largest forest that can be obtained from both trees by deleting nodes. We present algorithms for computing tree LCS which exploit the sparsity inherent to the tree LCS problem. Assuming G is smaller than F , our first algorithm runs in time O(r · height(F ) · height(G) · lg lg |G|), where r is the number of pairs (v ∈ F,w ∈ G) suc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: BMC Bioinformatics
سال: 2017
ISSN: 1471-2105
DOI: 10.1186/s12859-017-1916-1