StringologyTimes

LATA for Stringologist

LATA 2021

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

LATA 2020

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

LATA 2019

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

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. Integrated Encryption in Dynamic Arithmetic Compression.
  3. Two-Dimensional Palindromes and Their Properties.

LATA 2016

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

LATA 2015

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

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. Abelian Square-Free Partial Words.
  6. Hard Counting Problems for Partial Words.
  7. Grammar-Based Compression in a Streaming Model.

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.