Sciweavers

1099 search results - page 123 / 220
» On the Complexity of Computing Evolutionary Trees
Sort
View
CORR
2000
Springer
112views Education» more  CORR 2000»
14 years 9 months ago
Evolution of differentiated expression patterns in digital organisms
Abstract. We investigate the evolutionary processes behind the development and optimization of multiple threads of execution in digital organisms using the avida platform, a softwa...
Charles Ofria, Christoph Adami, Travis C. Collier,...
BMCBI
2007
154views more  BMCBI 2007»
14 years 10 months ago
Inferring biological networks with output kernel trees
Background: Elucidating biological networks between proteins appears nowadays as one of the most important challenges in systems biology. Computational approaches to this problem ...
Pierre Geurts, Nizar Touleimat, Marie Dutreix, Flo...
BIRD
2008
Springer
162views Bioinformatics» more  BIRD 2008»
15 years 16 hour ago
Suffix Tree Characterization of Maximal Motifs in Biological Sequences
Finding motifs in biological sequences is one of the most intriguing problems for string algorithms designers due to, on the one hand, the numerous applications of this problem in...
Maria Federico, Nadia Pisanti
GECCO
2005
Springer
125views Optimization» more  GECCO 2005»
15 years 3 months ago
Schema disruption in tree-structured chromosomes
We study if and when the inequality dp(H) ≤ rel∆(H) holds for schemas H in chromosomes that are structured as trees. The disruption probability dp(H) is the probability that a...
William A. Greene
PPOPP
2009
ACM
15 years 10 months ago
An efficient transactional memory algorithm for computing minimum spanning forest of sparse graphs
Due to power wall, memory wall, and ILP wall, we are facing the end of ever increasing single-threaded performance. For this reason, multicore and manycore processors are arising ...
Seunghwa Kang, David A. Bader