StringologyTimes

Papers for stringologist (2024)

• CALDAM(2024) [dblp]
• CPM(2024) [dblp]
• EvoStar(2024) [dblp]
• FUN(2024) [dblp]
• ICCS (5)(2024) [dblp]
• SPIRE(2024) [dblp]

• TAMC(2024) [dblp]

• ACM Trans. Algorithms(2024) [dblp]
• Algorithmica(2024) [dblp]
• Algorithms(2024) [dblp]
• Discret. Appl. Math.(2024) [dblp]
• Inf. Comput.(2024) [dblp]
• Inf. Syst.(2024) [dblp]
• J. Comput. Syst. Sci.(2024) [dblp]
• J. Supercomput.(2024) [dblp]
• Knowl. Based Syst.(2024) [dblp]
• Theor. Comput. Sci.(2024) [dblp]
• VLDB J.(2024) [dblp]

Contents

CALDAM 2024

1. Consecutive Occurrences with Distance Constraints.

CPM 2024

1. A Class of Heuristics for Reducing the Number of BWT-Runs in the String Ordering Problem.
2. A Data Structure for the Maximum-Sum Segment Problem with Offsets.
3. Algorithms for Galois Words: Detection, Factorization, and Rotation.
4. BAT-LZ out of hell.
5. Closing the Gap: Minimum Space Optimal Time Distance Labeling Scheme for Interval Graphs.
6. Computing the LCP Array of a Labeled Graph.
7. Connecting de Bruijn Graphs.
8. Construction of Sparse Suffix Trees and LCE Indexes in Optimal Time and Space.
9. Efficient Construction of Long Orientable Sequences.
10. Exploiting New Properties of String Net Frequency for Efficient Computation.
11. Faster Sliding Window String Indexing in Streams.
12. Finding Diverse Strings and Longest Common Subsequences in a Graph.
13. Front Matter, Table of Contents, Preface, Conference Organization.
14. Hairpin Completion Distance Lower Bound.
15. Internal Pattern Matching in Small Space and Applications.
16. Maintaining the Size of LZ77 on Semi-Dynamic Strings.
17. Minimizing the Minimizers via Alphabet Reordering.
18. Online Context-Free Recognition in OMv Time.
19. Random Wheeler Automata.
20. Reconstructing General Matching Graphs.
21. Searching 2D-Strings for Matching Frames.
22. Shortest Cover After Edit.
23. Simplified Tight Bounds for Monotone Minimal Perfect Hashing.
24. Solving the Minimal Positional Substring Cover Problem in Sublinear Space.
25. Subsequences with Generalised Gap Constraints: Upper and Lower Complexity Bounds.
26. The Rational Construction of a Wheeler DFA.
27. Tight Bounds for Compressing Substring Samples.
28. Walking on Words.
29. When Is the Normalized Edit Distance over Non-Uniform Weights a Metric?

EvoStar 2024

1. A Neural Network Based Guidance for a BRKGA: An Application to the Longest Common Square Subsequence Problem.

FUN 2024

1. Baba Is Universal.
2. Snake in Optimal Space and Time.
3. The Great Textual Hoax: Boosting Sampled String Matching with Fake Samples.

ICCS (5) 2024

1. Efficient Search Algorithms for the Restricted Longest Common Subsequence Problem.

SPIRE 2024

1. 2d Side-Sharing Tandems with Mismatches.
2. Adaptive Dynamic Bitvectors.
3. All-Pairs Suffix-Prefix on Dynamic Set of Strings.
4. Another Virtue of Wavelet Forests.
5. Bijective BWT Based Compression Schemes.
6. Bounded-Ratio Gapped String Indexing.
7. Burst Edit Distance.
8. Compressed Graph Representations for Evaluating Regular Path Queries.
9. Computing String Covers in Sublinear Time.
10. Faster Algorithms for Ranking/Unranking Bordered and Unbordered Words.
11. Faster Computation of Chinese Frequent Strings and Their Net Frequencies.
12. Faster and Simpler Online/Sliding Rightmost Lempel-Ziv Factorizations.
13. Generalization of Repetitiveness Measures for Two-Dimensional Strings.
14. Greedy Conjecture for the Shortest Common Superstring Problem and Its Strengthenings.
15. Indexing Finite-State Automata Using Forward-Stable Partitions.
16. LZ78 Substring Compression with CDAWGs.
17. Linear Time Reconstruction of Parameterized Strings from Parameterized Suffix and LCP Arrays for Constant-Sized Alphabets.
18. Logarithmic-Time Internal Pattern Matching Queries in Compressed and Dynamic Texts.
19. On Computing the Smallest Suffixient Set.
20. On the Number of Non-equivalent Parameterized Squares in a String.
21. Online Computation of String Net Frequency.
22. Quantum Algorithms for Longest Common Substring with a Gap.
23. Revisiting the Folklore Algorithm for Random Access to Grammar-Compressed Strings.
24. Simple Linear-Time Repetition Factorization.
25. Simultaneously Building and Reconciling a Synteny Tree.
26. Space-Efficient SLP Encoding for O(log N)-Time Random Access.

TAMC 2024

1. Quantum Path Parallelism: A Circuit-Based Approach to Text Searching.

ACM Trans. Algorithms 2024

1. Generic Non-recursive Suffix Array Construction.

Algorithmica 2024

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

Algorithms 2024

1. Computing RF Tree Distance over Succinct Representations.

Discret. Appl. Math. 2024

1. On arithmetically progressed suffix arrays and related Burrows-Wheeler transforms.
2. Polynomial-time equivalences and refined algorithms for longest common subsequence variants.

Inf. Comput. 2024

1. Constructing and indexing the bijective and extended Burrows-Wheeler transform.

Inf. Syst. 2024

1. CoCo-trie: Data-aware compression and indexing of strings.

J. Comput. Syst. Sci. 2024

1. The tree-child network inference problem for line trees and the shortest common supersequence problem for permutation strings.

J. Supercomput. 2024

1. Palindromes in involutive Fibonacci arrays.

Knowl. Based Syst. 2024

1. Dynamic-MLCS: Fast searching for dynamic multiple longest common subsequences in sequence stream data.

Theor. Comput. Sci. 2024

1. Faster space-efficient STR-IC-LCS computation.

VLDB J. 2024

1. Optimizing RPQs over a compact graph representation.

This site is open source. Improve this page.