Sciweavers

330 search results - page 37 / 66
» Phylogenetic trees in ACL2
Sort
View
JCB
2006
124views more  JCB 2006»
14 years 11 months ago
The Average Common Substring Approach to Phylogenomic Reconstruction
We describe a novel method for efficient reconstruction of phylogenetic trees, based on sequences of whole genomes or proteomes, whose lengths may greatly vary. The core of our me...
Igor Ulitsky, David Burstein, Tamir Tuller, Benny ...
BMCBI
2005
122views more  BMCBI 2005»
14 years 11 months ago
Bayesian coestimation of phylogeny and sequence alignment
Background: Two central problems in computational biology are the determination of the alignment and phylogeny of a set of biological sequences. The traditional approach to this p...
Gerton Lunter, István Miklós, Alexei...
RECOMB
2006
Springer
16 years 4 days ago
Efficient Enumeration of Phylogenetically Informative Substrings
We study the problem of enumerating substrings that are common amongst genomes that share evolutionary descent. For example, one might want to enumerate all identical (therefore co...
Stanislav Angelov, Boulos Harb, Sampath Kannan, Sa...
RECOMB
2005
Springer
16 years 4 days 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...
WEA
2010
Springer
476views Algorithms» more  WEA 2010»
15 years 6 months ago
Fast FPT Algorithms for Computing Rooted Agreement Forests: Theory and Experiments
We improve on earlier FPT algorithms for computing a rooted maximum agreement forest (MAF) or a maximum acyclic agreement forest (MAAF) of a pair of phylogenetic trees. Their sizes...
Chris Whidden, Robert G. Beiko, Norbert Zeh