1421 search results - page 103 / 285 » Algorithms for subsequence combinatorics |
120
click to vote
DAWAK
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. We present an algorithm for mining frequent queries in arbitrary relational databases, over which functional dependencies are assumed. Building upon previous results, we ...
126
click to vote
ICSM
2005
IEEE
15 years 10 months ago
2005
IEEE
To aid software analysis and maintenance tasks, a number of software clustering algorithms have been proposed to automatically partition a software system into meaningful subsyste...
139
click to vote
BMCBI
2007
15 years 4 months ago
2007
Background: To infer homology and subsequently gene function, the Smith-Waterman (SW) algorithm is used to find the optimal local alignment between two sequences. When searching s...
160
click to vote
IJCAI
1989
15 years 5 months ago
1989
Several published reports show that instancebased learning algorithms yield high classification accuracies and have low storage requirements during supervised learning application...
130
click to vote
BMCBI
2006
15 years 4 months ago
2006
Background: The problem of finding a Shortest Common Supersequence (SCS) of a set of sequences is an important problem with applications in many areas. It is a key problem in biol...