StringologyTimes

LATIN for Stringologist

LATIN 2022

  1. Elastic-Degenerate String Matching with 1 Error.
  2. Near-Optimal Search Time in δ-Optimal Space.
  3. String Attractors and Infinite Words.
  4. Space-Efficient Data Structure for Next/Previous Larger/Smaller Value Queries.

LATIN 2020

  1. Batched Predecessor and Sorting with Size-Priced Information in External Memory.
  2. On the Collection of Fringe Subtrees in Random Binary Trees.
  3. Towards a Definitive Measure of Repetitiveness.
  4. Suffix Trees, DAWGs and CDAWGs for Forward and Backward Tries.

LATIN 2018

  1. Property Suffix Array with Applications.
  2. Compressed Indexing with Signature Grammars.
  3. On the Approximation Ratio of Lempel-Ziv Parsing.

LATIN 2016

  1. Compressing Bounded Degree Graphs.
  2. Linear-Time Sequence Comparison Using Minimal Absent Words & Applications.
  3. Tree Compression Using String Grammars.
  4. Bidirectional Variable-Order de Bruijn Graphs.
  5. Deterministic Sparse Suffix Sorting on Rewritable Texts.
  6. The Grandmama de Bruijn Sequence for Binary Strings.

LATIN 2014

  1. Biased Predecessor Search.
  2. Quad-K-d Trees.
  3. LZ77-Based Self-indexing with Faster Pattern Matching.
  4. Multiply Balanced k -Partitioning.

LATIN 2012

  1. Forbidden Patterns.
  2. Indexed Multi-pattern Matching.

LATIN 2010

  1. Compact Rich-Functional Binary Relation Representations.
  2. Sharp Separation and Applications to Exact and Parameterized Algorithms.
  3. Lightweight Data Indexing and Compression in External Memory.
  4. Fast Set Intersection and Two-Patterns Matching.
  5. Optimal Succinctness for Range Minimum Queries.

LATIN 2008

  1. Fully-Compressed Suffix Trees.
  2. Improved Dynamic Rank-Select Entropy-Bound Structures.

LATIN 2006

  1. Position-Restricted Substring Searching.

LATIN 2004

  1. Rotation and Lighting Invariant Template Matching.
  2. Rooted Maximum Agreement Supertrees.

LATIN 2002

  1. The Level Ancestor Problem Simplified.
  2. A Metric Index for Approximate String Matching.

LATIN 2000

  1. The LCA Problem Revisited.

LATIN 1998

  1. Fast Two-Dimensional Approximate Pattern Matching
  2. Improved Approximate Pattern Matching on Hypertext.
This site is open source. Improve this page.