62 search results - page 8 / 13 » Faster Algorithms for Computing Longest Common Increasing Su... |
HICSS
2006
IEEE
14 years 1 months ago
2006
IEEE
Finding frequent patterns from databases has been the most time consuming process in data mining tasks, like association rule mining. Frequent pattern mining in real-time is of in...
BMCBI
2007
13 years 7 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...
AIRS
2004
Springer
14 years 23 days ago
2004
Springer
There exist practical bit-parallel algorithms for several types of pair-wise string processing, such as longest common subsequence computation or approximate string matching. The b...
HICSS
2005
IEEE
14 years 1 months ago
2005
IEEE
Association rule mining in real-time is of increasing thrust in many business applications. Applications such as e-commerce, recommender systems, supply-chain management and group...
SAC
2006
ACM
14 years 1 months ago
2006
ACM
Constraint-based mining techniques on sequence databases have been studied extensively the last few years and efficient algorithms enable to compute complete collections of patte...