Sciweavers

1099 search results - page 8 / 220
» On the Complexity of Computing Evolutionary Trees
Sort
View
GECCO
2006
Springer
139views Optimization» more  GECCO 2006»
15 years 1 months ago
Genetic programming: optimal population sizes for varying complexity problems
The population size in evolutionary computation is a significant parameter affecting computational effort and the ability to successfully evolve solutions. We find that population...
Alan Piszcz, Terence Soule
BIBE
2007
IEEE
124views Bioinformatics» more  BIBE 2007»
15 years 4 months ago
Finding Cancer-Related Gene Combinations Using a Molecular Evolutionary Algorithm
—High-throughput data such as microarrays make it possible to investigate the molecular-level mechanism of cancer more efficiently. Computational methods boost the microarray ana...
Chan-Hoon Park, Soo-Jin Kim, Sun Kim, Dong-Yeon Ch...
BMCBI
2006
143views more  BMCBI 2006»
14 years 9 months ago
Fast estimation of the difference between two PAM/JTT evolutionary distances in triplets of homologous sequences
Background: The estimation of the difference between two evolutionary distances within a triplet of homologs is a common operation that is used for example to determine which of t...
Christophe Dessimoz, Manuel Gil, Adrian Schneider,...
ISMIS
2011
Springer
14 years 18 days ago
An Evolutionary Algorithm for Global Induction of Regression Trees with Multivariate Linear Models
In the paper we present a new evolutionary algorithm for induction of regression trees. In contrast to the typical top-down approaches it globally searches for the best tree struct...
Marcin Czajkowski, Marek Kretowski
SIAMCOMP
1998
111views more  SIAMCOMP 1998»
14 years 9 months ago
Computing the Local Consensus of Trees
The inference of consensus from a set of evolutionary trees is a fundamental problem in a number of fields such as biology and historical linguistics, and many models for inferrin...
Sampath Kannan, Tandy Warnow