Computing minimal and maximal suffixes of a substring revisited

DOI10.1007/978-3-319-07566-2_4MaRDI QIDQ5165588zbMATH OpenOpenAlexFDO

Authors Paweł Gawrychowski, Tomasz Kociumaka, Tatiana Starikovskaya, Maxim Babenko

Publication date 30 June 2014

Published in Combinatorial Pattern Matching (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-07566-2_4

Mathematics Subject Classification ID

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

Recommendations

• Computing minimal and maximal suffixes of a substring
• On minimal and maximal suffixes of a substring
• Minimal suffix and rotation of a substring in optimal time
• Generalized substring compression
• Lyndon factorization of grammar compressed texts revisited

Cited in

(5)

• On the longest common prefix of suffixes in an inverse Lyndon factorization and other properties
• Computing minimal and maximal suffixes of a substring
• Suffix array and Lyndon factorization of a text
• On minimal and maximal suffixes of a substring
• Minimal suffix and rotation of a substring in optimal time

This page was built for publication: Computing minimal and maximal suffixes of a substring revisited

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