Subsequences with gap constraints: complexity bounds for matching and analysis problems (Q6602491)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Subsequences with gap constraints: complexity bounds for matching and analysis problems |
scientific article; zbMATH DE number 7911130
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Subsequences with gap constraints: complexity bounds for matching and analysis problems |
scientific article; zbMATH DE number 7911130 |
Statements
Subsequences with gap constraints: complexity bounds for matching and analysis problems (English)
0 references
11 September 2024
0 references
string algorithms
0 references
subsequences with gap constraints
0 references
pattern matching
0 references
fine-grained complexity
0 references
conditional lower bounds
0 references
parameterised complexity
0 references
