Computing Palindromic Factorizations and Palindromic Covers On-line
From MaRDI portal
Publication:5165601
DOI10.1007/978-3-319-07566-2_16zbMath1407.68575OpenAlexW110454916MaRDI QIDQ5165601
Masayuki Takeda, Shunsuke Inenaga, Hideo Bannai, Shiho Sugimoto, Tomohiro I.
Publication date: 30 June 2014
Published in: Combinatorial Pattern Matching (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-07566-2_16
Related Items (17)
Factorizing strings into repetitions ⋮ Diverse Palindromic Factorization Is NP-complete ⋮ Palindromic decompositions with gaps and errors ⋮ Palindromic length and reduction of powers ⋮ EERTREE: an efficient data structure for processing palindromes in strings ⋮ An efficient algorithm for the longest common palindromic subsequence problem ⋮ Maximal degenerate palindromes with gaps and mismatches ⋮ A subquadratic algorithm for minimum palindromic factorization ⋮ String Covering: A Survey ⋮ Algorithms and combinatorial properties on shortest unique palindromic substrings ⋮ Dynamic and internal longest common substring ⋮ Palindromic Decompositions with Gaps and Errors ⋮ Counting Palindromes in Substrings ⋮ Diverse Palindromic Factorization is NP-Complete ⋮ Unnamed Item ⋮ On the size of overlapping Lempel-Ziv and Lyndon factorizations ⋮ Comparing Degenerate Strings
This page was built for publication: Computing Palindromic Factorizations and Palindromic Covers On-line
