Verifying a Parameterized Border Array in O(n 1.5) Time

DOI10.1007/978-3-642-13509-5_22zbMath1286.68527OpenAlexW1587287256MaRDI QIDQ3575251

Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Tomohiro I.

Publication date: 26 July 2010

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

Full work available at URL: https://doi.org/10.1007/978-3-642-13509-5_22

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Related Items

The structural border array, Variations of the parameterized longest previous factor, Indeterminate string inference algorithms, Verifying and enumerating parameterized border arrays, Inferring strings from suffix trees and links on a binary alphabet, A prefix array for parameterized strings, Universal reconstruction of a string, A suffix tree or not a suffix tree?