Palindromic decompositions with gaps and errors

DOI10.1007/978-3-319-58747-9_7zbMath1489.68416arXiv1703.08931OpenAlexW2602146049MaRDI QIDQ2399364

Panagiotis Charalampopoulos, Mai Alzamel, Michał Adamczyk, Costas S. Iliopoulos, Jakub Radoszewski

Publication date: 22 August 2017

Full work available at URL: https://arxiv.org/abs/1703.08931

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Related Items (5)

Palindromic Decompositions with Gaps and Errors ⋮ Unnamed Item ⋮ Comparing Degenerate Strings ⋮ On highly palindromic words: the ternary case ⋮ Off-line and on-line algorithms for closed string factorization

Uses Software

• EERTREE

Cites Work

• Unnamed Item
• On palindromic factorization of words
• A subquadratic algorithm for minimum palindromic factorization
• Parallel detection of all palindromes in a string
• Searching for gapped palindromes
• Palindromes in the Fibonacci word
• EERTREE: an efficient data structure for processing palindromes in strings
• Finding all periods and initial palindromes of a string in parallel
• Palindromes and Sturmian words
• Finding Gapped Palindromes Online
• A New Linear-Time ``On-Line Algorithm for Finding the Smallest Initial Palindrome of a String
• A Linear-Time On-Line Recognition Algorithm for ``Palstar
• Fast Pattern Matching in Strings
• Algorithms on Strings, Trees and Sequences
• Jewels of Stringology
• Computing Palindromic Factorizations and Palindromic Covers On-line
• Pal k is Linear Recognizable Online
• Algorithms on Strings

This page was built for publication: Palindromic decompositions with gaps and errors