# Justin Colannino

jcolan@cs.mcgill.ca 2 Department of Computer Science, Villanova University, Villanova, USA. e-mail: mirela.damian@villanova.edu 3 Departament de Matemàtica Aplicada II, Universitat Politècnica de Catalunya, Barcelona, Spain. Partially supported by projects MCYT BFM2003-00368, MEC MTM2006-01267 and Gen. Cat. 2005SGR00692. e-mail: Ferran.Hurtado@upc.edu 4(More)
• Inf. Process. Lett.
• 2005
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 of(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. In this paper we show that this problem has an(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)
Volcanic CFCs Dear Editors: In the recent ES&T feature article on "The Natural Production of Chlorinated Compounds" by Gordon W. Gribble (July 1994, p. 310A), the author includes volcanoes as a natural source of chlorofluorocarbons (CFCs), citing two reports of measurements taken downwind in volcanic gas plumes {1,2). Readers of ES&T should be aware that(More)
The assignment problem takes as input two nite 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)
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