StringologyTimes

SOFSEM for Stringologist

SOFSEM 2023

  1. Space-Efficient STR-IC-LCS Computation.
  2. The k-Centre Problem for Classes of Cyclic Words.

SOFSEM 2021

  1. Blocksequences of k-local Words.
  2. A Normal Sequence Compressed by PPM* But Not by Lempel-Ziv 78.
  3. Novel Results on the Number of Runs of the Burrows-Wheeler-Transform.

SOFSEM 2020

  1. Minimal Unique Substrings and Minimal Absent Words in a Sliding Window.
  2. Fast Indexes for Gapped Pattern Matching.
  3. Faster STR-EC-LCS Computation.
  4. Parallel Duel-and-Sweep Algorithm for the Order-Preserving Pattern Matching.

SOFSEM 2019

  1. On Infinite Prefix Normal Words.

SOFSEM 2018

  1. New Variants of Pattern Matching with Constants and Variables.
  2. Longest Common Prefixes with k-Mismatches and Applications.
  3. Duel and Sweep Algorithm for Order-Preserving Pattern Matching.

SOFSEM 2017

  1. Longest Common Subsequence in at Least k Length Order-Isomorphic Substrings.
  2. Computing Longest Single-arm-gapped Palindromes in a String.
  3. Edit-Distance Between Visibly Pushdown Languages.

SOFSEM 2016

  1. Subsequence Automata with Default Transitions.
  2. Compacting a Dynamic Edit Distance Table by RLE Compression.

SOFSEM 2014

  1. Shortest Unique Substrings Queries in Optimal Time.

SOFSEM 2013

  1. Permuted Pattern Matching on Multi-track Strings.

SOFSEM 2012

  1. Computing q-Gram Non-overlapping Frequencies on SLP Compressed Texts.

SOFSEM 2011

  1. An Improved B+ Tree for Flash File Systems.
  2. In-Place Sorting.

SOFSEM 2010

  1. Fast Arc-Annotated Subsequence Matching in Linear Space.
  2. Efficient Algorithms for Two Extensions of LPF Table: The Power of Suffix Arrays.
  3. Fast and Compact Prefix Codes.
  4. Dynamic Edit Distance Table under a General Weighted Cost Function.

SOFSEM 2008

  1. Computing Longest Common Substring and All Palindromes from Compressed Strings.
This site is open source. Improve this page.