Finding Gapped Palindromes Online

DOI10.1007/978-3-319-44543-4_15zbMath1478.68460OpenAlexW2538938081MaRDI QIDQ2819503

Michitaro Nakamura, Shunsuke Inenaga, Yuta Fujishige, Hideo Bannai, Masayuki Takeda

Publication date: 29 September 2016

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-44543-4_15

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Online algorithms; streaming algorithms (68W27) Algorithms on strings (68W32)

Related Items (6)

Improved upper bounds on all maximal \(\alpha\)-gapped repeats and palindromes ⋮ Palindromic decompositions with gaps and errors ⋮ Maximal degenerate palindromes with gaps and mismatches ⋮ Computing Longest Single-arm-gapped Palindromes in a String ⋮ Palindromic Decompositions with Gaps and Errors ⋮ Efficient computation of longest single-arm-gapped palindromes in a string

Cites Work

• Unnamed Item
• Unnamed Item
• Parallel detection of all palindromes in a string
• Searching for gapped palindromes
• On-line construction of suffix trees
• A New Linear-Time ``On-Line Algorithm for Finding the Smallest Initial Palindrome of a String
• Algorithms on Strings, Trees and Sequences
• Efficiently Finding All Maximal alpha-gapped Repeats
• Dynamic LCA Queries on Trees
• On the sorting-complexity of suffix tree construction

This page was built for publication: Finding Gapped Palindromes Online