995 search results - page 2 / 199 » String Pattern Discovery |
KYOTODL
2000
13 years 6 months ago
2000
This paper describes applications of the optimized pattern discover),framework to text and Webmining. In particular; we introduce a class of simple combinatorialpatterns over phra...
DIS
2004
Springer
13 years 10 months ago
2004
Springer
We consider the problem of discovering the optimal pair of substring patterns with bounded distance α, from a given set S of strings. We study two kinds of pattern classes, one is...
WWW
2001
ACM
14 years 6 months ago
2001
ACM
The research in information extraction (IE) regards the generation of wrappers that can extract particular information from semistructured Web documents. Similar to compiler gener...
IFIP
2004
Springer
13 years 10 months ago
2004
Springer
Abstract In this paper we introduce the Weighted Suffix Tree, an efficient data structure for computing string regularities in weighted sequences of molecular data. Molecular Wei...
IPL
2008
13 years 5 months ago
2008
Given two strings, a pattern P of length m and a text T of length n over some alphabet , we consider the string matching problem under k mismatches. The well