On the complexity of finding common approximate substrings. (Q1426464): Difference between revisions
From MaRDI portal
Created a new Item |
Created claim: Wikidata QID (P12): Q106509296, #quickstatements; #temporary_batch_1705017028534 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q106509296 / rank | |||
Normal rank | |||
Revision as of 00:54, 12 January 2024
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
