An efficient algorithm to locate all locally optimal alignments between two sequences allowing for gaps

Research output: Contribution to journalArticle

47 Citations (Scopus)

Abstract

An efficient algorithm is described to locate locally optimal alignments between two sequences allowing for insertions and deletions. The algorithm is based on that of Smith and Waterman which returns the single best local alignment. However, the algorithm described here permits all non-intersecting locally optimal alignments to be determined in a single pass through the comparison matrix. The algorithm simplifies the location of repeats, multiple domains and shuffled motifs, and is fast enough to be used on a conventional workstation to scan large sequence databanks.

Original languageEnglish
Pages (from-to)729-734
Number of pages6
JournalComputer Applications in the Biosciences
Volume9
Issue number6
DOIs
Publication statusPublished - Dec 1993

Keywords

  • Algorithms
  • Base sequence
  • DNA
  • Molecular sequence data
  • Sequence alignment
  • Sequence homology, Nucleic acid
  • Software

Fingerprint Dive into the research topics of 'An efficient algorithm to locate all locally optimal alignments between two sequences allowing for gaps'. Together they form a unique fingerprint.

  • Cite this