StringologyTimes

SEA for Stringologist

SEA 2022

  1. Computing Maximal Unique Matches with the r-Index.
  2. RLBWT Tricks.

SEA 2021

  1. Engineering Predecessor Data Structures for Dynamic Integer Sets.
  2. Document Retrieval Hacks.

SEA 2020

  1. Fast and Simple Compact Hashing via Bucketing.
  2. Fast and Linear-Time String Matching Algorithms Based on the Distances of q-Gram Occurrences.
  3. Indexing Compressed Text: A Tale of Time and Space (Invited Talk).
  4. Zipping Segment Trees.
  5. Pattern Discovery in Colored Strings.

SEA 2018

  1. Dictionary Matching in Elastic-Degenerate Texts with Applications in Searching VCF Files On-line.
  2. Fast matching statistics in small space.

SEA 2017

  1. Engineering External Memory LCP Array Construction: Parallel, In-Place and Large Alphabet.
  2. A Framework of Dynamic Data Structures for String Processing.
  3. Fast and Scalable Minimal Perfect Hashing for Massive Key Sets.
  4. Online Construction of Wavelet Trees.
  5. The Quantile Index - Succinct Self-Index for Top-k Document Retrieval.
  6. Compression with the tudocomp Framework.
  7. Practical Range Minimum Queries Revisited.

SEA 2016

  1. Practical Dynamic Entropy-Compressed Bitvectors with Applications.
  2. Lempel-Ziv Decoding in External Memory.
  3. CHICO: A Compressed Hybrid Index for Repetitive Collections.
  4. Practical Variable Length Gap Pattern Matching.
  5. Fast Scalable Construction of (Minimal Perfect Hash) Functions.
  6. Worst-Case-Efficient Dynamic Arrays in Practice.

SEA 2015

  1. A Bulk-Parallel Priority Queue in External Memory with STXXL.
  2. Huffman Codes versus Augmented Non-Prefix-Free Codes.
  3. Tree Compression with Top Trees Revisited.
  4. Parallel Construction of Succinct Trees.

SEA 2014

  1. DenseZDD: A Compact and Fast Index for Families of Sets.
  2. LCP Array Construction in External Memory.
  3. From Theory to Practice: Plug and Play with Succinct Data Structures.
  4. Approximate Online Matching of Circular Strings.
  5. Faster Compressed Suffix Trees for Repetitive Text Collections.
  6. Efficient Representation for Online Suffix Tree Construction.
  7. Order-Preserving Matching with Filtration.
  8. Efficient Wavelet Tree Construction and Querying for Multicore Architectures.
  9. Retrieval and Perfect Hashing Using Fingerprinting.
  10. Improved and Extended Locating Functionality on Compressed Suffix Arrays.
  11. Improved ESP-index: A Practical Self-index for Highly Repetitive Texts.

SEA 2013

  1. Lightweight Lempel-Ziv Parsing.
  2. Space-Efficient, High-Performance Rank and Select Structures on Uncompressed Bit Sequences.

SEA 2012

  1. Branch Mispredictions Don’t Affect Mergesort.
  2. Space Efficient Modifications to Structator - A Fast Index-Based Search Tool for RNA Sequence-Structure Patterns.
  3. Dynamizing Succinct Tree Representations.
  4. Space-Efficient Top-k Document Retrieval.
  5. Fast, Small, Simple Rank/Select on Bitmaps.

SEA 2011

  1. Compressed String Dictionaries.
  2. Practical Compressed Document Retrieval.
  3. Online Dictionary Matching with Variable-Length Gaps.
  4. An Empirical Evaluation of Extendible Arrays.

SEA 2010

  1. Practical Compressed Suffix Trees.
  2. Bit-Parallel Search Algorithms for Long Patterns.
  3. Experiments on Union-Find Algorithms for the Disjoint-Set Data Structure.

SEA 2009

  1. Broadword Computing and Fibonacci Code Speed Up Compressed Suffix Arrays.
  2. An Application of Self-organizing Data Structures to Compression.
This site is open source. Improve this page.