StringologyTimes

LATA for Stringologist

LATA 2021

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

LATA 2020

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

LATA 2019

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

LATA 2018

  1. Bubble-Flip - A New Generation Algorithm for Prefix Normal Words.
  2. On Periodicity Lemma for Partial 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. Optimal Bounds for Computing \alpha α -gapped Repeats.
  2. On Del-Robust Primitive Partial Words with One Hole.

LATA 2015

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

LATA 2013

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

LATA 2012

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

LATA 2011

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

LATA 2010

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