541 search results - page 17 / 109 » An Efficient Algorithm for the Longest Pattern Subsequence P... |
109
click to vote
JCB
2000
15 years 2 months ago
2000
We study the problem of similarity detection by sequence alignment with gaps, using a recently established theoretical framework based on the morphology of alignment paths. Alignm...
114
click to vote
DLT
2004
15 years 3 months ago
2004
There is a close relationship between formal language theory and data compression. Since 1990's various types of grammar-based text compression algorithms have been introduced...
112
Voted
SDM
2008
SIAM
15 years 3 months ago
2008
SIAM
Typically, sequence signatures, such as motifs and domains, are assumed to be localized in one region of a sequence or are derived as combinations of the former. We generalize the...
126
Voted
BMCBI
2008
15 years 2 months ago
2008
Background: The DNA microarray technology allows the measurement of expression levels of thousands of genes under tens/hundreds of different conditions. In microarray data, genes ...
127
click to vote
AUSDM
2008
Springer
15 years 4 months ago
2008
Springer
Share-frequent pattern mining discovers more useful and realistic knowledge from database compared to the traditional frequent pattern mining by considering the non-binary frequen...