Efficient many-to-Many point matching in one dimension
From MaRDI portal
Publication:2373930
DOI10.1007/s00373-007-0714-3zbMath1149.90092OpenAlexW1967648182WikidataQ126274371 ScholiaQ126274371MaRDI QIDQ2373930
Diane L. Souvaine, Stefan Langerman, Godfried T. Toussaint, Justin Colannino, Mirela Damian, Henk G. Meijer, Ferran Hurtado, Suneeta Ramaswami
Publication date: 19 July 2007
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-007-0714-3
Related Items (7)
An \(O(n^2)\) algorithm for the limited-capacity many-to-many point matching in one dimension ⋮ Geometric planar networks on bichromatic collinear points ⋮ A fast algorithm for maximal propensity score matching ⋮ Faster retrieval with a two-pass dynamic-time-warping lower bound ⋮ Comment: Matching methods for observational studies derived from large administrative databases ⋮ Minimum many-to-many matchings for computing the distance between two sequences ⋮ Computational geometric aspects of rhythm, melody, and voice-leading
Cites Work
- Unnamed Item
- Unnamed Item
- An algorithm for computing the restriction s|caffold assignment problem in computational biology
- Two special cases of the assignment problem
- An efficient algorithm for minimum-weight bibranching
- Distance measures for point sets and their computation
- Geometry Helps in Matching
- Min-max Relations for Directed Graphs
- Fast Matching Algorithms for Points on a Polygon
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- The Geometry of Musical Rhythm
- On some techniques useful for solution of transportation network problems
- Geometry helps in bottleneck matching and related problems
This page was built for publication: Efficient many-to-Many point matching in one dimension
