84 search results - page 2 / 17 » Computing the graph-based parallel complexity of gene assemb... |
CPM
2005
Springer
13 years 11 months ago
2005
Springer
Gene structure prediction is one of the most important problems in computational molecular biology. It involves two steps: the first is finding the evidence (e.g. predicting spl...
IJFCS
2008
13 years 5 months ago
2008
We propose two different ways to simulate Boolean circuits in the framework of ciliate computations, based on the intramolecular and on the intermolecular gene assembly models wit...
BMCBI
2010
13 years 6 months ago
2010
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...
BICOB
2009
Springer
14 years 12 days ago
2009
Springer
The de novo assembly of genomes from high-throughput short reads is an active area of research. Several promising methods have been recently developed, with applicability mainly re...
WABI
2007
Springer
13 years 12 months ago
2007
Springer
Graph-theoretic models have come to the forefront as some of the most powerful and practical methods for sequence assembly. Simultaneously, the computational hardness of the underl...