97 search results - page 2 / 20 » Faster Algorithms for Sampling and Counting Biological Seque... |
FOCS
2007
IEEE
13 years 11 months ago
2007
IEEE
We present a near-optimal reduction from approximately counting the cardinality of a discrete set to approximately sampling elements of the set. An important application of our wo...
CORR
2007
Springer
13 years 4 months ago
2007
Springer
Assembling a gene from candidate exons is an important problem in computational biology. Among the most successful approaches to this problem is spliced alignment, proposed by Gelf...
BMCBI
2010
13 years 5 months ago
2010
Background: High throughput sequencing has become an important technology for studying expression levels in many types of genomic, and particularly transcriptomic, data. One key w...
ENGL
2007
13 years 4 months ago
2007
— The paper aims at designing a scheme for automatic identification of a species from its genome sequence. A set of 64 three-tuple keywords is first generated using the four type...
BMCBI
2011
12 years 8 months ago
2011
Background: The Smith-Waterman algorithm for local sequence alignment is more sensitive than heuristic methods for database searching, but also more time-consuming. The fastest ap...