StringologyTimes

DCC for Stringologist

DCC 2023

  1. JARVIS2: a data compressor for large genome sequences.
  2. Augmented Thresholds for MONI.
  3. Model Compression for Data Compression: Neural Network Based Lossless Compressor Made Practical.
  4. Permutation coding using divide-and-conquer strategy.
  5. Practical Implementations of Compressed RAM.
  6. Computing matching statistics on Wheeler DFAs.
  7. LZ4r - A New Fast Compression Algorithm for High-Speed Data Storage Systems.
  8. Constructing the CDAWG CFG using LCP-Intervals.
  9. FM-Directories: Extending the Burrows-Wheeler Transform for String Labeled Vertex Graphs of (Almost) Arbitrary Topology.
  10. Measuring the Similarity of Files by Data Compression.
  11. Computing the optimal BWT of very large string collections.
  12. Contextual Pattern Matching in Less Space.
  13. Bit-Parallel (Compressed) Wavelet Tree Construction.
  14. RNA secondary structures: from ab initio prediction to better compression, and back.
  15. SnappyR: A New High-Speed Lossless Data Compression Algorithm.
  16. Recursive Prefix-Free Parsing for Building Big BWTs.

DCC 2022

  1. Burrows-Wheeler Transform on Purely Morphic Words.
  2. Succinct Data Structure for Path Graphs.
  3. x3: Lossless Data Compressor.
  4. On Dynamic Bitvector Implementations.
  5. Linear-time Minimization of Wheeler DFAs.
  6. Simple Worst-Case Optimal Adaptive Prefix-Free Coding.
  7. FM-Indexing Grammars Induced by Suffix Sorting for Long Patterns.
  8. Fast Coding of Haar Wavelet Trees.
  9. CSTs for Terabyte-Sized Data.
  10. Graphs can be succinctly indexed for pattern matching in $O(\vert E\vert ^{2}+\vert V\vert ^{5/2})$ time.
  11. A Benchmark of Entropy Coders for the Compression of Genome Sequencing Data.
  12. RLBWT Tricks.
  13. Computing Lexicographic Parsings.
  14. Lower Bounds for Lexicographical DFS Data Structures.
  15. Converting RLBWT to LZ77 in smaller space.
  16. On different variants of the Burrows-Wheeler-Transform of string collections.
  17. Computing Matching Statistics on Repetitive Texts.
  18. Compressing the Tree of Canonical Huffman Coding.
  19. HOLZ: High-Order Entropy Encoding of Lempel-Ziv Factor Distances.
  20. Selective Weighted Adaptive Coding.

DCC 2021

  1. PHONI: Streamed Matching Statistics with Multi-Genome References.
  2. Improving Run Length Encoding by Preprocessing.
  3. Succinct representations of Intersection Graphs on a Circle.
  4. A Disk-Based Index for Trajectories with an In-Memory Compressed Cache.
  5. Neural Networks Optimally Compress the Sawbridge.
  6. Backward Weighted Coding.
  7. Parallel Processing of Grammar Compression.
  8. Compact Representation of Spatial Hierarchies and Topological Relationships.
  9. Smaller RLZ-Compressed Suffix Arrays.
  10. On Elias-Fano for Rank Queries in FM-Indexes.
  11. DZip: improved general-purpose loss less compression based on novel neural network modeling.
  12. Succinct Data Structures for Small Clique-Width Graphs.
  13. A grammar compressor for collections of reads with applications to the construction of the BWT.
  14. End-to-End optimized image compression for machines, a study.
  15. On Random Editing in LZ-End.
  16. ndzip: A High-Throughput Parallel Lossless Compressor for Scientific Data.
  17. Improved LZ77 Compression.
  18. Approximate Hashing for Bioinformatics.
  19. Efficiently Merging r-indexes.
  20. Accelerating Knuth-Morris-Pratt String Matching over LZ77 Compressed Text.

DCC 2020

  1. Semantrix: A Compressed Semantic Matrix.
  2. Grammar Compression with Probabilistic Context-Free Grammar.
  3. Revisiting Compact RDF Stores Based on k2-Trees.
  4. Pattern Search in Grammar-Compressed Graphs.
  5. Decompressing Lempel-Ziv Compressed Text.
  6. Towards Better Compressed Representations.
  7. c-Trie++: A Dynamic Trie Tailored for Fast Prefix Searches.
  8. Bitvectors with Runs and the Successor/Predecessor Problem.
  9. Edge Minimization in de Bruijn Graphs.
  10. Practical Repetition-Aware Grammar Compression.
  11. On Dynamic Succinct Graph Representations.
  12. Approximating Optimal Bidirectional Macro Schemes.
  13. Re-Pair in Small Space.
  14. Compact Representation of Graphs with Small Bandwidth and Treedepth.
  15. Compressing and Randomly Accessing Sequences (note).

DCC 2019

  1. On the Randomness of Compressed Data.
  2. RePair in Compressed Space and Time.
  3. Practical Indexing of Repetitive Collections Using Relative Lempel-Ziv.
  4. On Lempel-Ziv Decompression in Small Space.
  5. Space-Efficient Computation of the Burrows-Wheeler Transform.
  6. Constructing Antidictionaries in Output-Sensitive Space.
  7. MR-RePair: Grammar Compression Based on Maximal Repeats.
  8. Better Than Optimal Huffman Coding?
  9. Numerical Pattern Mining Through Compression.
  10. Multidimensional Compression with Pattern Matching.
  11. BWT Tunnel Planning is Hard But Manageable.
  12. Vectorizing Fast Compression.
  13. Light Field Image Compression with Random Access.
  14. Regular Expression Search on Compressed Text.
  15. Parameterized Text Indexing with One Wildcard.
  16. Selective Dynamic Compression.
  17. A New Technique for Lossless Compression of Color Images Based on Hierarchical Prediction, Inversion and Context Adaptive Coding.
  18. LZRR: LZ77 Parsing with Right Reference.
  19. Generalized Word Equations: A New Approach to Data Compresion.
  20. Tunneling on Wheeler Graphs.
  21. A Compact Representation of Raster Time Series.
  22. Dv2v: A Dynamic Variable-to-Variable Compressor.

DCC 2018

  1. Run Compressed Rank/Select for Large Alphabets.
  2. Delta-Huffman Coding of Unbounded Integers.
  3. Optimal In-Place Suffix Sorting.
  4. Compressed Hierarchical Clustering.
  5. K-Means Algorithm Over Compressed Binary Data.
  6. Two-Dimensional Block Trees.
  7. Constant Delay Traversal of Compressed Graphs.
  8. Compact Representations of Event Sequences.
  9. Lapped Transforms Based Image Recovery for Block Compressed Sensing.
  10. Efficient Processing of top-K Vector-Raster Queries Over Compressed Data.
  11. A Grammar Compression Algorithm Based on Induced Suffix Sorting.
  12. Practical Succinct Text Indexes in External Memory.
  13. Compaction of Church Numerals for Higher-Order Compression.
  14. Exploiting Computation-Friendly Graph Compression Methods for Adjacency-Matrix Multiplication.
  15. LZ77 Like Lossy Transformation of Quality Scores.
  16. Compact Encoding for Galled-Trees and Its Applications.
  17. Fibonacci Based Compressed Suffix Array.
  18. A Dynamic Compressed Self-Index for Highly Repetitive Text Collections.
  19. Fast and Efficient Compression of Next Generation Sequencing Data.
  20. Engineering Compressed Static Functions.
  21. The Bits Between Proteins.
  22. A Hybrid Approach for Wind Tunnel Data Compression.

DCC 2017

  1. Marlin: A High Throughput Variable-to-Fixed Codec Using Plurally Parsable Dictionaries.
  2. A Compact Index for Order-Preserving Pattern Matching.
  3. Making Compression Algorithms for Unicode Text.
  4. Content Adaptive Embedded Compression.
  5. LZ-End Parsing in Compressed Space.
  6. Stabbing Colors in One Dimension.
  7. Space-Efficient Re-Pair Compression.
  8. Improved Parallel Construction of Wavelet Trees and Rank/Select Structures.
  9. Improvements on Re-Pair Grammar Compressor.
  10. Optimize Genomics Data Compression with Hardware Accelerator.
  11. Complementary Contextual Models with FM-Index for DNA Compression.
  12. Compressed Dynamic Range Majority Data Structures.
  13. Streaming K-Mismatch with Error Correcting and Applications.
  14. A Succinct Data Structure for Multidimensional Orthogonal Range Searching.
  15. Full Compressed Affix Tree Representations.
  16. Symmetry-Compressible Graphs.

DCC 2016

  1. Grammatical Ziv-Lempel Compression: Achieving PPM-Class Text Compression Ratios with LZ-Class Decompression Speed.
  2. Self-Indexing RDF Archives.
  3. Efficient Environmental Temperature Monitoring Using Compressed Sensing.
  4. Induced Suffix Sorting for String Collections.
  5. Shortest DNA Cyclic Cover in Compressed Space.
  6. CS2A: A Compressed Suffix Array-Based Method for Short Read Alignment.
  7. Positional Inverted Self-index.
  8. Timeliness in Lossless Block Coding.
  9. A Simple and Efficient Approach for Adaptive Entropy Coding over Large Alphabets.
  10. Lempel-Ziv Computation in Compressed Space (LZ-CICS).
  11. Linear Time Succinct Indexable Dictionary Construction with Applications.
  12. When Less is More - Using Restricted Repetition Search in Fast Compressors.
  13. Lossy Compression of Unordered Rooted Trees.
  14. Approximate String Matching for Self-Indexes.
  15. Burrows-Wheeler Transform for Terabases.
  16. Efficient Compression of Genomic Sequences.
  17. Computing LZ77 in Run-Compressed Space.
  18. Quick Access to Compressed Data in Storage Systems.
  19. Analysis of a Rewriting Compression System for Flash Memory.
  20. Parallel Lightweight Wavelet Tree, Suffix Array and FM-Index Construction.
  21. A Space Efficient Direct Access Data Structure.
  22. Online Grammar Transformation Based on Re-Pair Algorithm.
  23. Improved Range Minimum Queries.
  24. Hardware Based Compression in Big Data.
  25. Small Polygon Compression.
  26. Compressing Combinatorial Objects.
  27. Faster, Minuter.

DCC 2015

  1. Serializing RDF in Compressed Space.
  2. Compression for Similarity Identification: Computing the Error Exponent.
  3. Queries on LZ-Bounded Encodings.
  4. OnlineRePair: A Recompressor for XML Structures.
  5. Geometric Compression of Orientation Signals for Fast Gesture Analysis.
  6. Document Counting in Compressed Space.
  7. On Probability Estimation via Relative Frequencies and Discount.
  8. Efficient Set Operations over k2-Trees.
  9. Smaller and Faster: Parallel Processing of Compressed Graphs with Ligra+.
  10. Range Selection Queries in Data Aware Space and Time.
  11. Improving PPM with Dynamic Parameter Updates.
  12. Universal Compression of Memoryless Sources over Large Alphabets via Independent Component Analysis.
  13. Compressing Yahoo Mail.
  14. Parallel Wavelet Tree Construction.
  15. Compression-Aware Algorithms for Massive Datasets.
  16. Compression of Next Generation Sequencing Data.
  17. Incremental Locality and Clustering-Based Compression.
  18. Enhanced Direct Access to Huffman Encoded Files.
  19. Data Compression Cost Optimization.
  20. Variable-Order de Bruijn Graphs.
  21. Faster Compressed Quadtrees.
  22. Bi-Directional Context Modeling with Combinatorial Structuring for Genome Sequence Compression.

DCC 2014

  1. Fully Online Grammar Compression in Constant Space.
  2. Combining Deduplication and Delta Compression to Achieve Low-Overhead Data Reduction on Backup Datasets.
  3. Hybrid Compression of Bitvectors for the FM-Index.
  4. Compressing Similar Biological Sequences Using FM-Index.
  5. LZ-Compressed String Dictionaries.
  6. Relative Lempel-Ziv with Constant-Time Random Access.
  7. Space Efficient Linear Time Lempel-Ziv Factorization for Small Alphabets.
  8. Universal Text Preprocessing and Postprocessing for PPM Using Alphabet Adjustment.
  9. Information Profiles for DNA Pattern Discovery.
  10. Compressing Sets and Multisets of Sequences.
  11. Lempel-Ziv Parsing in External Memory.
  12. Direct Access to Variable-to-Fixed Length Codes with a Succinct Index.
  13. Fast Fully-Compressed Suffix Trees.
  14. Towards Markup-Aware Text Compression.
  15. Interleaved K2-Tree: Indexing and Navigating Ternary Relations.
  16. Compression Schemes for Similarity Queries.
  17. Adaptive Dictionary Sharing Method for Re-Pair Algorithm.
  18. A Practical Implementation of Compressed Suffix Arrays with Applications to Self-Indexing.
  19. Alignment Free Sequence Similarity with Bounded Hamming Distance.
  20. Entropy Reduction Using Context Transformations.
  21. Better Compression through Better List Update Algorithms.
  22. Boosting the Compression of Rewriting on Flash Memory.

DCC 2013

  1. Practical Parallel Lempel-Ziv Factorization.
  2. Partition Tree Weighting.
  3. Random Extraction from Compressed Data - A Practical Study.
  4. Compressed Parameterized Pattern Matching.
  5. Quadratic Similarity Queries on Compressed Data.
  6. Effective Variable-Length-to-Fixed-Length Coding via a Re-Pair Algorithm.
  7. Faster Compressed Top-k Document Retrieval.
  8. Space-Efficient Construction Algorithm for the Circular Suffix Tree.
  9. Algorithms for Compressed Inputs.
  10. A Simple Online Competitive Adaptation of Lempel-Ziv Compression with Efficient Random Access Support.
  11. Variable-to-Fixed-Length Encoding for Large Texts Using Re-Pair Algorithm with Shared Dictionaries.
  12. Computing Convolution on Grammar-Compressed Text.
  13. An Adaptive Difference Distribution-Based Coding with Hierarchical Tree Structure for DNA Sequence Compression.
  14. Texture Compression.
  15. The Rightmost Equal-Cost Position Problem.
  16. Compressing Huffman Models on Large Alphabets.
  17. Faster Compact Top-k Document Retrieval.
  18. From Run Length Encoding to LZ78 and Back Again.
  19. Simpler and Faster Lempel Ziv Factorization.

DCC 2012

  1. Fast Construction of Nearly-Optimal Prefix Codes without Probability Sorting.
  2. Differentially Encoded Search Trees.
  3. Compressed Dynamic Binary Relations.
  4. Gipfeli - High Speed Compression Algorithm.
  5. Fast Insertion and Deletion in Compressed Texts.
  6. Mixing Strategies in Data Compression.
  7. A Cuckoo Hashing Variant with Improved Memory Utilization and Insertion Time.
  8. Adaptive Context Tree Weighting.
  9. Slashing the Time for BWT Inversion.

DCC 2011

  1. Color Image Compression Using a Learned Dictionary of Pairs of Orthonormal Bases.
  2. Coding of Sets of Words.
  3. On Performance of Compressed Pattern Matching on VF Codes.
  4. Improving PPM Algorithm Using Dictionaries.
  5. Tree Structure Compression with RePair.
  6. Deplump for Streaming Data.
  7. Compressed Context Modeling for Text Compression.
  8. Compressed Index for Property Matching.
  9. Sequence Similarity by Gapped LZW.
  10. Error Recovery Method for PPM Compressed Data.
  11. Mixing Deduplication and Compression on Active Data Sets.
  12. Compressed Property Suffix Trees.
  13. Search and Modification in Compressed Texts.
  14. Sliding Window Update Using Suffix Arrays.
  15. The String-to-Dictionary Matching Problem.
  16. Lossless Data Compression Testbed: ExCom and Prague Corpus.

DCC 2010

  1. A Pseudo-Random Number Generator Based on LZSS.
  2. Neural Markovian Predictive Compression: An Algorithm for Online Lossless Data Compression.
  3. Lossless Compression of Maps, Charts, and Graphs via Color Separation.
  4. gFPC: A Self-Tuning Compression Algorithm.
  5. Local Modeling for WebGraph Compression.
  6. Xampling: Analog Data Compression.
  7. Modelling Parallel Texts for Boosting Compression.
  8. Lossless Data Compression via Substring Enumeration.
  9. Bidirectional Delta Files.
  10. Optimum String Match Choices in LZSS.
  11. A Similarity Measure Using Smallest Context-Free Grammars.
  12. Advantages of Shared Data Structures for Sequences of Balanced Parentheses.
  13. Efficient Algorithms for Constructing Optimal Bi-directional Context Sets.
  14. A New Searchable Variable-to-Variable Compressor.
  15. On Computation of Performance Bounds of Optimal Index Assignment.
  16. File-Size Preserving LZ Encoding for Reversible Data Embedding.
  17. I/O-Efficient Compressed Text Indexes: From Theory to Practice.
  18. LZ77-Like Compression with Fast Random Access.

DCC 2009

  1. Suffix Tree Based VF-Coding for Compressed Pattern Matching.
  2. Low-Memory Adaptive Prefix Coding.

DCC 2008

  1. Re-pair Achieves High-Order Entropy.
  2. Word-Based Statistical Compressors as Natural Language Compression Boosters.
  3. On Self-Indexing Images - Image Compression with Added Value.
  4. All-Match LZ77 Bit Recycling.
  5. List Update Algorithms for Data Compression.

DCC 2007

  1. Simple Linear-Time Off-Line Text Compression by Longest-First Substitution.
  2. Compressed Delta Encoding for LZSS Encoded Files.
  3. Bit Recycling with Prefix Codes.

DCC 2006

  1. Modeling Delta Encoding of Compressed Files.
  2. Compressed Data Structures: Dictionaries and Data-Aware Measures.

DCC 2005

  1. The Performance of Linear Time Suffix Sorting Algorithms.
  2. Real-Time Traversal in Grammar-Based Compressed Files.
  3. Compressed Pattern Matching in JPEG Images.

DCC 2003

  1. In-Place Differential File Compression.

DCC 2002

  1. Searching in Compressed Dictionaries.
This site is open source. Improve this page.