An algorithm for computing the restriction scaffold assignment problem in computational biology

Justin Colannino, Godfried Toussaint

Research output: Contribution to journalArticle

Abstract

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 assigning an element si of S to an element tj of T is |si - tj|, i.e., the distance between si and tj. In 2003 Ben-Dor, Karp, Schwikowski and Shamir [J. Comput. Biol. 10 (2) (2003) 385] published an O(nlogn) time algorithm for this problem. Here we provide a counterexample to their algorithm and present a new algorithm that runs in O(n2) time, improving the best previous complexity of O(n3).

Original languageEnglish (US)
Pages (from-to)466-471
Number of pages6
JournalInformation Processing Letters
Volume95
Issue number4
DOIs
StatePublished - Aug 31 2005

Fingerprint

Scaffold
Computational Biology
Scaffolds (biology)
Assignment Problem
Restriction
Computing
Costs
Real Line
Set of points
Assign
Counterexample
Finite Set
Assignment

Keywords

  • Analysis of algorithms
  • Assignment problems
  • Computational biology
  • Computational geometry
  • Information retrieval
  • Operations research
  • Rhythmic similarity measures

ASJC Scopus subject areas

  • Computational Theory and Mathematics

Cite this

An algorithm for computing the restriction scaffold assignment problem in computational biology. / Colannino, Justin; Toussaint, Godfried.

In: Information Processing Letters, Vol. 95, No. 4, 31.08.2005, p. 466-471.

Research output: Contribution to journalArticle

@article{e2e6f30409e44b0faa4dfa4ab88182ff,
title = "An algorithm for computing the restriction scaffold assignment problem in computational biology",
abstract = "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 assigning an element si of S to an element tj of T is |si - tj|, i.e., the distance between si and tj. In 2003 Ben-Dor, Karp, Schwikowski and Shamir [J. Comput. Biol. 10 (2) (2003) 385] published an O(nlogn) time algorithm for this problem. Here we provide a counterexample to their algorithm and present a new algorithm that runs in O(n2) time, improving the best previous complexity of O(n3).",
keywords = "Analysis of algorithms, Assignment problems, Computational biology, Computational geometry, Information retrieval, Operations research, Rhythmic similarity measures",
author = "Justin Colannino and Godfried Toussaint",
year = "2005",
month = "8",
day = "31",
doi = "10.1016/j.ipl.2005.05.007",
language = "English (US)",
volume = "95",
pages = "466--471",
journal = "Information Processing Letters",
issn = "0020-0190",
publisher = "Elsevier",
number = "4",

}

TY - JOUR

T1 - An algorithm for computing the restriction scaffold assignment problem in computational biology

AU - Colannino, Justin

AU - Toussaint, Godfried

PY - 2005/8/31

Y1 - 2005/8/31

N2 - 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 assigning an element si of S to an element tj of T is |si - tj|, i.e., the distance between si and tj. In 2003 Ben-Dor, Karp, Schwikowski and Shamir [J. Comput. Biol. 10 (2) (2003) 385] published an O(nlogn) time algorithm for this problem. Here we provide a counterexample to their algorithm and present a new algorithm that runs in O(n2) time, improving the best previous complexity of O(n3).

AB - 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 assigning an element si of S to an element tj of T is |si - tj|, i.e., the distance between si and tj. In 2003 Ben-Dor, Karp, Schwikowski and Shamir [J. Comput. Biol. 10 (2) (2003) 385] published an O(nlogn) time algorithm for this problem. Here we provide a counterexample to their algorithm and present a new algorithm that runs in O(n2) time, improving the best previous complexity of O(n3).

KW - Analysis of algorithms

KW - Assignment problems

KW - Computational biology

KW - Computational geometry

KW - Information retrieval

KW - Operations research

KW - Rhythmic similarity measures

UR - http://www.scopus.com/inward/record.url?scp=21344443505&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=21344443505&partnerID=8YFLogxK

U2 - 10.1016/j.ipl.2005.05.007

DO - 10.1016/j.ipl.2005.05.007

M3 - Article

AN - SCOPUS:21344443505

VL - 95

SP - 466

EP - 471

JO - Information Processing Letters

JF - Information Processing Letters

SN - 0020-0190

IS - 4

ER -