Average optimal string matching in packed strings

DOI10.1007/978-3-642-38233-8_4MaRDI QIDQ4924636zbMATH OpenOpenAlexFDO

Authors Djamal Belazzougui, Mathieu Raffinot

Publication date 7 June 2013

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-38233-8_4

Mathematics Subject Classification ID

Data structures (68P05) Algorithms on strings (68W32)

Recommendations

• Fast Searching in Packed Strings
• Fast searching in packed strings
• Optimal packed string matching
• Worst-case efficient single and multiple string matching on packed texts in the word-RAM model
• Simple Optimal String Matching Algorithm

Cited in

(17)

• Average-optimal string matching
• Constant-space string-matching in sublinear average time
• Average complexity of exact and approximate multiple string matching
• Streaming dictionary matching with mismatches
• Optimal packed string matching
• Worst case efficient single and multiple string matching in the RAM model
• scientific article; zbMATH DE number 5777888 (Why is no real title available?)
• Fast Searching in Packed Strings
• Fast and flexible packed string matching
• Worst-case efficient single and multiple string matching on packed texts in the word-RAM model
• Compressed Multiple Pattern Matching
• Streaming Dictionary Matching with Mismatches
• Deterministic indexing for packed strings
• The complexity of the multiple pattern matching problem for random strings
• Fast searching in packed strings
• Succinct backward-DAWG-matching
• Average-optimal single and multiple approximate string matching

This page was built for publication: Average optimal string matching in packed strings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4924636)