Entity usage

This page lists pages that use the given entity (e.g. Q42). The list is sorted by descending page ID, so that newer pages are listed first.

Showing below up to 50 results in range #51 to #100.

An Improved Query Time for Succinct Dynamic Dictionary Matching: Label: en
Indexed Geometric Jumbled Pattern Matching: Label: en
Randomized and Parameterized Algorithms for the Closest String Problem: Label: en
From Indexing Data Structures to de Bruijn Graphs: Label: en
The Worst Case Complexity of Maximum Parsimony: Label: en
Permuted Scaled Matching: Label: en
On Combinatorial Generation of Prefix Normal Words: Label: en
Reversal Distances for Strings with Few Blocks or Small Alphabets: Label: en
Computing Minimal and Maximal Suffixes of a Substring Revisited: Label: en
Approximate On-line Palindrome Recognition, and Applications: Label: en
Dictionary Matching with One Gap: Label: en
On the Efficiency of the Hamming C-Centerstring Problems: Label: en
Converting SLP to LZ78 in almost Linear Time: Label: en
On Minimal and Maximal Suffixes of a Substring: Label: en
Locating All Maximal Approximate Runs in a String: Label: en
Forty Years of Text Indexing: Label: en
Data Structure Lower Bounds on Random Access to Grammar-Compressed Strings: Label: en
A Succinct Grammar Compression: Label: en
Time-Space Trade-Offs for the Longest Common Substring Problem: Label: en
Efficient All Path Score Computations on Grid Graphs: Label: en
External Memory Generalized Suffix and LCP Arrays Construction: Label: en
Linear Time Lempel-Ziv Factorization: Simple, Fast, Small: Label: en
Fast Algorithm for Partial Covers in Words: Label: en
Approximation of Grammar-Based Compression via Recompression: Label: en
Efficient Lyndon Factorization of Grammar Compressed Text: Label: en
Space-Efficient Construction Algorithm for the Circular Suffix Tree: Label: en
Local Search for String Problems: Brute Force Is Essentially Optimal: Label: en
Approximating Shortest Superstring Problem Using de Bruijn Graphs: Label: en
Document Listing on Repetitive Collections: Label: en
New Algorithms for Position Heaps: Label: en
Pattern Matching with Variables: A Multivariate Complexity Analysis: Label: en
A Constant-Space Comparison-Based Algorithm for Computing the Burrows–Wheeler Transform: Label: en
Compact q-Gram Profiling of Compressed Strings: Label: en
A Bit-Parallel, General Integer-Scoring Sequence Alignment Algorithm: Label: en
On the Value of Multiple Read/Write Streams for Data Compression: Label: en
Fast RNA Structure Alignment for Crossing Input Structures: Label: en
Maximum Motif Problem in Vertex-Colored Graphs: Label: en
Deconstructing Intractability: A Case Study for Interval Constrained Coloring: Label: en
Periodic String Comparison: Label: en
Permuted Longest-Common-Prefix Array: Label: en
Approximate Matching for Run-Length Encoded Strings Is 3sum-Hard: Label: en
Faster and Space-Optimal Edit Distance “1” Dictionary: Label: en
New Complexity Bounds for Image Matching under Rotation and Scaling: Label: en
Fast Searching in Packed Strings: Label: en
LCS Approximation via Embedding into Local Non-repetitive Strings: Label: en
Reoptimization of the Shortest Common Superstring Problem: Label: en
Linear Time Suffix Array Construction Using D-Critical Substrings: Label: en
Contracted Suffix Trees: A Simple and Dynamic Text Indexing Data Structure: Label: en
Quasi-distinct Parsing and Optimal Compression Methods: Label: en
Efficient Inference of Haplotypes from Genotypes on a Pedigree with Mutations and Missing Alleles (Extented Abstract): Label: en