StringologyTimes

LATIN for Stringologist

LATIN 2022

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

LATIN 2020

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

LATIN 2018

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

LATIN 2016

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

LATIN 2014

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

LATIN 2012

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

LATIN 2010

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

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. Rooted Maximum Agreement Supertrees.
  2. Rotation and Lighting Invariant Template Matching.

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. Improved Approximate Pattern Matching on Hypertext.
  2. Fast Two-Dimensional Approximate Pattern Matching
This site is open source. Improve this page.