Minimum many-to-many matchings for computing the distance between two sequences
From MaRDI portal
Publication:497361
DOI10.1007/s00373-014-1467-4zbMath1321.05210OpenAlexW2158086649MaRDI QIDQ497361
David Rappaport, Mustafa A. Mohamad, Godfried T. Toussaint
Publication date: 24 September 2015
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-014-1467-4
Dynamic programming (90C39) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (1)
Cites Work
- Unnamed Item
- CAT(0) spaces on which a certain type of singularity is bounded
- Two special cases of the assignment problem
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Distance measures for point sets and their computation
- Efficient many-to-Many point matching in one dimension
- The Geometry of Musical Chords
- Bipartite graph matching for points on a line or a circle
- The Geometry of Musical Rhythm
- Algorithms – ESA 2004
This page was built for publication: Minimum many-to-many matchings for computing the distance between two sequences