Minimum many-to-many matchings for computing the distance between two sequences (Q497361)
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: Minimum many-to-many matchings for computing the distance between two sequences |
scientific article; zbMATH DE number 6484833
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimum many-to-many matchings for computing the distance between two sequences |
scientific article; zbMATH DE number 6484833 |
Statements
Minimum many-to-many matchings for computing the distance between two sequences (English)
0 references
24 September 2015
0 references
many-to-many matching
0 references
bipartite graph
0 references
music theory
0 references
dynamic programming
0 references
