Sciweavers

97 search results - page 3 / 20
» Faster Algorithms for Sampling and Counting Biological Seque...
Sort
View
GCB
2000
Springer
75views Biometrics» more  GCB 2000»
13 years 9 months ago
Regexpcount, a Symbolic Package for Counting Problems on Regular Expressions and Words
In previous work [10], we considered algorithms related to the statistics of matches with words and regular expressions in texts generated by Bernoulli or Markov sources. In this w...
Pierre Nicodème
BMCBI
2004
134views more  BMCBI 2004»
13 years 5 months ago
Bayesian model accounting for within-class biological variability in Serial Analysis of Gene Expression (SAGE)
Background: An important challenge for transcript counting methods such as Serial Analysis of Gene Expression (SAGE), "Digital Northern" or Massively Parallel Signature ...
Ricardo Z. N. Vêncio, Helena Brentani, Diogo...
IPPS
2010
IEEE
13 years 3 months ago
Fast Smith-Waterman hardware implementation
The Smith-Waterman (SW) algorithm is one of the widely used algorithms for sequence alignment in computational biology. With the growing size of the sequence database, there is alw...
Zubair Nawaz, Koen Bertels, Huseyin Ekin Sumbul
BMCBI
2010
81views more  BMCBI 2010»
13 years 4 months ago
Empirical Bayes Analysis of Sequencing-based Transcriptional Profiling without Replicates
Background: Recent technological advancements have made high throughput sequencing an increasingly popular approach for transcriptome analysis. Advantages of sequencing-based tran...
Zhijin Wu, Bethany D. Jenkins, Tatiana A. Rynearso...
RECOMB
2005
Springer
14 years 5 months ago
Improved Pattern-Driven Algorithms for Motif Finding in DNA Sequences
Abstract. In order to guarantee that the optimal motif is found, traditional pattern-driven approaches perform an exhaustive search over all candidate motifs of length l. We develo...
Sing-Hoi Sze, Xiaoyan Zhao