All Highest Scoring Paths in Weighted Grid Graphs and Their Application to Finding All Approximate Repeats in Strings (Q4210080): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 13:56, 6 February 2024
scientific article; zbMATH DE number 1200712
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
