StringologyTimes

LATIN for Stringologist

LATIN 2022

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

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. Property Suffix Array with Applications.
  3. On the Approximation Ratio of Lempel-Ziv Parsing.

LATIN 2016

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

LATIN 2014

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

LATIN 2012

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

LATIN 2010

  1. Fast Set Intersection and Two-Patterns Matching.
  2. Lightweight Data Indexing and Compression in External Memory.
  3. Sharp Separation and Applications to Exact and Parameterized Algorithms.
  4. Compact Rich-Functional Binary Relation Representations.
  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. A Metric Index for Approximate String Matching.
  2. The Level Ancestor Problem Simplified.

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.