Minimum Many-to-Many Matchings for Computing the Distance Between Two Sequences

Mustafa Mohamad, David Rappaport, Godfried Toussaint

Research output: Contribution to journalArticle

Abstract

Motivated by a problem in music theory of measuring the distance between chords, scales, and rhythms we consider algorithms for obtaining a minimum-weight many-to-many matching between two sets of points on the real line. Given sets A and B, we seek to find the best rigid translation of B and a many-to-many matching that minimizes the sum of the squares of the distances between matched points. We provide discrete algorithms that solve this continuous optimization problem, and discuss other related matters.

Original languageEnglish (US)
Pages (from-to)1637-1648
Number of pages12
JournalGraphs and Combinatorics
Volume31
Issue number5
DOIs
StatePublished - Sep 24 2015

Fingerprint

Many to many
Continuous Optimization
Computing
Chord or secant line
Music
Real Line
Set of points
Optimization Problem
Minimise

Keywords

  • Bipartite graph
  • Dynamic Programming
  • Many-to-many matching
  • Music Theory

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics

Cite this

Minimum Many-to-Many Matchings for Computing the Distance Between Two Sequences. / Mohamad, Mustafa; Rappaport, David; Toussaint, Godfried.

In: Graphs and Combinatorics, Vol. 31, No. 5, 24.09.2015, p. 1637-1648.

Research output: Contribution to journalArticle

Mohamad, Mustafa ; Rappaport, David ; Toussaint, Godfried. / Minimum Many-to-Many Matchings for Computing the Distance Between Two Sequences. In: Graphs and Combinatorics. 2015 ; Vol. 31, No. 5. pp. 1637-1648.
@article{04909d52d3604fecb60cae4aaf8faf24,
title = "Minimum Many-to-Many Matchings for Computing the Distance Between Two Sequences",
abstract = "Motivated by a problem in music theory of measuring the distance between chords, scales, and rhythms we consider algorithms for obtaining a minimum-weight many-to-many matching between two sets of points on the real line. Given sets A and B, we seek to find the best rigid translation of B and a many-to-many matching that minimizes the sum of the squares of the distances between matched points. We provide discrete algorithms that solve this continuous optimization problem, and discuss other related matters.",
keywords = "Bipartite graph, Dynamic Programming, Many-to-many matching, Music Theory",
author = "Mustafa Mohamad and David Rappaport and Godfried Toussaint",
year = "2015",
month = "9",
day = "24",
doi = "10.1007/s00373-014-1467-4",
language = "English (US)",
volume = "31",
pages = "1637--1648",
journal = "Graphs and Combinatorics",
issn = "0911-0119",
publisher = "Springer Japan",
number = "5",

}

TY - JOUR

T1 - Minimum Many-to-Many Matchings for Computing the Distance Between Two Sequences

AU - Mohamad, Mustafa

AU - Rappaport, David

AU - Toussaint, Godfried

PY - 2015/9/24

Y1 - 2015/9/24

N2 - Motivated by a problem in music theory of measuring the distance between chords, scales, and rhythms we consider algorithms for obtaining a minimum-weight many-to-many matching between two sets of points on the real line. Given sets A and B, we seek to find the best rigid translation of B and a many-to-many matching that minimizes the sum of the squares of the distances between matched points. We provide discrete algorithms that solve this continuous optimization problem, and discuss other related matters.

AB - Motivated by a problem in music theory of measuring the distance between chords, scales, and rhythms we consider algorithms for obtaining a minimum-weight many-to-many matching between two sets of points on the real line. Given sets A and B, we seek to find the best rigid translation of B and a many-to-many matching that minimizes the sum of the squares of the distances between matched points. We provide discrete algorithms that solve this continuous optimization problem, and discuss other related matters.

KW - Bipartite graph

KW - Dynamic Programming

KW - Many-to-many matching

KW - Music Theory

UR - http://www.scopus.com/inward/record.url?scp=84940436578&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84940436578&partnerID=8YFLogxK

U2 - 10.1007/s00373-014-1467-4

DO - 10.1007/s00373-014-1467-4

M3 - Article

AN - SCOPUS:84940436578

VL - 31

SP - 1637

EP - 1648

JO - Graphs and Combinatorics

JF - Graphs and Combinatorics

SN - 0911-0119

IS - 5

ER -