EFFICIENT ALGORITHMS FOR (δ,γ,α) AND (δ, k<sub>Δ</sub>, α)-MATCHING (Q3532148)
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: EFFICIENT ALGORITHMS FOR (δ,γ,α) AND (δ, kΔ, α)-MATCHING |
scientific article; zbMATH DE number 5360163
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | EFFICIENT ALGORITHMS FOR (δ,γ,α) AND (δ, k<sub>Δ</sub>, α)-MATCHING |
scientific article; zbMATH DE number 5360163 |
Statements
EFFICIENT ALGORITHMS FOR (δ,γ,α) AND (δ, k<sub>Δ</sub>, α)-MATCHING (English)
0 references
3 November 2008
0 references
approximate string matching
0 references
music information retrieval
0 references
computational biology
0 references
sparse dynamic programming
0 references
bounded gaps
0 references
0.9237794876098632
0 references
0.8806934952735901
0 references
0.8696694374084473
0 references
0.8265637159347534
0 references
