Sciweavers

712 search results - page 56 / 143
» The Complexity of Constructing Evolutionary Trees Using Expe...
Sort
View
EUROGP
2006
Springer
138views Optimization» more  EUROGP 2006»
15 years 6 months ago
Evolving Crossover Operators for Function Optimization
Abstract. A new model for evolving crossover operators for evolutionary function optimization is proposed in this paper. The model is a hybrid technique that combines a Genetic Pro...
Laura Diosan, Mihai Oltean
BMCBI
2010
189views more  BMCBI 2010»
15 years 3 months ago
Efficient parallel and out of core algorithms for constructing large bi-directed de Bruijn graphs
Background: Assembling genomic sequences from a set of overlapping reads is one of the most fundamental problems in computational biology. Algorithms addressing the assembly probl...
Vamsi Kundeti, Sanguthevar Rajasekaran, Hieu Dinh,...
IWSSD
2000
IEEE
15 years 6 months ago
The Complexity of TRMCS-like Spiral Specification
Modern software is often constructed using "spiral specification"; i.e. the specification is a dynamic document that is altered by experience with the current version of...
Tim Menzies
ISAAC
2004
Springer
153views Algorithms» more  ISAAC 2004»
15 years 8 months ago
Canonical Data Structure for Interval Probe Graphs
The class of interval probe graphs is introduced to deal with the physical mapping and sequencing of DNA as a generalization of interval graphs. The polynomial time recognition al...
Ryuhei Uehara
CORR
2010
Springer
136views Education» more  CORR 2010»
15 years 1 months ago
Delay-Constrained Multicast Routing Algorithm Based on Average Distance Heuristic
Multicast is the ability of a communication network to accept a single message from an application and to deliver copies of the message to multiple recipients at different locatio...
Ling Zhou, Wei-xiong Ding, Yu-xi Zhu