Sciweavers

1552 search results - page 268 / 311
» On the Complexity of Constant Propagation
Sort
View
BMCBI
2010
189views more  BMCBI 2010»
14 years 12 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,...
BMCBI
2008
81views more  BMCBI 2008»
14 years 12 months ago
A perspective for biomedical data integration: Design of databases for flow cytometry
Background: The integration of biomedical information is essential for tackling medical problems. We describe a data model in the domain of flow cytometry (FC) allowing for massiv...
John Drakos, Marina Karakantza, Nicholas C. Zoumbo...
BMCBI
2006
116views more  BMCBI 2006»
14 years 12 months ago
Whole genome association mapping by incompatibilities and local perfect phylogenies
Background: With current technology, vast amounts of data can be cheaply and efficiently produced in association studies, and to prevent data analysis to become the bottleneck of ...
Thomas Mailund, Søren Besenbacher, Mikkel H...
JCB
2006
114views more  JCB 2006»
14 years 11 months ago
A General Modeling Strategy for Gene Regulatory Networks with Stochastic Dynamics
A stochastic genetic toggle switch model that consists of two identical, mutually repressive genes is built using the Gillespie algorithm with time delays as an example of a simpl...
Andre Ribeiro, Rui Zhu, Stuart A. Kauffman
SIAMDM
2008
79views more  SIAMDM 2008»
14 years 11 months ago
Testing Triangle-Freeness in General Graphs
In this paper we consider the problem of testing whether a graph is triangle-free, and more generally, whether it is H-free, for a fixed subgraph H. The algorithm should accept gr...
Noga Alon, Tali Kaufman, Michael Krivelevich, Dana...