StringologyTimes

LATA for Stringologist

LATA 2021

  1. Cadences in Grammar-Compressed Strings.
  2. Succinct Representations for (Non)Deterministic Finite Automata.

LATA 2020

  1. On Collapsing Prefix Normal Words.
  2. Lyndon Words versus Inverse Lyndon Words: Queries on Suffixes and Bordered Words.

LATA 2019

  1. Recurrence in Multidimensional Words.
  2. Automata over Infinite Sequences of Reals.
  3. Regular Matching and Inclusion on Compressed Tree Patterns with Context Variables.
  4. On the Maximum Number of Distinct Palindromic Sub-arrays.
  5. Generalized Register Context-Free Grammars.
  6. Palindromic Subsequences in Finite Words.
  7. Efficient Representation and Counting of Antipower Factors in Words.

LATA 2018

  1. On Periodicity Lemma for Partial Words.
  2. Bubble-Flip - A New Generation Algorithm for Prefix Normal Words.

LATA 2017

  1. Efficient Pattern Matching in Elastic-Degenerate Texts.
  2. Two-Dimensional Palindromes and Their Properties.
  3. Integrated Encryption in Dynamic Arithmetic Compression.

LATA 2016

  1. On Del-Robust Primitive Partial Words with One Hole.
  2. Optimal Bounds for Computing \alpha α -gapped Repeats.

LATA 2015

  1. Coverability in Two Dimensions.
  2. Online Computation of Abelian Runs.
  3. Construction of a de Bruijn Graph for Assembly from a Truncated Suffix Tree.
  4. Backward Linearised Tree Pattern Matching.
  5. On the Number of Closed Factors in a Word.
  6. On the Language of Primitive Partial Words.
  7. Compressed Data Structures for Range Searching.
  8. Equation x^iy^jx^k=u^iv^ju^k in Words.
  9. Average Linear Time and Compressed Space Construction of the Burrows-Wheeler Transform.
  10. Average-Case Optimal Approximate Circular String Matching.
  11. Square-Free Words over Partially Commutative Alphabets.

LATA 2013

  1. On the Number of Unbordered Factors.
  2. Linear-Time Version of Holub’s Algorithm for Morphic Imprimitivity Testing.

LATA 2012

  1. A Faster Grammar-Based Self-index.
  2. Longest Common Extensions via Fingerprinting.

LATA 2011

  1. Improved Alignment Based Algorithm for Multilingual Text Compression.
  2. Unary Pattern Avoidance in Partial Words Dense with Holes.

LATA 2010

  1. Extending Stochastic Context-Free Grammars for an Application in Bioinformatics.
  2. A Fast Longest Common Subsequence Algorithm for Similar Strings.
  3. Avoidable Binary Patterns in Partial Words.
  4. Choosing Word Occurrences for the Smallest Grammar Problem.
  5. Grammar-Based Compression in a Streaming Model.
  6. Hard Counting Problems for Partial Words.
  7. Abelian Square-Free Partial Words.

LATA 2009

  1. Counting Parameterized Border Arrays for a Binary Alphabet.
  2. A Series of Run-Rich Strings.

LATA 2008

  1. 2-Synchronizing Words.
This site is open source. Improve this page.