English

Finding Distinct Subpalindromes Online

Data Structures and Algorithms 2013-05-14 v1
Authors: Dmitry Kosolobov , Mikhail Rubinchik , Arseny M. Shur
View on arXiv ↗ PDF ↗

Abstract

We exhibit an online algorithm finding all distinct palindromes inside a given string in time Θ(nlog⁡∣Σ∣)\Theta(n\log|\Sigma|) over an ordered alphabet and in time Θ(n∣Σ∣)\Theta(n|\Sigma|) over an unordered alphabet. Using a reduction from a dictionary-like data structure, we prove the optimality of this algorithm in the comparison-based computation model.

Keywords

string algorithms succinct data structure graph algorithm

Cite

@article{arxiv.1305.2540,
  title  = {Finding Distinct Subpalindromes Online},
  author = {Dmitry Kosolobov and Mikhail Rubinchik and Arseny M. Shur},
  journal= {arXiv preprint arXiv:1305.2540},
  year   = {2013}
}

Comments

7 pages

Related papers

View all related →
Data Structures and Algorithms · Computer Science
Online Computation of Palindromes and Suffix Trees on Tries
Hiroki Shibata, Mitsuru Funakoshi, Takuya Mieno, Masakazu Ishihata +4
2026-01-26
Data Structures and Algorithms · Computer Science
Computing palindromes on a trie in linear time
Takuya Mieno, Mitsuru Funakoshi, Shunsuke Inenaga
2022-11-11
Data Structures and Algorithms · Computer Science
Finding Approximate Palindromes in Strings Quickly and Simply
L. Allison
2007-05-23
Discrete Mathematics · Computer Science
Efficiently decoding strings from their shingles
Aryeh Kontorovich, Ari Trachtenberg
2012-04-17
Data Structures and Algorithms · Computer Science
A Subquadratic Algorithm for Minimum Palindromic Factorization
Gabriele Fici, Travis Gagie, Juha Kärkkäinen, Dominik Kempa
2020-12-15
Data Structures and Algorithms · Computer Science
Palindromic Decompositions with Gaps and Errors
Michał Adamczyk, Mai Alzamel, Panagiotis Charalampopoulos, Costas S. Iliopoulos +1
2017-03-28
Data Structures and Algorithms · Computer Science
Palindrome Recognition In The Streaming Model
Petra Berenbrink, Funda Ergün, Frederik Mallmann-Trenn, Erfan Sadeqi Azer
2016-01-29
Data Structures and Algorithms · Computer Science
Finding approximate palindromes in strings
A. H. L. Porto, V. C. Barbosa
2007-05-23
Data Structures and Algorithms · Computer Science
Linear-Time Online Algorithm Inferring the Shortest Path from a Walk
Shintaro Narisada, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara
2019-02-22
Data Structures and Algorithms · Computer Science
Tight Bound for the Number of Distinct Palindromes in a Tree
Paweł Gawrychowski, Tomasz Kociumaka, Wojciech Rytter, Tomasz Waleń
2020-11-30
Data Structures and Algorithms · Computer Science
Online Square Detection
Dmitry Kosolobov
2014-11-10
Data Structures and Algorithms · Computer Science
Palindromic k-Factorization in Pure Linear Time
Mikhail Rubinchik, Arseny M. Shur
2020-07-07
Data Structures and Algorithms · Computer Science
Computing longest palindromic substring after single-character or block-wise edits
Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai +1
2021-01-11
Data Structures and Algorithms · Computer Science
Block Palindromes: A New Generalization of Palindromes
Keisuke Goto, Tomohiro I, Hideo Bannai, Shunsuke Inenaga
2018-08-07
Data Structures and Algorithms · Computer Science
Computing Runs on a General Alphabet
Dmitry Kosolobov
2015-11-24
Data Structures and Algorithms · Computer Science
Finding Top-k Longest Palindromes in Substrings
Kazuki Mitani, Takuya Mieno, Kazuhisa Seto, Takashi Horiyama
2023-06-21
Data Structures and Algorithms · Computer Science
A Chronological Edge-Driven Approach to Temporal Subgraph Isomorphism
Patrick Mackey, Katherine Porterfield, Erin Fitzhenry, Sutanay Choudhury +1
2018-01-25
Data Structures and Algorithms · Computer Science
Online algorithms for finding distinct substrings with length and multiple prefix and suffix conditions
Laurentius Leonard, Shunsuke Inenaga, Hideo Bannai, Takuya Mieno
2022-11-01
Data Structures and Algorithms · Computer Science
Online and Offline Algorithms for Counting Distinct Closed Factors via Sliding Suffix Trees
Takuya Mieno, Shun Takahashi, Kazuhisa Seto, Takashi Horiyama
2024-10-01
Data Structures and Algorithms · Computer Science
On-line Indexing for General Alphabets via Predecessor Queries on Subsets of an Ordered List
Tsvi Kopelowitz
2012-08-21
Data Structures and Algorithms · Computer Science
Almost succinct representation of maximal palindromes
Takuya Mieno, Tomohiro I
2026-05-15
Data Structures and Algorithms · Computer Science
Algorithms for Parameterized String Matching with Mismatches
Apurba Saha, Iftekhar Hakim Kaowsar, Mahdi Hasnat Siyam, M. Sohel Rahman
2024-12-03
Data Structures and Algorithms · Computer Science
Tight tradeoffs for approximating palindromes in streams
Paweł Gawrychowski, Przemysław Uznański
2016-04-08
Data Structures and Algorithms · Computer Science
A Linear-Time Algorithm for Finding an Odd Cycle Through Two Specified Vertices
Takumi Kano, Yutaro Yamaguchi
2026-04-28
Data Structures and Algorithms · Computer Science
On Time-Memory Tradeoffs for Maximal Palindromes with Wildcards and $k$-Mismatches
Amihood Amir, Ayelet Butman, Michael Itzhaki, Dina Sokol
2026-04-24
R2 v1 2026-06-22T00:14:58.650Z