Sciweavers

181 search results - page 20 / 37
» Hybrid Genetic Algorithm for DNA Sequencing with Errors
Sort
View
ISAAC
2004
Springer
115views Algorithms» more  ISAAC 2004»
14 years 26 days ago
Randomized Algorithms for Motif Detection
Motivation: Motif detection for DNA sequences has many important applications in biological studies, e.g., locating binding sites and regulatory signals, and designing genetic prob...
Lusheng Wang, Liang Dong, Hui Fan
EMNLP
2006
13 years 9 months ago
A Hybrid Markov/Semi-Markov Conditional Random Field for Sequence Segmentation
Markov order-1 conditional random fields (CRFs) and semi-Markov CRFs are two popular models for sequence segmentation and labeling. Both models have advantages in terms of the typ...
Galen Andrew
KDD
2002
ACM
125views Data Mining» more  KDD 2002»
14 years 8 months ago
Pattern discovery in sequences under a Markov assumption
In this paper we investigate the general problem of discovering recurrent patterns that are embedded in categorical sequences. An important real-world problem of this nature is mo...
Darya Chudova, Padhraic Smyth
ISMB
2000
13 years 8 months ago
A Statistical Method for Finding Transcription Factor Binding Sites
Understanding the mechanismsthat determine the regulation of geneexpression is an important and challenging problem. A fundamental subproblem is to identify DNA-bindingsites for u...
Saurabh Sinha, Martin Tompa
CORR
2004
Springer
111views Education» more  CORR 2004»
13 years 7 months ago
Finding Approximate Palindromes in Strings Quickly and Simply
: Described are two algorithms to find long approximate palindromes in a string, for example a DNA sequence. A simple algorithm requires O(n)space and almost always runs in O(k.n)-...
L. Allison