Data Structures for Computing Unique Palindromes in Static and Non-Static Strings

A palindromic substring T [ i .. j ] of a string T is said to be a shortest unique palindromic substring (SUPS) in T for an interval [ p , q ] if T [ i .. j ] is a shortest palindromic substring such that T [ i .. j ] occurs only once in T , and [ i , j ] contains [ p , q ]. The SUPS problem is,...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Algorithmica Ročník 86; číslo 3; s. 852 - 873
Hlavní autori:	Mieno, Takuya, Funakoshi, Mitsuru
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 01.03.2024 Springer Nature B.V
Predmet:	Algorithm Analysis and Problem Complexity Algorithms Computer Science Computer Systems Organization and Communication Networks Constraints Data structures Data Structures and Information Theory Mathematics of Computing Preprocessing Queries Strings Theory of Computation Upper bounds String algorithms Palindromes Dynamic data structures Shortest unique palindromic substrings Range minimum queries Compact data structures
ISSN:	0178-4617, 1432-0541
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Abstract	A palindromic substring T [ i .. j ] of a string T is said to be a shortest unique palindromic substring (SUPS) in T for an interval [ p , q ] if T [ i .. j ] is a shortest palindromic substring such that T [ i .. j ] occurs only once in T , and [ i , j ] contains [ p , q ]. The SUPS problem is, given a string T of length n , to construct a data structure that can compute all the SUPSs for any given query interval. It is known that any SUPS query can be answered in O ( α ) time after O ( n )-time preprocessing, where α is the number of SUPSs to output (Inoue in J Discrete Algorithms 52-53:122–132, 2018). In this paper, we first show that α is at most 4, and the upper bound is tight. We also show that the total sum of lengths of minimal unique palindromic substrings of string T , which is strongly related to SUPSs, is O ( n ). Then, we present the first O ( n )-bits data structures that can answer any SUPS query in constant time. Also, we present an algorithm to solve the SUPS problem for a sliding window that can answer any query in O ( log log W ) time and update data structures in amortized O ( log σ + log log W ) time, where W is the size of the window, and σ is the alphabet size. Furthermore, we consider the SUPS problem in the after-edit model and present an efficient algorithm. Namely, we present an algorithm that uses O ( n ) time for preprocessing and answers any k SUPS queries in O ( log n log log n + k log log n ) time after single character substitution. Finally, as a by-product, we propose a fully-dynamic data structure for range minimum queries (RmQs) with a constraint where the width of each query range is limited to poly-logarithmic. The constrained RmQ data structure can answer such a query in constant time and support a single-element edit operation in amortized constant time.
AbstractList	A palindromic substring T [ i .. j ] of a string T is said to be a shortest unique palindromic substring (SUPS) in T for an interval [ p , q ] if T [ i .. j ] is a shortest palindromic substring such that T [ i .. j ] occurs only once in T , and [ i , j ] contains [ p , q ]. The SUPS problem is, given a string T of length n , to construct a data structure that can compute all the SUPSs for any given query interval. It is known that any SUPS query can be answered in O ( α ) time after O ( n )-time preprocessing, where α is the number of SUPSs to output (Inoue in J Discrete Algorithms 52-53:122–132, 2018). In this paper, we first show that α is at most 4, and the upper bound is tight. We also show that the total sum of lengths of minimal unique palindromic substrings of string T , which is strongly related to SUPSs, is O ( n ). Then, we present the first O ( n )-bits data structures that can answer any SUPS query in constant time. Also, we present an algorithm to solve the SUPS problem for a sliding window that can answer any query in O ( log log W ) time and update data structures in amortized O ( log σ + log log W ) time, where W is the size of the window, and σ is the alphabet size. Furthermore, we consider the SUPS problem in the after-edit model and present an efficient algorithm. Namely, we present an algorithm that uses O ( n ) time for preprocessing and answers any k SUPS queries in O ( log n log log n + k log log n ) time after single character substitution. Finally, as a by-product, we propose a fully-dynamic data structure for range minimum queries (RmQs) with a constraint where the width of each query range is limited to poly-logarithmic. The constrained RmQ data structure can answer such a query in constant time and support a single-element edit operation in amortized constant time. A palindromic substring T[i..j] of a string T is said to be a shortest unique palindromic substring (SUPS) in T for an interval [p, q] if T[i..j] is a shortest palindromic substring such that T[i..j] occurs only once in T, and [i, j] contains [p, q]. The SUPS problem is, given a string T of length n, to construct a data structure that can compute all the SUPSs for any given query interval. It is known that any SUPS query can be answered in O(α) time after O(n)-time preprocessing, where α is the number of SUPSs to output (Inoue in J Discrete Algorithms 52-53:122–132, 2018). In this paper, we first show that α is at most 4, and the upper bound is tight. We also show that the total sum of lengths of minimal unique palindromic substrings of string T, which is strongly related to SUPSs, is O(n). Then, we present the first O(n)-bits data structures that can answer any SUPS query in constant time. Also, we present an algorithm to solve the SUPS problem for a sliding window that can answer any query in O(loglogW) time and update data structures in amortized O(logσ+loglogW) time, where W is the size of the window, and σ is the alphabet size. Furthermore, we consider the SUPS problem in the after-edit model and present an efficient algorithm. Namely, we present an algorithm that uses O(n) time for preprocessing and answers any k SUPS queries in O(lognloglogn+kloglogn) time after single character substitution. Finally, as a by-product, we propose a fully-dynamic data structure for range minimum queries (RmQs) with a constraint where the width of each query range is limited to poly-logarithmic. The constrained RmQ data structure can answer such a query in constant time and support a single-element edit operation in amortized constant time.
Author	Funakoshi, Mitsuru Mieno, Takuya
Author_xml	– sequence: 1 givenname: Takuya surname: Mieno fullname: Mieno, Takuya email: tmieno@uec.ac.jp organization: Department of Computer and Network Engineering, University of Electro-Communications – sequence: 2 givenname: Mitsuru surname: Funakoshi fullname: Funakoshi, Mitsuru organization: Department of Informatics, Kyushu University, Japan Society for the Promotion of Science
BookMark	eNp9kMtOwzAQRS1UJNrCD7CKxNowfsXxEpWnhHiIsrac2EGpWjvYyYK_xyWV2LEYjUY6987MXaCZD94hdE7gkgDIqwTABcNAcxEiAVdHaE44oxgEJzM0ByIrzEsiT9AipQ0AoVKVc_R2YwZTvA9xbIYxulS0IRarsOvHofOfxYfvvkZXvJpt520Muwx0PuNm6JrCeFs8B48PYzbJknSKjluzTe7s0JdofXe7Xj3gp5f7x9X1E26ohAFzLnlNalUZoHUrmGqFYNbWxMgSGlcroLStZG1KJhQXtqmYaC1XRFlKhGFLdDHZ9jHkE9OgN2GMPm_UVGUrLqCETNGJamJIKbpW97HbmfitCeh9cnpKTufk9G9yusoiNolSv__IxT_rf1Q_P1px_g
Cites_doi	10.1016/0020-0190(77)90031-X 10.1109/TCOM.1984.1096090 10.1137/090779759 10.1016/j.tcs.2021.01.014 10.1016/j.jda.2018.11.009 10.1007/3-540-61422-2_148 10.1016/0304-3975(94)00083-U 10.1145/63334.63341 10.1007/s00453-020-00744-0 10.1007/s00453-019-00591-8 10.1016/j.ipl.2021.106174 10.1145/321892.321896 10.1007/s00224-020-09980-x 10.1007/s00453-021-00864-1 10.1007/BF01206331 10.1109/TIT.1977.1055714 10.1007/s00453-022-00955-7 10.1090/S0002-9939-1965-0174934-9 10.1016/j.tcs.2008.12.016 10.1111/j.1349-7006.1992.tb02734.x 10.1016/j.ic.2019.104461 10.4049/jimmunol.148.12.4072 10.1007/978-3-642-22300-6_25 10.1007/978-3-319-67428-5_2 10.1007/978-3-319-04298-5_44 10.1007/978-3-030-86692-1_4 10.1109/DCC.1996.488324 10.1109/SFCS.1998.743504 10.1145/3519935.3520061 10.4230/LIPIcs.ESA.2019.5 10.4230/LIPIcs.CPM.2018.19 10.1109/SFCS.1989.63533 10.1017/cbo9780511574931 10.1137/1.9781611975031.99 10.4230/LIPIcs.ICALP.2020.27
ContentType	Journal Article
Copyright	The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2023. Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
Copyright_xml	– notice: The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2023. Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
DBID	AAYXX CITATION JQ2
DOI	10.1007/s00453-023-01170-8
DatabaseName	CrossRef ProQuest Computer Science Collection
DatabaseTitle	CrossRef ProQuest Computer Science Collection
DatabaseTitleList	ProQuest Computer Science Collection
DeliveryMethod	fulltext_linktorsrc
Discipline	Computer Science
EISSN	1432-0541
EndPage	873
ExternalDocumentID	10_1007_s00453_023_01170_8
GrantInformation_xml	– fundername: Japan Society for the Promotion of Science grantid: JP20J11983; JP20J21147 funderid: http://dx.doi.org/10.13039/501100001691
GroupedDBID	-4Z -59 -5G -BR -EM -Y2 -~C -~X .86 .DC .VR 06D 0R~ 0VY 199 1N0 1SB 203 23M 28- 2J2 2JN 2JY 2KG 2KM 2LR 2P1 2VQ 2~H 30V 4.4 406 408 409 40D 40E 5GY 5QI 5VS 67Z 6NX 78A 8TC 8UJ 95- 95. 95~ 96X AAAVM AABHQ AACDK AAHNG AAIAL AAJBT AAJKR AANZL AAOBN AARHV AARTL AASML AATNV AATVU AAUYE AAWCG AAYIU AAYQN AAYTO AAYZH ABAKF ABBBX ABBXA ABDPE ABDZT ABECU ABFSI ABFTV ABHLI ABHQN ABJNI ABJOX ABKCH ABKTR ABLJU ABMNI ABMQK ABNWP ABQBU ABQSL ABSXP ABTAH ABTEG ABTHY ABTKH ABTMW ABULA ABWNU ABXPI ACAOD ACBXY ACDTI ACGFS ACHSB ACHXU ACKNC ACMDZ ACMLO ACOKC ACOMO ACPIV ACZOJ ADHHG ADHIR ADIMF ADINQ ADKNI ADKPE ADRFC ADTPH ADURQ ADYFF ADZKW AEBTG AEFIE AEFQL AEGAL AEGNC AEJHL AEJRE AEKMD AEMSY AENEX AEOHA AEPYU AESKC AETLH AEVLU AEXYK AFBBN AFEXP AFGCZ AFLOW AFQWF AFWTZ AFZKB AGAYW AGDGC AGGDS AGJBK AGMZJ AGQEE AGQMX AGRTI AGWIL AGWZB AGYKE AHAVH AHBYD AHKAY AHSBF AHYZX AI. AIAKS AIGIU AIIXL AILAN AITGF AJBLW AJRNO AJZVZ ALMA_UNASSIGNED_HOLDINGS ALWAN AMKLP AMXSW AMYLF AMYQR AOCGG ARMRJ ASPBG AVWKF AXYYD AYJHY AZFZN B-. BA0 BBWZM BDATZ BGNMA BSONS CAG COF CS3 CSCUP DDRTE DL5 DNIVK DPUIP E.L EBLON EBS EIOEI EJD ESBYG FEDTE FERAY FFXSO FIGPU FINBP FNLPD FRRFC FSGXE FWDCC GGCAI GGRSB GJIRD GNWQR GQ6 GQ7 GQ8 GXS H13 HF~ HG5 HG6 HMJXF HQYDN HRMNR HVGLF HZ~ H~9 I09 IHE IJ- IKXTQ ITM IWAJR IXC IZIGR IZQ I~X I~Z J-C J0Z JBSCW JCJTX JZLTJ KDC KOV KOW LAS LLZTM M4Y MA- N2Q N9A NB0 NDZJH NPVJJ NQJWS NU0 O9- O93 O9G O9I O9J OAM P19 P9O PF- PT4 PT5 QOK QOS R4E R89 R9I RHV RIG RNI RNS ROL RPX RSV RZK S16 S1Z S26 S27 S28 S3B SAP SCJ SCLPG SCO SDH SDM SHX SISQX SJYHP SNE SNPRN SNX SOHCF SOJ SPISZ SRMVM SSLCW STPWE SZN T13 T16 TN5 TSG TSK TSV TUC U2A UG4 UOJIU UQL UTJUX UZXMN VC2 VFIZW VH1 VXZ W23 W48 WK8 YLTOR Z45 Z7X Z83 Z88 Z8R Z8W Z92 ZMTXR ZY4 ~EX AAPKM AAYXX ABBRH ABDBE ABFSG ABRTQ ACSTC ADHKG AEZWR AFDZB AFHIU AFOHR AGQPQ AHPBZ AHWEU AIXLP ATHPR AYFIA CITATION JQ2
ID	FETCH-LOGICAL-c270t-4474b1b98a02bf539f553ddb1a760ceb9022f87ba635945dc835fd4919d215a3
IEDL.DBID	RSV
ISICitedReferencesCount	1
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001061478800002&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	0178-4617
IngestDate	Thu Nov 20 10:41:17 EST 2025 Sat Nov 29 02:20:33 EST 2025 Fri Feb 21 02:40:21 EST 2025
IsPeerReviewed	true
IsScholarly	true
Issue	3
Keywords	String algorithms Palindromes Dynamic data structures Shortest unique palindromic substrings Range minimum queries Compact data structures
Language	English
LinkModel	DirectLink
MergedId	FETCHMERGED-LOGICAL-c270t-4474b1b98a02bf539f553ddb1a760ceb9022f87ba635945dc835fd4919d215a3
Notes	ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14
PQID	2955345060
PQPubID	2043795
PageCount	22
ParticipantIDs	proquest_journals_2955345060 crossref_primary_10_1007_s00453_023_01170_8 springer_journals_10_1007_s00453_023_01170_8
PublicationCentury	2000
PublicationDate	2024-03-01
PublicationDateYYYYMMDD	2024-03-01
PublicationDate_xml	– month: 03 year: 2024 text: 2024-03-01 day: 01
PublicationDecade	2020
PublicationPlace	New York
PublicationPlace_xml	– name: New York
PublicationTitle	Algorithmica
PublicationTitleAbbrev	Algorithmica
PublicationYear	2024
Publisher	Springer US Springer Nature B.V
Publisher_xml	– name: Springer US – name: Springer Nature B.V
References	Cleary, Witten (CR11) 1984; 32 Watanabe, Nakashima, Inenaga (CR36) 2020; 64 Ukkonen (CR34) 1995; 14 CR17 CR35 CR33 CR10 Funakoshi, Nakashima, Inenaga (CR18) 2021; 859 Fiala, Greene (CR14) 1989; 32 Mieno, Watanabe, Nakashima (CR31) 2022; 173 Fine, Wilf (CR15) 1965; 16 Abedin, Hooshmand, Ganguly (CR1) 2022; 84 Amir, Charalampopoulos, Pissis (CR6) 2020; 82 van Emde (CR13) 1977; 6 Kuramoto, Yano, Kimura (CR26) 1992; 83 Matsubara, Inenaga, Ishino (CR29) 2009; 410 CR2 Gawrychowski, Merkurev, Shur (CR21) 2019; 81 CR4 CR3 Senft (CR32) 2005; 2005 Yamamoto, Yamamoto, Kataoka (CR37) 1992; 148 CR5 Manacher (CR28) 1975; 22 CR8 Gasieniec, Karpinski, Plandowski, Karlsson, Lingas (CR19) 1996 CR9 CR27 Ziv, Lempel (CR38) 1977; 23 CR25 CR24 Inoue, Nakashima, Mieno (CR23) 2018; 52–53 Crochemore, Héliou, Kucherov (CR12) 2020 CR22 CR20 Fischer, Heun (CR16) 2011; 40 Mieno, Fujishige, Nakashima (CR30) 2022; 84 Apostolico, Breslauer, Galil (CR7) 1995; 141 GK Manacher (1170_CR28) 1975; 22 1170_CR3 1170_CR4 T Mieno (1170_CR31) 2022; 173 1170_CR2 Boas P van Emde (1170_CR13) 1977; 6 P Abedin (1170_CR1) 2022; 84 M Crochemore (1170_CR12) 2020 W Matsubara (1170_CR29) 2009; 410 A Amir (1170_CR6) 2020; 82 H Inoue (1170_CR23) 2018; 52–53 1170_CR25 J Ziv (1170_CR38) 1977; 23 1170_CR27 K Watanabe (1170_CR36) 2020; 64 P Gawrychowski (1170_CR21) 2019; 81 1170_CR22 NJ Fine (1170_CR15) 1965; 16 A Apostolico (1170_CR7) 1995; 141 1170_CR24 JG Cleary (1170_CR11) 1984; 32 1170_CR20 M Senft (1170_CR32) 2005; 2005 ER Fiala (1170_CR14) 1989; 32 S Yamamoto (1170_CR37) 1992; 148 J Fischer (1170_CR16) 2011; 40 M Funakoshi (1170_CR18) 2021; 859 T Mieno (1170_CR30) 2022; 84 1170_CR9 1170_CR8 1170_CR5 1170_CR17 1170_CR10 E Kuramoto (1170_CR26) 1992; 83 1170_CR33 L Gasieniec (1170_CR19) 1996 E Ukkonen (1170_CR34) 1995; 14 1170_CR35
References_xml	– ident: CR22 – volume: 6 start-page: 80 issue: 3 year: 1977 end-page: 82 ident: CR13 article-title: Preserving order in a forest in less than logarithmic time and linear space publication-title: Inf. Process. Lett. doi: 10.1016/0020-0190(77)90031-X – volume: 32 start-page: 396 issue: 4 year: 1984 end-page: 402 ident: CR11 article-title: Data compression using adaptive coding and partial string matching publication-title: IEEE Trans. Commun. doi: 10.1109/TCOM.1984.1096090 – volume: 40 start-page: 465 issue: 2 year: 2011 end-page: 492 ident: CR16 article-title: Space-efficient preprocessing schemes for range minimum queries on static arrays publication-title: SIAM J. Comput. doi: 10.1137/090779759 – ident: CR4 – volume: 859 start-page: 116 year: 2021 end-page: 133 ident: CR18 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: 52–53 start-page: 122 year: 2018 end-page: 132 ident: CR23 article-title: Algorithms and combinatorial properties on shortest unique palindromic substrings publication-title: J. Dis. Algorithms doi: 10.1016/j.jda.2018.11.009 – ident: CR2 – start-page: 392 year: 1996 end-page: 403 ident: CR19 article-title: Efficient algorithms for Lempel-Ziv encoding publication-title: Algorithm theory – SWAT’96 doi: 10.1007/3-540-61422-2_148 – volume: 141 start-page: 163 issue: 1 &2 year: 1995 end-page: 173 ident: CR7 article-title: Parallel detection of all palindromes in a string publication-title: Theor. Comput. Sci. doi: 10.1016/0304-3975(94)00083-U – ident: CR10 – ident: CR33 – volume: 32 start-page: 490 issue: 4 year: 1989 end-page: 505 ident: CR14 article-title: Data compression with finite windows publication-title: Commun. ACM doi: 10.1145/63334.63341 – volume: 82 start-page: 3707 issue: 12 year: 2020 end-page: 3743 ident: CR6 article-title: Dynamic and internal longest common substring publication-title: Algorithmica doi: 10.1007/s00453-020-00744-0 – volume: 81 start-page: 3630 issue: 9 year: 2019 end-page: 3654 ident: CR21 article-title: Tight tradeoffs for real-time approximation of longest palindromes in streams publication-title: Algorithmica doi: 10.1007/s00453-019-00591-8 – ident: CR35 – ident: CR8 – volume: 173 year: 2022 ident: CR31 article-title: Palindromic trees for a sliding window and its applications publication-title: Inf. Process. Lett. doi: 10.1016/j.ipl.2021.106174 – volume: 22 start-page: 346 issue: 3 year: 1975 end-page: 351 ident: CR28 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 – ident: CR25 – ident: CR27 – volume: 64 start-page: 1273 issue: 7 year: 2020 end-page: 1291 ident: CR36 article-title: Fast algorithms for the shortest unique palindromic substring problem on run-length encoded strings publication-title: Theor. Comput. Syst. doi: 10.1007/s00224-020-09980-x – volume: 84 start-page: 670 issue: 3 year: 2022 end-page: 693 ident: CR30 article-title: Computing minimal unique substrings for a sliding window publication-title: Algorithmica doi: 10.1007/s00453-021-00864-1 – volume: 14 start-page: 249 issue: 3 year: 1995 end-page: 260 ident: CR34 article-title: On-line construction of suffix trees publication-title: Algorithmica doi: 10.1007/BF01206331 – ident: CR3 – ident: CR17 – ident: CR9 – volume: 2005 start-page: 41 year: 2005 end-page: 46 ident: CR32 article-title: Suffix tree for a sliding window: an overview publication-title: WDS – volume: 23 start-page: 337 issue: 3 year: 1977 end-page: 343 ident: CR38 article-title: A universal algorithm for sequential data compression publication-title: IEEE Trans. Inf. Theor. doi: 10.1109/TIT.1977.1055714 – volume: 84 start-page: 2088 issue: 7 year: 2022 end-page: 2105 ident: CR1 article-title: The heaviest induced ancestors problem: better data structures and applications publication-title: Algorithmica doi: 10.1007/s00453-022-00955-7 – ident: CR5 – volume: 16 start-page: 109 issue: 1 year: 1965 end-page: 114 ident: CR15 article-title: Uniqueness theorems for periodic functions publication-title: Proc. Am. Math. Soc. doi: 10.1090/S0002-9939-1965-0174934-9 – volume: 410 start-page: 900 issue: 8–10 year: 2009 end-page: 913 ident: CR29 article-title: Efficient algorithms to compute compressed longest common substrings and compressed palindromes publication-title: Theor. Comput. Sci. doi: 10.1016/j.tcs.2008.12.016 – volume: 83 start-page: 1128 issue: 11 year: 1992 end-page: 1131 ident: CR26 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 – year: 2020 ident: CR12 article-title: Absent words in a sliding window with applications publication-title: Inf. Comput. doi: 10.1016/j.ic.2019.104461 – ident: CR24 – ident: CR20 – volume: 148 start-page: 4072 issue: 12 year: 1992 end-page: 4076 ident: CR37 article-title: Unique palindromic sequences in synthetic oligonucleotides are required to induce IFN natural killer activity publication-title: J. Immunol. doi: 10.4049/jimmunol.148.12.4072 – volume: 40 start-page: 465 issue: 2 year: 2011 ident: 1170_CR16 publication-title: SIAM J. Comput. doi: 10.1137/090779759 – volume: 52–53 start-page: 122 year: 2018 ident: 1170_CR23 publication-title: J. Dis. Algorithms doi: 10.1016/j.jda.2018.11.009 – volume: 410 start-page: 900 issue: 8–10 year: 2009 ident: 1170_CR29 publication-title: Theor. Comput. Sci. doi: 10.1016/j.tcs.2008.12.016 – ident: 1170_CR8 doi: 10.1007/978-3-642-22300-6_25 – ident: 1170_CR4 doi: 10.1007/978-3-319-67428-5_2 – ident: 1170_CR33 doi: 10.1007/978-3-319-04298-5_44 – ident: 1170_CR10 – ident: 1170_CR17 doi: 10.1007/978-3-030-86692-1_4 – ident: 1170_CR27 doi: 10.1109/DCC.1996.488324 – ident: 1170_CR2 doi: 10.1109/SFCS.1998.743504 – volume: 14 start-page: 249 issue: 3 year: 1995 ident: 1170_CR34 publication-title: Algorithmica doi: 10.1007/BF01206331 – volume: 82 start-page: 3707 issue: 12 year: 2020 ident: 1170_CR6 publication-title: Algorithmica doi: 10.1007/s00453-020-00744-0 – ident: 1170_CR25 doi: 10.1145/3519935.3520061 – ident: 1170_CR5 doi: 10.4230/LIPIcs.ESA.2019.5 – volume: 83 start-page: 1128 issue: 11 year: 1992 ident: 1170_CR26 publication-title: Jpn. J. Cancer Res. doi: 10.1111/j.1349-7006.1992.tb02734.x – ident: 1170_CR35 doi: 10.4230/LIPIcs.CPM.2018.19 – volume: 2005 start-page: 41 year: 2005 ident: 1170_CR32 publication-title: WDS – volume: 6 start-page: 80 issue: 3 year: 1977 ident: 1170_CR13 publication-title: Inf. Process. Lett. doi: 10.1016/0020-0190(77)90031-X – volume: 81 start-page: 3630 issue: 9 year: 2019 ident: 1170_CR21 publication-title: Algorithmica doi: 10.1007/s00453-019-00591-8 – volume: 64 start-page: 1273 issue: 7 year: 2020 ident: 1170_CR36 publication-title: Theor. Comput. Syst. doi: 10.1007/s00224-020-09980-x – volume: 22 start-page: 346 issue: 3 year: 1975 ident: 1170_CR28 publication-title: J. ACM doi: 10.1145/321892.321896 – volume: 84 start-page: 2088 issue: 7 year: 2022 ident: 1170_CR1 publication-title: Algorithmica doi: 10.1007/s00453-022-00955-7 – year: 2020 ident: 1170_CR12 publication-title: Inf. Comput. doi: 10.1016/j.ic.2019.104461 – volume: 23 start-page: 337 issue: 3 year: 1977 ident: 1170_CR38 publication-title: IEEE Trans. Inf. Theor. doi: 10.1109/TIT.1977.1055714 – ident: 1170_CR3 – volume: 148 start-page: 4072 issue: 12 year: 1992 ident: 1170_CR37 publication-title: J. Immunol. doi: 10.4049/jimmunol.148.12.4072 – ident: 1170_CR24 doi: 10.1109/SFCS.1989.63533 – volume: 32 start-page: 396 issue: 4 year: 1984 ident: 1170_CR11 publication-title: IEEE Trans. Commun. doi: 10.1109/TCOM.1984.1096090 – volume: 84 start-page: 670 issue: 3 year: 2022 ident: 1170_CR30 publication-title: Algorithmica doi: 10.1007/s00453-021-00864-1 – ident: 1170_CR22 doi: 10.1017/cbo9780511574931 – volume: 859 start-page: 116 year: 2021 ident: 1170_CR18 publication-title: Theor. Comput. Sci. doi: 10.1016/j.tcs.2021.01.014 – start-page: 392 volume-title: Algorithm theory – SWAT’96 year: 1996 ident: 1170_CR19 doi: 10.1007/3-540-61422-2_148 – volume: 32 start-page: 490 issue: 4 year: 1989 ident: 1170_CR14 publication-title: Commun. ACM doi: 10.1145/63334.63341 – volume: 173 year: 2022 ident: 1170_CR31 publication-title: Inf. Process. Lett. doi: 10.1016/j.ipl.2021.106174 – volume: 16 start-page: 109 issue: 1 year: 1965 ident: 1170_CR15 publication-title: Proc. Am. Math. Soc. doi: 10.1090/S0002-9939-1965-0174934-9 – ident: 1170_CR20 doi: 10.1137/1.9781611975031.99 – volume: 141 start-page: 163 issue: 1 &2 year: 1995 ident: 1170_CR7 publication-title: Theor. Comput. Sci. doi: 10.1016/0304-3975(94)00083-U – ident: 1170_CR9 doi: 10.4230/LIPIcs.ICALP.2020.27
SSID	ssj0012796
Score	2.3809233
Snippet	A palindromic substring T [ i .. j ] of a string T is said to be a shortest unique palindromic substring (SUPS) in T for an interval [ p , q ] if T [ i .. j ]... A palindromic substring T[i..j] of a string T is said to be a shortest unique palindromic substring (SUPS) in T for an interval [p, q] if T[i..j] is a shortest...
SourceID	proquest crossref springer
SourceType	Aggregation Database Index Database Publisher
StartPage	852
SubjectTerms	Algorithm Analysis and Problem Complexity Algorithms Computer Science Computer Systems Organization and Communication Networks Constraints Data structures Data Structures and Information Theory Mathematics of Computing Preprocessing Queries Strings Theory of Computation Upper bounds
Title	Data Structures for Computing Unique Palindromes in Static and Non-Static Strings
URI	https://link.springer.com/article/10.1007/s00453-023-01170-8 https://www.proquest.com/docview/2955345060
Volume	86
WOSCitedRecordID	wos001061478800002&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText	1
inHoldings	1
isFullTextHit
isPrint
journalDatabaseRights	– providerCode: PRVAVX databaseName: SpringerLINK Contemporary 1997-Present customDbUrl: eissn: 1432-0541 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0012796 issn: 0178-4617 databaseCode: RSV dateStart: 19970101 isFulltext: true titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22 providerName: Springer Nature
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV09T8MwED1BYWChfIpCQR7YwFI-nMQeEVAxVYUW1C2yY1vqkiIS-P2cnaQVCAYYrViOdWf7XnLn9wAuU5NwJaWghgec4qIIKLdRSB31GcOmZkp7sYlsPObzuZi0l8Kqrtq9S0n6k3p12c2hD5dzdPU_Ti6Fb8IWhjvutuPT9GWVO4gyr8rldOcpwwDdXpX5eYyv4WiNMb-lRX20GfX_N8892G3RJblplsM-bJjyAPqdcgNpN_IhPN7JWpKp5459xw9ugtCVNN3wVeTZs7qSCWL0hs-gIouSOFy6KIgsNRkvS9o2cRD3s_0IZqP72e0DbcUVaBFlQU0Zy5gKleAyiJRNYmGTJNZahTJLg8IogcHd8kxJ9JpgiS4QqlnNRCg0ogQZH0OvXJbmBEholIpNkWp0LLPWCq0Rt6jEqVtZkwYDuOpMnL82FBr5iizZGytHY-XeWDkfwLDzQt5upyqPBE6OOS7EAVx3Vl8__n200791P4OdCEFLU2M2hB66wZzDdvFRL6q3C7_MPgFla8sZ
linkProvider	Springer Nature
linkToHtml	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV09T8MwED1BQYKF8ikKBTywgaUkdRp7REBVRKkKLahbZMe21CVFtPD7OTtJKxAMMFqxHOvO9r3kzu8BnLdNzJWUghoecIqLIqDcRiF11GcMm5op7cUmkn6fj8diUF4Km1XV7lVK0p_Ui8tuDn24nKOr_3FyKXwV1hhGLFfI9zR8WeQOosSrcjndecowQJdXZX4e42s4WmLMb2lRH2069f_Ncxu2SnRJrorlsAMrJt-FeqXcQMqNvAePN3IuydBzx77jBzdB6EqKbvgq8uxZXckAMXrBZzAjk5w4XDrJiMw16U9zWjZxEPezfR9GndvRdZeW4go0i5JgThlLmAqV4DKIlI1bwsZxS2sVyqQdZEYJDO6WJ0qi1wSLdYZQzWomQqHR5rJ1ALV8mptDIKFRqmWytkbHMmut0Bpxi4qdupU17aABF5WJ09eCQiNdkCV7Y6VorNQbK-UNaFZeSMvtNEsjgZNjjguxAZeV1ZePfx_t6G_dz2CjO3ropb27_v0xbEYIYIp6sybU0CXmBNazj_lk9nbql9wn9JnN_Q
linkToPdf	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3PS8MwFH7oFPHi_InTqTl402DbpWtyFOdQlDHZlN1K0iSwSzfc9O_3JW03FT2Ix9CQhPcS3pe-vO8DOG-bmCspBTU84BQ3RUC5jULqqM8YNjVT2otNJL0eH41E_1MVv3_tXqUki5oGx9KUz6-m2l4tCt8cEnH5R_cWyEmn8FVYY040yN3XBy-LPEKUeIUup0FPGQbrsmzm5zG-hqYl3vyWIvWRp1v__5q3YatEneS62CY7sGLyXahXig6kPOB78NSRc0kGnlP2DS_iBCEtKbrhtOTZs72SPmL3gudgRsY5cXh1nBGZa9Kb5LRs4iDuJ_w-DLu3w5s7Woou0CxKgjllLGEqVILLIFI2bgkbxy2tVSiTdpAZJTDoW54oid4ULNYZQjirmQiFRvQgWwdQyye5OQQSGqVaJmtrdDiz1gqtEc-o2KleWdMOGnBRmTudFtQa6YJE2RsrRWOl3lgpb0Cz8khaHrNZGglcHHMciQ24rDyw_Pz7aEd_634GG_1ON3287z0cw2aEuKZ4htaEGnrEnMB69j4fz15P_e77AIJc1uE
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=Data+Structures+for+Computing+Unique+Palindromes+in+Static+and+Non-Static+Strings&rft.jtitle=Algorithmica&rft.au=Mieno%2C+Takuya&rft.au=Funakoshi%2C+Mitsuru&rft.date=2024-03-01&rft.issn=0178-4617&rft.eissn=1432-0541&rft.volume=86&rft.issue=3&rft.spage=852&rft.epage=873&rft_id=info:doi/10.1007%2Fs00453-023-01170-8&rft.externalDBID=n%2Fa&rft.externalDocID=10_1007_s00453_023_01170_8
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0178-4617&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0178-4617&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0178-4617&client=summon