Sciweavers

249 search results - page 9 / 50
» Finding Patterns in Given Intervals
Sort
View
PAKDD
2009
ACM
170views Data Mining» more  PAKDD 2009»
14 years 5 months ago
Discovering Periodic-Frequent Patterns in Transactional Databases.
Since mining frequent patterns from transactional databases involves an exponential mining space and generates a huge number of patterns, efficient discovery of user-interest-based...
Byeong-Soo Jeong, Chowdhury Farhan Ahmed, Syed Kha...
CPM
2006
Springer
143views Combinatorics» more  CPM 2006»
14 years 4 days ago
Algorithms for Finding a Most Similar Subforest
Given an ordered labeled forest F ("the target forest") and an ordered labeled forest G ("the pattern forest"), the most similar subforest problem is to find a ...
Jesper Jansson, Zeshan Peng
WABI
2001
Springer
142views Bioinformatics» more  WABI 2001»
14 years 25 days ago
Pattern Matching and Pattern Discovery Algorithms for Protein Topologies
We describe algorithms for pattern matching and pattern learning in TOPS diagrams (formal descriptions of protein topologies). These problems can be reduced to checking for subgrap...
Juris Viksna, David Gilbert
CPM
2007
Springer
94views Combinatorics» more  CPM 2007»
14 years 2 months ago
Finding Witnesses by Peeling
In the k-matches problem, we are given a pattern and a text, and for each text location, the desired output consists of all aligned matching characters if there are k or fewer of ...
Yonatan Aumann, Moshe Lewenstein, Noa Lewenstein, ...
COMBINATORICS
1999
85views more  COMBINATORICS 1999»
13 years 8 months ago
Permutation Patterns and Continued Fractions
We find, in the form of a continued fraction, the generating function for the number of (132)-avoiding permutations that have a given number of (123) patterns, and show how to ext...
Aaron Robertson, Herbert S. Wilf, Doron Zeilberger