#### Filter Results:

- Full text PDF available (8)

#### Publication Year

1995

2007

- This year (0)
- Last 5 years (0)
- Last 10 years (2)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Justin Colannino, Mirela Damian, +5 authors Godfried T. Toussaint
- Graphs and Combinatorics
- 2007

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)

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 the other set. The link distance is defined as the minimum-cost linking. In this note we consider a special case of the link distance where both point sets lie on… (More)

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 retrieval and computational biology: the surjection distance and the link distance. The former is called the restriction scaffold assignment problem in computational… (More)

- Justin Colannino, Godfried T. Toussaint
- 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)

- Justin Colannino, Mirela Damian, +4 authors Godfried Toussaint
- 2006

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)

- Justin Colannino, Mirela Damian, +4 authors Godfried T. Toussaint
- Journal of Computational Biology
- 2006

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)

- J Colannino
- Environmental science & technology
- 1995

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)

- Justin Colannino, Mirela Damian Ferran Hurtado, John Iacono, Henk Meijer, Suneeta Ramaswami, Godfried Toussaint

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)

- Justin Colannino, Godfried T. Toussaint
- Inf. Process. Lett.
- 2007

- Justin Colannino, Mirela Damian, +4 authors Godfried T. Toussaint
- ArXiv
- 2005

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
- ›