An algorithm for searching restriction maps

Webb Miller, Jim Ostell, Kenneth E. Rudd

Research output: Contribution to journalArticle

8 Scopus citations

Abstract

This paper presents kan algorithm that searches a DNA restriction enzyme map for regions that approximately match a shorter 'probe' map. Both the map and the probe consist of a sequence of address-enzyme pairs denoting restriction sites, and the algorithm penalizes a potential match for undetected or missing sites and for discrepancies in the distance between adjacent sites. The algorithm was designed specifically for comparing relatively short DNA sequences with a long restriction map, a problem that will become increasing common as large physical maps are generated. The algorithm has been used to extract information from a restriction map of the entire Escherichia coli genome.

Original languageEnglish (US)
Pages (from-to)247-252
Number of pages6
JournalBioinformatics
Volume6
Issue number3
DOIs
StatePublished - Jul 1 1990

ASJC Scopus subject areas

  • Statistics and Probability
  • Biochemistry
  • Molecular Biology
  • Computer Science Applications
  • Computational Theory and Mathematics
  • Computational Mathematics

Fingerprint Dive into the research topics of 'An algorithm for searching restriction maps'. Together they form a unique fingerprint.

  • Cite this