198 search results - page 28 / 40 » Efficient computation of absent words in genomic sequences |
105
click to vote
GCB
2004
Springer
15 years 1 months ago
2004
Springer
: In biological sequence analysis, position specific scoring matrices (PSSMs) are widely used to represent sequence motifs. In this paper, we present a new nonheuristic algorithm, ...
101
click to vote
BMCBI
2006
14 years 9 months ago
2006
Background: Single nucleotide polymorphisms (SNPs) are important tools in studying complex genetic traits and genome evolution. Computational strategies for SNP discovery make use...
KDD
2008
ACM
15 years 10 months ago
2008
ACM
Pattern discovery in sequences is an important problem in many applications, especially in computational biology and text mining. However, due to the noisy nature of data, the tra...
127
click to vote
RECOMB
2001
Springer
15 years 10 months ago
2001
Springer
motif discovery problem abstracts the task of discovering short, conserved sites in genomic DNA. Pevzner and Sze recently described a precise combinatorial formulation of motif di...
ALMOB
2006
14 years 9 months ago
2006
Background: In order to compute pattern statistics in computational biology a Markov model is commonly used to take into account the sequence composition. Usually its parameter mu...