735 search results - page 37 / 147 » A Mechanization of Phylogenetic Trees |
133
Voted
BMCBI
2005
15 years 18 days ago
2005
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...
110
Voted
RECOMB
2006
Springer
16 years 1 months ago
2006
Springer
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...
110
Voted
RECOMB
2005
Springer
16 years 1 months ago
2005
Springer
Reticulation events occur frequently in many types of species. Therefore, to develop accurate methods for reconstructing phylogenetic networks in order to describe evolutionary his...
126
Voted
WEA
2010
Springer
15 years 7 months ago
2010
Springer
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...
100
click to vote
BMCBI
2006
15 years 22 days ago
2006
Background: With current technology, vast amounts of data can be cheaply and efficiently produced in association studies, and to prevent data analysis to become the bottleneck of ...