StringologyTimes

IWOCA for Stringologist

IWOCA 2022

  1. Practical Space-Efficient Index for Structural Pattern Matching.
  2. Space-Efficient B Trees via Load-Balancing.
  3. Linear Time Construction of Indexable Elastic Founder Graphs.
  4. Computing Longest (Common) Lyndon Subsequences.
  5. Shortest Unique Palindromic Substring Queries in Semi-dynamic Settings.

IWOCA 2021

  1. The Tandem Duplication Distance Problem Is Hard over Bounded Alphabets.

IWOCA 2020

  1. Optimal In-place Algorithms for Basic Graph Problems.

IWOCA 2019

  1. Shortest Unique Palindromic Substring Queries on Run-Length Encoded Strings.
  2. Burrows-Wheeler Transform of Words Defined by Morphisms.
  3. Finding Periods in Cartesian Tree Matching.

IWOCA 2018

  1. An Efficient Representation of Partitions of Integers.
  2. LZ-ABT: A Practical Algorithm for α-Balanced Grammar Compression.
  3. On the Expected Number of Distinct Gapped Palindromic Factors.

IWOCA 2017

  1. How to Answer a Small Batch of RMQs or LCA Queries in Practice.
  2. Shortest Unique Palindromic Substring Queries in Optimal Time.
  3. A Faster Implementation of Online Run-Length Burrows-Wheeler Transform.
  4. Computing Abelian String Regularities Based on RLE.

IWOCA 2016

  1. Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing.
  2. Finding Gapped Palindromes Online.
  3. Partial Covering Arrays: Algorithms and Asymptotics.

IWOCA 2015

  1. Computing the BWT and the LCP Array in Constant Space.
  2. EERTREE: An Efficient Data Structure for Processing Palindromes in Strings.
  3. Longest Common Extensions in Partial Words.

IWOCA 2014

  1. A Suffix Tree Or Not a Suffix Tree?
  2. Computing Primitively-Rooted Squares and Runs in Partial Words.
  3. Fast and Simple Computations Using Prefix Tables Under Hamming and Edit Distance.

IWOCA 2013

  1. Suffix Tree of Alignment: An Efficient Index for Similar Data.
  2. An Optimal Algorithm for Computing All Subtree Repeats in Trees.
  3. Deciding Representability of Sets of Words of Equal Length in Polynomial Time.
  4. Motif Matching Using Gapped Patterns.
  5. Prefix Table Construction and Conversion.

IWOCA 2012

  1. Border Array for Structural Strings.
  2. Computing a Longest Common Palindromic Subsequence.
  3. Range Extremum Queries.
  4. Indexing Highly Repetitive Collections.
  5. A Sequential Recursive Implementation of Dead-Zone Single Keyword Pattern Matching.

IWOCA 2011

  1. Periods in Partial Words: An Algorithm.
  2. p-Suffix Sorting as Arithmetic Coding.
  3. Parameterized Longest Previous Factor.
  4. A Unifying Property for Distribution-Sensitive Priority Queues.
  5. Two Constant-Factor-Optimal Realizations of Adaptive Heapsort.

IWOCA 2010

  1. Dictionary-Symbolwise Flexible Parsing.
  2. Minimum Number of Holes in Unavoidable Sets of Partial Words of Size Three.
  3. On the Maximal Sum of Exponents of Runsin a String.
  4. Worst Case Efficient Single and Multiple String Matching in the RAM Model.
  5. Skip Lift: A Probabilistic Alternative to Red-Black Trees.

IWOCA 2009

  1. Succinct Representations of Trees.
  2. Minimax Trees in Linear Time with Applications.
  3. Lightweight Parameterized Suffix Array Construction.
  4. LPF Computation Revisited.
This site is open source. Improve this page.