Justin Colannino

Learn More
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 one point in S, such that sum of the matching costs is minimized. Here we examine the special case where both S and T lie on the line and the cost of matching s ∈ S to t(More)
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 point of T such that the sum of all the assignment costs is minimized, with the constraint that every element of T must be assigned at least one element of S. The cost(More)
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 , such that each point in S maps to exactly one point in T and each point in T maps to at least one point in S. An algorithm is presented that finds a(More)
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 each point in T maps to at least one point in S. In this paper we show that this problem has an O(n log n)-time solution, provided that the points in S and T(More)
  • 1