All Highest Scoring Paths in Weighted Grid Graphs and Their Application to Finding All Approximate Repeats in Strings (Q4210080)
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: All Highest Scoring Paths in Weighted Grid Graphs and Their Application to Finding All Approximate Repeats in Strings |
scientific article; zbMATH DE number 1200712
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | All Highest Scoring Paths in Weighted Grid Graphs and Their Application to Finding All Approximate Repeats in Strings |
scientific article; zbMATH DE number 1200712 |
Statements
All Highest Scoring Paths in Weighted Grid Graphs and Their Application to Finding All Approximate Repeats in Strings (English)
0 references
20 September 1998
0 references
string matching
0 references
tandem repeats
0 references
edit-distance
0 references
dynamic programming
0 references
0.7482778429985046
0 references
0.7432030439376831
0 references
0.723652184009552
0 references
0.718828022480011
0 references
