Optimal packed string matching

DOI10.4230/LIPICS.FSTTCS.2011.423MaRDI QIDQ2911643zbMATH OpenOpenAlexFDO

Authors Oren Ben-Kiki, Philip Bille, Dany Breslauer, Roberto Grossi, Oren Weimann, Leszek Gąsieniec

Publication date 31 August 2012

Full work available at URL https://doi.org/10.4230/lipics.fsttcs.2011.423

zbMATH Keywords

real timestring matchingbit parallelismspace efficiency

Mathematics Subject Classification ID

Combinatorics on words (68R15) Algorithms on strings (68W32)

Recommendations

• Towards optimal packed string matching
• Fast searching in packed strings
• Fast Searching in Packed Strings
• Average optimal string matching in packed strings
• Fast and flexible packed string matching

Cited in

(9)

• Fast and flexible packed string matching
• Fast searching in packed strings
• Fast Packed String Matching for Short Patterns
• Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing
• Average optimal string matching in packed strings
• Fast Searching in Packed Strings
• Towards optimal packed string matching
• Constant-time word-size string matching
• Worst-case efficient single and multiple string matching on packed texts in the word-RAM model

This page was built for publication: Optimal packed string matching

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