On Minimal and Maximal Suffixes of a Substring

DOI10.1007/978-3-642-38905-4_5zbMath1380.68459OpenAlexW58157398MaRDI QIDQ4928556

Ignat Kolesnichenko, Tatiana Starikovskaya, Maxim A. Babenko

Publication date: 14 June 2013

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

Full work available at URL: https://doi.org/10.1007/978-3-642-38905-4_5

Mathematics Subject Classification ID

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

Related Items (1)

Near-optimal quantum algorithms for string problems

This page was built for publication: On Minimal and Maximal Suffixes of a Substring