Sciweavers

224 search results - page 37 / 45
» The Complexity of Finding Replicas Using Equality Tests
Sort
View
BMCBI
2006
116views more  BMCBI 2006»
14 years 9 months ago
Optimized mixed Markov models for motif identification
Background: Identifying functional elements, such as transcriptional factor binding sites, is a fundamental step in reconstructing gene regulatory networks and remains a challengi...
Weichun Huang, David M. Umbach, Uwe Ohler, Leping ...
93
Voted
ATAL
2009
Springer
15 years 4 months ago
Graph-based methods for the analysis of large-scale multiagent systems
Multiagent systems are often characterized by complex, and sometimes unpredictable interactions amongst their autonomous components. While these systems can provide robust and sca...
Wilbur Peng, William Krueger, Alexander Grushin, P...
76
Voted
BMCBI
2007
151views more  BMCBI 2007»
14 years 9 months ago
Minimus: a fast, lightweight genome assembler
Background: Genome assemblers have grown very large and complex in response to the need for algorithms to handle the challenges of large whole-genome sequencing projects. Many of ...
Daniel D. Sommer, Arthur L. Delcher, Steven L. Sal...
BMCBI
2010
124views more  BMCBI 2010»
14 years 9 months ago
A factor model to analyze heterogeneity in gene expression
Background: Microarray technology allows the simultaneous analysis of thousands of genes within a single experiment. Significance analyses of transcriptomic data ignore the gene d...
Yuna Blum, Guillaume Le Mignon, Sandrine Lagarrigu...
GECCO
2007
Springer
241views Optimization» more  GECCO 2007»
15 years 3 months ago
Binary ant algorithm
When facing dynamic optimization problems the goal is no longer to find the extrema, but to track their progression through the space as closely as possible. Over these kind of ov...
Carlos Fernandes, Agostinho C. Rosa, Vitorino Ramo...