Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

18

EVOW
2005
Springer

favoriteEmaildiscussreport

235views Artificial Intelligence» more EVOW 2005»

On the Application of Evolutionary Algorithms to the Consensus Tree Problem

13 years 10 months ago

On the Application of Evolutionary Algorithms to the Consensus Tree Problem

Download www.lcc.uma.es

Computing consensus trees amounts to ﬁnding a single tree that summarizes a collection of trees. Three evolutionary algorithms are deﬁned for this problem, featuring characteristics of genetic programming (GP), evolution strategies (ES) and evolutionary programming (EP) respectively. These algorithms are evaluated on a benchmark composed of phylogenetic trees computed from genomic data. The GP-like algorithm is shown to provide better results than the other evolutionary algorithms, and than two greedy heuristics deﬁned ad hoc for this problem.

Carlos Cotta

Real-time Traffic

Artificial Intelligence | Consensus Trees | Evolutionary Algorithms | Evolutionary Programming | EVOW 2005 |

claim paper

Related Content

» Computing the Local Consensus of Trees

» PAC Progressive Alignment with Consensus Sequences

» A Consensus Tree Approach for Reconstructing Human Evolutionary History and Detecting Popu...

» Balanced Randomized Tree Splitting with Applications to Evolutionary Tree Constructions

» Unordered Tree Mining with Applications to Phylogeny

» Case Study Visualizing Sets of Evolutionary Trees

» Finding consensus trees by evolutionary variable neighborhood search and hybrid algorithms

» PentaPlot A software tool for the illustration of genome mosaicism

» A Hybrid Transgenetic Algorithm for the Prize Collecting Steiner Tree Problem

Post Info
More Details (n/a)

Added	27 Jun 2010
Updated	27 Jun 2010
Type	Conference
Year	2005
Where	EVOW
Authors	Carlos Cotta

Comments (0)