Journal Article10.1006/JAGM.1996.0035
Determining the Evolutionary Tree Using Experiments
72
TL;DR: A new model of computation is presented which assumes that it is possible to determine the true evolutionary tree for each three species, perhaps through the use of Ahlquist?Sibley experimental techniques and presents tight upper and lower bounds for constructing evolutionary trees using experiments.
read more
About: This article is published in Journal of Algorithms. The article was published on 01 Jul 1996. The article focuses on the topics: Human-based evolutionary computation & Tree rearrangement.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Learning from positive examples when the negative class is undetermined--microRNA gene identification.
TL;DR: Using the EBV genome as and external validation of the method, one-class machine learning is found to work as well as or better than a two-class approach in identifying true miRNAs aswell as predicting new miRNA prediction approaches.
Inferring a level-1 phylogenetic network from a dense set of rooted triplets
Jesper Jansson,Wing-Kin Sung +1 more
- 17 Aug 2004
TL;DR: An O(n 5)-time algorithm for finding the set of all phylogenetic networks having a single hybrid node attached to exactly one leaf (and having no other hybrid nodes) that are consistent with a given dense set of rooted triplets.
Computing the Local Consensus of Trees
TL;DR: It is shown that all local consensus trees, when they exist, can be constructed in polynomial time and that many fundamental problems can be solved in linear time.
Inferring phylogenetic relationships avoiding forbidden rooted triplets.
TL;DR: This paper considers the problem of constructing a phylogenetic tree/network which is consistent with all of the rooted triplets in a given set C and none of the Root Triplets in another given set F and provides some efficient exact and approximation algorithms for a number of biologically meaningful variants of the problem.
On the longest path algorithm for reconstructing trees from distance matrices
Lev Reyzin,Nikhil Srivastava +1 more
TL;DR: An algorithm that reconstructs a degree d restricted tree from its distance matrix that runs in time O(dnlog"dn) for topological trees and takes @Q(n^3^/^2d) time in the topological case is shown.
38
References
•Book
Data Structures and Network Algorithms
Robert E. Tarjan
- 01 Jan 1983
TL;DR: This paper presents a meta-trees tree model that automates the very labor-intensive and therefore time-heavy and therefore expensive process of manually selecting trees to grow in a graph.
2.3K
Estimating Phylogenetic Trees from Distance Matrices
TL;DR: The distance Wagner procedure is applicable to data matrices of immunological distance, such as that of Sarich (1969a), in which between-OTU comparisons are evaluated but for which no attributes of the OTUs themselves are directly observable.
1.4K
Numerical methods for inferring evolutionary trees.
TL;DR: Although existing statistical models are highly oversimplified and do not reflect the complexity of evolutionary processes, it is by viewing the problem as a statistical one that all these methods can be placed in common fremework, within which their behavior and assumptions can be compared.
663
Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational Expressions
TL;DR: An algorithm for constructing a tree to satisfy a set of lineage constraints on common ancestors is presented and this algorithm is applied to synthesize a relational algebra expression from a simple tableau, a problem arising in the theory of relational databases.
471
Some Biological Sequence Metrics
TL;DR: Some new metrics are introduced to measure the distance between biological sequences, such as amino acid sequences or nucleotide sequences, which generalize a metric of Sellers who considered only single deletions, mutations, and insertions.
420