StringologyTimes
LATIN for Stringologist
LATIN 2022
Elastic-Degenerate String Matching with 1 Error.
Near-Optimal Search Time in δ-Optimal Space.
String Attractors and Infinite Words.
Space-Efficient Data Structure for Next/Previous Larger/Smaller Value Queries.
LATIN 2020
Batched Predecessor and Sorting with Size-Priced Information in External Memory.
On the Collection of Fringe Subtrees in Random Binary Trees.
Towards a Definitive Measure of Repetitiveness.
Suffix Trees, DAWGs and CDAWGs for Forward and Backward Tries.
LATIN 2018
Property Suffix Array with Applications.
Compressed Indexing with Signature Grammars.
On the Approximation Ratio of Lempel-Ziv Parsing.
LATIN 2016
Compressing Bounded Degree Graphs.
Linear-Time Sequence Comparison Using Minimal Absent Words & Applications.
Tree Compression Using String Grammars.
Bidirectional Variable-Order de Bruijn Graphs.
Deterministic Sparse Suffix Sorting on Rewritable Texts.
The Grandmama de Bruijn Sequence for Binary Strings.
LATIN 2014
Biased Predecessor Search.
Quad-K-d Trees.
LZ77-Based Self-indexing with Faster Pattern Matching.
Multiply Balanced k -Partitioning.
LATIN 2012
Forbidden Patterns.
Indexed Multi-pattern Matching.
LATIN 2010
Compact Rich-Functional Binary Relation Representations.
Sharp Separation and Applications to Exact and Parameterized Algorithms.
Lightweight Data Indexing and Compression in External Memory.
Fast Set Intersection and Two-Patterns Matching.
Optimal Succinctness for Range Minimum Queries.
LATIN 2008
Fully-Compressed Suffix Trees.
Improved Dynamic Rank-Select Entropy-Bound Structures.
LATIN 2006
Position-Restricted Substring Searching.
LATIN 2004
Rotation and Lighting Invariant Template Matching.
Rooted Maximum Agreement Supertrees.
LATIN 2002
The Level Ancestor Problem Simplified.
A Metric Index for Approximate String Matching.
LATIN 2000
The LCA Problem Revisited.
LATIN 1998
Fast Two-Dimensional Approximate Pattern Matching
Improved Approximate Pattern Matching on Hypertext.