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 |
Set profile property. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 14:47, 5 March 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
