Next:  Abstract
 
 
  An Efficient Algorithm to Locate 
 
All Locally Optimal Alignments
Between Two Sequences 
 
Allowing for Gaps
  Geoffrey J. Barton
Laboratory of Molecular Biophysics
 
University of Oxford
 
Rex Richards Building
 
South Parks Road
 
Oxford OX1 3QU
 
U.K.
 
Tel:  0865-275368
 
Fax:  0865-510454
 
e-mail:  gjb@bioch.ox.ac.uk
Keywords: Smith-Waterman / Dynamic programming / locally optimal  alignment / protein sequence
Running Head: Finding All Locally Optimal Alignments
 
 This paper appeared in Computer Applications in the Biosciences, (1993), 9, 729-734
 
 
Geoff Barton 
Fri Sep 22 17:15:02 BST 1995