4 search results - page 1 / 1 » Window Subsequence Problems for Compressed Texts |
CSR
2006
Springer
13 years 8 months ago
2006
Springer
Given two strings (a text t of length n and a pattern p) and a natural number w, window subsequence problems consist in deciding whether p occurs as a subsequence of t and/or findi...
CORR
2007
Springer
13 years 4 months ago
2007
Springer
Abstract. Processing compressed strings without decompression is often essential when dealing with massive data sets. We consider local subsequence recognition problems on strings ...
DASFAA
2005
IEEE
13 years 10 months ago
2005
IEEE
Finding bursts in data streams is attracting much attention in research community due to its broad applications. Existing burst detection methods suffer the problems that 1) the p...
KDD
2010
ACM
13 years 8 months ago
2010
ACM
The detection of repeated subsequences, time series motifs, is a problem which has been shown to have great utility for several higher-level data mining algorithms, including clas...