226 search results - page 8 / 46 » A Practical Algorithm to Find the Best Subsequence Patterns |
BMCBI
2004
13 years 7 months ago
2004
Background: The general problem of RNA secondary structure prediction under the widely used thermodynamic model is known to be NP-complete when the structures considered include a...
DCC
2005
IEEE
14 years 7 months ago
2005
IEEE
Inspired by the combinatorial denoising method DUDE [13], we present efficient algorithms for implementing this idea for arbitrary contexts or for using it within subsequences. We...
ECML
2007
Springer
13 years 11 months ago
2007
Springer
Mining frequent patterns is a major topic in data mining research, resulting in many seminal papers and algorithms on item set and episode discovery. The combination of these, call...
SIGMOD
2005
ACM
14 years 7 months ago
2005
ACM
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...
APBC
2008
13 years 8 months ago
2008
: Finding motifs and the corresponding binding sites is a critical and challenging problem in studying the process of gene expression. String and matrix representations are two pop...