1421 search results - page 71 / 285 » Algorithms for subsequence combinatorics |
136
click to vote
ADMA
2009
Springer
15 years 9 months ago
2009
Springer
Mining frequent sequential patterns from sequence databases has been a central research topic in data mining and various efficient mining sequential patterns algorithms have been p...
150
click to vote
IEEESCC
2009
IEEE
15 years 22 days ago
2009
IEEE
In this paper we look at combining and compressing a set of workflows, such that computation can be minimized. In this context, we look at two novel theoretical problems with appl...
123
click to vote
BIBE
2007
IEEE
15 years 9 months ago
2007
IEEE
Abstract—We consider the problem of aligning multiple protein sequences with the goal of maximizing the SP (Sum-of-Pairs) score, when the number of sequences is large. The QOMA (...
134
click to vote
CPM
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. The efficiency of regular expression matching algorithms depends very much on the size of the nondeterministic finite automata (NFA) obtained from regular expressions. R...
117
click to vote
CPM
2004
Springer
15 years 8 months ago
2004
Springer
Given a matrix X composed of symbols, a bicluster is a submatrix of X obtained by removing some of the rows and some of the columns of X in such a way that each row of what is lef...