StringologyTimes

Papers for stringologist (2014)

• ALENEX(2014) [dblp]
• CPM(2014) [dblp]
• DCC(2014) [dblp]
• Developments in Language Theory(2014) [dblp]
• ESA(2014) [dblp]
• FOCS(2014) [dblp]
• FSTTCS(2014) [dblp]
• HPCA(2014) [dblp]
• ICALP (1)(2014) [dblp]
• ISAAC(2014) [dblp]
• IWOCA(2014) [dblp]
• JSAI-isAI Workshops(2014) [dblp]
• LATIN(2014) [dblp]
• Language, Culture, Computation (1)(2014) [dblp]
• MFCS (1)(2014) [dblp]
• MFCS (2)(2014) [dblp]
• SEA(2014) [dblp]
• SISAP(2014) [dblp]
• SODA(2014) [dblp]
• SOFSEM(2014) [dblp]
• SPIRE(2014) [dblp]
• STACS(2014) [dblp]
• STOC(2014) [dblp]
• SWAT(2014) [dblp]
• WABI(2014) [dblp]

• WALCOM(2014) [dblp]

• ACM J. Exp. Algorithmics(2014) [dblp]
• ACM Trans. Algorithms(2014) [dblp]
• ACM Trans. Inf. Syst.(2014) [dblp]
• Algorithmica(2014) [dblp]
• Algorithms(2014) [dblp]
• Algorithms Mol. Biol.(2014) [dblp]
• BMC Bioinform.(2014) [dblp]
• Comput. Geom.(2014) [dblp]
• Discret. Appl. Math.(2014) [dblp]
• IEEE Trans. Knowl. Data Eng.(2014) [dblp]
• J. Comput. Syst. Sci.(2014) [dblp]
• J. Discrete Algorithms(2014) [dblp]
• Knowl. Inf. Syst.(2014) [dblp]
• Parallel Comput.(2014) [dblp]
• SIAM J. Comput.(2014) [dblp]
• Softw. Pract. Exp.(2014) [dblp]
• Theor. Comput. Sci.(2014) [dblp]
• Theory Comput. Syst.(2014) [dblp]

Contents

ALENEX 2014

1. Multi-Pivot Quicksort: Theory and Experiments.
2. Top-k Substring Matching for Auto-Completion.

CPM 2014

1. A really Simple Approximation of Smallest Grammar.
2. Approximate On-line Palindrome Recognition, and Applications.
3. Compressed Subsequence Matching and Packed Tree Coloring.
4. Computing Minimal and Maximal Suffixes of a Substring Revisited.
5. Computing Palindromic Factorizations and Palindromic Covers On-line.
6. Dictionary Matching with One Gap.
7. Efficient Algorithms for Shortest Partial Seeds in Words.
8. Encodings for Range Majority Queries.
9. Indexed Geometric Jumbled Pattern Matching.
10. Most Recent Match Queries in On-Line Suffix Trees.
11. Order-Preserving Pattern Matching with k Mismatches.
12. Permuted Scaled Matching.
13. String Range Matching.

DCC 2014

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

Developments in Language Theory 2014

1. On k-Abelian Palindromic Rich and Poor Words.
2. k-Abelian Pattern Matching.

ESA 2014

1. Amortized Bounds for Dynamic Orthogonal Range Reporting.
2. Bicriteria Data Compression: Efficient and Usable.
3. Document Retrieval on Repetitive Collections.
4. Equivalence between Priority Queues and Sorting in External Memory.
5. Sublinear Space Algorithms for the Longest Common Substring Problem.
6. The Batched Predecessor Problem in External Memory.
7. Weighted Ancestors in Suffix Trees.

FOCS 2014

1. Dynamic Integer Sets with Optimal Rank, Select, and Predecessor Search.
2. The Dyck Language Edit Distance Problem in Near-Linear Time.

FSTTCS 2014

1. Asymptotically Optimal Encodings for Range Selection.

HPCA 2014

1. MemZip: Exploring unconventional benefits from memory compression.

ICALP (1) 2014

1. Deterministic Rectangle Enclosure and Offline Dominance Reporting on the RAM.
2. On Hardness of Jumbled Indexing.

ISAAC 2014

1. Depth-First Search Using O(n) Bits.
2. Hashing and Indexing: Succinct DataStructures and Smoothed Analysis.
3. The Power and Limitations of Static Binary Search Trees with Lazy Finger.
4. Top- k Term-Proximity in Succinct Space.

IWOCA 2014

1. A Suffix Tree Or Not a Suffix Tree?
2. Computing Primitively-Rooted Squares and Runs in Partial Words.
3. Fast and Simple Computations Using Prefix Tables Under Hamming and Edit Distance.

JSAI-isAI Workshops 2014

1. Finding Ambiguous Patterns on Grammar Compressed String.

LATIN 2014

1. Biased Predecessor Search.
2. LZ77-Based Self-indexing with Faster Pattern Matching.
3. Multiply Balanced k -Partitioning.
4. Quad-K-d Trees.

Language, Culture, Computation (1) 2014

1. Hypertext Searching - A Survey.

MFCS (1) 2014

1. Universal Lyndon Words.

MFCS (2) 2014

1. Document Retrieval with One Wildcard.
2. Inferring Strings from Lyndon Factorization.

SEA 2014

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

SISAP 2014

1. Dynamic List of Clusters in Secondary Memory.

SODA 2014

1. Bicriteria data compression.
2. Concurrent Range Reporting in Two-Dimensional Space.
3. Finding small patterns in permutations in linear time.
4. Near-optimal labeling schemes for nearest common ancestors.
5. Selection and Sorting in the “Restore” Model.

SOFSEM 2014

1. Shortest Unique Substrings Queries in Optimal Time.

SPIRE 2014

1. Algorithms for Jumbled Indexing, Jumbled Border and Jumbled Square on Run-Length Encoded Strings.
2. Efficient Compressed Indexing for Approximate Top-k String Retrieval.
3. Efficient Indexing and Representation of Web Access Logs.
4. Fast Construction of Wavelet Trees.
5. Grammar Compressed Sequences with Rank/Select Support.
6. Indexed Matching Statistics and Shortest Unique Substrings.
7. K 2-Treaps: Range Top-k Queries in Compact Space.
8. Online Pattern Matching for String Edit Distance with Moves.
9. Relative FM-Indexes.
10. Relative Lempel-Ziv with Constant-Time Random Access.
11. Simple and Efficient String Algorithms for Query Suggestion Metrics Computation.
12. Strategic Pattern Search in Factor-Compressed Text.

STACS 2014

1. Data-Oblivious Data Structures.
2. Faster Compact On-Line Lempel-Ziv Factorization.
3. Faster Sparse Suffix Sorting.
4. Space-Efficient String Indexing for Wildcard Pattern Matching.
5. Testing Generalised Freeness of Words.
6. Weighted Coloring in Trees.

STOC 2014

1. Linear time construction of compressed text indices in compact space.
2. Zig-zag sort: a simple deterministic data-oblivious sorting algorithm running in O(n log n) time.

SWAT 2014

1. B-slack Trees: Space Efficient B-Trees.
2. Colored Range Searching in Linear Space.
3. Expected Linear Time Sorting for Word Size Ω(log2 n loglogn).
4. Ranked Document Selection.

WABI 2014

1. Constructing String Graphs in External Memory.
2. Manifold de Bruijn Graphs.

WALCOM 2014

1. Alignment with Non-overlapping Inversions on Two Strings.

ACM J. Exp. Algorithmics 2014

1. General Document Retrieval in Compact Space.
2. Locally Compressed Suffix Arrays.

ACM Trans. Algorithms 2014

1. Alphabet-Independent Compressed Text Indexing.
2. Fully Functional Static and Dynamic Succinct Trees.

ACM Trans. Inf. Syst. 2014

1. XXS: Efficient XPath Evaluation on Compressed XML Documents.

Algorithmica 2014

1. A Framework for Succinct Labeled Ordinal Trees over Large Alphabets.
2. Efficient Fully-Compressed Sequence Representations.
3. Substring Range Reporting.

Algorithms 2014

1. High-Order Entropy Compressed Bit Vectors with Rank/Select.

Algorithms Mol. Biol. 2014

1. Fast algorithms for approximate circular string matching.
2. Optimal computation of all tandem repeats in a weighted sequence.

BMC Bioinform. 2014

1. Linear-time computation of minimal absent words using suffix array.

Comput. Geom. 2014

1. Space efficient data structures for dynamic orthogonal range counting.

Discret. Appl. Math. 2014

1. Inferring strings from suffix trees and links on a binary alphabet.

IEEE Trans. Knowl. Data Eng. 2014

1. Large-Scale Pattern Search Using Reduced-Space On-Disk Suffix Arrays.

J. Comput. Syst. Sci. 2014

1. Range LCP.

J. Discrete Algorithms 2014

1. A subquadratic algorithm for minimum palindromic factorization.
2. Cross-document pattern matching.
3. Multi-pattern matching with bidirectional indexes.
4. Simple and efficient LZW-compressed multiple pattern matching.
5. Simple, compact and robust approximate string dictionary.
6. Time-space trade-offs for longest common extensions.
7. Wavelet trees for all.

Knowl. Inf. Syst. 2014

1. Compressed representations for web and social graphs.

Parallel Comput. 2014

1. Distributed text search using suffix arrays.

SIAM J. Comput. 2014

1. Optimal Dynamic Sequence Representations.

Softw. Pract. Exp. 2014

1. Optimized succinct data structures for massive data.

Theor. Comput. Sci. 2014

1. Closest periodic vectors in Lp spaces.
2. Compact q-gram profiling of compressed strings.
3. Detecting approximate periodic patterns.
4. Extending alignments with k-mismatches and ℓ-gaps.
5. Fast relative Lempel-Ziv self-index for similar sequences.
6. Less space: Indexing for queries with wildcards.
7. New space/time tradeoffs for top-k document retrieval on sequences.
8. Order-preserving matching.
9. Towards optimal packed string matching.

Theory Comput. Syst. 2014

1. String Indexing for Patterns with Wildcards.
2. Validating the Knuth-Morris-Pratt Failure Function, Fast and Online.

This site is open source. Improve this page.