Sciweavers

97 search results - page 5 / 20
» Faster Algorithms for Sampling and Counting Biological Seque...
Sort
View
TCS
2008
13 years 8 months ago
Algorithms for subsequence combinatorics
A subsequence is obtained from a string by deleting any number of characters; thus in contrast to a substring, a subsequence is not necessarily a contiguous part of the string. Co...
Cees H. Elzinga, Sven Rahmann, Hui Wang
RECOMB
2010
Springer
14 years 3 months ago
A Novel Abundance-Based Algorithm for Binning Metagenomic Sequences Using l-Tuples
Abstract. Metagenomics is the study of microbial communities sampled directly from their natural environment, without prior culturing. Among the computational tools recently develo...
Yu-Wei Wu, Yuzhen Ye
RECOMB
2010
Springer
13 years 10 months ago
naiveBayesCall: An Efficient Model-Based Base-Calling Algorithm for High-Throughput Sequencing
Immense amounts of raw instrument data (i.e., images of fluorescence) are currently being generated using ultra high-throughput sequencing platforms. An important computational cha...
Wei-Chun Kao, Yun S. Song
CCE
2004
13 years 8 months ago
Improving convergence of the stochastic decomposition algorithm by using an efficient sampling technique
This work focuses on the basic stochastic decomposition (SD) algorithm of Higle and Sen [J.L. Higle, S. Sen, Stochastic Decomposition, Kluwer Academic Publishers, 1996] for two-st...
José María Ponce-Ortega, Vicente Ric...
CCCG
2009
13 years 9 months ago
Defining and computing accessibility radius
In structural molecular biology software, the accessibility of an atom in a molecule to a ball representing solvent is either computed slowly by building a solventaccessible surfa...
Vishal Verma, Jack Snoeyink