StringologyTimes
Papers for stringologist (2024)
CALDAM(2024)
[dblp]
CPM(2024)
[dblp]
EvoStar(2024)
[dblp]
FUN(2024)
[dblp]
ICCS (5)(2024)
[dblp]
TAMC(2024)
[dblp]
ACM Trans. Algorithms(2024)
[dblp]
Algorithmica(2024)
[dblp]
Algorithms(2024)
[dblp]
Inf. Comput.(2024)
[dblp]
Inf. Syst.(2024)
[dblp]
Knowl. Based Syst.(2024)
[dblp]
Theor. Comput. Sci.(2024)
[dblp]
VLDB J.(2024)
[dblp]
Contents
CALDAM 2024
Consecutive Occurrences with Distance Constraints.
CPM 2024
A Class of Heuristics for Reducing the Number of BWT-Runs in the String Ordering Problem.
A Data Structure for the Maximum-Sum Segment Problem with Offsets.
Algorithms for Galois Words: Detection, Factorization, and Rotation.
BAT-LZ out of hell.
Closing the Gap: Minimum Space Optimal Time Distance Labeling Scheme for Interval Graphs.
Computing the LCP Array of a Labeled Graph.
Connecting de Bruijn Graphs.
Construction of Sparse Suffix Trees and LCE Indexes in Optimal Time and Space.
Efficient Construction of Long Orientable Sequences.
Exploiting New Properties of String Net Frequency for Efficient Computation.
Faster Sliding Window String Indexing in Streams.
Finding Diverse Strings and Longest Common Subsequences in a Graph.
Front Matter, Table of Contents, Preface, Conference Organization.
Hairpin Completion Distance Lower Bound.
Internal Pattern Matching in Small Space and Applications.
Maintaining the Size of LZ77 on Semi-Dynamic Strings.
Minimizing the Minimizers via Alphabet Reordering.
Online Context-Free Recognition in OMv Time.
Random Wheeler Automata.
Reconstructing General Matching Graphs.
Searching 2D-Strings for Matching Frames.
Shortest Cover After Edit.
Simplified Tight Bounds for Monotone Minimal Perfect Hashing.
Solving the Minimal Positional Substring Cover Problem in Sublinear Space.
Subsequences with Generalised Gap Constraints: Upper and Lower Complexity Bounds.
The Rational Construction of a Wheeler DFA.
Tight Bounds for Compressing Substring Samples.
Walking on Words.
When Is the Normalized Edit Distance over Non-Uniform Weights a Metric?
EvoStar 2024
A Neural Network Based Guidance for a BRKGA: An Application to the Longest Common Square Subsequence Problem.
FUN 2024
Baba Is Universal.
Snake in Optimal Space and Time.
The Great Textual Hoax: Boosting Sampled String Matching with Fake Samples.
ICCS (5) 2024
Efficient Search Algorithms for the Restricted Longest Common Subsequence Problem.
TAMC 2024
Quantum Path Parallelism: A Circuit-Based Approach to Text Searching.
ACM Trans. Algorithms 2024
Generic Non-recursive Suffix Array Construction.
Algorithmica 2024
Pattern Masking for Dictionary Matching: Theory and Practice.
Algorithms 2024
Computing RF Tree Distance over Succinct Representations.
Inf. Comput. 2024
Constructing and indexing the bijective and extended Burrows-Wheeler transform.
Inf. Syst. 2024
CoCo-trie: Data-aware compression and indexing of strings.
Knowl. Based Syst. 2024
Dynamic-MLCS: Fast searching for dynamic multiple longest common subsequences in sequence stream data.
Theor. Comput. Sci. 2024
Faster space-efficient STR-IC-LCS computation.
VLDB J. 2024
Optimizing RPQs over a compact graph representation.