The complexity of the Approximate Multiple Pattern Matching Problem for random strings (Q5874424)
From MaRDI portal
scientific article; zbMATH DE number 7651063
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of the Approximate Multiple Pattern Matching Problem for random strings |
scientific article; zbMATH DE number 7651063 |
Statements
7 February 2023
0 references
subcritical graph class
0 references
block statistic
0 references
number of blocks
0 references
number of edges
0 references
number of spanning trees
0 references
The complexity of the Approximate Multiple Pattern Matching Problem for random strings (English)
0 references
