Sciweavers

76 search results - page 8 / 16
» Pattern Matching in Degenerate DNA RNA Sequences
Sort
View
CORR
2008
Springer
128views Education» more  CORR 2008»
13 years 7 months ago
A Fast Generic Sequence Matching Algorithm
A string matching--and more generally, sequence matching--algorithm is presented that has a linear worst-case computing time bound, a low worst-case bound on the number of compari...
David R. Musser, Gor V. Nishanov
BMCBI
2004
146views more  BMCBI 2004»
13 years 7 months ago
Defining transcriptional networks through integrative modeling of mRNA expression and transcription factor binding data
Background: Functional genomics studies are yielding information about regulatory processes in the cell at an unprecedented scale. In the yeast S. cerevisiae, DNA microarrays have...
Feng Gao, Barrett C. Foat, Harmen J. Bussemaker
RECOMB
2002
Springer
14 years 7 months ago
DNA sequence evolution with neighbor-dependent mutation
We introduce a model of DNA sequence evolution which can account for biases in mutation rates that depend on the identity of the neighboring bases. An analytic solution for this c...
Peter F. Arndt, Christopher B. Burge, Terence Hwa
IFIP
2004
Springer
14 years 25 days ago
Efficient Algorithms for Handling Molecular Weighted Sequences
Abstract In this paper we introduce the Weighted Suffix Tree, an efficient data structure for computing string regularities in weighted sequences of molecular data. Molecular Wei...
Costas S. Iliopoulos, Christos Makris, Yannis Pana...
SIGMOD
2005
ACM
144views Database» more  SIGMOD 2005»
14 years 7 months ago
Mining Periodic Patterns with Gap Requirement from Sequences
We study a problem of mining frequently occurring periodic patterns with a gap requirement from sequences. Given a character sequence S of length L and a pattern P of length l, we...
Minghua Zhang, Ben Kao, David Wai-Lok Cheung, Kevi...