{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,19]],"date-time":"2026-06-19T23:51:38Z","timestamp":1781913098552,"version":"3.54.5"},"reference-count":89,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T00:00:00Z","timestamp":1772064000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100002341","name":"Research Council of Finland","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002341","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100024370","name":"Ministero dell'Istruzione dell'Universit\u00e0 e della Ricerca","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100024370","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100009112","name":"Francesco Severi National Institute of Higher Mathematics","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100009112","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2026,5]]},"DOI":"10.1016\/j.tcs.2026.115796","type":"journal-article","created":{"date-parts":[[2026,2,4]],"date-time":"2026-02-04T00:17:50Z","timestamp":1770164270000},"page":"115796","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"special_numbering":"C","title":["Matching statistics\u2014a survey"],"prefix":"10.1016","volume":"1071","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3233-0691","authenticated-orcid":false,"given":"Zsuzsanna","family":"Lipt\u00e1k","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2078-6835","authenticated-orcid":false,"given":"Francesco","family":"Masillo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7668-7636","authenticated-orcid":false,"given":"Simon J.","family":"Puglisi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2026.115796_bib0001","series-title":"Proc. 31st Annual Symposium on Foundations of Computer Science (FOCS)","first-page":"116","article-title":"Approximate string matching in sublinear expected time","volume":"1","author":"Chang","year":"1990"},{"issue":"4\/5","key":"10.1016\/j.tcs.2026.115796_bib0002","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1007\/BF01185431","article-title":"Sublinear approximate string matching and biological applications","volume":"12","author":"Chang","year":"1994","journal-title":"Algorithmica"},{"key":"10.1016\/j.tcs.2026.115796_bib0003","series-title":"Proc. 2nd IEEE Computer Society Bioinformatics Conference (CSB)","first-page":"57","article-title":"Fast and sensitive probe selection for DNA chips using jumps in matching statistics","author":"Rahmann","year":"2003"},{"key":"10.1016\/j.tcs.2026.115796_bib0004","series-title":"Proc. 23rd International Conference on Machine Learning (ICML)","first-page":"929","article-title":"Fast and space efficient string kernels using suffix arrays","volume":"148","author":"Teo","year":"2006"},{"key":"10.1016\/j.tcs.2026.115796_bib0005","series-title":"Proc. 17th International Symposium on String Processing and Information Retrieval (SPIRE)","first-page":"347","article-title":"Computing matching statistics and maximal exact matches on compressed full-text indexes","author":"Ohlebusch","year":"2010"},{"issue":"8","key":"10.1016\/j.tcs.2026.115796_bib0006","doi-asserted-by":"crossref","first-page":"945","DOI":"10.1089\/cmb.2012.0122","article-title":"Detecting phylogenetic signals in eukaryotic whole genome sequences","volume":"19","author":"Cohen","year":"2012","journal-title":"J. Comput. Biol."},{"issue":"2","key":"10.1016\/j.tcs.2026.115796_bib0007","doi-asserted-by":"crossref","first-page":"336","DOI":"10.1089\/cmb.2006.13.336","article-title":"The average common substring approach to phylogenomic reconstruction","volume":"13","author":"Ulitsky","year":"2006","journal-title":"J. Comput. Biol."},{"key":"10.1016\/j.tcs.2026.115796_bib0008","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1186\/gb-2013-14-3-r30","article-title":"CRAC: an integrated approach to the analysis of RNA-seq reads","volume":"14","author":"Philippe","year":"2013","journal-title":"Genome Biol."},{"key":"10.1016\/j.tcs.2026.115796_bib0009","series-title":"Algorithms on Strings, Trees, and Sequences","author":"Gusfield","year":"1997"},{"issue":"5","key":"10.1016\/j.tcs.2026.115796_bib0010","doi-asserted-by":"crossref","first-page":"935","DOI":"10.1137\/0222058","article-title":"Suffix arrays: a new method for on-line string searches","volume":"22","author":"Manber","year":"1993","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.tcs.2026.115796_bib0011","series-title":"Technical Report","article-title":"A Block-Sorting Lossless Data Compression Algorithm","author":"Burrows","year":"1994"},{"key":"10.1016\/j.tcs.2026.115796_bib0012","series-title":"Proc. 22nd International Workshop on Algorithms in Bioinformatics (WABI)","first-page":"20:1","article-title":"Suffix sorting via matching statistics","author":"Lipt\u00e1k","year":"2022"},{"issue":"1","key":"10.1016\/j.tcs.2026.115796_bib0013","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1186\/s13015-023-00245-z","article-title":"Suffix sorting via matching statistics","volume":"19","author":"Lipt\u00e1k","year":"2024","journal-title":"Algorithms Mol. Biol."},{"key":"10.1016\/j.tcs.2026.115796_bib0014","series-title":"Proc. 31st Annual European Symposium on Algorithms (ESA)","first-page":"83:1","article-title":"Matching statistics speed up BWT construction","author":"Masillo","year":"2023"},{"issue":"6","key":"10.1016\/j.tcs.2026.115796_bib0015","doi-asserted-by":"crossref","first-page":"918","DOI":"10.1145\/1217856.1217858","article-title":"Linear work suffix array construction","volume":"53","author":"K\u00e4rkk\u00e4inen","year":"2006","journal-title":"J. ACM"},{"key":"10.1016\/j.tcs.2026.115796_bib0016","series-title":"Proc. 17th International Symposium on String Processing and Information Retrieval (SPIRE)","first-page":"201","article-title":"Relative Lempel-Ziv compression of genomes for large-scale storage and retrieval","author":"Kuruppu","year":"2010"},{"key":"10.1016\/j.tcs.2026.115796_bib0017","series-title":"Compact PAT Trees","author":"Clark","year":"1996"},{"key":"10.1016\/j.tcs.2026.115796_bib0018","series-title":"Proc. 16th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS)","first-page":"37","article-title":"Tables","author":"Munro","year":"1996"},{"key":"10.1016\/j.tcs.2026.115796_bib0019","series-title":"Proc. 14th Annual Symposium on Discrete Algorithms (SODA)","first-page":"841","article-title":"High-order entropy-compressed text indexes","author":"Grossi","year":"2003"},{"key":"10.1016\/j.tcs.2026.115796_bib0020","series-title":"Proc. 14th Annual Symposium on Switching and Automata Theory","first-page":"1","article-title":"Linear pattern matching algorithms","author":"Weiner","year":"1973"},{"key":"10.1016\/j.tcs.2026.115796_bib0021","series-title":"Combinatorial Algorithms on Words","first-page":"85","article-title":"The myriad virtues of subword trees","author":"Apostolico","year":"1985"},{"issue":"2","key":"10.1016\/j.tcs.2026.115796_bib0022","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1145\/321941.321946","article-title":"A space-economical suffix tree construction algorithm","volume":"23","author":"McCreight","year":"1976","journal-title":"J. ACM"},{"key":"10.1016\/j.tcs.2026.115796_bib0023","series-title":"Proc. 38th Annual Symposium on Foundations of Computer Science (FOCS)","first-page":"137","article-title":"Optimal suffix tree construction with large alphabets","author":"Farach","year":"1997"},{"issue":"3","key":"10.1016\/j.tcs.2026.115796_bib0024","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1007\/BF01206331","article-title":"On-line construction of suffix trees","volume":"14","author":"Ukkonen","year":"1995","journal-title":"Algorithmica"},{"issue":"2-4","key":"10.1016\/j.tcs.2026.115796_bib0025","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1016\/j.jda.2004.08.019","article-title":"Constructing suffix arrays in linear time","volume":"3","author":"Kim","year":"2005","journal-title":"J. Discr. Algorithms"},{"issue":"2-4","key":"10.1016\/j.tcs.2026.115796_bib0026","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/j.jda.2004.08.002","article-title":"Space efficient linear time construction of suffix arrays","volume":"3","author":"Ko","year":"2005","journal-title":"J. Discr. Algorithms"},{"issue":"2","key":"10.1016\/j.tcs.2026.115796_bib0027","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1145\/1242471.1242472","article-title":"A taxonomy of suffix array construction algorithms","volume":"39","author":"Puglisi","year":"2007","journal-title":"ACM Comput. Surv."},{"key":"10.1016\/j.tcs.2026.115796_bib0028","series-title":"Proc. 26th International Symposium on String Processing and Information Retrieval (SPIRE)","first-page":"407","article-title":"SACABench: benchmarking suffix array construction","author":"Bahne","year":"2019"},{"key":"10.1016\/j.tcs.2026.115796_bib0029","series-title":"Scalable String and Suffix Sorting: Algorithms, Techniques, and Tools","author":"Bingmann","year":"2018"},{"issue":"10","key":"10.1016\/j.tcs.2026.115796_bib0030","doi-asserted-by":"crossref","first-page":"1471","DOI":"10.1109\/TC.2010.188","article-title":"Two efficient algorithms for linear time suffix array construction","volume":"60","author":"Nong","year":"2011","journal-title":"IEEE Trans. Computers"},{"issue":"3","key":"10.1016\/j.tcs.2026.115796_bib0031","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1145\/2493175.2493180","article-title":"Practical linear-time O(1)-workspace suffix sorting for constant alphabets","volume":"31","author":"Nong","year":"2013","journal-title":"ACM Trans. Inf. Syst."},{"key":"10.1016\/j.tcs.2026.115796_bib0032","series-title":"Proc. 27th Annual Symposium on Combinatorial Pattern Matching (CPM)","first-page":"23:1","article-title":"Linear-time suffix sorting - a new approach for suffix array construction","author":"Baier","year":"2016"},{"key":"10.1016\/j.tcs.2026.115796_bib0033","series-title":"Proc. Prague Stringology Conference (PSC)","first-page":"111","article-title":"Optimal time and space construction of suffix arrays and LCP arrays for integer alphabets","author":"Goto","year":"2019"},{"issue":"Part","key":"10.1016\/j.tcs.2026.115796_bib0034","article-title":"Optimal in-place suffix sorting","volume":"285","author":"Li","year":"2022","journal-title":"Inf. Comput."},{"key":"10.1016\/j.tcs.2026.115796_bib0035","series-title":"Proc. 12th Annual Symposium Combinatorial Pattern Matching (CPM)","first-page":"181","article-title":"Linear-time longest-common-prefix computation in suffix arrays and its applications","author":"Kasai","year":"2001"},{"issue":"22","key":"10.1016\/j.tcs.2026.115796_bib0036","doi-asserted-by":"crossref","first-page":"2451","DOI":"10.1016\/j.tcs.2011.01.036","article-title":"Combined data structure for previous- and next-smaller-values","volume":"412","author":"Fischer","year":"2011","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.tcs.2026.115796_bib0037","series-title":"Proc. of the 9th International Symposium Experimental Algorithms, SEA 2010","first-page":"94","article-title":"Practical compressed suffix trees","volume":"6049","author":"C\u00e1novas","year":"2010"},{"key":"10.1016\/j.tcs.2026.115796_bib0038","series-title":"Proc. 16th International Symposium on String Processing and Information Retrieval (SPIRE)","first-page":"51","article-title":"A compressed enhanced suffix array supporting fast string matching","author":"Ohlebusch","year":"2009"},{"issue":"51","key":"10.1016\/j.tcs.2026.115796_bib0039","doi-asserted-by":"crossref","first-page":"5354","DOI":"10.1016\/j.tcs.2009.09.012","article-title":"Faster entropy-bounded compressed suffix trees","volume":"410","author":"Fischer","year":"2009","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.tcs.2026.115796_bib0040","series-title":"Proc. 41st Annual Symposium on Foundations of Computer Science (FOCS)","first-page":"390","article-title":"Opportunistic data structures with applications","author":"Ferragina","year":"2000"},{"issue":"4","key":"10.1016\/j.tcs.2026.115796_bib0041","doi-asserted-by":"crossref","first-page":"552","DOI":"10.1145\/1082036.1082039","article-title":"Indexing compressed text","volume":"52","author":"Ferragina","year":"2005","journal-title":"J. ACM"},{"issue":"7","key":"10.1016\/j.tcs.2026.115796_bib0042","doi-asserted-by":"crossref","first-page":"1838","DOI":"10.1093\/bioinformatics\/btac064","article-title":"Fast and compact matching statistics analytics","volume":"38","author":"Cunial","year":"2022","journal-title":"Bioinform."},{"key":"10.1016\/j.tcs.2026.115796_bib0043","series-title":"Proc. Prague Stringology Conference (PSC)","first-page":"3","article-title":"Fast matching statistics for sets of long similar strings","author":"Lipt\u00e1k","year":"2024"},{"issue":"5","key":"10.1016\/j.tcs.2026.115796_bib0044","doi-asserted-by":"crossref","DOI":"10.1145\/3409371","article-title":"Predecessor search","volume":"53","author":"Navarro","year":"2020","journal-title":"ACM Comput. Surv."},{"issue":"1","key":"10.1016\/j.tcs.2026.115796_bib0045","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/S1570-8667(03)00065-0","article-title":"Replacing suffix trees with enhanced suffix arrays","volume":"2","author":"Abouelhoda","year":"2004","journal-title":"J. Discr. Algorithms"},{"issue":"6","key":"10.1016\/j.tcs.2026.115796_bib0046","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1016\/j.ipl.2005.12.012","article-title":"Computing suffix links for suffix trees and arrays","volume":"101","author":"Maa\u00df","year":"2007","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"10.1016\/j.tcs.2026.115796_bib0047","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1145\/1216370.1216372","article-title":"Compressed full-text indexes","volume":"39","author":"Navarro","year":"2007","journal-title":"ACM Comput. Surv."},{"key":"10.1016\/j.tcs.2026.115796_bib0048","series-title":"Proc. 29th Annual Symposium on Combinatorial Pattern Matching (CPM)","first-page":"7:1","article-title":"Online LZ77 parsing and matching statistics with RLBWTs","author":"Bannai","year":"2018"},{"key":"10.1016\/j.tcs.2026.115796_bib0049","series-title":"Proc. Data Compression Conference (DCC)","first-page":"23","article-title":"Computing LZ77 in run-compressed space","author":"Policriti","year":"2016"},{"key":"10.1016\/j.tcs.2026.115796_bib0050","series-title":"Proc. 12th International Symposium on Experimental Algorithms (SEA)","first-page":"139","article-title":"Lightweight Lempel-Ziv parsing","author":"K\u00e4rkk\u00e4inen","year":"2013"},{"issue":"1","key":"10.1016\/j.tcs.2026.115796_bib0051","doi-asserted-by":"crossref","first-page":"2:1","DOI":"10.1145\/3375890","article-title":"Fully functional suffix trees and optimal text searching in BWT-runs bounded space","volume":"67","author":"Gagie","year":"2020","journal-title":"J. ACM"},{"key":"10.1016\/j.tcs.2026.115796_bib0052","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1016\/j.tcs.2019.08.005","article-title":"Refining the r-index","volume":"812","author":"Bannai","year":"2020","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"10.1016\/j.tcs.2026.115796_bib0053","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/0022-0000(88)90045-1","article-title":"Fast string matching with k differences","volume":"37","author":"Landau","year":"1988","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"10.1016\/j.tcs.2026.115796_bib0054","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/0196-6774(89)90010-2","article-title":"Fast parallel and serial approximate string matching","volume":"10","author":"Landau","year":"1989","journal-title":"J. Algorithms"},{"key":"10.1016\/j.tcs.2026.115796_bib0055","series-title":"Proc. International Symposium on Algorithms and Computation (ISAAC)","first-page":"234","article-title":"Approximate pattern matching with samples","author":"Takaoka","year":"1994"},{"key":"10.1016\/j.tcs.2026.115796_bib0056","series-title":"Proc. 4th Latin American Symposium on Theoretical Informatics (LATIN)","first-page":"88","article-title":"The LCA problem revisited","author":"Bender","year":"2000"},{"issue":"2","key":"10.1016\/j.tcs.2026.115796_bib0057","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1137\/0213024","article-title":"Fast algorithms for finding nearest common ancestors","volume":"13","author":"Harel","year":"1984","journal-title":"SIAM J. Comput."},{"issue":"4","key":"10.1016\/j.tcs.2026.115796_bib0058","first-page":"406","article-title":"The neighbor-joining method: a new method for reconstructing phylogenetic trees","volume":"4","author":"Saitou","year":"1987","journal-title":"Mol. Biol. Evol."},{"issue":"14","key":"10.1016\/j.tcs.2026.115796_bib0059","doi-asserted-by":"crossref","first-page":"2000","DOI":"10.1093\/bioinformatics\/btu331","article-title":"kmacs: the k-mismatch average common substring approach to alignment-free sequence comparison","volume":"30","author":"Leimeister","year":"2014","journal-title":"Bioinform."},{"key":"10.1016\/j.tcs.2026.115796_bib0060","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1016\/j.tcs.2016.01.023","article-title":"Sequence similarity measures based on bounded hamming distance","volume":"638","author":"Apostolico","year":"2016","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.tcs.2026.115796_bib0061","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1186\/s13015-016-0072-x","article-title":"MissMax: alignment-free sequence comparison with mismatches through filtering and heuristics","volume":"11","author":"Pizzi","year":"2016","journal-title":"Algorithms Mol. Biol."},{"issue":"6","key":"10.1016\/j.tcs.2026.115796_bib0062","doi-asserted-by":"crossref","first-page":"472","DOI":"10.1089\/cmb.2015.0235","article-title":"A provably efficient algorithm for the k-mismatch average common substring problem","volume":"23","author":"Thankachan","year":"2016","journal-title":"J. Comput. Biol."},{"key":"10.1016\/j.tcs.2026.115796_bib0063","unstructured":"H. Li, Aligning sequence reads, clone sequences and assembly contigs with BWA-MEM, 2013. https:\/\/arxiv.org\/abs\/1303.3997."},{"issue":"2","key":"10.1016\/j.tcs.2026.115796_bib0064","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1089\/cmb.2021.0290","article-title":"MONI: A pangenomic index for finding maximal exact matches","volume":"29","author":"Rossi","year":"2022","journal-title":"J. Comput. Biol."},{"key":"10.1016\/j.tcs.2026.115796_bib0065","series-title":"Proc. 31st Data Compression Conference (DCC)","first-page":"193","article-title":"PHONI: Streamed matching statistics with multi-genome references","author":"Boucher","year":"2021"},{"key":"10.1016\/j.tcs.2026.115796_bib0066","series-title":"Proc. 33rd Data Compression Conference (DCC)","first-page":"268","article-title":"Augmented thresholds for MONI","author":"Mart\u00ednez-Guardiola","year":"2023"},{"key":"10.1016\/j.tcs.2026.115796_bib0067","series-title":"Proc. Data Compression Conference (DCC)","first-page":"123","article-title":"Faster maximal exact matches with lazy LCP evaluation","author":"Goga","year":"2024"},{"issue":"6","key":"10.1016\/j.tcs.2026.115796_bib0068","doi-asserted-by":"crossref","DOI":"10.1016\/j.isci.2021.102696","article-title":"Pan-genomic matching statistics for targeted nanopore sequencing","volume":"24","author":"Ahmed","year":"2021","journal-title":"Iscience"},{"issue":"1","key":"10.1016\/j.tcs.2026.115796_bib0069","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1186\/s13059-023-02958-1","article-title":"SPUMONI 2: improved classification using a pangenome index of minimizer digests","volume":"24","author":"Ahmed","year":"2023","journal-title":"Genome Biol."},{"issue":"Supplement 1","key":"10.1016\/j.tcs.2026.115796_bib0070","doi-asserted-by":"crossref","first-page":"i287","DOI":"10.1093\/bioinformatics\/btae213","article-title":"Sigmoni: classification of nanopore signal with a compressed pangenome index","volume":"40","author":"Shivakumar","year":"2024","journal-title":"Bioinformatics"},{"issue":"12","key":"10.1016\/j.tcs.2026.115796_bib0071","doi-asserted-by":"crossref","DOI":"10.1016\/j.isci.2024.111464","article-title":"Movi: a fast and cache-efficient full-text pangenome index","volume":"27","author":"Zakeri","year":"2024","journal-title":"iScience"},{"issue":"1","key":"10.1016\/j.tcs.2026.115796_bib0072","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1371\/journal.pcbi.1005944","article-title":"MUMmer4: A fast and versatile genome alignment system","volume":"14","author":"Mar\u00e7ais","year":"2018","journal-title":"PLoS Comput. Biol."},{"key":"10.1016\/j.tcs.2026.115796_bib0073","series-title":"Genome Scale Algorithm Design, 2nd Edition","author":"M\u00e4kinen","year":"2023"},{"key":"10.1016\/j.tcs.2026.115796_bib0074","doi-asserted-by":"crossref","DOI":"10.1016\/j.ic.2024.105155","article-title":"r-indexing the eBWT","volume":"298","author":"Boucher","year":"2024","journal-title":"Inf. Comput."},{"issue":"3","key":"10.1016\/j.tcs.2026.115796_bib0075","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1016\/j.tcs.2007.07.014","article-title":"An extension of the Burrows-Wheeler transform","volume":"387","author":"Mantaci","year":"2007","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"10.1016\/j.tcs.2026.115796_bib0076","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1109\/TIT.1976.1055501","article-title":"On the complexity of finite sequences","volume":"22","author":"Lempel","year":"1976","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"10.1016\/j.tcs.2026.115796_bib0077","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1109\/TIT.1977.1055714","article-title":"A universal algorithm for sequential data compression","volume":"23","author":"Ziv","year":"1977","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"21","key":"10.1016\/j.tcs.2026.115796_bib0078","doi-asserted-by":"crossref","first-page":"2979","DOI":"10.1093\/bioinformatics\/btr505","article-title":"Robust relative compression of genomes with random access","volume":"27","author":"Deorowicz","year":"2011","journal-title":"Bioinform."},{"issue":"3","key":"10.1016\/j.tcs.2026.115796_bib0079","doi-asserted-by":"crossref","first-page":"265","DOI":"10.14778\/2078331.2078341","article-title":"Relative Lempel-Ziv factorization for efficient storage and retrieval of web collections","volume":"5","author":"Hoobin","year":"2011","journal-title":"Proc. VLDB Endow."},{"key":"10.1016\/j.tcs.2026.115796_bib0080","series-title":"Proc. 25t International Conference on World Wide Web (WWW)","first-page":"807","article-title":"Effective construction of relative Lempel-Ziv dictionaries","author":"Liao","year":"2016"},{"key":"10.1016\/j.tcs.2026.115796_bib0081","series-title":"Proc. 27th International Symposium on String Processing and Information Retrieval (SPIRE)","first-page":"89","article-title":"Relative Lempel-Ziv compression of suffix arrays","author":"Puglisi","year":"2020"},{"key":"10.1016\/j.tcs.2026.115796_bib0082","series-title":"Proc. 19th International Symposium on Experimental Algorithms (SEA)","first-page":"12:1","article-title":"Document retrieval hacks","author":"Puglisi","year":"2021"},{"key":"10.1016\/j.tcs.2026.115796_bib0083","series-title":"Proc. 21st International Symposium on Experimental Algorithms (SEA)","first-page":"18:1","article-title":"Hierarchical relative Lempel-Ziv compression","author":"Bille","year":"2023"},{"key":"10.1016\/j.tcs.2026.115796_bib0084","series-title":"Proc. 6th International Conference on Language and Automata Theory and Applications (LATA)","first-page":"240","article-title":"A faster grammar-based self-index","author":"Gagie","year":"2012"},{"key":"10.1016\/j.tcs.2026.115796_bib0085","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1016\/j.tcs.2013.07.024","article-title":"Fast relative Lempel-Ziv self-index for similar sequences","volume":"532","author":"Do","year":"2014","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.tcs.2026.115796_bib0086","series-title":"Proc. 29th Data Compression Conference (DCC)","first-page":"201","article-title":"Practical indexing of repetitive collections using relative Lempel-Ziv","author":"Navarro","year":"2019"},{"key":"10.1016\/j.tcs.2026.115796_bib0087","series-title":"Proc. 33rd Data Compression Conference (DCC)","first-page":"150","article-title":"Computing matching statistics on wheeler DFAs","author":"Conte","year":"2023"},{"key":"10.1016\/j.tcs.2026.115796_bib0088","series-title":"Proc. 32nd Data Compression Conference (DCC)","first-page":"73","article-title":"Computing matching statistics on repetitive texts","author":"Gao","year":"2022"},{"key":"10.1016\/j.tcs.2026.115796_bib0089","series-title":"Proc. 32nd International Symposium on String Processing and Information Retrieval (SPIRE)","article-title":"Massively parallel computation of matching statistics","author":"Diseth","year":"2025"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526000551?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526000551?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,3,21]],"date-time":"2026-03-21T07:36:50Z","timestamp":1774078610000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397526000551"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5]]},"references-count":89,"alternative-id":["S0304397526000551"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2026.115796","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2026,5]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Matching statistics\u2014a survey","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2026.115796","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 The Authors. Published by Elsevier B.V.","name":"copyright","label":"Copyright"}],"article-number":"115796"}}