Complexity issues of string to graph approximate matching (Q782580)
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 7225128
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity issues of string to graph approximate matching |
scientific article; zbMATH DE number 7225128 |
Statements
Complexity issues of string to graph approximate matching (English)
0 references
27 July 2020
0 references
algorithms on strings
0 references
computational complexity
0 references
graph query
0 references
parameterized complexity
0 references
patterns
0 references
string-to-graph matching
0 references
0.96839040517807
0 references
0.7959999442100525
0 references
0.7700070738792419
0 references
0.7569699883460999
0 references
0.7569699883460999
0 references
