StringologyTimes

SEA for Stringologist

SEA 2022

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

SEA 2021

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

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. Pattern Discovery in Colored Strings.
  5. Zipping Segment Trees.

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

SEA 2016

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

SEA 2015

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

SEA 2014

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

SEA 2013

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

SEA 2012

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

SEA 2011

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

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.