Sciweavers

371 search results - page 15 / 75
» Algorithms for phylogenetic footprinting
Sort
View
RECOMB
2010
Springer
14 years 2 months ago
Alignment-Free Phylogenetic Reconstruction
We introduce the first polynomial-time phylogenetic reconstruction algorithm under a model of sequence evolution allowing insertions and deletions—or indels. Given appropriate ...
Constantinos Daskalakis, Sébastien Roch
TCBB
2008
101views more  TCBB 2008»
13 years 7 months ago
Improved Layout of Phylogenetic Networks
Split networks are increasingly being used in phylogenetic analysis. Usually, a simple equal-angle algorithm is used to draw such networks, producing layouts that leave much room f...
Philippe Gambette, Daniel H. Huson
WABI
2004
Springer
107views Bioinformatics» more  WABI 2004»
14 years 22 days ago
Phylogenetic Super-networks from Partial Trees
—In practice, one is often faced with incomplete phylogenetic data, such as a collection of partial trees or partial splits. This paper poses the problem of inferring a phylogene...
Daniel H. Huson, Tobias Dezulian, Tobias H. Kl&oum...
WOB
2004
134views Bioinformatics» more  WOB 2004»
13 years 8 months ago
Reconstruction of Phylogenetic Trees using the Ant Colony Optimization Paradigm
We developed a new approach for the reconstruction of phylogenetic trees using ant colony optimization metaheuristics.Atree is constructed using a fully connected graph and the pro...
Heitor S. Lopes, Mauricio Perretto
EOR
2006
110views more  EOR 2006»
13 years 7 months ago
Scatter search with path relinking for phylogenetic inference
We propose the use of scatter search with path relinking for the inference of phylogenetic trees. Solutions are here represented as trees whose leaves span the set of species unde...
Carlos Cotta