Counting Distinct (Non-)crossing Substrings

Authors: Umezaki, Haruki^Aff11, Shibata, Hiroki^Aff12, Köppl, Dominik^Aff13, Nakashima, Yuto^Aff14, Inenaga, Shunsuke^Aff14, Bannai, Hideo^Aff15

Contributors: Goos, Gerhard, Founding Editor^Aff1, Hartmanis, Juris, Founding Editor^Aff2, Bertino, Elisa, Series Editor^Aff3, Gao, Wen, Series Editor^Aff4, Steffen, Bernhard, Series Editor^Aff5, Yung, Moti, Series Editor^Aff6, Badkobeh, Golnaz, editor^Aff7, Radoszewski, Jakub, editor^Aff8, Tonellotto, Nicola, editor^Aff9, Baeza-Yates, Ricardo, editor^Aff10

Source: String Processing and Information Retrieval : 32nd International Symposium, SPIRE 2025, London, UK, September 8–11, 2025, Proceedings. 16073:281-290

Practical Algorithms for Hierarchical Overlap Graphs

Authors: Talera, Saumya^Aff11, Bansal, Parth^Aff11, Khan, Shabnam^Aff11, Khan, Shahbaz^Aff11

Contributors: Goos, Gerhard, Founding Editor^Aff1, Hartmanis, Juris, Founding Editor^Aff2, Bertino, Elisa, Series Editor^Aff3, Gao, Wen, Series Editor^Aff4, Steffen, Bernhard, Series Editor^Aff5, Yung, Moti, Series Editor^Aff6, Badkobeh, Golnaz, editor^Aff7, Radoszewski, Jakub, editor^Aff8, Tonellotto, Nicola, editor^Aff9, Baeza-Yates, Ricardo, editor^Aff10

Source: String Processing and Information Retrieval : 32nd International Symposium, SPIRE 2025, London, UK, September 8–11, 2025, Proceedings. 16073:265-280

Longest Unbordered Factors on Run-Length Encoded Strings

Authors: Sekizaki, Shoma^Aff11, Mieno, Takuya^Aff11

Contributors: Goos, Gerhard, Founding Editor^Aff1, Hartmanis, Juris, Founding Editor^Aff2, Bertino, Elisa, Series Editor^Aff3, Gao, Wen, Series Editor^Aff4, Steffen, Bernhard, Series Editor^Aff5, Yung, Moti, Series Editor^Aff6, Badkobeh, Golnaz, editor^Aff7, Radoszewski, Jakub, editor^Aff8, Tonellotto, Nicola, editor^Aff9, Baeza-Yates, Ricardo, editor^Aff10

Source: String Processing and Information Retrieval : 32nd International Symposium, SPIRE 2025, London, UK, September 8–11, 2025, Proceedings. 16073:233-247

Minimizers in Semi-dynamic Strings

Authors: Zuba, Wiktor^{Aff9, Aff10}, Lachish, Oded^Aff11, Pissis, Solon P.^{Aff10, Aff12}

Contributors: Hartmanis, Juris, Founding Editor^Aff1, Goos, Gerhard, Founding Editor^Aff2, Bertino, Elisa, Series Editor^Aff3, Gao, Wen, Series Editor^Aff4, Steffen, Bernhard, Series Editor^Aff5, Yung, Moti, Series Editor^Aff6, Jeż, Artur, editor^Aff7, Otop, Jan, editor^Aff8

Source: Fundamentals of Computation Theory : 25th International Symposium, FCT 2025, Wrocław, Poland, September 15–17, 2025, Proceedings. 16106:434-447

Methodology for Detecting Similarity of Program Code Based on Combining Algorithms

Authors: Novotochinov, Maksim E., Solomatin, Dmitry I., Chernenkii, Andrei V.

Source: 2024 Conference of Young Researchers in Electrical and Electronic Engineering (ElCon) Young Researchers in Electrical and Electronic Engineering (ElCon), 2024 Conference of. :255-258 Jan, 2024

Relation: 2024 Conference of Young Researchers in Electrical and Electronic Engineering (ElCon)

Bidirectional String Anchors for Improved Text Indexing and Top-$K$ Similarity Search

Authors: Loukides, G., Pissis, S.P., Sweering, M.

Source: IEEE Transactions on Knowledge and Data Engineering IEEE Trans. Knowl. Data Eng. Knowledge and Data Engineering, IEEE Transactions on. 35(11):11093-11111 Nov, 2023

Elastic-Degenerate String Matching with 1 Error or Mismatch

Authors: Bernardini, Giulia, Gabory, Esteban, Pissis, Solon, Stougie, Leen, Sweering, Michelle, Zuba, Wiktor

Contributors: Bernardini, G., Gabory, E., Pissis, S. P., Stougie, L., Sweering, M., Zuba, W., Sagot, Marie-France

Source: Theory of Computing Systems

Subject Terms: String algorithms, Elastic-degenerate strings, string algorithms, approximate string matching, edit distance, Hamming distance, elastic-degenerate strings, Approximate string matching, Elastic-degenerate string, Edit distance, String algorithm, [INFO.INFO-BI] Computer Science [cs]/Bioinformatics [q-bio.QM]

File Description: application/pdf

Access URL: https://link.springer.com/article/10.1007/s00224-024-10194-8
https://hdl.handle.net/11368/3091558
https://hdl.handle.net/1871.1/fbd19d3a-5431-453a-a3e0-8cd5b1a5b811
https://doi.org/10.1007/s00224-024-10194-8
https://research.vu.nl/en/publications/fbd19d3a-5431-453a-a3e0-8cd5b1a5b811
https://inria.hal.science/hal-04747458v1
https://doi.org/10.1007/s00224-024-10194-8
https://inria.hal.science/hal-04747458v1/document
https://hdl.handle.net/2434/1131036
https://doi.org/10.1007/s00224-024-10194-8
https://link.springer.com/article/10.1007/s00224-024-10194-8
https://doi.org/10.1007/s00224-024-10194-8
https://hdl.handle.net/11368/3091558

Estimating the Longest Increasing Subsequence in Nearly Optimal Time

Authors: Andoni, Alexandr, Nosatzki, Negev Shekel, Sinha, Sandip, Stein, Clifford

Source: 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS) FOCS Foundations of Computer Science (FOCS), 2022 IEEE 63rd Annual Symposium on. :708-719 Oct, 2022

Relation: 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS)

A Space-Efficient Algorithm for Longest Common Almost Increasing Subsequence of Two Sequences

Authors: Rahat, Md. Tanzeem^Aff9, Hasan, Md. Manzurul^Aff9, Mondal, Debajyoti^Aff10

Contributors: Goos, Gerhard, Founding Editor^Aff1, Hartmanis, Juris, Founding Editor^Aff2, Bertino, Elisa, Series Editor^Aff3, Gao, Wen, Series Editor^Aff4, Steffen, Bernhard, Series Editor^Aff5, Yung, Moti, Series Editor^Aff6, Fernau, Henning, editor^Aff7, Zhu, Binhai, editor^Aff8

Source: Combinatorial Algorithms : 36th International Workshop, IWOCA 2025, Bozeman, MT, USA, July 21–24, 2025, Proceedings. 15885:228-241

k-Universality of Regular Languages Revisited

Authors: Adamson, Duncan^Aff11, Fleischmann, Pamela^Aff12, Huch, Annika^Aff12, Koß, Tore^Aff13, Manea, Florin^Aff13

Contributors: Goos, Gerhard, Founding Editor^Aff1, Hartmanis, Juris, Founding Editor^Aff2, Bertino, Elisa, Series Editor^Aff3, Gao, Wen, Series Editor^Aff4, Steffen, Bernhard, Series Editor^Aff5, Yung, Moti, Series Editor^Aff6, Chau, Vincent, editor^Aff7, Dürr, Christoph, editor^Aff8, Li, Minming, editor^Aff9, Lu, Pinyan, editor^Aff10

Source: Frontiers of Algorithmics : 19th International Joint Conference, IJTCS-FAW 2025, Paris, France, June 30 – July 2, 2025, Proceedings. 15828:16-32

Online and Offline Algorithms for Counting Distinct Closed Factors via Sliding Suffix Trees

Authors: Mieno, Takuya^Aff9, Takahashi, Shun^Aff10, Seto, Kazuhisa^Aff10, Horiyama, Takashi^Aff10

Contributors: Goos, Gerhard, Series Editor^Aff1, Hartmanis, Juris, Founding Editor^Aff2, Bertino, Elisa, Editorial Board Member^Aff3, Gao, Wen, Editorial Board Member^Aff4, Steffen, Bernhard, Editorial Board Member^Aff5, Yung, Moti, Editorial Board Member^Aff6, Královič, Rastislav, editor^Aff7, Kůrková, Věra, editor^Aff8

Source: SOFSEM 2025: Theory and Practice of Computer Science : 50th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2025, Bratislava, Slovak Republic, January 20–23, 2025, Proceedings, Part II. 15539:172-183

Hide and Mine in Strings: Hardness, Algorithms, and Experiments

Authors: Bernardini, G., Conte, A., Gourdel, G., Grossi, R., Loukides, G., Pisanti, N., Pissis, S.P., Punzi, G., Stougie, L., Sweering, M.

Source: IEEE Transactions on Knowledge and Data Engineering IEEE Trans. Knowl. Data Eng. Knowledge and Data Engineering, IEEE Transactions on. 35(6):5948-5963 Jun, 2023

k-Universality of Regular Languages

Authors: Duncan Adamson, Pamela Fleischmann, Annika Huch, Tore Koß, Florin Manea, Dirk Nowotka

Contributors: Duncan Adamson and Pamela Fleischmann and Annika Huch and Tore Koß and Florin Manea and Dirk Nowotka, Iwata, Satoru, Kakimura, Naonori, University of St Andrews.School of Computer Science

Source: Information and Computation. 307:105357

Subject Terms: FOS: Computer and information sciences, Formal Languages and Automata Theory (cs.FL), T-NDAS, String Algorithms, Computer Science - Data Structures and Algorithms, Finite Automata, Subsequences, Regular Languages, Computer Science - Formal Languages and Automata Theory, Data Structures and Algorithms (cs.DS), ddc:004, Software

File Description: application/pdf

Access URL: http://arxiv.org/abs/2311.10658
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2023.4
https://hdl.handle.net/10023/29996

Missing value replacement in strings and applications

Authors: G. Bernardini, C. Liu, G. Loukides, A. Marchetti-Spaccamela, S. P. Pissis, L. Stougie, M. Sweering

Source: Data Min Knowl Discov

Subject Terms: String algorithms, String sanitization, string algorithm, forbidden pattern, missing value replacement, string sanitization, string algorithms, forbidden patterns, Forbidden patterns, Missing value replacement, Article

File Description: application/pdf

Access URL: https://pubmed.ncbi.nlm.nih.gov/39867462
https://research.vu.nl/en/publications/8a02a50e-06d3-4836-aac0-8c0e0992a4bd
https://doi.org/10.1007/s10618-024-01074-3
https://hdl.handle.net/1871.1/8a02a50e-06d3-4836-aac0-8c0e0992a4bd
https://hdl.handle.net/2434/1138695
https://doi.org/10.1007/s10618-024-01074-3
https://hdl.handle.net/11368/3096431

Pattern Masking for Dictionary Matching: Theory and Practice: Theory and Practice

Authors: Charalampopoulos, Panagiotis, Chen, Huiping, Christen, Peter, Loukides, Grigorios, Pisanti, Nadia, Pissis, Solon P., Radoszewski, Jakub

Contributors: Sagot, Marie-France

Source: Algorithmica

Subject Terms: String algorithms, Record linkage, String algorithms Dictionary matching Wildcards Record linkage, Query term dropping, 4. Education, Wildcards, Dictionary matching, [INFO.INFO-BI] Computer Science [cs]/Bioinformatics [q-bio.QM]

File Description: application/pdf

Access URL: https://hdl.handle.net/1871.1/7db223ca-663b-47f1-9c0e-c2ab8c68cf98
https://doi.org/10.1007/s00453-024-01213-8
https://research.vu.nl/en/publications/7db223ca-663b-47f1-9c0e-c2ab8c68cf98
https://inria.hal.science/hal-04747475v1
https://inria.hal.science/hal-04747475v1/document
https://doi.org/10.1007/s00453-024-01213-8

Non-overlapping indexing in BWT-runs bounded space

Authors: Gibney, Daniel ^{a, ⁎}, MacNichol, Paul ^b, Thankachan, Sharma V. ^b

Source: In Theoretical Computer Science 21 November 2025 1056

Double-ended palindromic trees in linear time

Authors: Wang, Qisheng ^{a, ⁎}, Yang, Ming ^b, Zhu, Xinrui ^c

Source: In Information and Computation November 2025 307

Bit Packed Encodings for Grammar-Compressed Strings Supporting Fast Random Access

Authors: Cleary, Alan M., Winjum, Joseph, Dood, Jordan, Shibata, Hiroki, Inenaga, Shunsuke

Contributors: Alan M. Cleary and Joseph Winjum and Jordan Dood and Hiroki Shibata and Shunsuke Inenaga

Subject Terms: String algorithms, grammar-based compression, ddc:004, data compression, random access

File Description: application/pdf

Access URL: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2025.12

Graph Indexing Beyond Wheeler Graphs

Authors: Alanko, Jarno N., Biagi, Elena, Equi, Massimo, Mäkinen, Veli, Puglisi, Simon J., Rizzo, Nicola, Sadakane, Kunihiko, Sirén, Jouni

Contributors: Ferragina, Paolo, Gagie, Travis, Navarro, Gonzalo, Department of Computer Science, Algorithmic Bioinformatics, Genome-scale Algorithmics research group / Veli Mäkinen, Bioinformatics, Jarno N. Alanko and Elena Biagi and Massimo Equi and Veli Mäkinen and Simon J. Puglisi and Nicola Rizzo and Kunihiko Sadakane and Jouni Sirén, University of Helsinki, University of Tokyo, University of California, Santa Cruz, Aalto-yliopisto, Aalto University

Subject Terms: compressed data structures, Computer and information sciences, pattern matching, ddc:004, string algorithms, compression, indexing

File Description: application/pdf

Access URL: http://hdl.handle.net/10138/600103
https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.Manzini.13
https://aaltodoc.aalto.fi/handle/123456789/138634

Faster Range LCP Queries in Linear Space

Authors: Nekirch, Yakov, Thankachan, Sharma V.

Contributors: Yakov Nekirch and Sharma V. Thankachan

Subject Terms: Longest Common Prefix, String Algorithms, ddc:004, Data Structures

File Description: application/pdf

Access URL: https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.Grossi.16