A graph-theoretic model to solve the approximate string matching problem allowing for translocations (Q396701)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A graph-theoretic model to solve the approximate string matching problem allowing for translocations |
scientific article; zbMATH DE number 6329929
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A graph-theoretic model to solve the approximate string matching problem allowing for translocations |
scientific article; zbMATH DE number 6329929 |
Statements
A graph-theoretic model to solve the approximate string matching problem allowing for translocations (English)
0 references
13 August 2014
0 references
algorithms
0 references
pattern matching
0 references
translocations
0 references
graphs
0 references
approximate string matching
0 references
0 references
0.965503752231598
0 references
0.810926616191864
0 references
0.7845826745033264
0 references
0.7826600074768066
0 references
