Window-accumulated subsequence matching problem is linear

Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems

Volumn , Issue , 1999, Pages 327-336

  Boasson, Luc ^a   Cegielski, Patrick ^a   Guessarian, Irene ^a   Matiyasevich, Yuri ^a  

^a UNIVERSITÉ PARIS DESCARTES   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DATABASE SYSTEMS; ONLINE SYSTEMS; PROBLEM SOLVING; RANDOM ACCESS STORAGE;

KNUTH-MORRIS-PRATT (KMP) PATTERN MATCHING ALGORITHMS; WINDOW-ACCUMULATED SUBSEQUENCE MATCHING PROBLEMS (WASP);

PATTERN MATCHING;

EID: 0032676579     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/303976.304008     Document Type: Article

References (20)