Computing minimal and maximal suffixes of a substring
From MaRDI portal
Publication:294952
DOI10.1016/J.TCS.2015.08.023zbMATH Open1344.68308OpenAlexW1902630904MaRDI QIDQ294952FDOQ294952
Authors: Paweł Gawrychowski, Tomasz Kociumaka, Ignat Kolesnichenko, Tatiana Starikovskaya, Maxim Babenko 
Publication date: 16 June 2016
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2015.08.023
Recommendations
Cites Work
- Factorizing words over an ordered alphabet
- Title not available (Why is that?)
- Title not available (Why is that?)
- Free differential calculus. IV: The quotient groups of the lower central series
- Uniqueness Theorems for Periodic Functions
- Surpassing the information theoretic bound with fusion trees
- Generalized substring compression
- Faster range LCP queries
- Substring compression problems
- Extracting powers and periods in a word from its runs structure
- Simple real-time constant-space string matching
- Internal pattern matching queries in a text and applications
- Wavelet trees meet suffix trees
- Algorithms on Strings
- Range LCP
Cited In (7)
- Finding the maximum suffix with fewer comparisons
- On minimal and maximal suffixes of a substring
- Near-optimal quantum algorithms for string problems
- Internal shortest absent word queries in constant time and linear space
- Finding the maximum suffix with fewer comparisons
- Minimal suffix and rotation of a substring in optimal time
- Computing minimal and maximal suffixes of a substring revisited
This page was built for publication: Computing minimal and maximal suffixes of a substring
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q294952)
