Faster range LCP queries

DOI10.1007/978-3-319-02432-5_29MaRDI QIDQ2856589zbMATH OpenOpenAlexFDO

Authors Manish Patil, Rahul Shah, Sharma V. Thankachan

Publication date 29 October 2013

Published in String Processing and Information Retrieval (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-02432-5_29

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• Range LCP
• Range LCP
• A linear space data structure for range LCP queries
• A linear-space data structure for range-LCP queries in poly-logarithmic time
• A linear-space data structure for range-LCP queries in poly-logarithmic time

Cited in

(10)

• A linear-space data structure for range-LCP queries in poly-logarithmic time
• Computing minimal and maximal suffixes of a substring
• Range LCP
• Range LCP
• Wee LCP
• A linear space data structure for range LCP queries
• Faster longest common extension queries in strings over general alphabets
• Internal pattern matching queries in a text and applications
• Longest common extensions via fingerprinting
• A linear-space data structure for range-LCP queries in poly-logarithmic time

This page was built for publication: Faster range LCP queries

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