On the complexity of finding common approximate substrings. (Q1426464)
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: On the complexity of finding common approximate substrings. |
scientific article; zbMATH DE number 2056808
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of finding common approximate substrings. |
scientific article; zbMATH DE number 2056808 |
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
