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 the normal view instead:
scientific article; zbMATH DE number 2056808
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.8340655565261841
0 references
0.8179512619972229
0 references
0.8102230429649353
0 references
0.8011971712112427
0 references
