StringologyTimes

Papers for stringologist (2013)

• ALENEX(2013) [dblp]
• CIAA(2013) [dblp]
• CIAC(2013) [dblp]
• CPM(2013) [dblp]
• CSR(2013) [dblp]
• CiE(2013) [dblp]
• DCC(2013) [dblp]
• Developments in Language Theory(2013) [dblp]
• ESA(2013) [dblp]
• ICALP (1)(2013) [dblp]
• ICCS(2013) [dblp]
• IEEE BigData(2013) [dblp]
• ISAAC(2013) [dblp]
• IWOCA(2013) [dblp]
• Information Theory, Combinatorics, and Search Theory(2013) [dblp]
• LATA(2013) [dblp]
• MFCS(2013) [dblp]
• MICRO(2013) [dblp]
• PPAM (2)(2013) [dblp]
• SEA(2013) [dblp]
• SIGIR(2013) [dblp]
• SODA(2013) [dblp]
• SOFSEM(2013) [dblp]
• SPIRE(2013) [dblp]
• STACS(2013) [dblp]
• WABI(2013) [dblp]

• WADS(2013) [dblp]

• ACM Comput. Surv.(2013) [dblp]
• ACM J. Exp. Algorithmics(2013) [dblp]
• ACM Trans. Algorithms(2013) [dblp]
• Algorithmica(2013) [dblp]
• Algorithms(2013) [dblp]
• Algorithms Mol. Biol.(2013) [dblp]
• BMC Bioinform.(2013) [dblp]
• Eur. J. Comb.(2013) [dblp]
• IEICE Trans. Inf. Syst.(2013) [dblp]
• Inf. Comput.(2013) [dblp]
• Inf. Process. Manag.(2013) [dblp]
• Inf. Syst.(2013) [dblp]
• Int. J. Comput. Biol. Drug Des.(2013) [dblp]
• Int. J. Comput. Geom. Appl.(2013) [dblp]
• J. Discrete Algorithms(2013) [dblp]
• SIAM J. Comput.(2013) [dblp]
• Theor. Comput. Sci.(2013) [dblp]

Contents

ALENEX 2013

1. Fast Packed String Matching for Short Patterns.
2. Inducing Suffix and Lcp Arrays in External Memory.
3. Lempel-Ziv factorization: Simple, fast, practical.

CIAA 2013

1. Compressed Automata for Dictionary Matching.

CIAC 2013

1. Average Optimal String Matching in Packed Strings.

CPM 2013

1. A Succinct Grammar Compression.
2. Compact q-Gram Profiling of Compressed Strings.
3. Converting SLP to LZ78 in almost Linear Time.
4. Document Listing on Repetitive Collections.
5. Efficient Lyndon Factorization of Grammar Compressed Text.
6. Fast Algorithm for Partial Covers in Words.
7. Linear Time Lempel-Ziv Factorization: Simple, Fast, Small.
8. New Algorithms for Position Heaps.
9. On Minimal and Maximal Suffixes of a Substring.
10. Time-Space Trade-Offs for the Longest Common Substring Problem.

CSR 2013

1. Alphabetic Minimax Trees in Linear Time.

CiE 2013

1. Discovering Hidden Repetitions in Words.

DCC 2013

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

Developments in Language Theory 2013

1. Abelian Repetitions in Sturmian Words.
2. On the Number of Abelian Bordered Words.
3. Repetition Avoidance in Circular Factors.
4. Suffixes, Conjugates and Lyndon Words.

ESA 2013

1. Binary Jumbled Pattern Matching on Trees and Tree-Like Structures.
2. Compressed Cache-Oblivious String B-tree.
3. Efficient Indexes for Jumbled Pattern Matching with Constant-Sized Alphabet.
4. Encodings for Range Selection and Top-k Queries.
5. Optimal Color Range Reporting in One Dimension.
6. Parallel String Sample Sort.
7. The Encoding Complexity of Two Dimensional Range Minimum Data Structures.
8. Versatile Succinct Representations of the Bidirectional Burrows-Wheeler Transform.

ICALP (1) 2013

1. Combining Binary Search Trees.
2. Dynamic Compressed Strings with Random Access.
3. Sparse Suffix Tree Construction in Small Space.
4. Tree Compression with Top Trees.

ICCS 2013

1. n-step FM-Index for Faster Pattern Matching.

IEEE BigData 2013

1. A reconfigurable stream compression hardware based on static symbol-lookup table.

ISAAC 2013

1. Beating $\mathcal{O}(nm)$ in Approximate LZW-Compressed Pattern Matching.
2. Faster, Space-Efficient Selection Algorithms in Read-Only Memory for Integers.
3. Less Space: Indexing for Queries with Wildcards.
4. Pattern Matching with Non Overlapping Reversals - Approximation and On-line Algorithms.
5. RAM-Efficient External Memory Sorting.
6. Single and Multiple Consecutive Permutation Motif Search.
7. Sliding Bloom Filters.
8. Succinct Data Structures for Representing Equivalence Classes.
9. Top-k Document Retrieval in Compact Space and Near-Optimal Time.

IWOCA 2013

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

Information Theory, Combinatorics, and Search Theory 2013

1. On the Value of Multiple Read/Write Streams for Data Compression.

LATA 2013

1. Linear-Time Version of Holub’s Algorithm for Morphic Imprimitivity Testing.
2. On the Number of Unbordered Factors.

MFCS 2013

1. Detecting Regularities on Grammar-Compressed Strings.

MICRO 2013

1. Decoupled compressed cache: exploiting spatial locality for energy-optimized compressed caching.
2. Linearly compressed pages: a low-complexity, low-latency main memory compression framework.

PPAM (2) 2013

1. Accelerating String Matching on MIC Architecture for Motif Extraction.

SEA 2013

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

SIGIR 2013

1. Faster and smaller inverted indices with treaps.

SODA 2013

1. Adaptive and Approximate Orthogonal Range Counting.
2. Compressed static functions with applications.
3. Lyndon Words and Short Superstrings.
4. Near-Optimal Range Reporting Structures for Categorical Data.
5. Optimal Dynamic Sequence Representations.
6. The Space Complexity of 2-Dimensional Approximate Range Counting.
7. Twisted Tabulation Hashing.

SOFSEM 2013

1. Permuted Pattern Matching on Multi-track Strings.

SPIRE 2013

1. A Lempel-Ziv Compressed Structure for Document Listing.
2. Adding Compression and Blended Search to a Compact Two-Level Suffix Array.
3. Compact Querieable Representations of Raster Data.
4. Document Listing on Versioned Documents.
5. Faster Lyndon Factorization Algorithms for SLP and LZ78 Compressed Text.
6. Faster Top-k Document Retrieval in Optimal Space.
7. Fully-Online Grammar Compression.
8. Indexes for Jumbled Pattern Matching in Strings, Trees and Graphs.
9. Minimal Discriminating Words Problem Revisited.
10. Order-Preserving Incomplete Suffix Trees and Order-Preserving Indexes.
11. Space-Efficient Construction of the Burrows-Wheeler Transform.

STACS 2013

1. Fast Algorithms for Abelian Periods in Words and Greatest Common Divisor Queries.
2. Finding Pseudo-repetitions.
3. Parameterized Matching in the Streaming Model.
4. Recompression: a simple and powerful technique for word equations.

WABI 2013

1. A Fixed-Parameter Algorithm for Minimum Common String Partition with Few Duplications.
2. Probabilistic Approaches to Alignment with Tandem Repeats.
3. Using Cascading Bloom Filters to Improve the Memory Usage for de Brujin Graphs.

WADS 2013

1. Better Space Bounds for Parameterized Range Majority and Minority.
2. Compressed Persistent Index for Efficient Rank/Select Queries.
3. Fingerprints in Compressed Strings.
4. On (Dynamic) Range Minimum Queries in External Memory.

ACM Comput. Surv. 2013

1. Spaces, Trees, and Colors: The algorithmic landscape of document retrieval on sequences.

ACM J. Exp. Algorithmics 2013

1. Compressed suffix trees: Efficient computation and storage of LCP-values.

ACM Trans. Algorithms 2013

1. Optimal Pattern Matching in LZW Compressed Strings.

Algorithmica 2013

1. Distribution-Aware Compressed Full-Text Indexes.
2. Sublinear Algorithms for Approximating String Compressibility.

Algorithms 2013

1. Practical Compressed Suffix Trees.

Algorithms Mol. Biol. 2013

1. Data compression for sequencing data.

BMC Bioinform. 2013

1. libgapmis: extending short-read alignments.

Eur. J. Comb. 2013

1. Computing the Longest Previous Factor.
2. Minimax trees in linear time with applications.

IEICE Trans. Inf. Syst. 2013

1. Scalable Detection of Frequent Substrings by Grammar-Based Compression.

Inf. Comput. 2013

1. Compact binary relation representations with rich functionality.
2. Range majority in constant time and linear space.

Inf. Process. Manag. 2013

1. DACs: Bringing direct access to variable-length codes.

Inf. Syst. 2013

1. Space-efficient representations of rectangle datasets supporting orthogonal range querying.
2. Succinct nearest neighbor search.

Int. J. Comput. Biol. Drug Des. 2013

1. Querying highly similar sequences.

Int. J. Comput. Geom. Appl. 2013

1. External Memory orthogonal Range Reporting with Fast Updates.

J. Discrete Algorithms 2013

1. Computing the longest common prefix array based on the Burrows-Wheeler transform.
2. ESP-index: A compressed index based on edit-sensitive parsing.
3. Fast q-gram mining on SLP compressed strings.
4. Improved compressed indexes for full-text document retrieval.
5. Various improvements to text fingerprinting.

SIAM J. Comput. 2013

1. On the Bit-Complexity of Lempel-Ziv Compression.

Theor. Comput. Sci. 2013

1. Colored range queries and document retrieval.
2. Enhanced string covering.
3. On compressing and indexing repetitive sequences.
4. On compressing permutations and adaptive sorting.
5. On the weak prefix-search problem.
6. Palindrome pattern matching.
7. Space-efficient data-analysis queries on grids.
8. Succinct encoding of arbitrary graphs.

This site is open source. Improve this page.