On the complexity of finding common approximate substrings. (Q1426464): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0304-3975(03)00320-7 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2062088872 / rank | |||
Normal rank | |||
Latest revision as of 08:21, 30 July 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
