StringologyTimes

Papers for stringologist (2011)

• ALENEX(2011) [dblp]
• BCB(2011) [dblp]
• CCP(2011) [dblp]
• CIAA(2011) [dblp]
• CIKM(2011) [dblp]
• COCOON(2011) [dblp]
• CPM(2011) [dblp]
• DCC(2011) [dblp]
• Developments in Language Theory(2011) [dblp]
• Discovery Science(2011) [dblp]
• ESA(2011) [dblp]
• FSTTCS(2011) [dblp]
• ICALP (1)(2011) [dblp]
• ISAAC(2011) [dblp]
• IWOCA(2011) [dblp]
• LATA(2011) [dblp]
• MFCS(2011) [dblp]
• SEA(2011) [dblp]
• SIGIR(2011) [dblp]
• SISAP(2011) [dblp]
• SODA(2011) [dblp]
• SOFSEM(2011) [dblp]
• SPIRE(2011) [dblp]
• STACS(2011) [dblp]
• STOC(2011) [dblp]
• WADS(2011) [dblp]

• WALCOM(2011) [dblp]

• ACM J. Exp. Algorithmics(2011) [dblp]
• ACM Trans. Algorithms(2011) [dblp]
• Algorithmica(2011) [dblp]
• Algorithms(2011) [dblp]
• Bioinform.(2011) [dblp]
• Fundam. Informaticae(2011) [dblp]
• Inf. Comput.(2011) [dblp]
• Inf. Process. Lett.(2011) [dblp]
• Inf. Process. Manag.(2011) [dblp]
• Inf. Syst.(2011) [dblp]
• Int. J. Found. Comput. Sci.(2011) [dblp]
• J. Discrete Algorithms(2011) [dblp]
• Probl. Inf. Transm.(2011) [dblp]
• Proc. VLDB Endow.(2011) [dblp]
• Theor. Comput. Sci.(2011) [dblp]

Contents

ALENEX 2011

1. A Closer Look at the Closest String and Closest Substring Problem.
2. A Simple Parallel Cartesian Tree Algorithm and its Application to Suffix Tree Construction.
3. Exact Pattern Matching with Feed-Forward Bloom Filters.
4. Fast and Lightweight LCP-Array Construction Algorithms.

BCB 2011

1. Approximate string-matching with a single gap for sequence alignment.
2. DynMap: mapping short reads to multiple related genomes.

CCP 2011

1. A Method to Ensure the Confidentiality of the Compressed Data.
2. An Online Algorithm for Lightweight Grammar-Based Compression.
3. Asymptotic Optimal Lossless Compression via the CSE Technique.
4. Backwards Search in Context Bound Text Transformations.
5. Cache Friendly Burrows-Wheeler Inversion.
6. Combining Non-stationary Prediction, Optimization and Mixing for Data Compression.
7. Generalized Witness Sets.
8. Lempel-Ziv Data Compression on Parallel and Distributed Systems.
9. Lossless Compression of Hyperspectral Imagery.
10. Natural Language Compression per Blocks.
11. Pattern Matching on Sparse Suffix Trees.
12. Quick Estimation of Data Compression and De-duplication for Large Storage Systems.
13. Straight-Line Programs: A Practical Test.
14. Wavelet Trees: From Theory to Practice.

CIAA 2011

1. Chrobak Normal Form Revisited, with Applications.
2. Tree Template Matching in Ranked Ordered Trees by Pushdown Automata.

CIKM 2011

1. Indexes for highly repetitive document collections.

COCOON 2011

1. On the Right-Seed Array of a String.

CPM 2011

1. Counting Colours in Compressed Strings.
2. Efficient Seeds Computation Revisited.
3. Faster Subsequence and Don’t-Care Pattern Matching on Compressed Texts.
4. LRM-Trees: Compressed Indices, Adaptive Sorting, and Compressed Permutations.
5. Lempel-Ziv Factorization Revisited.
6. On the Weak Prefix-Search Problem.
7. Palindrome Pattern Matching.
8. Self-indexing Based on LZ77.
9. Substring Range Reporting.

DCC 2011

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

Developments in Language Theory 2011

1. Abelian Primitive Words.
2. Avoiding Abelian Powers in Partial Words.
3. On Highly Repetitive and Power Free Words.
4. On Prefix Normal Words.

Discovery Science 2011

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

ESA 2011

1. Alphabet-Independent Compressed Text Indexing.
2. Distribution-Aware Compressed Full-Text Indexes.
3. Pattern Matching in Lempel-Ziv Compressed Strings: Fast, Simple, and Deterministic.

FSTTCS 2011

1. Optimal Packed String Matching.

ICALP (1) 2011

1. Range Majority in Constant Time and Linear Space.

ISAAC 2011

1. A Dynamic Stabbing-Max Data Structure with Sub-Logarithmic Query Time.
2. A New Algorithm for the Characteristic String Problem under Loose Similarity Criteria.
3. Compact Representation of Posets.
4. Dynamic Range Majority Data Structures.
5. Dynamic Range Selection in Linear Space.
6. Encoding 2D Range Maximum Queries.
7. External Memory Orthogonal Range Reporting with Fast Updates.
8. Faster Approximate Pattern Matching in Compressed Repetitive Texts.
9. Path Queries in Weighted Trees.
10. Range LCP.
11. Space-Efficient Data-Analysis Queries on Grids.
12. Succinct Indexes for Circular Patterns.

IWOCA 2011

1. A Unifying Property for Distribution-Sensitive Priority Queues.
2. Parameterized Longest Previous Factor.
3. Periods in Partial Words: An Algorithm.
4. Two Constant-Factor-Optimal Realizations of Adaptive Heapsort.
5. p-Suffix Sorting as Arithmetic Coding.

LATA 2011

1. Improved Alignment Based Algorithm for Multilingual Text Compression.
2. Unary Pattern Avoidance in Partial Words Dense with Holes.

MFCS 2011

1. Compressed Word Problems for Inverse Monoids.
2. On Minimising Automata with Errors.
3. Periodicity Algorithms for Partial Words.
4. The Bounded Search Tree Algorithm for the Closest String Problem Has Quadratic Smoothed Complexity.

SEA 2011

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

SIGIR 2011

1. Sample selection for dictionary-based corpus compression.

SISAP 2011

1. Succinct nearest neighbor search.

SODA 2011

1. Improved Space Bounds for Cache-Oblivious Range Reporting.
2. Optimal pattern matching in LZW compressed strings.
3. Ordered and Unordered Top-K Range Reporting in Large Data Sets.
4. Persistent Predecessor Search and Orthogonal point Location on the Word RAM.
5. Random Access to grammar-Compressed Strings.
6. Top-K Color Queries for Document Retrieval.

SOFSEM 2011

1. An Improved B+ Tree for Flash File Systems.
2. In-Place Sorting.

SPIRE 2011

1. Approximate Regular Expression Matching with Multi-strings.
2. COCA Filters: Co-occurrence Aware Bloom Filters.
3. Computing All Subtree Repeats in Ordered Ranked Trees.
4. Computing the Longest Common Prefix Array Based on the Burrows-Wheeler Transform.
5. ESP-Index: A Compressed Index Based on Edit-Sensitive Parsing.
6. Fast q-gram Mining on SLP Compressed Strings.
7. Finding Frequent Elements in Compressed 2D Arrays and Strings.
8. Fixed Block Compression Boosting in FM-Indexes.
9. Improved Compressed Indexes for Full-Text Document Retrieval.
10. Reference Sequence Construction for Relative Compression of Genomes.

STACS 2011

1. On Minimal Sturmian Partial Words.

STOC 2011

1. The power of simple tabulation hashing.

WADS 2011

1. Space Efficient Data Structures for Dynamic Orthogonal Range Counting.

WALCOM 2011

1. De Bruijn Sequences for the Binary Strings with Maximum Density.
2. Efficient Top-k Queries for Orthogonal Ranges.

ACM J. Exp. Algorithmics 2011

1. Theory and practice of monotone minimal perfect hashing.

ACM Trans. Algorithms 2011

1. Fully compressed suffix trees.
2. Succinct indexes for strings, binary relations and multilabeled trees.
3. The tree inclusion problem: In linear space and faster.

Algorithmica 2011

1. On Optimally Partitioning a Text to Improve Its Compression.

Algorithms 2011

1. Compressed Matching in Dictionaries.
2. Edit Distance with Block Deletions.

Bioinform. 2011

1. Compression of DNA sequence reads in FASTQ format.

Fundam. Informaticae 2011

1. Self-Indexed Grammar-Based Compression.

Inf. Comput. 2011

1. Space-efficient construction of Lempel-Ziv compressed text indexes.

Inf. Process. Lett. 2011

1. Computing Longest Previous non-overlapping Factors.

Inf. Process. Manag. 2011

1. Improving semistatic compression via phrase-based modeling.

Inf. Syst. 2011

1. Fully dynamic metric access methods based on hyperplane partitioning.

Int. J. Found. Comput. Sci. 2011

1. Stronger Quickheaps.

J. Discrete Algorithms 2011

1. Fast searching in packed strings.
2. Missing pattern discovery.
3. Tight bounds for online stable sorting.

Probl. Inf. Transm. 2011

1. Computing the longest common substring with one mismatch.

Proc. VLDB Endow. 2011

1. Relative Lempel-Ziv Factorization for Efficient Storage and Retrieval of Web Collections.

Theor. Comput. Sci. 2011

1. Approximate string matching with stuck address bits.
2. On-line approximate string matching with bounded errors.
3. Succinct data structures for Searchable Partial Sums with optimal worst-case performance.
4. Succinct representation of dynamic trees.
5. Verifying and enumerating parameterized border arrays.

This site is open source. Improve this page.