Sciweavers

387 search results - page 17 / 78
» Parallel Phylogenetic Inference
Sort
View
ISAAC
2009
Springer
147views Algorithms» more  ISAAC 2009»
14 years 2 months ago
Computing a Smallest Multi-labeled Phylogenetic Tree from Rooted Triplets
Abstract. We investigate the computational complexity of a new combinatorial problem of inferring a smallest possible multi-labeled phylogenetic tree (MUL tree) which is consistent...
Sylvain Guillemot, Jesper Jansson, Wing-Kin Sung
CORR
2004
Springer
119views Education» more  CORR 2004»
13 years 7 months ago
The Largest Compatible Subset Problem for Phylogenetic Data
Abstract. The phylogenetic tree construction is to infer the evolutionary relationship between species from the experimental data. However, the experimental data are often imperfec...
Andy Auyeung, Ajith Abraham
SODA
2004
ACM
124views Algorithms» more  SODA 2004»
13 years 9 months ago
On contract-and-refine transformations between phylogenetic trees
The inference of evolutionary trees using approaches which attempt to solve the maximum parsimony (MP) and maximum likelihood (ML) optimization problems is a standard part of much...
Ganeshkumar Ganapathy, Vijaya Ramachandran, Tandy ...
TKDE
2008
153views more  TKDE 2008»
13 years 7 months ago
Discovering Frequent Agreement Subtrees from Phylogenetic Data
We study a new data mining problem concerning the discovery of frequent agreement subtrees (FASTs) from a set of phylogenetic trees. A phylogenetic tree, or phylogeny, is an unorde...
Sen Zhang, Jason Tsong-Li Wang
RECOMB
2005
Springer
14 years 8 months ago
Constructing a Smallest Refining Galled Phylogenetic Network
Reticulation events occur frequently in many types of species. Therefore, to develop accurate methods for reconstructing phylogenetic networks in order to describe evolutionary his...
Trinh N. D. Huynh, Jesper Jansson, Nguyen Bao Nguy...