Sciweavers

8431 search results - page 138 / 1687
» Algorithmically Independent Sequences
Sort
View
WABI
2007
Springer
133views Bioinformatics» more  WABI 2007»
15 years 4 months ago
RNA Folding Including Pseudoknots: A New Parameterized Algorithm and Improved Upper Bound
Predicting the secondary structure of an RNA sequence is an important problem in structural bioinformatics. The general RNA folding problem, where the sequence to be folded may con...
Chunmei Liu, Yinglei Song, Louis W. Shapiro
RECOMB
2000
Springer
15 years 1 months ago
Sequencing-by-hybridization at the information-theory bound: an optimal algorithm
In a recent paper (Preparata et al., 1999) we introduced a novel probing scheme for DNA sequencing by hybridization (SBH). The new gapped-probe scheme combines natural and univers...
Franco P. Preparata, Eli Upfal
APBC
2004
163views Bioinformatics» more  APBC 2004»
14 years 11 months ago
A Combined Model and a Varied Gibbs Sampling Algorithm Used for Motif Discovery
The conserved sequences in gene regulatory regions dominate gene regulation. Discovering these sequences and their functions is important in post genome era. A novel model is cons...
Xiaoming Wu, Bo Wang, Changxin Song, Jingzhi Cheng
BMCBI
2010
90views more  BMCBI 2010»
14 years 10 months ago
Local alignment of generalized k-base encoded DNA sequence
Background: DNA sequence comparison is a well-studied problem, in which two DNA sequences are compared using a weighted edit distance. Recent DNA sequencing technologies however o...
Nils Homer, Stanley F. Nelson, Barry Merriman
ESA
2007
Springer
133views Algorithms» more  ESA 2007»
15 years 4 months ago
Order Statistics in the Farey Sequences in Sublinear Time
We present the rst sublinear-time algorithms for computing order statistics in the Farey sequence and for the related problem of ranking. Our algorithms achieve a running times o...
Jakub Pawlewicz