Closed factorization

DOI10.1016/J.DAM.2016.04.009MaRDI QIDQ313756zbMATH OpenOpenAlexFDO

Authors Golnaz Badkobeh, Hideo Bannai, Keisuke Goto, Costas S. Iliopoulos, Shunsuke Inenaga, Simon J. Puglisi, Shiho Sugimoto, 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

suffix treesbordersclosed stringsManhattan skyline problemrange successor queries

Mathematics Subject Classification ID

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

Recommendations

• Off-line and on-line algorithms for closed string factorization
• Open and closed words
• Efficient identification of \(k\)-closed strings
• On the number of closed factors in a word
• scientific article; zbMATH DE number 1003283

Cites work

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

Cited in

(11)

• Maximal closed substrings
• On closed-rich words
• Factorizing strings into repetitions
• Closed Ziv-Lempel factorization of the \(m\)-bonacci words
• The sequence of open and closed prefixes of a Sturmian word
• Open and closed words
• Off-line and on-line algorithms for closed string factorization
• On the number of closed factors in a word
• Finite and infinite closed-rich words
• Efficient identification of \(k\)-closed strings
• On the size of overlapping Lempel-Ziv and Lyndon factorizations

This page was built for publication: Closed factorization

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