Multiple serial episodes matching

DOI10.1016/j.ipl.2006.02.008zbMath1187.68178OpenAlexW2002610410WikidataQ56896650 ScholiaQ56896650MaRDI QIDQ844201

Irène Guessarian, Patrick Cégielski, Yu. V. Matiyasevich

Publication date: 18 January 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2006.02.008

zbMATH Keywords

algorithmsdata miningsubsequence matchingepisode matchingfrequent patterns

Mathematics Subject Classification ID

Searching and sorting (68P10) Nonnumerical algorithms (68W05)

Related Items

Faster subsequence recognition in compressed strings, Compressed subsequence matching and packed tree coloring

Cites Work

• An algorithm for string matching with a sequence of don't cares
• Multiplication, division, and shift instructions in parallel random access machines
• Faster approximate string matching
• Matching a set of strings with variable length don't cares
• On the power of the shift instruction
• On-line construction of suffix trees
• Real-time recognition of the inclusion relation
• Fast Pattern Matching in Strings
• Window-accumulated subsequence matching problem is linear
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item