Closed factorization

DOI10.1016/J.DAM.2016.04.009zbMath1350.68299OpenAlexW2913952852MaRDI QIDQ313756

Simon J. Puglisi, Hideo Bannai, Costas S. Iliopoulos, Keisuke Goto, Shiho Sugimoto, Golnaz Badkobeh, Shunsuke Inenaga, Tomohiro I.

Publication date: 12 September 2016

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2016.04.009

zbMATH Keywords

closed stringssuffix treesbordersManhattan skyline problemrange successor queries

Mathematics Subject Classification ID

Combinatorics on words (68R15) Algorithms on strings (68W32)

Related Items (8)

The sequence of open and closed prefixes of a Sturmian word ⋮ Factorizing strings into repetitions ⋮ Closed Ziv-Lempel factorization of the \(m\)-bonacci words ⋮ Finite and infinite closed-rich words ⋮ On the size of overlapping Lempel-Ziv and Lyndon factorizations ⋮ Off-line and on-line algorithms for closed string factorization ⋮ Efficient Identification of k-Closed Strings ⋮ On closed-rich words

Cites Work

• Extracting powers and periods in a word from its runs structure
• Improved data structures for the orthogonal range successor problem
• A Classification of Trapezoidal Words
• Sorted Range Reporting
• Suffix Arrays: A New Method for On-Line String Searches
• Fast Pattern Matching in Strings

This page was built for publication: Closed factorization