Improved algorithms for searching restriction maps

W. Miller, J. Barr, K. E. Rudd

Research output: Contribution to journalArticle

6 Citations (Scopus)

Abstract

We present algorithms for searching a DNA restriction enzyme map for a region that best matches a shorter 'probe' map. Our algorithms utilize a new model of map alignments, and extensive experiments prove our model superior to earlier approaches for certain applications. Let M be the number of map sites and P be the number of probe sites. Our first algorithm, which optimizes only over a restricted class of alignments, requires O(MP log P) worst-case time and O(M + P) space. Our second algorithm, which optimizes over all alignments, runs in O(MP3) time and O(M + p2) space, under reasonable assumptions about the distribution of restriction enzyme cleavage sites. Combining the algorithms gives a map-searching method that optimizes over all alignments in O(MP log P) time in practice. The algorithms' effectiveness is illustrated by searches involving a genomic restriction map of Escherichia coli.

Original languageEnglish
Pages (from-to)447-456
Number of pages10
JournalComputer Applications in the Biosciences
Volume7
Issue number4
StatePublished - Jan 1 1991
Externally publishedYes

Fingerprint

Restriction
Alignment
Optimise
Enzymes
Probe
P-space
DNA Restriction Enzymes
Escherichia coli
Escherichia Coli
Genomics
DNA
Model
Experiment
Experiments

ASJC Scopus subject areas

  • Medicine (miscellaneous)
  • Molecular Biology
  • Statistics and Probability
  • Computational Mathematics
  • Computer Science Applications
  • Computational Theory and Mathematics
  • Biochemistry

Cite this

Miller, W., Barr, J., & Rudd, K. E. (1991). Improved algorithms for searching restriction maps. Computer Applications in the Biosciences, 7(4), 447-456.

Improved algorithms for searching restriction maps. / Miller, W.; Barr, J.; Rudd, K. E.

In: Computer Applications in the Biosciences, Vol. 7, No. 4, 01.01.1991, p. 447-456.

Research output: Contribution to journalArticle

Miller, W, Barr, J & Rudd, KE 1991, 'Improved algorithms for searching restriction maps', Computer Applications in the Biosciences, vol. 7, no. 4, pp. 447-456.
Miller, W. ; Barr, J. ; Rudd, K. E. / Improved algorithms for searching restriction maps. In: Computer Applications in the Biosciences. 1991 ; Vol. 7, No. 4. pp. 447-456.
@article{3332ad8553d24d2aafddc1de348484bb,
title = "Improved algorithms for searching restriction maps",
abstract = "We present algorithms for searching a DNA restriction enzyme map for a region that best matches a shorter 'probe' map. Our algorithms utilize a new model of map alignments, and extensive experiments prove our model superior to earlier approaches for certain applications. Let M be the number of map sites and P be the number of probe sites. Our first algorithm, which optimizes only over a restricted class of alignments, requires O(MP log P) worst-case time and O(M + P) space. Our second algorithm, which optimizes over all alignments, runs in O(MP3) time and O(M + p2) space, under reasonable assumptions about the distribution of restriction enzyme cleavage sites. Combining the algorithms gives a map-searching method that optimizes over all alignments in O(MP log P) time in practice. The algorithms' effectiveness is illustrated by searches involving a genomic restriction map of Escherichia coli.",
author = "W. Miller and J. Barr and Rudd, {K. E.}",
year = "1991",
month = "1",
day = "1",
language = "English",
volume = "7",
pages = "447--456",
journal = "Bioinformatics (Oxford, England)",
issn = "1367-4803",
publisher = "Oxford University Press",
number = "4",

}

TY - JOUR

T1 - Improved algorithms for searching restriction maps

AU - Miller, W.

AU - Barr, J.

AU - Rudd, K. E.

PY - 1991/1/1

Y1 - 1991/1/1

N2 - We present algorithms for searching a DNA restriction enzyme map for a region that best matches a shorter 'probe' map. Our algorithms utilize a new model of map alignments, and extensive experiments prove our model superior to earlier approaches for certain applications. Let M be the number of map sites and P be the number of probe sites. Our first algorithm, which optimizes only over a restricted class of alignments, requires O(MP log P) worst-case time and O(M + P) space. Our second algorithm, which optimizes over all alignments, runs in O(MP3) time and O(M + p2) space, under reasonable assumptions about the distribution of restriction enzyme cleavage sites. Combining the algorithms gives a map-searching method that optimizes over all alignments in O(MP log P) time in practice. The algorithms' effectiveness is illustrated by searches involving a genomic restriction map of Escherichia coli.

AB - We present algorithms for searching a DNA restriction enzyme map for a region that best matches a shorter 'probe' map. Our algorithms utilize a new model of map alignments, and extensive experiments prove our model superior to earlier approaches for certain applications. Let M be the number of map sites and P be the number of probe sites. Our first algorithm, which optimizes only over a restricted class of alignments, requires O(MP log P) worst-case time and O(M + P) space. Our second algorithm, which optimizes over all alignments, runs in O(MP3) time and O(M + p2) space, under reasonable assumptions about the distribution of restriction enzyme cleavage sites. Combining the algorithms gives a map-searching method that optimizes over all alignments in O(MP log P) time in practice. The algorithms' effectiveness is illustrated by searches involving a genomic restriction map of Escherichia coli.

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

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

M3 - Article

VL - 7

SP - 447

EP - 456

JO - Bioinformatics (Oxford, England)

JF - Bioinformatics (Oxford, England)

SN - 1367-4803

IS - 4

ER -