On the complexity of finding common approximate substrings. (Q1426464)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of finding common approximate substrings. |
scientific article |
Statements
On the complexity of finding common approximate substrings. (English)
0 references
14 March 2004
0 references
Parameterized complexity
0 references
Pattern matching
0 references
Common approximate substring
0 references
