Computer Science
Automaton
9%
Clustering Technique
6%
Compact Representation
9%
Compression Scheme
21%
Context-Free Grammars
9%
Data Structure
100%
Intersection Set
11%
Longest Path
6%
Matching Algorithm
6%
Minimal Distance
6%
Parsing
11%
Pattern Matching
27%
Preprocessing Time
8%
Production Rule
6%
Random Access
24%
Reference String
9%
Regular Expression
7%
Sliding Window
9%
Solution Space
8%
String Pattern
17%
Wildcard
12%
Keyphrases
Compact Data Structures
9%
Compressed String
12%
Compression System
8%
Consecutive Occurrences
12%
Fenwick Tree
5%
Finger Search
6%
Intersection Problem
8%
Lempel-Ziv
6%
Linear Space
17%
Longest Common Extension
7%
Number of Occurrences
6%
Packed Words
9%
Partial Sums
9%
Q-gram
6%
Query Response Time
27%
Regular Expression Parsing
6%
Set Intersection
6%
Space-time Data
6%
String Indexing
25%
String Matching
5%
Subsequence
5%
Subsequence Matching
6%
Substring
11%
Tight Bounds
6%
Top Trees
9%
Tree Compression
9%
Ultra-wide
6%
Wildcard
6%
Word RAM Model
8%
Mathematics
Data Structure
39%
Integer
7%
Linear Space
27%
Linear Time
9%
Main Result
9%
Matching Problem
11%
Model of Computation
5%
Open Problem
6%
Partial Sum
15%
Probability Theory
6%
Subsequence
11%
Tradeoff
5%
Worst Case
7%
