StringologyTimes

WALCOM for Stringologist

WALCOM 2023

  1. Inferring Strings from Position Heaps in Linear Time.
  2. Finding the Cyclic Covers of a String.
  3. Energy Efficient Sorting, Selection and Searching.
  4. Efficient Non-isomorphic Graph Enumeration Algorithms for Subclasses of Perfect Graphs.
  5. Parity Permutation Pattern Matching.
  6. Internal Longest Palindrome Queries in Optimal Time.

WALCOM 2020

  1. Generalized Dictionary Matching Under Substring Consistent Equivalence Relations.
  2. Fast Multiple Pattern Cartesian Tree Matching.
  3. Shortest Covers of All Cyclic Shifts of a String.
  4. Faster Privacy-Preserving Computation of Edit Distance with Moves.

WALCOM 2019

  1. Applications of V-Order: Suffix Arrays, the Burrows-Wheeler Transform & the FM-index.

WALCOM 2018

  1. On Multiple Longest Common Subsequence and Common Motifs with Gaps (Extended Abstract).

WALCOM 2017

  1. A Space-Efficient Algorithm for the Dynamic DFS Problem in Undirected Graphs.

WALCOM 2015

  1. Non-repetitive Strings over Alphabet Lists.
  2. A Practical Succinct Data Structure for Tree-Like Graphs.

WALCOM 2014

  1. Alignment with Non-overlapping Inversions on Two Strings.

WALCOM 2012

  1. Linear Time Inference of Strings from Cover Arrays Using a Binary Alphabet - (Extended Abstract).

WALCOM 2011

  1. De Bruijn Sequences for the Binary Strings with Maximum Density.
  2. Efficient Top-k Queries for Orthogonal Ranges.
This site is open source. Improve this page.