Double-ended palindromic trees in linear time

The palindromic tree (a.k.a. eertree) is a data structure that provides access to all palindromic substrings of a string. In this paper, we propose a dynamic version of eertree, called double-ended eertree, which supports online operations on the stored string, including double-ended queue operation...

Full description

Saved in:
Bibliographic Details
Published in:Information and computation Vol. 307; p. 105379
Main Authors: Wang, Qisheng, Yang, Ming, Zhu, Xinrui
Format: Journal Article
Language:English
Published: Elsevier Inc 01.11.2025
Subjects:
Double-ended data structures
Eertrees
Palindromes
String algorithms
Palindromes
String algorithms
Eertrees
Double-ended data structures
ISSN:0890-5401
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract The palindromic tree (a.k.a. eertree) is a data structure that provides access to all palindromic substrings of a string. In this paper, we propose a dynamic version of eertree, called double-ended eertree, which supports online operations on the stored string, including double-ended queue operations, counting distinct palindromic substrings, and finding the longest palindromic prefix/suffix. At the heart of our construction, we identify a new class of substring occurrences, called surfaces, that are palindromic substring occurrences that are neither prefixes nor suffixes of any other palindromic substring occurrences, which is of independent interest. Surfaces characterize the link structure of all palindromic substrings in the eertree, thereby allowing a linear-time implementation of double-ended eertrees through a linear-time maintenance of surfaces.
AbstractList The palindromic tree (a.k.a. eertree) is a data structure that provides access to all palindromic substrings of a string. In this paper, we propose a dynamic version of eertree, called double-ended eertree, which supports online operations on the stored string, including double-ended queue operations, counting distinct palindromic substrings, and finding the longest palindromic prefix/suffix. At the heart of our construction, we identify a new class of substring occurrences, called surfaces, that are palindromic substring occurrences that are neither prefixes nor suffixes of any other palindromic substring occurrences, which is of independent interest. Surfaces characterize the link structure of all palindromic substrings in the eertree, thereby allowing a linear-time implementation of double-ended eertrees through a linear-time maintenance of surfaces.
ArticleNumber 105379
Author Zhu, Xinrui
Yang, Ming
Wang, Qisheng
Author_xml – sequence: 1
  givenname: Qisheng
  orcidid: 0000-0001-5107-8279
  surname: Wang
  fullname: Wang, Qisheng
  email: QishengWang1994@gmail.com
  organization: School of Informatics, University of Edinburgh, Edinburgh, United Kingdom
– sequence: 2
  givenname: Ming
  orcidid: 0000-0003-2756-8264
  surname: Yang
  fullname: Yang, Ming
  organization: China Telecom Cloud Technology Co., Ltd., Beijing, China
– sequence: 3
  givenname: Xinrui
  orcidid: 0009-0006-6849-9110
  surname: Zhu
  fullname: Zhu, Xinrui
  organization: XVERSE Technology Inc., Shenzhen, China
BookMark eNp1j01rwzAMhn3oYG23-475A87kOI7r3Ub30UFhl-1sYlsGh8QpdjbYv59Ldx0IiVfwCD0bsopzRELuGNQMWHc_1MHWDTSiRMGlWpE17BRQ0QK7JpucBwDGRNutCX2av8yIFKNDV536MUSX5inYakmIuQqxKivsU7WECW_Ile_HjLd_c0s-X54_9gd6fH992z8eqWW8VZTZzrOOGeV6Xhoq7qRsALFzrS0FDQIKb4zl4A0q4XnbcinQSW_8TvItgctdm-acE3p9SmHq049moM-KetDB6rOivigW5OGCYPnrO2DS2QaMFl1IaBft5vA__AtP_Fwn
Cites_doi 10.1016/0304-3975(91)90073-B
10.1007/s00224-020-09980-x
10.1016/j.tcs.2009.03.008
10.1137/0206024
10.1016/S0166-218X(99)00199-7
10.1023/A:1007678316583
10.1002/bies.950161207
10.1016/j.tcs.2023.114183
10.1145/324133.324139
10.1007/s00453-019-00591-8
10.1016/j.ejc.2017.07.021
10.1016/0304-3975(94)00083-U
10.1145/3456807
10.1007/s00453-015-0060-4
10.1007/BF01294132
10.1137/S0097539792242144
10.1186/1471-2105-12-214
10.1016/j.disc.2009.08.002
10.1038/nbt.3659
10.1145/3723884
10.1016/S0031-3203(01)00179-0
10.1016/S1570-8667(03)00010-8
10.1017/S0956796800001489
10.1016/j.tcs.2008.11.001
10.1016/S0304-3975(00)00436-9
10.1016/j.tcs.2014.06.033
10.1016/j.jda.2014.08.001
10.1006/jagm.1995.1020
10.1016/j.tcs.2004.12.015
10.1016/S0304-3975(01)00212-2
10.1063/1.2826631
10.1016/j.tcs.2014.07.012
10.1016/j.ipl.2016.07.001
10.1007/s00224-023-10146-8
10.1007/BF01182773
10.1109/5.892711
10.1145/367390.367400
10.1023/A:1023454111924
10.3233/FI-2011-536
10.1016/0020-0190(85)90088-2
10.1007/BF02099468
10.1145/322047.322056
10.1145/63334.63341
10.1016/j.jda.2018.11.009
10.1016/0020-0190(95)00080-V
10.1007/s00453-022-01092-x
10.1007/s11047-009-9131-2
10.1142/S0129054110007647
10.1080/10717544.2018.1474964
10.1016/j.ejc.2008.04.006
10.1145/321941.321946
10.1016/0020-0190(86)90028-1
10.1145/1217856.1217858
10.1016/j.ic.2019.104461
10.4310/MRL.2004.v11.n6.a10
10.1016/j.tig.2018.05.004
10.1016/S0304-3975(99)00320-5
10.1007/s00453-020-00744-0
10.1016/j.tcs.2012.01.047
10.1016/j.tcs.2025.115120
10.1016/j.tcs.2015.05.016
10.4049/jimmunol.148.12.4072
10.1016/S0304-3975(97)00188-6
10.1007/s00453-022-01066-z
10.1007/BF01206331
10.1145/360825.360855
10.1016/j.tcs.2007.09.029
10.1145/3672395
10.1145/321892.321896
10.1016/j.tcs.2021.01.014
10.1137/0222058
10.1016/j.tcs.2012.01.023
10.1142/S012905410400242X
10.1063/1.531916
10.1016/S0022-0000(73)80029-7
10.3233/FI-2016-1366
10.1111/j.1349-7006.1992.tb02734.x
10.1016/j.ipl.2010.07.018
10.1080/00150517.1998.12428937
10.1016/j.ipl.2021.106174
10.1016/S0012-365X(00)00054-6
10.1016/j.tcs.2012.04.031
10.1016/0022-0000(78)90042-9
ContentType Journal Article
Copyright 2025 The Authors
Copyright_xml – notice: 2025 The Authors
DBID 6I.
AAFTH
AAYXX
CITATION
DOI 10.1016/j.ic.2025.105379
DatabaseName ScienceDirect Open Access Titles
Elsevier:ScienceDirect:Open Access
CrossRef
DatabaseTitle CrossRef
DatabaseTitleList
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
Computer Science
ExternalDocumentID 10_1016_j_ic_2025_105379
S0890540125001154
GroupedDBID --K
--M
--Z
-~X
.~1
0R~
1B1
1~.
1~5
29I
4.4
457
4G.
5GY
5VS
6I.
6TJ
7-5
71M
8P~
9DU
9JN
AAEDT
AAEDW
AAFTH
AAIKJ
AAKOC
AALRI
AAOAW
AAQFI
AAQXK
AATTM
AAXKI
AAXUO
AAYFN
AAYWO
ABAOU
ABBOA
ABDPE
ABFNM
ABJNI
ABMAC
ABWVN
ABXDB
ACDAQ
ACGFS
ACLOT
ACNNM
ACRPL
ACVFH
ACZNC
ADBBV
ADCNI
ADEZE
ADFGL
ADMUD
ADNMO
ADVLN
AEBSH
AEIPS
AEKER
AENEX
AEUPX
AEXQZ
AFJKZ
AFPUW
AFTJW
AGHFR
AGQPQ
AGUBO
AGYEJ
AHZHX
AIALX
AIEXJ
AIGII
AIIUN
AIKHN
AITUG
AKBMS
AKRWK
AKYEP
ALMA_UNASSIGNED_HOLDINGS
AMRAJ
ANKPU
AOUOD
APXCP
ARUGR
ASPBG
AVWKF
AXJTR
AZFZN
BKOJK
BLXMC
CAG
COF
CS3
DM4
DU5
E3Z
EBS
EFBJH
EFKBS
EFLBG
EJD
EO8
EO9
EP2
EP3
FDB
FEDTE
FGOYB
FIRID
FNPLU
FYGXN
G-Q
GBLVA
GBOLZ
HVGLF
HZ~
H~9
IHE
IXB
J1W
KOM
LG5
LX9
M41
MHUIS
MO0
MVM
N9A
O-L
O9-
OAUVE
OK1
OZT
P-8
P-9
P2P
PC.
Q38
R2-
RNS
ROL
RPZ
SDF
SDG
SDP
SES
SEW
SPC
SPCBC
SSV
SSZ
T5K
TN5
WH7
WUQ
XPP
ZMT
ZU3
ZY4
~G-
~HD
AAYXX
CITATION
ID FETCH-LOGICAL-c1349-1c6f161b9da3b9de93d7720ee6d4cd4c02e0e5fbbc30fbe95f344375ed7fbf873
ISSN 0890-5401
IngestDate Thu Nov 27 00:46:12 EST 2025
Sat Nov 29 17:06:35 EST 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Keywords Palindromes
String algorithms
Eertrees
Double-ended data structures
Language English
License This is an open access article under the CC BY license.
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c1349-1c6f161b9da3b9de93d7720ee6d4cd4c02e0e5fbbc30fbe95f344375ed7fbf873
ORCID 0009-0006-6849-9110
0000-0001-5107-8279
0000-0003-2756-8264
OpenAccessLink https://dx.doi.org/10.1016/j.ic.2025.105379
ParticipantIDs crossref_primary_10_1016_j_ic_2025_105379
elsevier_sciencedirect_doi_10_1016_j_ic_2025_105379
PublicationCentury 2000
PublicationDate November 2025
2025-11-00
PublicationDateYYYYMMDD 2025-11-01
PublicationDate_xml – month: 11
  year: 2025
  text: November 2025
PublicationDecade 2020
PublicationTitle Information and computation
PublicationYear 2025
Publisher Elsevier Inc
Publisher_xml – name: Elsevier Inc
References Ukkonen (br1270) 1995; 14
Mieno, Kuhara, Akagi, Fujishige, Nakashima, Inenaga, Bannai, Takeda (br1040) 2020
Kuramoto, Yano, Kimura, Baba, Makino, Yamamoto, Yamamoto, Kataoka, Tokunaga (br0900) 1992; 83
Guo, Shallit, Shur (br0640) 2016; 116
Chuang, Goldberg (br0300) 1993
Kosaraju (br0860) 1994
Mieno, Watanabe, Nakashima, Inenaga, Bannai, Takeda (br1050) 2022; 173
Porto (br1120) 1999
Allouche (br0040) 1997; 38
Ramesh, Vinay (br1140) 2003; 1
Wang, Yang, Zhu (br1310) 2022
Gibney, Jin, Kociumaka, Thankachan (br0580) 2024
Yamamoto, Yamamoto, Kataoka, Kuramoto, Yano, Tokunaga (br1350) 1992; 148
Hagerup (br0660) 1998
Cook, Reckhow (br0310) 1973; 7
Tomohiro, Sugimoto, Inenaga, Bannai, Takeda (br0730) 2014
Montanaro (br1080) 2017; 77
Berenbrink, Ergün, Mallmann-Trenn, Sadeqi Azer (br0160) 2014
Gawrychowski, Karczmarz, Kociumaka, Ła̧cki, Sankowski (br0550) 2018
Glen, Justin, Widmer, Zamboni (br0600) 2009; 30
Hsu, Chen, Chao (br0700) 2010; 21
Anisiu, Anisiu, Kása (br0090) 2010; 310
Tomohiro, Inenaga, Bannai, Takeda (br0710) 2010
Hood (br0690) 1982
Funakoshi, Nakashima, Inenaga, Bannai, Takeda (br0500) 2019
Tarjan (br1260) 1983
Bergerson (br0170) 1973
Chen, Hsu, Chao (br0280) 2012; 432
Manacher (br0970) 1975; 22
Damanik, Zare (br0360) 2000; 222
Meyer (br1010) 1985; 21
Kärkkäinen, Sanders, Burkhardt (br0800) 2006; 53
Rubinchik, Shur (br1190) 2018; 68
Buchsbaum, Tarjan (br0250) 1995; 18
Funakoshi, Mieno, Nakashima, Inenaga, Bannai, Takeda (br0490) 2025; 304
Boroujeni, Ehsani, Ghodsi, HajiAghayi, Seddighin (br0180) 2021; 68
Duchon, Nicaud, Pivoteau (br0410) 2017
Kosolobov, Rubinchik, Shur (br0880) 2015
Gusfield (br0650) 1997
De La Briandais (br0370) 1959
Fici, Gagie, Kärkkäinen, Kempa (br0450) 2014; 28
Breslauer, Galil (br0200) 1995; 14
Strothmann (br1250) 2007; 389
Rubinchik, Shur (br1200) 2020
Slisenko (br1240) 1973; 129
Leach (br0940) 1994; 16
Gawrychowski, Kociumaka, Rytter, Waleń (br0560) 2015
Glen, Simpson, Smyth (br0610) 2019; 73
Meyer, Kurtz, Backofen, Will, Beckstette (br1020) 2011; 12
Funakoshi, Nakashima, Inenaga, Bannai, Takeda (br0510) 2021; 859
Kociumaka, Nogler, Wellnitz (br0840) 2025
Akmal, Jin (br0020) 2023; 85
Oleksandr (br0890) 2024
Fredman, Willard (br0470) 1990
Porto, Barbosa (br1130) 2002; 35
Manber, Myers (br0980) 1993; 22
Hof, Knill, Simon (br0680) 1995; 174
Shallit (br1220) 2013
Wang (br1300) 2025; 1034
Galil, Seiferas (br0540) 1978; 25
Damanik (br0350) 2000; 100
Fredkin (br0460) 1960; 3
Brlek, Lafrenière, Provençal (br0220) 2015
Inoue, Nakashima, Mieno, Inenaga, Bannai, Takeda (br0750) 2018; 52–53
Droubay, Pirillo (br0400) 1999; 223
Morita (br1090) 2020
Aho, Corasick (br0010) 1975; 18
Fiala, Greene (br0440) 1989; 32
Barrangou, Doudna (br0140) 2016; 34
Simpson (br1230) 2014; 550
Vesti (br1280) 2014; 548
Nong, Zhang, Chan (br1100) 2009
Mauri, Pavesi (br0990) 2005; 335
Baake (br0110) 1999; 49
Gajewska, Tarjan (br0520) 1986; 22
Crochemore, Rytter (br0340) 1991; 88
Funakoshi, Mieno (br0480) 2021
Lino, Harper, Carney, Timlin (br0950) 2018; 25
McCreight (br1000) 1976; 23
Brlek, Hamel, Nivat, Reutenauer (br0210) 2004; 15
Mignosi, Restivo, Sciortino (br1060) 2002; 273
Amir, Boneh (br0060) 2019
Jin, Nogler (br0770) 2024; 20
Droubay (br0380) 1995; 55
Banks, Hart, Sakata (br0130) 2004; 11
Okasaki (br1110) 1995; 5
Allouche, Baake, Cassaigne, Damanik (br0050) 2003; 292
Restivo, Rosone (br1160) 2009; 410
Rubinchik, Shur (br1170) 2016; 145
Watanabe, Nakashima, Inenaga, Bannai, Takeda (br1330) 2020; 64
Borozdin, Kosolobov, Rubinchik, Shur (br0190) 2017
Buchsbaum, Sundar, Tarjan (br0240) 1995; 24
Droubay, Justin, Pirillo (br0390) 2001; 255
Gawrychowski, Merkurev, Shur, Uznański (br0570) 2019; 81
Crochemore, Héliou, Kucherov, Mouchard, Pissis, Ramusat (br0320) 2020; 270
Gonnet, Baeza-Yates, Snider (br0620) 1992
Ravsky (br1150) 2003; 8
Apostolico, Breslauer, Galil (br0100) 1995; 141
Jeuring (br0760) 1994; 11
Wang (br1290) 2022
Amir, Porat (br0080) 2014
Chairungsee, Crochemore (br0260) 2012; 450
Harminc, Soták (br0670) 1998; 36
Allcock, Bao, Belovs, Lee, Santha (br0030) 2025
Kempa, Kociumaka (br0810) 2022
Mieno, Funakoshi (br1030) 2022
Kaplan, Tarjan (br0780) 1999; 46
Duraj, Kleiner, Polak, Vassilevska Williams (br0420) 2020
Amir, Charalampopoulos, Pissis, Radoszewski (br0070) 2020; 82
Kosolobov, Rubinchik, Shur (br0870) 2013
Ilie, Smyth (br0740) 2011; 110
Wang, Ying (br1320) 2024; 68
Groult, Prieur, Richomme (br0630) 2010; 110
Larsson (br0920) 1996
Kosaraju (br0850) 1979
Weiner (br1340) 1973
Bucci, De Luca, Glen, Zamboni (br0230) 2009; 410
Bak, Gomez-Ospina, Porteus (br0120) 2018; 34
Beal, Adjeroh (br0150) 2015; 592
Rukavicka (br1210) 2017
Childs, Kothari, Kovacs-Deak, Sundaram, Wang (br0290) 2025; 6
Charalampopoulos, Pissis, Radoszewski (br0270) 2022
Crochemore, Mignosi, Restivo, Salemi (br0330) 2000; 88
Galil (br0530) 1978; 16
Le Gall, Seddighin (br0930) 2023; 85
Mahalingam, Maity, Pandoh (br0960) 2022; 285
Larionov, Loskutov, Ryadchenko (br0910) 2008; 18
Rubinchik, Shur (br1180) 2017
Tomohiro, Inenaga, Takeda (br0720) 2013; 483
Kari, Mahalingam (br0790) 2010; 9
Giel-Pietraszuk, Hoffmann, Dolecka, Rychlewski, Barciszewski (br0590) 2003; 22
Knuth (br0820) 1997
Knuth, Morris, Pratt (br0830) 1977; 6
Mitani, Mieno, Seto, Horiyama (br1070) 2023; 979
Farach (br0430) 1997
Barrangou (10.1016/j.ic.2025.105379_br0140) 2016; 34
Kärkkäinen (10.1016/j.ic.2025.105379_br0800) 2006; 53
Tarjan (10.1016/j.ic.2025.105379_br1260) 1983
Knuth (10.1016/j.ic.2025.105379_br0820) 1997
Damanik (10.1016/j.ic.2025.105379_br0350) 2000; 100
Kaplan (10.1016/j.ic.2025.105379_br0780) 1999; 46
Leach (10.1016/j.ic.2025.105379_br0940) 1994; 16
Damanik (10.1016/j.ic.2025.105379_br0360) 2000; 222
Beal (10.1016/j.ic.2025.105379_br0150) 2015; 592
Fiala (10.1016/j.ic.2025.105379_br0440) 1989; 32
Guo (10.1016/j.ic.2025.105379_br0640) 2016; 116
Funakoshi (10.1016/j.ic.2025.105379_br0490) 2025; 304
Manacher (10.1016/j.ic.2025.105379_br0970) 1975; 22
Gonnet (10.1016/j.ic.2025.105379_br0620) 1992
Rubinchik (10.1016/j.ic.2025.105379_br1170) 2016; 145
Weiner (10.1016/j.ic.2025.105379_br1340) 1973
Chuang (10.1016/j.ic.2025.105379_br0300) 1993
Gawrychowski (10.1016/j.ic.2025.105379_br0550) 2018
Banks (10.1016/j.ic.2025.105379_br0130) 2004; 11
Allcock (10.1016/j.ic.2025.105379_br0030) 2025
Crochemore (10.1016/j.ic.2025.105379_br0340) 1991; 88
Gajewska (10.1016/j.ic.2025.105379_br0520) 1986; 22
Akmal (10.1016/j.ic.2025.105379_br0020) 2023; 85
Kosaraju (10.1016/j.ic.2025.105379_br0850) 1979
Crochemore (10.1016/j.ic.2025.105379_br0320) 2020; 270
Duraj (10.1016/j.ic.2025.105379_br0420) 2020
Buchsbaum (10.1016/j.ic.2025.105379_br0250) 1995; 18
Chairungsee (10.1016/j.ic.2025.105379_br0260) 2012; 450
Kociumaka (10.1016/j.ic.2025.105379_br0840) 2025
Kosolobov (10.1016/j.ic.2025.105379_br0870) 2013
Breslauer (10.1016/j.ic.2025.105379_br0200) 1995; 14
Ukkonen (10.1016/j.ic.2025.105379_br1270) 1995; 14
Boroujeni (10.1016/j.ic.2025.105379_br0180) 2021; 68
Mauri (10.1016/j.ic.2025.105379_br0990) 2005; 335
Montanaro (10.1016/j.ic.2025.105379_br1080) 2017; 77
Hagerup (10.1016/j.ic.2025.105379_br0660) 1998
Berenbrink (10.1016/j.ic.2025.105379_br0160) 2014
Droubay (10.1016/j.ic.2025.105379_br0390) 2001; 255
Giel-Pietraszuk (10.1016/j.ic.2025.105379_br0590) 2003; 22
Hof (10.1016/j.ic.2025.105379_br0680) 1995; 174
Borozdin (10.1016/j.ic.2025.105379_br0190) 2017
Chen (10.1016/j.ic.2025.105379_br0280) 2012; 432
Gusfield (10.1016/j.ic.2025.105379_br0650) 1997
Wang (10.1016/j.ic.2025.105379_br1300) 2025; 1034
Droubay (10.1016/j.ic.2025.105379_br0380) 1995; 55
Mignosi (10.1016/j.ic.2025.105379_br1060) 2002; 273
Glen (10.1016/j.ic.2025.105379_br0610) 2019; 73
Restivo (10.1016/j.ic.2025.105379_br1160) 2009; 410
Bucci (10.1016/j.ic.2025.105379_br0230) 2009; 410
Mieno (10.1016/j.ic.2025.105379_br1040) 2020
Rubinchik (10.1016/j.ic.2025.105379_br1200) 2020
Gawrychowski (10.1016/j.ic.2025.105379_br0570) 2019; 81
Okasaki (10.1016/j.ic.2025.105379_br1110) 1995; 5
Rubinchik (10.1016/j.ic.2025.105379_br1190) 2018; 68
Gawrychowski (10.1016/j.ic.2025.105379_br0560) 2015
Groult (10.1016/j.ic.2025.105379_br0630) 2010; 110
Fici (10.1016/j.ic.2025.105379_br0450) 2014; 28
Mieno (10.1016/j.ic.2025.105379_br1050) 2022; 173
Childs (10.1016/j.ic.2025.105379_br0290) 2025; 6
Mahalingam (10.1016/j.ic.2025.105379_br0960) 2022; 285
Amir (10.1016/j.ic.2025.105379_br0070) 2020; 82
Glen (10.1016/j.ic.2025.105379_br0600) 2009; 30
Le Gall (10.1016/j.ic.2025.105379_br0930) 2023; 85
Hsu (10.1016/j.ic.2025.105379_br0700) 2010; 21
Mitani (10.1016/j.ic.2025.105379_br1070) 2023; 979
Hood (10.1016/j.ic.2025.105379_br0690) 1982
Rubinchik (10.1016/j.ic.2025.105379_br1180) 2017
Inoue (10.1016/j.ic.2025.105379_br0750) 2018; 52–53
Strothmann (10.1016/j.ic.2025.105379_br1250) 2007; 389
Lino (10.1016/j.ic.2025.105379_br0950) 2018; 25
Bak (10.1016/j.ic.2025.105379_br0120) 2018; 34
Larsson (10.1016/j.ic.2025.105379_br0920) 1996
Galil (10.1016/j.ic.2025.105379_br0530) 1978; 16
Meyer (10.1016/j.ic.2025.105379_br1020) 2011; 12
Fredkin (10.1016/j.ic.2025.105379_br0460) 1960; 3
Tomohiro (10.1016/j.ic.2025.105379_br0730) 2014
Wang (10.1016/j.ic.2025.105379_br1310)
Watanabe (10.1016/j.ic.2025.105379_br1330) 2020; 64
Charalampopoulos (10.1016/j.ic.2025.105379_br0270) 2022
Crochemore (10.1016/j.ic.2025.105379_br0330) 2000; 88
Morita (10.1016/j.ic.2025.105379_br1090)
Droubay (10.1016/j.ic.2025.105379_br0400) 1999; 223
Anisiu (10.1016/j.ic.2025.105379_br0090) 2010; 310
Mieno (10.1016/j.ic.2025.105379_br1030) 2022
Brlek (10.1016/j.ic.2025.105379_br0210) 2004; 15
Jin (10.1016/j.ic.2025.105379_br0770) 2024; 20
Allouche (10.1016/j.ic.2025.105379_br0050) 2003; 292
Simpson (10.1016/j.ic.2025.105379_br1230) 2014; 550
Wang (10.1016/j.ic.2025.105379_br1320) 2024; 68
Tomohiro (10.1016/j.ic.2025.105379_br0710) 2010
Funakoshi (10.1016/j.ic.2025.105379_br0500) 2019
Porto (10.1016/j.ic.2025.105379_br1130) 2002; 35
Allouche (10.1016/j.ic.2025.105379_br0040) 1997; 38
Buchsbaum (10.1016/j.ic.2025.105379_br0240) 1995; 24
Duchon (10.1016/j.ic.2025.105379_br0410) 2017
Larionov (10.1016/j.ic.2025.105379_br0910) 2008; 18
Amir (10.1016/j.ic.2025.105379_br0060)
Manber (10.1016/j.ic.2025.105379_br0980) 1993; 22
Nong (10.1016/j.ic.2025.105379_br1100) 2009
Fredman (10.1016/j.ic.2025.105379_br0470) 1990
Wang (10.1016/j.ic.2025.105379_br1290)
Yamamoto (10.1016/j.ic.2025.105379_br1350) 1992; 148
Kuramoto (10.1016/j.ic.2025.105379_br0900) 1992; 83
Kosaraju (10.1016/j.ic.2025.105379_br0860) 1994
Amir (10.1016/j.ic.2025.105379_br0080) 2014
Shallit (10.1016/j.ic.2025.105379_br1220)
Bergerson (10.1016/j.ic.2025.105379_br0170) 1973
Baake (10.1016/j.ic.2025.105379_br0110) 1999; 49
Rukavicka (10.1016/j.ic.2025.105379_br1210) 2017
Meyer (10.1016/j.ic.2025.105379_br1010) 1985; 21
Vesti (10.1016/j.ic.2025.105379_br1280) 2014; 548
Ramesh (10.1016/j.ic.2025.105379_br1140) 2003; 1
Harminc (10.1016/j.ic.2025.105379_br0670) 1998; 36
Slisenko (10.1016/j.ic.2025.105379_br1240) 1973; 129
Funakoshi (10.1016/j.ic.2025.105379_br0480) 2021
Brlek (10.1016/j.ic.2025.105379_br0220) 2015
Gibney (10.1016/j.ic.2025.105379_br0580) 2024
Oleksandr (10.1016/j.ic.2025.105379_br0890)
Funakoshi (10.1016/j.ic.2025.105379_br0510) 2021; 859
Aho (10.1016/j.ic.2025.105379_br0010) 1975; 18
McCreight (10.1016/j.ic.2025.105379_br1000) 1976; 23
Kari (10.1016/j.ic.2025.105379_br0790) 2010; 9
Apostolico (10.1016/j.ic.2025.105379_br0100) 1995; 141
Farach (10.1016/j.ic.2025.105379_br0430) 1997
Kempa (10.1016/j.ic.2025.105379_br0810) 2022
Cook (10.1016/j.ic.2025.105379_br0310) 1973; 7
Jeuring (10.1016/j.ic.2025.105379_br0760) 1994; 11
Ravsky (10.1016/j.ic.2025.105379_br1150) 2003; 8
Porto (10.1016/j.ic.2025.105379_br1120) 1999
Tomohiro (10.1016/j.ic.2025.105379_br0720) 2013; 483
De La Briandais (10.1016/j.ic.2025.105379_br0370) 1959
Ilie (10.1016/j.ic.2025.105379_br0740) 2011; 110
Galil (10.1016/j.ic.2025.105379_br0540) 1978; 25
Kosolobov (10.1016/j.ic.2025.105379_br0880) 2015
Knuth (10.1016/j.ic.2025.105379_br0830) 1977; 6
References_xml – volume: 38
  start-page: 1843
  year: 1997
  end-page: 1848
  ident: br0040
  article-title: Schrödinger operators with Rudin-Shapiro potentials are not palindromic
  publication-title: J. Math. Phys.
– volume: 592
  start-page: 59
  year: 2015
  end-page: 71
  ident: br0150
  article-title: Efficient pattern matching for RNA secondary structures
  publication-title: Theor. Comput. Sci.
– start-page: 3302
  year: 2024
  end-page: 3332
  ident: br0580
  article-title: Near-optimal quantum algorithms for bounded edit distance and Lempel-Ziv factorization
  publication-title: Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms
– volume: 141
  start-page: 163
  year: 1995
  end-page: 173
  ident: br0100
  article-title: Parallel detection of all palindromes in a string
  publication-title: Theor. Comput. Sci.
– volume: 32
  start-page: 490
  year: 1989
  end-page: 505
  ident: br0440
  article-title: Data compression with finite windows
  publication-title: Commun. ACM
– volume: 55
  start-page: 217
  year: 1995
  end-page: 221
  ident: br0380
  article-title: Palindromes in the Fibonacci word
  publication-title: Inf. Process. Lett.
– volume: 20
  year: 2024
  ident: br0770
  article-title: Quantum speed-ups for string synchronizing sets, longest common substring, and
  publication-title: ACM Trans. Algorithms
– volume: 14
  start-page: 355
  year: 1995
  end-page: 366
  ident: br0200
  article-title: Finding all periods and initial palindromes of a string in parallel
  publication-title: Algorithmica
– volume: 6
  year: 2025
  ident: br0290
  article-title: Quantum divide and conquer
  publication-title: ACM Trans. Quantum Comput.
– volume: 5
  start-page: 583
  year: 1995
  end-page: 592
  ident: br1110
  article-title: Simple and efficient purely functional queues and deques
  publication-title: J. Funct. Program.
– start-page: 149
  year: 2014
  end-page: 161
  ident: br0160
  article-title: Palindrome recognition in the streaming model
  publication-title: Proceedings of the 31th International Symposium on Theoretical Aspects of Computer Science
– start-page: 366
  year: 1998
  end-page: 398
  ident: br0660
  article-title: Sorting and searching on the word RAM
  publication-title: Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science
– volume: 110
  start-page: 183
  year: 2011
  end-page: 195
  ident: br0740
  article-title: Minimum unique substrings and maximum repeats
  publication-title: Fundam. Inform.
– year: 2022
  ident: br1310
  article-title: Double-ended palindromic trees in linear time
– year: 2019
  ident: br0060
  article-title: Dynamic palindrome detection
– volume: 15
  start-page: 293
  year: 2004
  end-page: 306
  ident: br0210
  article-title: On the palindromic complexity of infinite words
  publication-title: Int. J. Found. Comput. Sci.
– volume: 35
  start-page: 2581
  year: 2002
  end-page: 2591
  ident: br1130
  article-title: Finding approximate palindromes in strings
  publication-title: Pattern Recognit.
– volume: 24
  start-page: 1190
  year: 1995
  end-page: 1206
  ident: br0240
  article-title: Data-structural bootstrapping, linear path compression, and catenable heap-ordered double-ended queues
  publication-title: SIAM J. Comput.
– volume: 11
  start-page: 146
  year: 1994
  end-page: 184
  ident: br0760
  article-title: The derivation of on-line algorithms, with an application to finding palindromes
  publication-title: Algorithmica
– start-page: 1509
  year: 2018
  end-page: 1528
  ident: br0550
  article-title: Optimal dynamic strings
  publication-title: Proceedings of the 2018 Annual ACM-SIAM Symposium on Discrete Algorithms
– volume: 1034
  year: 2025
  ident: br1300
  article-title: A note on quantum divide and conquer for minimal string rotation
  publication-title: Theor. Comput. Sci.
– year: 2020
  ident: br1200
  article-title: Palindromic
  publication-title: Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science
– volume: 3
  start-page: 490
  year: 1960
  end-page: 499
  ident: br0460
  article-title: Trie memory
  publication-title: Commun. ACM
– volume: 389
  start-page: 278
  year: 2007
  end-page: 294
  ident: br1250
  article-title: The affix array data structure and its applications to RNA secondary structure analysis
  publication-title: Theor. Comput. Sci.
– volume: 18
  start-page: 333
  year: 1975
  end-page: 340
  ident: br0010
  article-title: Efficient string matching: an aid to bibliographic search
  publication-title: Commun. ACM
– volume: 49
  start-page: 217
  year: 1999
  end-page: 227
  ident: br0110
  article-title: A note on palindromicity
  publication-title: Lett. Math. Phys.
– start-page: 33
  year: 2021
  end-page: 46
  ident: br0480
  article-title: Minimal unique palindromic substrings after single-character substitution
  publication-title: Proceedings of the 28th International Symposium on String Processing and Information Retrieval
– start-page: 1657
  year: 2022
  end-page: 1670
  ident: br0810
  article-title: Dynamic suffix array with polylogarithmic queries and updates
  publication-title: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing
– start-page: 290
  year: 2017
  end-page: 303
  ident: br1180
  article-title: Counting palindromes in substrings
  publication-title: Proceedings of the 24th International Conference on String Processing and Information Retrieval
– volume: 100
  start-page: 115
  year: 2000
  end-page: 121
  ident: br0350
  article-title: Local symmetries in the period-doubling sequence
  publication-title: Discrete Appl. Math.
– year: 1997
  ident: br0650
  article-title: Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology
– year: 2024
  ident: br0890
  article-title: Double-ended eertree
– volume: 25
  start-page: 1234
  year: 2018
  end-page: 1257
  ident: br0950
  article-title: Delivering CRISPR: a review of the challenges and approaches
  publication-title: Drug Deliv.
– volume: 22
  start-page: 109
  year: 2003
  end-page: 113
  ident: br0590
  article-title: Palindromes in proteins
  publication-title: J. Protein Chem.
– volume: 14
  start-page: 249
  year: 1995
  end-page: 260
  ident: br1270
  article-title: On-line construction of suffix trees
  publication-title: Algorithmica
– volume: 432
  start-page: 28
  year: 2012
  end-page: 37
  ident: br0280
  article-title: Efficient retrieval of approximate palindromes in a run-length encoded string
  publication-title: Theor. Comput. Sci.
– volume: 222
  start-page: 259
  year: 2000
  end-page: 267
  ident: br0360
  article-title: Palindrome complexity bounds for primitive substitution sequences
  publication-title: Discrete Math.
– volume: 483
  start-page: 162
  year: 2013
  end-page: 170
  ident: br0720
  article-title: Palindrome pattern matching
  publication-title: Theor. Comput. Sci.
– volume: 11
  start-page: 853
  year: 2004
  end-page: 868
  ident: br0130
  article-title: Almost all palindromes are composite
  publication-title: Math. Res. Lett.
– start-page: 155
  year: 2015
  end-page: 166
  ident: br0220
  article-title: Palindromic complexity of trees
  publication-title: Proceedings of the 19th International Conference on Developments in Language Theory
– volume: 273
  start-page: 99
  year: 2002
  end-page: 117
  ident: br1060
  article-title: Words and forbidden factors
  publication-title: Theor. Comput. Sci.
– start-page: 193
  year: 2009
  end-page: 202
  ident: br1100
  article-title: Linear suffix array construction by almost pure induced-sorting
  publication-title: 2009 Data Compression Conference
– start-page: 517
  year: 2025
  end-page: 534
  ident: br0840
  article-title: Near-optimal-time quantum algorithms for approximate pattern matching
  publication-title: Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms
– volume: 285
  year: 2022
  ident: br0960
  article-title: Counting (Watson-Crick) palindromes in Watson-Crick conjugates
  publication-title: Inf. Comput.
– volume: 859
  start-page: 116
  year: 2021
  end-page: 133
  ident: br0510
  article-title: Computing longest palindromic substring after single-character or block-wise edits
  publication-title: Theor. Comput. Sci.
– volume: 85
  start-page: 1251
  year: 2023
  end-page: 1286
  ident: br0930
  article-title: Quantum meets fine-grained complexity: sublinear time quantum algorithms for string problems
  publication-title: Algorithmica
– volume: 82
  start-page: 3707
  year: 2020
  end-page: 3743
  ident: br0070
  article-title: Dynamic and internal longest common substring
  publication-title: Algorithmica
– start-page: 21
  year: 2014
  end-page: 29
  ident: br0080
  article-title: Approximate on-line palindrome recognition, and applications
  publication-title: Proceedings of the 25th Annual Symposium on Combinatorial Pattern Matching
– volume: 174
  start-page: 149
  year: 1995
  end-page: 159
  ident: br0680
  article-title: Singular continuous spectrum for palindromic Schrödinger operators
  publication-title: Commun. Math. Phys.
– volume: 292
  start-page: 9
  year: 2003
  end-page: 31
  ident: br0050
  article-title: Palindrome complexity
  publication-title: Theor. Comput. Sci.
– volume: 81
  start-page: 3630
  year: 2019
  end-page: 3654
  ident: br0570
  article-title: Tight tradeoffs for real-time approximation of longest palindromes in streams
  publication-title: Algorithmica
– volume: 68
  year: 2021
  ident: br0180
  article-title: Approximating edit distance in truly subquadratic time: quantum and MapReduce
  publication-title: J. ACM
– volume: 36
  start-page: 259
  year: 1998
  end-page: 262
  ident: br0670
  article-title: Palindromic numbers in arithmetic progressions
  publication-title: Fibonacci Q.
– volume: 270
  year: 2020
  ident: br0320
  article-title: Absent words in a sliding window with applications
  publication-title: Inf. Comput.
– start-page: 270
  year: 2015
  end-page: 276
  ident: br0560
  article-title: Tight bound for the number of distinct palindromes in a tree
  publication-title: Proceedings of the 22nd International Symposium on String Processing and Information Retrieval
– volume: 28
  start-page: 41
  year: 2014
  end-page: 48
  ident: br0450
  article-title: A subquadratic algorithm for minimum palindromic factorization
  publication-title: J. Discrete Algorithms
– volume: 53
  start-page: 918
  year: 2006
  end-page: 936
  ident: br0800
  article-title: Linear work suffix array construction
  publication-title: J. ACM
– volume: 21
  start-page: 925
  year: 2010
  end-page: 939
  ident: br0700
  article-title: Finding all approximate gapped palindromes
  publication-title: Int. J. Found. Comput. Sci.
– volume: 335
  start-page: 29
  year: 2005
  end-page: 51
  ident: br0990
  article-title: Algorithms for pattern matching and discovery in RNA secondary structure
  publication-title: Theor. Comput. Sci.
– volume: 148
  start-page: 4072
  year: 1992
  end-page: 4076
  ident: br1350
  article-title: Unique palindromic sequences in synthetic oligonucleotides are required to induce IFN [correction of INF] and augment IFN-mediated [correction of INF] natural killer activity
  publication-title: J. Immunol.
– volume: 64
  start-page: 1273
  year: 2020
  end-page: 1291
  ident: br1330
  article-title: Fast algorithms for the shortest unique palindromic substring problem on run-length encoded strings
  publication-title: Theory Comput. Syst.
– volume: 73
  start-page: 242
  year: 2019
  end-page: 246
  ident: br0610
  article-title: Palindromes in starlike trees
  publication-title: Australas. J. Comb.
– year: 2013
  ident: br1220
  article-title: A216264. The on-line encyclopedia of integer sequences
– start-page: 137
  year: 1997
  end-page: 143
  ident: br0430
  article-title: Optimal suffix tree construction with large alphabets
  publication-title: Proceedings of 38th Annual Symposium on Foundations of Computer Science
– start-page: 425
  year: 2022
  end-page: 438
  ident: br1030
  article-title: Shortest unique palindromic substring queries in semi-dynamic settings
  publication-title: Proceedings of the 33rd International Workshop on Combinatorial Algorithms
– volume: 550
  start-page: 66
  year: 2014
  end-page: 78
  ident: br1230
  article-title: Palindromes in circular words
  publication-title: Theor. Comput. Sci.
– year: 2017
  ident: br0190
  article-title: Palindromic length in linear time
  publication-title: Proceedings of the 28th Annual Symposium on Combinatorial Pattern Matching
– year: 2022
  ident: br0270
  article-title: Longest palindromic substring in sublinear time
  publication-title: Proceedings of the 33rd Annual Symposium on Combinatorial Pattern Matching
– start-page: 346
  year: 1979
  end-page: 351
  ident: br0850
  article-title: Real-time simulation of concatenable double-ended queues by double-ended queues
  publication-title: Proceedings of the 11th Annual ACM Symposium on Theory of Computing
– volume: 116
  start-page: 735
  year: 2016
  end-page: 738
  ident: br0640
  article-title: Palindromic rich words and run-length encodings
  publication-title: Inf. Process. Lett.
– volume: 88
  start-page: 1756
  year: 2000
  end-page: 1768
  ident: br0330
  article-title: Data compression using antidictionaries
  publication-title: Proc. IEEE
– year: 1983
  ident: br1260
  article-title: Data Structures and Network Algorithms
– start-page: 148
  year: 2020
  end-page: 160
  ident: br1040
  article-title: Minimal unique substrings and minimal absent words in a sliding window
  publication-title: SOFSEM 2020: Theory and Practice of Computer Science
– year: 1973
  ident: br0170
  article-title: Palindromes and Anagrams
– volume: 304
  year: 2025
  ident: br0490
  article-title: Computing maximal palindromes in non-standard matching models
  publication-title: Inf. Comput.
– volume: 310
  start-page: 109
  year: 2010
  end-page: 114
  ident: br0090
  article-title: Total palindrome complexity of finite words
  publication-title: Discrete Math.
– volume: 25
  start-page: 102
  year: 1978
  end-page: 111
  ident: br0540
  article-title: A linear-time on-line recognition algorithm for “Palstar”
  publication-title: J. ACM
– volume: 16
  start-page: 893
  year: 1994
  end-page: 900
  ident: br0940
  article-title: Long DNA palindromes, cruciform structures, genetic instability and secondary structure repair
  publication-title: BioEssays
– volume: 223
  start-page: 73
  year: 1999
  end-page: 85
  ident: br0400
  article-title: Palindromes and Sturmian words
  publication-title: Theor. Comput. Sci.
– year: 1982
  ident: br0690
  article-title: The Efficient Implementation of Very-High-Level Programming Language Constructs
– year: 1999
  ident: br1120
  article-title: Detecting Approximate Palindromes in Strings
– volume: 129
  start-page: 30
  year: 1973
  end-page: 202
  ident: br1240
  article-title: Recognition of palindromes by multihead Turing machines
  publication-title: Proc. Steklov Inst. Math.
– volume: 52–53
  start-page: 122
  year: 2018
  end-page: 132
  ident: br0750
  article-title: Algorithms and combinatorial properties on shortest unique palindromic substrings
  publication-title: J. Discrete Algorithms
– start-page: 289
  year: 1993
  end-page: 298
  ident: br0300
  article-title: Real-time deques, multihead Turing machines, and purely functional programming
  publication-title: FPCA '93: Proceedings of the Conference on Functional Programming Languages and Computer Architecture
– volume: 22
  start-page: 935
  year: 1993
  end-page: 948
  ident: br0980
  article-title: Suffix arrays: a new method for on-line string searches
  publication-title: SIAM J. Comput.
– volume: 6
  start-page: 323
  year: 1977
  end-page: 350
  ident: br0830
  article-title: Fast pattern matching in strings
  publication-title: SIAM J. Comput.
– volume: 1
  start-page: 103
  year: 2003
  end-page: 110
  ident: br1140
  article-title: String matching in
  publication-title: J. Discrete Algorithms
– volume: 83
  start-page: 1128
  year: 1992
  end-page: 1131
  ident: br0900
  article-title: Oligonucleotide sequences required for natural killer cell activation
  publication-title: Jpn. J. Cancer Res.
– year: 2017
  ident: br0410
  article-title: Gapped pattern statistics
  publication-title: Proceedings of the 28th Annual Symposium on Combinatorial Pattern Matching
– start-page: 295
  year: 1959
  end-page: 298
  ident: br0370
  article-title: File searching using variable length keys
  publication-title: 1959 Proceedings of the Western Joint Computer Conference
– volume: 22
  start-page: 197
  year: 1986
  end-page: 200
  ident: br0520
  article-title: Deques with heap order
  publication-title: Inf. Process. Lett.
– start-page: 1
  year: 1973
  end-page: 11
  ident: br1340
  article-title: Linear pattern matching algorithms
  publication-title: Proceedings of the 14th Annual IEEE Symposium on Switching and Automata Theory
– volume: 46
  start-page: 577
  year: 1999
  end-page: 603
  ident: br0780
  article-title: Purely functional representations of catenable sorted lists
  publication-title: J. ACM
– year: 2022
  ident: br1290
  article-title: Double-ended eertree
– volume: 18
  year: 2008
  ident: br0910
  article-title: Chromosome evolution with naked eye: palindromic context of the life origin
  publication-title: Chaos, Interdiscip. J. Nonlinear Sci.
– volume: 22
  start-page: 346
  year: 1975
  end-page: 351
  ident: br0970
  article-title: A new linear-time on-line algorithm for finding the smallest initial palindrome of a string
  publication-title: J. ACM
– volume: 34
  start-page: 933
  year: 2016
  end-page: 941
  ident: br0140
  article-title: Applications of CRISPR technologies in research and beyond
  publication-title: Nat. Biotechnol.
– volume: 548
  start-page: 14
  year: 2014
  end-page: 24
  ident: br1280
  article-title: Extensions of rich words
  publication-title: Theor. Comput. Sci.
– year: 2020
  ident: br1090
  article-title: Library checker problems
– volume: 979
  year: 2023
  ident: br1070
  article-title: Finding top-
  publication-title: Theor. Comput. Sci.
– start-page: 345
  year: 2017
  end-page: 352
  ident: br1210
  article-title: On the number of rich words
  publication-title: 21st International Conference on Developments in Language Theory
– start-page: 190
  year: 1996
  end-page: 199
  ident: br0920
  article-title: Extended application of suffix trees to data compression
  publication-title: Proceedings of Data Compression Conference - DCC '96
– volume: 450
  start-page: 109
  year: 2012
  end-page: 116
  ident: br0260
  article-title: Using minimal absent words to build phylogeny
  publication-title: Theor. Comput. Sci.
– volume: 410
  start-page: 3018
  year: 2009
  end-page: 3026
  ident: br1160
  article-title: Burrows-Wheeler transform and palindromic richness
  publication-title: Theor. Comput. Sci.
– start-page: 289
  year: 2015
  end-page: 301
  ident: br0880
  article-title: is linear recognizable online
  publication-title: Proceedings of the 41st International Conference on Current Trends in Theory and Practice of Computer Science
– start-page: 3
  year: 2019
  end-page: 15
  ident: br0500
  article-title: Computing maximal palindromes and distinct palindromes in a trie
  publication-title: Proceedings of the 23rd Prague Stringology Conference
– volume: 21
  start-page: 219
  year: 1985
  end-page: 227
  ident: br1010
  article-title: Incremental string matching
  publication-title: Inf. Process. Lett.
– volume: 110
  start-page: 908
  year: 2010
  end-page: 912
  ident: br0630
  article-title: Counting distinct palindromes in a word in linear time
  publication-title: Inf. Process. Lett.
– start-page: 195
  year: 1994
  end-page: 203
  ident: br0860
  article-title: An optimal RAM implementation of catenable min double-ended queues
  publication-title: Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms
– start-page: 30
  year: 2020
  end-page: 47
  ident: br0420
  article-title: Equivalences between triangle and range query problems
  publication-title: Proceedings of the 2020 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)
– volume: 88
  start-page: 59
  year: 1991
  end-page: 82
  ident: br0340
  article-title: Usefulness of the Karp-Miller-Rosenberg algorithm in parallel computations on strings and arrays
  publication-title: Theor. Comput. Sci.
– year: 1997
  ident: br0820
  article-title: The Art of Computer Programming
– volume: 85
  start-page: 2260
  year: 2023
  end-page: 2317
  ident: br0020
  article-title: Near-optimal quantum algorithms for string problems
  publication-title: Algorithmica
– start-page: 150
  year: 2014
  end-page: 161
  ident: br0730
  article-title: Computing palindromic factorizations and palindromic covers on-line
  publication-title: Proceedings of the 25th Annual Symposium on Combinatorial Pattern Matching
– volume: 173
  year: 2022
  ident: br1050
  article-title: Palindromic trees for a sliding window and its applications
  publication-title: Inf. Process. Lett.
– volume: 145
  start-page: 371
  year: 2016
  end-page: 384
  ident: br1170
  article-title: The number of distinct subpalindromes in random words
  publication-title: Fundam. Inform.
– volume: 77
  start-page: 16
  year: 2017
  end-page: 39
  ident: br1080
  article-title: Quantum pattern matching fast on average
  publication-title: Algorithmica
– volume: 18
  start-page: 513
  year: 1995
  end-page: 547
  ident: br0250
  article-title: Confluently persistent deques via data-structural bootstrapping
  publication-title: J. Algorithms
– volume: 23
  start-page: 262
  year: 1976
  end-page: 272
  ident: br1000
  article-title: A space-economical suffix tree construction algorithm
  publication-title: J. ACM
– volume: 8
  start-page: 75
  year: 2003
  end-page: 83
  ident: br1150
  article-title: On the palindromic decomposition of binary words
  publication-title: J. Autom. Lang. Comb.
– volume: 410
  start-page: 2860
  year: 2009
  end-page: 2863
  ident: br0230
  article-title: A new characteristic property of rich words
  publication-title: Theor. Comput. Sci.
– volume: 16
  start-page: 140
  year: 1978
  end-page: 157
  ident: br0530
  article-title: Palindrome recognition in real time by a multitape Turing machine
  publication-title: J. Comput. Syst. Sci.
– volume: 12
  start-page: 1
  year: 2011
  end-page: 23
  ident: br1020
  article-title: Structator: fast index-based search for RNA sequence-structure patterns
  publication-title: BMC Bioinform.
– volume: 7
  start-page: 354
  year: 1973
  end-page: 375
  ident: br0310
  article-title: Time bounded random access machines
  publication-title: J. Comput. Syst. Sci.
– start-page: 66
  year: 1992
  end-page: 82
  ident: br0620
  article-title: New indices for text: PAT trees and PAT arrays
  publication-title: Information Retrieval: Data Structures and Algorithms
– year: 2025
  ident: br0030
  article-title: On the quantum time complexity of divide and conquer
  publication-title: Proceedings of the 52nd International Colloquium on Automata, Languages, and Programming
– volume: 255
  start-page: 539
  year: 2001
  end-page: 553
  ident: br0390
  article-title: Episturmian words and some constructions of de Luca and Rauzy
  publication-title: Theor. Comput. Sci.
– volume: 9
  start-page: 297
  year: 2010
  end-page: 316
  ident: br0790
  article-title: Watson-Crick palindromes in DNA computing
  publication-title: Nat. Comput.
– start-page: 63
  year: 2013
  end-page: 69
  ident: br0870
  article-title: Finding distinct subpalindromes online
  publication-title: Proceedings of the Prague Stringology Conference 2013
– volume: 34
  start-page: 600
  year: 2018
  end-page: 611
  ident: br0120
  article-title: Gene editing on center stage
  publication-title: Trends Genet.
– start-page: 135
  year: 2010
  end-page: 146
  ident: br0710
  article-title: Counting and verifying maximal palindromes
  publication-title: Proceedings of the 17th International Conference on String Processing and Information Retrieval
– volume: 30
  start-page: 510
  year: 2009
  end-page: 531
  ident: br0600
  article-title: Palindromic richness
  publication-title: Eur. J. Comb.
– volume: 68
  start-page: 249
  year: 2018
  end-page: 265
  ident: br1190
  article-title: EERTREE: an efficient data structure for processing palindromes in strings
  publication-title: Eur. J. Comb.
– start-page: 1
  year: 1990
  end-page: 7
  ident: br0470
  article-title: BLASTING through the information theoretic barrier with FUSION TREES
  publication-title: Proceedings of the 22nd Annual ACM Symposium on Theory of Computing
– volume: 68
  start-page: 29
  year: 2024
  end-page: 74
  ident: br1320
  article-title: Quantum algorithm for lexicographically minimal string rotation
  publication-title: Theory Comput. Syst.
– volume: 88
  start-page: 59
  issue: 1
  year: 1991
  ident: 10.1016/j.ic.2025.105379_br0340
  article-title: Usefulness of the Karp-Miller-Rosenberg algorithm in parallel computations on strings and arrays
  publication-title: Theor. Comput. Sci.
  doi: 10.1016/0304-3975(91)90073-B
– ident: 10.1016/j.ic.2025.105379_br0890
– volume: 64
  start-page: 1273
  year: 2020
  ident: 10.1016/j.ic.2025.105379_br1330
  article-title: Fast algorithms for the shortest unique palindromic substring problem on run-length encoded strings
  publication-title: Theory Comput. Syst.
  doi: 10.1007/s00224-020-09980-x
– start-page: 1657
  year: 2022
  ident: 10.1016/j.ic.2025.105379_br0810
  article-title: Dynamic suffix array with polylogarithmic queries and updates
– volume: 410
  start-page: 3018
  issue: 30–32
  year: 2009
  ident: 10.1016/j.ic.2025.105379_br1160
  article-title: Burrows-Wheeler transform and palindromic richness
  publication-title: Theor. Comput. Sci.
  doi: 10.1016/j.tcs.2009.03.008
– start-page: 1509
  year: 2018
  ident: 10.1016/j.ic.2025.105379_br0550
  article-title: Optimal dynamic strings
– volume: 6
  start-page: 323
  issue: 2
  year: 1977
  ident: 10.1016/j.ic.2025.105379_br0830
  article-title: Fast pattern matching in strings
  publication-title: SIAM J. Comput.
  doi: 10.1137/0206024
– volume: 100
  start-page: 115
  issue: 1–2
  year: 2000
  ident: 10.1016/j.ic.2025.105379_br0350
  article-title: Local symmetries in the period-doubling sequence
  publication-title: Discrete Appl. Math.
  doi: 10.1016/S0166-218X(99)00199-7
– start-page: 66
  year: 1992
  ident: 10.1016/j.ic.2025.105379_br0620
  article-title: New indices for text: PAT trees and PAT arrays
– volume: 49
  start-page: 217
  year: 1999
  ident: 10.1016/j.ic.2025.105379_br0110
  article-title: A note on palindromicity
  publication-title: Lett. Math. Phys.
  doi: 10.1023/A:1007678316583
– volume: 16
  start-page: 893
  issue: 12
  year: 1994
  ident: 10.1016/j.ic.2025.105379_br0940
  article-title: Long DNA palindromes, cruciform structures, genetic instability and secondary structure repair
  publication-title: BioEssays
  doi: 10.1002/bies.950161207
– volume: 8
  start-page: 75
  issue: 1
  year: 2003
  ident: 10.1016/j.ic.2025.105379_br1150
  article-title: On the palindromic decomposition of binary words
  publication-title: J. Autom. Lang. Comb.
– volume: 979
  year: 2023
  ident: 10.1016/j.ic.2025.105379_br1070
  article-title: Finding top-k longest palindromes in substrings
  publication-title: Theor. Comput. Sci.
  doi: 10.1016/j.tcs.2023.114183
– volume: 46
  start-page: 577
  issue: 5
  year: 1999
  ident: 10.1016/j.ic.2025.105379_br0780
  article-title: Purely functional representations of catenable sorted lists
  publication-title: J. ACM
  doi: 10.1145/324133.324139
– volume: 81
  start-page: 3630
  year: 2019
  ident: 10.1016/j.ic.2025.105379_br0570
  article-title: Tight tradeoffs for real-time approximation of longest palindromes in streams
  publication-title: Algorithmica
  doi: 10.1007/s00453-019-00591-8
– start-page: 155
  year: 2015
  ident: 10.1016/j.ic.2025.105379_br0220
  article-title: Palindromic complexity of trees
– year: 2022
  ident: 10.1016/j.ic.2025.105379_br0270
  article-title: Longest palindromic substring in sublinear time
– volume: 68
  start-page: 249
  year: 2018
  ident: 10.1016/j.ic.2025.105379_br1190
  article-title: EERTREE: an efficient data structure for processing palindromes in strings
  publication-title: Eur. J. Comb.
  doi: 10.1016/j.ejc.2017.07.021
– start-page: 270
  year: 2015
  ident: 10.1016/j.ic.2025.105379_br0560
  article-title: Tight bound for the number of distinct palindromes in a tree
– volume: 141
  start-page: 163
  issue: 1–2
  year: 1995
  ident: 10.1016/j.ic.2025.105379_br0100
  article-title: Parallel detection of all palindromes in a string
  publication-title: Theor. Comput. Sci.
  doi: 10.1016/0304-3975(94)00083-U
– volume: 68
  issue: 3
  year: 2021
  ident: 10.1016/j.ic.2025.105379_br0180
  article-title: Approximating edit distance in truly subquadratic time: quantum and MapReduce
  publication-title: J. ACM
  doi: 10.1145/3456807
– start-page: 148
  year: 2020
  ident: 10.1016/j.ic.2025.105379_br1040
  article-title: Minimal unique substrings and minimal absent words in a sliding window
– volume: 77
  start-page: 16
  issue: 1
  year: 2017
  ident: 10.1016/j.ic.2025.105379_br1080
  article-title: Quantum pattern matching fast on average
  publication-title: Algorithmica
  doi: 10.1007/s00453-015-0060-4
– start-page: 1
  year: 1990
  ident: 10.1016/j.ic.2025.105379_br0470
  article-title: BLASTING through the information theoretic barrier with FUSION TREES
– volume: 14
  start-page: 355
  issue: 4
  year: 1995
  ident: 10.1016/j.ic.2025.105379_br0200
  article-title: Finding all periods and initial palindromes of a string in parallel
  publication-title: Algorithmica
  doi: 10.1007/BF01294132
– volume: 24
  start-page: 1190
  issue: 6
  year: 1995
  ident: 10.1016/j.ic.2025.105379_br0240
  article-title: Data-structural bootstrapping, linear path compression, and catenable heap-ordered double-ended queues
  publication-title: SIAM J. Comput.
  doi: 10.1137/S0097539792242144
– start-page: 195
  year: 1994
  ident: 10.1016/j.ic.2025.105379_br0860
  article-title: An optimal RAM implementation of catenable min double-ended queues
– ident: 10.1016/j.ic.2025.105379_br0060
– volume: 12
  start-page: 1
  issue: 1
  year: 2011
  ident: 10.1016/j.ic.2025.105379_br1020
  article-title: Structator: fast index-based search for RNA sequence-structure patterns
  publication-title: BMC Bioinform.
  doi: 10.1186/1471-2105-12-214
– start-page: 366
  year: 1998
  ident: 10.1016/j.ic.2025.105379_br0660
  article-title: Sorting and searching on the word RAM
– volume: 310
  start-page: 109
  issue: 1
  year: 2010
  ident: 10.1016/j.ic.2025.105379_br0090
  article-title: Total palindrome complexity of finite words
  publication-title: Discrete Math.
  doi: 10.1016/j.disc.2009.08.002
– ident: 10.1016/j.ic.2025.105379_br1310
– volume: 129
  start-page: 30
  year: 1973
  ident: 10.1016/j.ic.2025.105379_br1240
  article-title: Recognition of palindromes by multihead Turing machines
  publication-title: Proc. Steklov Inst. Math.
– year: 1983
  ident: 10.1016/j.ic.2025.105379_br1260
– volume: 34
  start-page: 933
  issue: 9
  year: 2016
  ident: 10.1016/j.ic.2025.105379_br0140
  article-title: Applications of CRISPR technologies in research and beyond
  publication-title: Nat. Biotechnol.
  doi: 10.1038/nbt.3659
– volume: 6
  issue: 2
  year: 2025
  ident: 10.1016/j.ic.2025.105379_br0290
  article-title: Quantum divide and conquer
  publication-title: ACM Trans. Quantum Comput.
  doi: 10.1145/3723884
– volume: 35
  start-page: 2581
  issue: 11
  year: 2002
  ident: 10.1016/j.ic.2025.105379_br1130
  article-title: Finding approximate palindromes in strings
  publication-title: Pattern Recognit.
  doi: 10.1016/S0031-3203(01)00179-0
– volume: 1
  start-page: 103
  issue: 1
  year: 2003
  ident: 10.1016/j.ic.2025.105379_br1140
  article-title: String matching in O˜(n+m) quantum time
  publication-title: J. Discrete Algorithms
  doi: 10.1016/S1570-8667(03)00010-8
– year: 1982
  ident: 10.1016/j.ic.2025.105379_br0690
– year: 1999
  ident: 10.1016/j.ic.2025.105379_br1120
– start-page: 3
  year: 2019
  ident: 10.1016/j.ic.2025.105379_br0500
  article-title: Computing maximal palindromes and distinct palindromes in a trie
– volume: 5
  start-page: 583
  issue: 4
  year: 1995
  ident: 10.1016/j.ic.2025.105379_br1110
  article-title: Simple and efficient purely functional queues and deques
  publication-title: J. Funct. Program.
  doi: 10.1017/S0956796800001489
– volume: 410
  start-page: 2860
  issue: 30–32
  year: 2009
  ident: 10.1016/j.ic.2025.105379_br0230
  article-title: A new characteristic property of rich words
  publication-title: Theor. Comput. Sci.
  doi: 10.1016/j.tcs.2008.11.001
– start-page: 295
  year: 1959
  ident: 10.1016/j.ic.2025.105379_br0370
  article-title: File searching using variable length keys
– volume: 273
  start-page: 99
  issue: 1–2
  year: 2002
  ident: 10.1016/j.ic.2025.105379_br1060
  article-title: Words and forbidden factors
  publication-title: Theor. Comput. Sci.
  doi: 10.1016/S0304-3975(00)00436-9
– start-page: 190
  year: 1996
  ident: 10.1016/j.ic.2025.105379_br0920
  article-title: Extended application of suffix trees to data compression
– volume: 548
  start-page: 14
  year: 2014
  ident: 10.1016/j.ic.2025.105379_br1280
  article-title: Extensions of rich words
  publication-title: Theor. Comput. Sci.
  doi: 10.1016/j.tcs.2014.06.033
– volume: 28
  start-page: 41
  year: 2014
  ident: 10.1016/j.ic.2025.105379_br0450
  article-title: A subquadratic algorithm for minimum palindromic factorization
  publication-title: J. Discrete Algorithms
  doi: 10.1016/j.jda.2014.08.001
– volume: 18
  start-page: 513
  issue: 3
  year: 1995
  ident: 10.1016/j.ic.2025.105379_br0250
  article-title: Confluently persistent deques via data-structural bootstrapping
  publication-title: J. Algorithms
  doi: 10.1006/jagm.1995.1020
– volume: 335
  start-page: 29
  issue: 1
  year: 2005
  ident: 10.1016/j.ic.2025.105379_br0990
  article-title: Algorithms for pattern matching and discovery in RNA secondary structure
  publication-title: Theor. Comput. Sci.
  doi: 10.1016/j.tcs.2004.12.015
– volume: 292
  start-page: 9
  issue: 1
  year: 2003
  ident: 10.1016/j.ic.2025.105379_br0050
  article-title: Palindrome complexity
  publication-title: Theor. Comput. Sci.
  doi: 10.1016/S0304-3975(01)00212-2
– volume: 18
  issue: 1
  year: 2008
  ident: 10.1016/j.ic.2025.105379_br0910
  article-title: Chromosome evolution with naked eye: palindromic context of the life origin
  publication-title: Chaos, Interdiscip. J. Nonlinear Sci.
  doi: 10.1063/1.2826631
– year: 1997
  ident: 10.1016/j.ic.2025.105379_br0820
– start-page: 21
  year: 2014
  ident: 10.1016/j.ic.2025.105379_br0080
  article-title: Approximate on-line palindrome recognition, and applications
– volume: 550
  start-page: 66
  issue: 1B
  year: 2014
  ident: 10.1016/j.ic.2025.105379_br1230
  article-title: Palindromes in circular words
  publication-title: Theor. Comput. Sci.
  doi: 10.1016/j.tcs.2014.07.012
– volume: 116
  start-page: 735
  issue: 12
  year: 2016
  ident: 10.1016/j.ic.2025.105379_br0640
  article-title: Palindromic rich words and run-length encodings
  publication-title: Inf. Process. Lett.
  doi: 10.1016/j.ipl.2016.07.001
– volume: 68
  start-page: 29
  issue: 1
  year: 2024
  ident: 10.1016/j.ic.2025.105379_br1320
  article-title: Quantum algorithm for lexicographically minimal string rotation
  publication-title: Theory Comput. Syst.
  doi: 10.1007/s00224-023-10146-8
– volume: 11
  start-page: 146
  issue: 2
  year: 1994
  ident: 10.1016/j.ic.2025.105379_br0760
  article-title: The derivation of on-line algorithms, with an application to finding palindromes
  publication-title: Algorithmica
  doi: 10.1007/BF01182773
– volume: 88
  start-page: 1756
  issue: 11
  year: 2000
  ident: 10.1016/j.ic.2025.105379_br0330
  article-title: Data compression using antidictionaries
  publication-title: Proc. IEEE
  doi: 10.1109/5.892711
– volume: 3
  start-page: 490
  issue: 9
  year: 1960
  ident: 10.1016/j.ic.2025.105379_br0460
  article-title: Trie memory
  publication-title: Commun. ACM
  doi: 10.1145/367390.367400
– volume: 22
  start-page: 109
  issue: 2
  year: 2003
  ident: 10.1016/j.ic.2025.105379_br0590
  article-title: Palindromes in proteins
  publication-title: J. Protein Chem.
  doi: 10.1023/A:1023454111924
– volume: 110
  start-page: 183
  issue: 1–4
  year: 2011
  ident: 10.1016/j.ic.2025.105379_br0740
  article-title: Minimum unique substrings and maximum repeats
  publication-title: Fundam. Inform.
  doi: 10.3233/FI-2011-536
– volume: 21
  start-page: 219
  issue: 5
  year: 1985
  ident: 10.1016/j.ic.2025.105379_br1010
  article-title: Incremental string matching
  publication-title: Inf. Process. Lett.
  doi: 10.1016/0020-0190(85)90088-2
– volume: 174
  start-page: 149
  issue: 1
  year: 1995
  ident: 10.1016/j.ic.2025.105379_br0680
  article-title: Singular continuous spectrum for palindromic Schrödinger operators
  publication-title: Commun. Math. Phys.
  doi: 10.1007/BF02099468
– volume: 25
  start-page: 102
  issue: 1
  year: 1978
  ident: 10.1016/j.ic.2025.105379_br0540
  article-title: A linear-time on-line recognition algorithm for “Palstar”
  publication-title: J. ACM
  doi: 10.1145/322047.322056
– start-page: 1
  year: 1973
  ident: 10.1016/j.ic.2025.105379_br1340
  article-title: Linear pattern matching algorithms
– volume: 32
  start-page: 490
  issue: 4
  year: 1989
  ident: 10.1016/j.ic.2025.105379_br0440
  article-title: Data compression with finite windows
  publication-title: Commun. ACM
  doi: 10.1145/63334.63341
– ident: 10.1016/j.ic.2025.105379_br1220
– volume: 52–53
  start-page: 122
  year: 2018
  ident: 10.1016/j.ic.2025.105379_br0750
  article-title: Algorithms and combinatorial properties on shortest unique palindromic substrings
  publication-title: J. Discrete Algorithms
  doi: 10.1016/j.jda.2018.11.009
– start-page: 345
  year: 2017
  ident: 10.1016/j.ic.2025.105379_br1210
  article-title: On the number of rich words
– volume: 55
  start-page: 217
  issue: 4
  year: 1995
  ident: 10.1016/j.ic.2025.105379_br0380
  article-title: Palindromes in the Fibonacci word
  publication-title: Inf. Process. Lett.
  doi: 10.1016/0020-0190(95)00080-V
– start-page: 425
  year: 2022
  ident: 10.1016/j.ic.2025.105379_br1030
  article-title: Shortest unique palindromic substring queries in semi-dynamic settings
– ident: 10.1016/j.ic.2025.105379_br1290
– volume: 85
  start-page: 2260
  issue: 8
  year: 2023
  ident: 10.1016/j.ic.2025.105379_br0020
  article-title: Near-optimal quantum algorithms for string problems
  publication-title: Algorithmica
  doi: 10.1007/s00453-022-01092-x
– volume: 9
  start-page: 297
  issue: 2
  year: 2010
  ident: 10.1016/j.ic.2025.105379_br0790
  article-title: Watson-Crick palindromes in DNA computing
  publication-title: Nat. Comput.
  doi: 10.1007/s11047-009-9131-2
– volume: 21
  start-page: 925
  issue: 6
  year: 2010
  ident: 10.1016/j.ic.2025.105379_br0700
  article-title: Finding all approximate gapped palindromes
  publication-title: Int. J. Found. Comput. Sci.
  doi: 10.1142/S0129054110007647
– year: 2017
  ident: 10.1016/j.ic.2025.105379_br0410
  article-title: Gapped pattern statistics
– volume: 25
  start-page: 1234
  issue: 1
  year: 2018
  ident: 10.1016/j.ic.2025.105379_br0950
  article-title: Delivering CRISPR: a review of the challenges and approaches
  publication-title: Drug Deliv.
  doi: 10.1080/10717544.2018.1474964
– start-page: 30
  year: 2020
  ident: 10.1016/j.ic.2025.105379_br0420
  article-title: Equivalences between triangle and range query problems
– volume: 30
  start-page: 510
  issue: 2
  year: 2009
  ident: 10.1016/j.ic.2025.105379_br0600
  article-title: Palindromic richness
  publication-title: Eur. J. Comb.
  doi: 10.1016/j.ejc.2008.04.006
– volume: 23
  start-page: 262
  issue: 2
  year: 1976
  ident: 10.1016/j.ic.2025.105379_br1000
  article-title: A space-economical suffix tree construction algorithm
  publication-title: J. ACM
  doi: 10.1145/321941.321946
– volume: 22
  start-page: 197
  issue: 4
  year: 1986
  ident: 10.1016/j.ic.2025.105379_br0520
  article-title: Deques with heap order
  publication-title: Inf. Process. Lett.
  doi: 10.1016/0020-0190(86)90028-1
– volume: 53
  start-page: 918
  issue: 6
  year: 2006
  ident: 10.1016/j.ic.2025.105379_br0800
  article-title: Linear work suffix array construction
  publication-title: J. ACM
  doi: 10.1145/1217856.1217858
– volume: 270
  year: 2020
  ident: 10.1016/j.ic.2025.105379_br0320
  article-title: Absent words in a sliding window with applications
  publication-title: Inf. Comput.
  doi: 10.1016/j.ic.2019.104461
– year: 1973
  ident: 10.1016/j.ic.2025.105379_br0170
– volume: 11
  start-page: 853
  issue: 6
  year: 2004
  ident: 10.1016/j.ic.2025.105379_br0130
  article-title: Almost all palindromes are composite
  publication-title: Math. Res. Lett.
  doi: 10.4310/MRL.2004.v11.n6.a10
– volume: 304
  year: 2025
  ident: 10.1016/j.ic.2025.105379_br0490
  article-title: Computing maximal palindromes in non-standard matching models
  publication-title: Inf. Comput.
– volume: 34
  start-page: 600
  issue: 8
  year: 2018
  ident: 10.1016/j.ic.2025.105379_br0120
  article-title: Gene editing on center stage
  publication-title: Trends Genet.
  doi: 10.1016/j.tig.2018.05.004
– volume: 255
  start-page: 539
  issue: 1–2
  year: 2001
  ident: 10.1016/j.ic.2025.105379_br0390
  article-title: Episturmian words and some constructions of de Luca and Rauzy
  publication-title: Theor. Comput. Sci.
  doi: 10.1016/S0304-3975(99)00320-5
– start-page: 290
  year: 2017
  ident: 10.1016/j.ic.2025.105379_br1180
  article-title: Counting palindromes in substrings
– start-page: 3302
  year: 2024
  ident: 10.1016/j.ic.2025.105379_br0580
  article-title: Near-optimal quantum algorithms for bounded edit distance and Lempel-Ziv factorization
– volume: 82
  start-page: 3707
  issue: 12
  year: 2020
  ident: 10.1016/j.ic.2025.105379_br0070
  article-title: Dynamic and internal longest common substring
  publication-title: Algorithmica
  doi: 10.1007/s00453-020-00744-0
– start-page: 33
  year: 2021
  ident: 10.1016/j.ic.2025.105379_br0480
  article-title: Minimal unique palindromic substrings after single-character substitution
– year: 1997
  ident: 10.1016/j.ic.2025.105379_br0650
– start-page: 135
  year: 2010
  ident: 10.1016/j.ic.2025.105379_br0710
  article-title: Counting and verifying maximal palindromes
– start-page: 517
  year: 2025
  ident: 10.1016/j.ic.2025.105379_br0840
  article-title: Near-optimal-time quantum algorithms for approximate pattern matching
– volume: 483
  start-page: 162
  year: 2013
  ident: 10.1016/j.ic.2025.105379_br0720
  article-title: Palindrome pattern matching
  publication-title: Theor. Comput. Sci.
  doi: 10.1016/j.tcs.2012.01.047
– start-page: 63
  year: 2013
  ident: 10.1016/j.ic.2025.105379_br0870
  article-title: Finding distinct subpalindromes online
– start-page: 149
  year: 2014
  ident: 10.1016/j.ic.2025.105379_br0160
  article-title: Palindrome recognition in the streaming model
– volume: 1034
  year: 2025
  ident: 10.1016/j.ic.2025.105379_br1300
  article-title: A note on quantum divide and conquer for minimal string rotation
  publication-title: Theor. Comput. Sci.
  doi: 10.1016/j.tcs.2025.115120
– start-page: 150
  year: 2014
  ident: 10.1016/j.ic.2025.105379_br0730
  article-title: Computing palindromic factorizations and palindromic covers on-line
– volume: 592
  start-page: 59
  year: 2015
  ident: 10.1016/j.ic.2025.105379_br0150
  article-title: Efficient pattern matching for RNA secondary structures
  publication-title: Theor. Comput. Sci.
  doi: 10.1016/j.tcs.2015.05.016
– volume: 148
  start-page: 4072
  issue: 12
  year: 1992
  ident: 10.1016/j.ic.2025.105379_br1350
  article-title: Unique palindromic sequences in synthetic oligonucleotides are required to induce IFN [correction of INF] and augment IFN-mediated [correction of INF] natural killer activity
  publication-title: J. Immunol.
  doi: 10.4049/jimmunol.148.12.4072
– volume: 223
  start-page: 73
  issue: 1–2
  year: 1999
  ident: 10.1016/j.ic.2025.105379_br0400
  article-title: Palindromes and Sturmian words
  publication-title: Theor. Comput. Sci.
  doi: 10.1016/S0304-3975(97)00188-6
– volume: 85
  start-page: 1251
  issue: 5
  year: 2023
  ident: 10.1016/j.ic.2025.105379_br0930
  article-title: Quantum meets fine-grained complexity: sublinear time quantum algorithms for string problems
  publication-title: Algorithmica
  doi: 10.1007/s00453-022-01066-z
– volume: 14
  start-page: 249
  issue: 3
  year: 1995
  ident: 10.1016/j.ic.2025.105379_br1270
  article-title: On-line construction of suffix trees
  publication-title: Algorithmica
  doi: 10.1007/BF01206331
– volume: 18
  start-page: 333
  issue: 6
  year: 1975
  ident: 10.1016/j.ic.2025.105379_br0010
  article-title: Efficient string matching: an aid to bibliographic search
  publication-title: Commun. ACM
  doi: 10.1145/360825.360855
– volume: 389
  start-page: 278
  issue: 1–2
  year: 2007
  ident: 10.1016/j.ic.2025.105379_br1250
  article-title: The affix array data structure and its applications to RNA secondary structure analysis
  publication-title: Theor. Comput. Sci.
  doi: 10.1016/j.tcs.2007.09.029
– volume: 20
  issue: 4
  year: 2024
  ident: 10.1016/j.ic.2025.105379_br0770
  article-title: Quantum speed-ups for string synchronizing sets, longest common substring, and k-mismatch matching
  publication-title: ACM Trans. Algorithms
  doi: 10.1145/3672395
– volume: 22
  start-page: 346
  issue: 3
  year: 1975
  ident: 10.1016/j.ic.2025.105379_br0970
  article-title: A new linear-time on-line algorithm for finding the smallest initial palindrome of a string
  publication-title: J. ACM
  doi: 10.1145/321892.321896
– year: 2017
  ident: 10.1016/j.ic.2025.105379_br0190
  article-title: Palindromic length in linear time
– year: 2020
  ident: 10.1016/j.ic.2025.105379_br1200
  article-title: Palindromic k-factorization in pure linear time
– volume: 859
  start-page: 116
  year: 2021
  ident: 10.1016/j.ic.2025.105379_br0510
  article-title: Computing longest palindromic substring after single-character or block-wise edits
  publication-title: Theor. Comput. Sci.
  doi: 10.1016/j.tcs.2021.01.014
– volume: 22
  start-page: 935
  issue: 5
  year: 1993
  ident: 10.1016/j.ic.2025.105379_br0980
  article-title: Suffix arrays: a new method for on-line string searches
  publication-title: SIAM J. Comput.
  doi: 10.1137/0222058
– volume: 432
  start-page: 28
  year: 2012
  ident: 10.1016/j.ic.2025.105379_br0280
  article-title: Efficient retrieval of approximate palindromes in a run-length encoded string
  publication-title: Theor. Comput. Sci.
  doi: 10.1016/j.tcs.2012.01.023
– start-page: 193
  year: 2009
  ident: 10.1016/j.ic.2025.105379_br1100
  article-title: Linear suffix array construction by almost pure induced-sorting
– volume: 73
  start-page: 242
  issue: 1
  year: 2019
  ident: 10.1016/j.ic.2025.105379_br0610
  article-title: Palindromes in starlike trees
  publication-title: Australas. J. Comb.
– start-page: 289
  year: 1993
  ident: 10.1016/j.ic.2025.105379_br0300
  article-title: Real-time deques, multihead Turing machines, and purely functional programming
– volume: 15
  start-page: 293
  issue: 2
  year: 2004
  ident: 10.1016/j.ic.2025.105379_br0210
  article-title: On the palindromic complexity of infinite words
  publication-title: Int. J. Found. Comput. Sci.
  doi: 10.1142/S012905410400242X
– volume: 38
  start-page: 1843
  issue: 4
  year: 1997
  ident: 10.1016/j.ic.2025.105379_br0040
  article-title: Schrödinger operators with Rudin-Shapiro potentials are not palindromic
  publication-title: J. Math. Phys.
  doi: 10.1063/1.531916
– volume: 7
  start-page: 354
  issue: 4
  year: 1973
  ident: 10.1016/j.ic.2025.105379_br0310
  article-title: Time bounded random access machines
  publication-title: J. Comput. Syst. Sci.
  doi: 10.1016/S0022-0000(73)80029-7
– volume: 145
  start-page: 371
  issue: 3
  year: 2016
  ident: 10.1016/j.ic.2025.105379_br1170
  article-title: The number of distinct subpalindromes in random words
  publication-title: Fundam. Inform.
  doi: 10.3233/FI-2016-1366
– volume: 83
  start-page: 1128
  issue: 11
  year: 1992
  ident: 10.1016/j.ic.2025.105379_br0900
  article-title: Oligonucleotide sequences required for natural killer cell activation
  publication-title: Jpn. J. Cancer Res.
  doi: 10.1111/j.1349-7006.1992.tb02734.x
– start-page: 289
  year: 2015
  ident: 10.1016/j.ic.2025.105379_br0880
  article-title: Palk is linear recognizable online
– ident: 10.1016/j.ic.2025.105379_br1090
– volume: 110
  start-page: 908
  issue: 20
  year: 2010
  ident: 10.1016/j.ic.2025.105379_br0630
  article-title: Counting distinct palindromes in a word in linear time
  publication-title: Inf. Process. Lett.
  doi: 10.1016/j.ipl.2010.07.018
– volume: 36
  start-page: 259
  issue: 3
  year: 1998
  ident: 10.1016/j.ic.2025.105379_br0670
  article-title: Palindromic numbers in arithmetic progressions
  publication-title: Fibonacci Q.
  doi: 10.1080/00150517.1998.12428937
– volume: 173
  year: 2022
  ident: 10.1016/j.ic.2025.105379_br1050
  article-title: Palindromic trees for a sliding window and its applications
  publication-title: Inf. Process. Lett.
  doi: 10.1016/j.ipl.2021.106174
– start-page: 137
  year: 1997
  ident: 10.1016/j.ic.2025.105379_br0430
  article-title: Optimal suffix tree construction with large alphabets
– start-page: 346
  year: 1979
  ident: 10.1016/j.ic.2025.105379_br0850
  article-title: Real-time simulation of concatenable double-ended queues by double-ended queues
– volume: 285
  issue: B
  year: 2022
  ident: 10.1016/j.ic.2025.105379_br0960
  article-title: Counting (Watson-Crick) palindromes in Watson-Crick conjugates
  publication-title: Inf. Comput.
– volume: 222
  start-page: 259
  issue: 1–3
  year: 2000
  ident: 10.1016/j.ic.2025.105379_br0360
  article-title: Palindrome complexity bounds for primitive substitution sequences
  publication-title: Discrete Math.
  doi: 10.1016/S0012-365X(00)00054-6
– volume: 450
  start-page: 109
  year: 2012
  ident: 10.1016/j.ic.2025.105379_br0260
  article-title: Using minimal absent words to build phylogeny
  publication-title: Theor. Comput. Sci.
  doi: 10.1016/j.tcs.2012.04.031
– volume: 16
  start-page: 140
  issue: 2
  year: 1978
  ident: 10.1016/j.ic.2025.105379_br0530
  article-title: Palindrome recognition in real time by a multitape Turing machine
  publication-title: J. Comput. Syst. Sci.
  doi: 10.1016/0022-0000(78)90042-9
– year: 2025
  ident: 10.1016/j.ic.2025.105379_br0030
  article-title: On the quantum time complexity of divide and conquer
SSID ssj0011546
Score 2.4222286
Snippet The palindromic tree (a.k.a. eertree) is a data structure that provides access to all palindromic substrings of a string. In this paper, we propose a dynamic...
SourceID crossref
elsevier
SourceType Index Database
Publisher
StartPage 105379
SubjectTerms Double-ended data structures
Eertrees
Palindromes
String algorithms
Title Double-ended palindromic trees in linear time
URI https://dx.doi.org/10.1016/j.ic.2025.105379
Volume 307
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVESC
  databaseName: Elsevier SD Freedom Collection Journals 2021
  issn: 0890-5401
  databaseCode: AIEXJ
  dateStart: 20211207
  customDbUrl:
  isFulltext: true
  dateEnd: 99991231
  titleUrlDefault: https://www.sciencedirect.com
  omitProxy: false
  ssIdentifier: ssj0011546
  providerName: Elsevier
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3NS8MwFA-6edCDH1NxftGDFxkdbdO0y3HIRAWHwsTipTRpgh1SR7fJ_nxf2nTrZAM9CG0oj_Y15Ne-_JK8vIfQFe3YkU0lMUUkqOlGzDdpTKUK44q5S2CU7fI82YTf73eCgD7pVHLjPJ2An6ad2YyO_hVqkAHYauvsH-CeKwUBXAPoUALsUP4KeKDE7EOY-dR2awQ0Ow9JkHDlU557X7UUs4yyPK18lZvqnUmT0kGZ5wkfllbqX_Xs8rPypNd9njIZWvyYLGRv71MlCpI0mybVuQWH6E12FRNELeU6YVftJS7S1GqLZ6uAMHSlMS7mBYbtRIWKdEh7cety3Osf_dHcS7B0QBuGCQ-VhrDQsInqjk8o2LB6974XPMxXjWy9MaustV6WLvz5lmuxmoZUqMVgH-3qMYHRLbA8QBsibaC9Mt-Goc1vA-1UgkceIrMKtFEB2siBNpLUKIA2FNBH6OW2N7i5M3XyC5OriJGmzT0JbJzROMJQCIpjGAhZQnixy-GwHGEJIhnj2JJMUCKx62KfiNiXTMKfdoxq6WcqTpBBI595TMIJ4-E4Zsz2QKkHXUvEqI1FE12XbRGOihgn4bq2byJcNlaoOVrBvUJAfe1Tp394wxnaXnyK56g2yabiAm3xr0kyzi415N8QGllD
linkProvider Elsevier
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Double-ended+palindromic+trees+in+linear+time&rft.jtitle=Information+and+computation&rft.au=Wang%2C+Qisheng&rft.au=Yang%2C+Ming&rft.au=Zhu%2C+Xinrui&rft.date=2025-11-01&rft.issn=0890-5401&rft.volume=307&rft.spage=105379&rft_id=info:doi/10.1016%2Fj.ic.2025.105379&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_ic_2025_105379
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0890-5401&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0890-5401&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0890-5401&client=summon