Optimal prefix and suffix queries on texts

zbMATH Open1192.68952MaRDI QIDQ3576753FDOQ3576753

Authors: Maxime Crochemore, Costas S. Iliopoulos, M. Sohel Rahman 

Publication date: 2 August 2010

Full work available at URL: https://www.dmtcs.org/dmtcs-ojs/index.php/proceedings/article/view/dmAH0104/0.html

Recommendations

• Optimal prefix and suffix queries on texts
• Position-restricted substring searching over small alphabets
• On position restricted substring searching in succinct space
• Position-Restricted Substring Searching
• Efficient indexes for the positional pattern matching problem and two related problems over small alphabets

zbMATH Keywords

algorithmsindexdata structurespattern matchingsuffix trees

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Computer aspects of numerical algorithms (65Y99)

Cited In (3)

• Optimal prefix and suffix queries on texts
• Title not available (Why is that?)
• Cache oblivious algorithms for the RMQ and the RMSQ problems

This page was built for publication: Optimal prefix and suffix queries on texts

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