StringologyTimes

Papers for stringologist (2025)

• ACNS (1)(2025) [dblp]
• COCOON (2)(2025) [dblp]
• CPM(2025) [dblp]
• CPP(2025) [dblp]
• ICIC (26)(2025) [dblp]
• IJTCS-FAW(2025) [dblp]
• RECOMB(2025) [dblp]

• STOC(2025) [dblp]

• Acta Informatica(2025) [dblp]
• Algorithms Mol. Biol.(2025) [dblp]
• Comput. J.(2025) [dblp]
• Eur. J. Comb.(2025) [dblp]
• Geo spatial Inf. Sci.(2025) [dblp]
• Inf. Comput.(2025) [dblp]
• Inf. Process. Lett.(2025) [dblp]
• Inf. Syst.(2025) [dblp]
• Int. J. Found. Comput. Sci.(2025) [dblp]
• J. Heuristics(2025) [dblp]
• J. Syst. Softw.(2025) [dblp]
• Pattern Anal. Appl.(2025) [dblp]
• SoftwareX(2025) [dblp]
• Theor. Comput. Sci.(2025) [dblp]
• VLDB J.(2025) [dblp]

Contents

ACNS (1) 2025

1. Oblivious Suffix Sorting: A Multi-Party Computation Scheme for Secure and Efficient Suffix Sorting.

COCOON (2) 2025

1. Revisit the Partial Coloring Method: Prefix Spencer and Sampling.

CPM 2025

1. A Family of Partial Cubes with Minimal Fibonacci Dimension.
2. Branch Prediction Analysis of Morris-Pratt and Knuth-Morris-Pratt Algorithms.
3. Compressed Dictionary Matching on Run-Length Encoded Strings.
4. Counting on General Run-Length Grammars.
5. Covers in Optimal Space.
6. Doubly-Periodic String Comparison.
7. Encoding Co-Lex Orders of Finite-State Automata in Linear Space.
8. Encodings for Range Minimum Queries over Bounded Alphabets.
9. Extending the Burrows-Wheeler Transform for Cartesian Tree Matching and Constructing It.
10. FL-RMQ: A Learned Approach to Range Minimum Queries.
11. Faster Approximate Elastic-Degenerate String Matching - Part A.
12. Faster Approximate Elastic-Degenerate String Matching - Part B.
13. Front Matter, Table of Contents, Preface, Conference Organization.
14. Generating a Cyclic 2-Gray Code for Lucas Words in Constant Amortized Time.
15. Improved Circular Dictionary Matching.
16. Linear-Space LCS Enumeration for Two Strings.
17. Minimal Generators in Optimal Time.
18. Net Occurrences in Fibonacci and Thue-Morse Words.
19. On Palindromic Periodicities.
20. On the Compressiveness of the Burrows-Wheeler Transform.
21. Pattern Matching on Run-Length Grammar-Compressed Strings in Linear Time.
22. Representing Paths in Digraphs.
23. Shortest Undirected Paths in de Bruijn Graphs.
24. Sorted Consecutive Occurrence Queries in Substrings.
25. Space-Efficient Online Computation of String Net Occurrences.
26. String Problems in the Congested Clique Model.
27. Succinct Data Structures for Segments.
28. Text Indexing for Simple Regular Expressions.
29. The Equivalence Problem of E-Pattern Languages with Length Constraints Is Undecidable.
30. The Trie Measure, Revisited.

CPP 2025

1. Formalized Burrows-Wheeler Transform.

ICIC (26) 2025

1. Enough Consecutive Matches in k-Tuple Common Substrings.

IJTCS-FAW 2025

1. Finding a Set of Long Common Substrings with Repeats from m Input Strings.
2. k-Universality of Regular Languages Revisited.

RECOMB 2025

1. Prokrustean Graph: A Substring Index for Rapid K-Mer Size Analysis.

STOC 2025

1. On the Hardness Hierarchy for the O(n√log n) Complexity in the Word RAM.

Acta Informatica 2025

1. The Primitive Deficiency of two Primitive Strings.

Algorithms Mol. Biol. 2025

1. Faster computation of left-bounded shortest unique substrings.
2. sc McDag: indexing maximal common subsequences for k strings.

Comput. J. 2025

1. Clustering-based compression for raster time series.

Eur. J. Comb. 2025

1. The asymptotic repetition threshold of sequences rich in palindromes.

Geo spatial Inf. Sci. 2025

1. Stronger compact representations of object trajectories.

Inf. Comput. 2025

1. The generalized constrained longest common subsequence in the run-length encoded format.
2. The longest subsequence-duplicated subsequence and related problems.

Inf. Process. Lett. 2025

1. The longest common subsequence problem for small alphabets in the word RAM model.

Inf. Syst. 2025

1. Substring compression variations and LZ78-Derivates.
2. Two-level massive string dictionaries.

Int. J. Found. Comput. Sci. 2025

1. Repetition Factorization of Automatic Sequences.

J. Heuristics 2025

1. Heuristics for the run-length encoded Burrows-Wheeler transform alphabet ordering problem.

J. Syst. Softw. 2025

1. On the compressibility of large-scale source code datasets.

Pattern Anal. Appl. 2025

1. NEONATE: a bi-directional search strategy for non-overlapping pattern matching with gap constraint.

SoftwareX 2025

1. SDSL-Mobile: Enabling space-efficient data structures for mobile applications.

Theor. Comput. Sci. 2025

1. On the number of equal-letter runs of the bijective Burrows-Wheeler transform.
2. Repetitiveness measures based on string morphisms.

VLDB J. 2025

1. Text indexing for long patterns using locally consistent anchors.

This site is open source. Improve this page.