StringologyTimes

PSC for Stringologist

PSC 2021

  1. Computational Substantiation of the d-step Conjecture for Distinct Squares Revisited.
  2. Searching with Extended Guard and Pivot Loop.
  3. Refined Upper Bounds on the Size of the Condensed Neighbourhood of Sequences.
  4. Counting Lyndon Subsequences.
  5. Pitfalls of Algorithm Comparison.
  6. Automata Approach to Inexact Tree Pattern Matching Using 1-degree Edit Distance.
  7. Towards an Efficient Text Sampling Approach for Exact and Approximate Matching.
  8. The n-ary Initial Literal and Literal Shuffle.

PSC 2020

  1. New Compression Schemes for Natural Number Sequences.
  2. Conversion of Finite Tree Automata to Regular Tree Expressions By State Elimination.
  3. Fast Exact Pattern Matching in a Bitstream and 256-ary Strings.
  4. Re-Pair in Small Space.
  5. Enumerative Data Compression with Non-Uniquely Decodable Codes.
  6. On Arithmetically Progressed Suffix Arrays.
  7. Simple KMP Pattern-Matching on Indeterminate Strings.
  8. Left Lyndon Tree Construction.
  9. Pointer-Machine Algorithms for Fully-Online Construction of Suffix Trees and DAWGs on Multiple Strings.
  10. Tune-up for the Dead-Zone Algorithm.
  11. Greedy versus Optimal Analysis of Bounded Size Dictionary Compression and On-the-Fly Distributed Computing.
  12. Forward Linearised Tree Pattern Matching Using Tree Pattern Border Array.
  13. Fast Practical Computation of the Longest Common Cartesian Substrings of Two Strings.
  14. Reducing Time and Space in Indexed String Matching by Characters Distance Text Sampling.

PSC 2019

  1. Algorithms to Compute the Lyndon Array Revisited.
  2. Bidirectional Adaptive Compression.
  3. Online Parameterized Dictionary Matching with One Gap.
  4. Lexicalized Syntactic Analysis by Restarting Automata.
  5. Translating Between Wavelet Tree and Wavelet Matrix Construction.
  6. Pattern Matching on Weighted Strings.
  7. A Fast SIMD-Based Chunking Algorithm.
  8. k-Abelian Pattern Matching: Revisited, Corrected, and Extended.
  9. An Improvement of the Franek-Jennings-Smyth Pattern Matching Algorithm.
  10. Selective Dynamic Compression.
  11. Computing Maximal Palindromes and Distinct Palindromes in a Trie.
  12. Optimal Time and Space Construction of Suffix Arrays and LCP Arrays for Integer Alphabets.
This site is open source. Improve this page.