Efficient Many-To-Many Point Matching in One Dimension (2008)
Justin Colannino, Mirela Damian, Ferran Hurtado, Stefan Langerman, Suneeta Ramaswami, Diane Souvaine, ...
Abstract. Let S and T be two sets of points with total cardinality n. The minimum-cost many-to-many matching problem matches each point in S to at least one point in T and each point in T to at least...
Justin Colannino, Mirela Damian, Ferran Hurtado, John Iacono, Henk Meijer, Suneeta Ramaswami, ...
∗ Partially supported by MCYT-FEDER BFM2003-00368, Gen. Cat 2001SGR00224 and Gen. Cat 2005SGR00692
Justin Colannino, Ferran Hurtado, Henk Meijer, Godfried Toussaint, Mirela Damian, John Iacono, ...
The restriction scaffold assignment problem takes as input two finite point sets S and T (with S containing more points than T) and establishes a correspondence between points in S and points in T,...
Efficient Many-To-Many Point Matching in One Dimension (2008)
Justin Colannino, Mirela Damian, Ferran Hurtado, Stefan Langerman, Henk Meijer, Diane Souvaine, ...
Appears in Graphs and Combinatorics, vol. 23 (2007), supplement, Computational Geometry and Graph Theory. The Akiyama-Chvatal Festschrift. The original publication is available at...
An O(n log n)-Time Algorithm for the Restricted Scaffold Assignment Problem (2008)
Justin Colannino, Mirela Damian, Ferran Hurtado, John Iacono, Henk Meijer, Suneeta Ramaswami, ...
The restriction sca#old assignment problem takes as input two finite point sets S and T (with S containing more points than T ) and establishes a correspondence between points in S and points in T ,...
An O(n log n)-Time Algorithm for the Restricted Scaffold Assignment (2005)
Colannino, Justin, Damian, Mirela, Hurtado, Ferran, Iacono, John, Meijer, Henk, Ramaswami, Suneeta, ...
The assignment problem takes as input two finite point sets S and T and establishes a correspondence between points in S and points in T, such that each point in S maps to exactly one point in T, and...
A Faster Algorithm for Computing the Link Distance between Two Point Sets on the Real Line (2005)
Justin Colannino, Godfried Toussaint
Let S and T be point sets with |S| # |T | and total cardinality n. A linking between S and T is a matching, L, between the sets where every element of S and T is matched to at least one element of...
Faster Algorithms for Computing Distances between One-Dimensional Point Sets (2005)
Justin Colannino, Godfried Toussaint
Let S and T be two finite sets of points on the real line with |S| + |T | = n and |S| > |T |. We consider two distance measures between S and T that have applications in music information...
Justin Colannino, Godfried Toussaint
Let S and T be two finite sets of points on the real line with |S| + |T | = n and |S| > |T |. The restriction scaffold assignment problem in computational biology assigns each point of S to a...