A generalized global alignment algorithm
Resource
Bioinformatics 19 (2): 228-233
Bioinformatics, vol.19, pp.228-233
Journal
Bioinformatics
Journal Volume
19
Journal Issue
2
Pages
228-233
Date Issued
2003
Author(s)
Abstract
MOTIVATION: Homologous sequences are sometimes similar over some regions but different over other regions. Homologous sequences have a much lower global similarity if the different regions are much longer than the similar regions. RESULTS: We present a generalized global alignment algorithm for comparing sequences with intermittent similarities, an ordered list of similar regions separated by different regions. A generalized global alignment model is defined to handle sequences with intermittent similarities. A dynamic programming algorithm is designed to compute an optimal general alignment in time proportional to the product of sequence lengths and in space proportional to the sum of sequence lengths. The algorithm is implemented as a computer program named GAP3 (Global Alignment Program Version 3). The generalized global alignment model is validated by experimental results produced with GAP3 on both DNA and protein sequences. The GAP3 program extends the ability of standard global alignment programs to recognize homologous sequences of lower similarity. AVAILABILITY: The GAP3 program is freely available for academic use at http://bioinformatics.iastate.edu/aat/align/align.html.
SDGs
Type
journal article
File(s)![Thumbnail Image]()
Loading...
Name
03.pdf
Size
73.01 KB
Format
Adobe PDF
Checksum
(MD5):8838e57d63c204720e298a87af7bc65c