Window-Accumulated Subsequence matching Problem is linear

Window-Accumulated Subsequence matching Problem is linear (1999)

Cached

Download Links

[www.liafa.jussieu.fr]

Other Repositories/Bibliography

DBLP

by Luc Boasson , Patrick Cegielski , Irène Guessarian , Yuri Matiyasevich

Venue:	In Proceedings of the Eighteenth ACM SIGMODSIGACT -SIGART Symposium on Principles of Database Systems: PODS 1999, ACM
Citations:	8 - 0 self

Versions

Version History

Metadata Version 2

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Window-Accumulated Subsequence matching Problem is linear	user correction - Legacy Corrections
AUTHOR NAME	Luc Boasson	user correction - Legacy Corrections
AUTHOR NAME	Patrick Cegielski	user correction - Legacy Corrections
AUTHOR NAME	Irène Guessarian	user correction - Legacy Corrections
AUTHOR NAME	Yuri Matiyasevich	user correction - Legacy Corrections
ABSTRACT	Given two strings, text t of length n, and pattern p = p1 : : : pk of length k, and given a natural number w, the subsequence matching problem consists in finding the number of size w windows of text t which contain pattern p as a subsequence, i.e. the letters p1 ; : : : ; pk occur in the window, in the same order as in p, but not necessarily consecutively (they may be interleaved with other letters). Subsequence matching is used for finding frequent patterns and association rules in databases. We generalize the Knuth-Morris-Pratt (KMP) pattern matching algorithm; we define a non-conventional kind of RAM, the MP--RAMs which model more closely the microprocessor operations; we design an O(n) on-line algorithm for solving the subsequence matching problem on MP--RAMs. Keywords: Subsequence matching, algorithms, frequent patterns, episode matching, datamining. 1 Introduction We address the following problem. Given a text t of length n and a pattern p = p 1 \Delta \Delta \Delta p k of l...	user correction - Legacy Corrections
YEAR	1999	INFERENCE
VENUE	In Proceedings of the Eighteenth ACM SIGMODSIGACT -SIGART Symposium on Principles of Database Systems: PODS 1999, ACM	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	327--336	INFERENCE
CITATIONS	22 found	ParsCit 1.0