Multiple serial episodes matching
From MaRDI portal
Publication:844201
DOI10.1016/J.IPL.2006.02.008zbMATH Open1187.68178DBLPjournals/ipl/CegielskiGM06OpenAlexW2002610410WikidataQ56896650 ScholiaQ56896650MaRDI QIDQ844201FDOQ844201
Irène Guessarian, Patrick Cégielski, Yu. 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
Recommendations
Cites Work
- Title not available (Why is that?)
- Matching a set of strings with variable length don't cares
- Title not available (Why is that?)
- An algorithm for string matching with a sequence of don't cares
- Title not available (Why is that?)
- Fast Pattern Matching in Strings
- Faster approximate string matching
- On-line construction of suffix trees
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the power of the shift instruction
- Window-accumulated subsequence matching problem is linear
- Multiplication, division, and shift instructions in parallel random access machines
- Real-time recognition of the inclusion relation
- Title not available (Why is that?)
Cited In (4)
This page was built for publication: Multiple serial episodes matching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q844201)
