217 search results - page 23 / 44 » A new algorithm for gap constrained sequence mining |
JCDL
2004
ACM
14 years 2 months ago
2004
ACM
With the growth of digital music, content-based music retrieval (CBMR) has attracted increasingly attention. For most CBMR systems, the task is to return music objects similar to ...
EPIA
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. In social network analysis, a k-clique is a relaxed clique, i.e., a kclique is a quasi-complete sub-graph. A k-clique in a graph is a sub-graph where the distance between...
TCS
2008
13 years 8 months ago
2008
The longest common subsequence(LCS) problem is one of the classical and wellstudied problems in computer science. The computation of the LCS is a frequent task in DNA sequence ana...
ICDM
2007
IEEE
14 years 3 months ago
2007
IEEE
— RNA molecules are distinguished by their sequence composition and by their three-dimensional shape, called the secondary structure. The secondary structure of a pre-mRNA sequen...
KDD
2004
ACM
14 years 9 months ago
2004
ACM
In recent years, various constrained frequent pattern mining problem formulations and associated algorithms have been developed that enable the user to specify various itemsetbase...