Dynamic programming for reduced NFAs for approximate string and sequence matching. (Q3143775)
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 6112556
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Dynamic programming for reduced NFAs for approximate string and sequence matching. |
scientific article; zbMATH DE number 6112556 |
Statements
4 December 2012
0 references
string and sequence matching
0 references
nondeterministic finite automata
0 references
0.8168614506721497
0 references
0.8168614506721497
0 references
0.8107243776321411
0 references
0.8084903359413147
0 references
0.7896923422813416
0 references
