A Heuristic Algorithm to Find All Normalized Local Alignments Above Threshold.
- Author:
Sangtae KIM
1
;
Jeong Seop SIM
;
Heejin PARK
;
Kunsoo PARK
;
Hyunseok PARK
;
Jeong Sun SEO
Author Information
1. Department of Computer Science, Korea Military Academy, Seoul, Korea.
- Publication Type:Original Article
- Keywords:
local alignment;
dynamic programming;
normalized score;
fractional programming
- MeSH:
Molecular Biology
- From:Genomics & Informatics
2003;1(1):25-31
- CountryRepublic of Korea
- Language:English
-
Abstract:
Local alignment is an important task in molecular biology to see if two sequences contain regions that are similar. The most popular approach to local alignment is the use of dynamic programming due to Smith and Waterman, but the alignment reported by the Smith-Waterman algorithm has some undesirable properties. The recent approach to fix these problems is to use the notion of normalized scores for local alignments by Arslan, Egecioglu and Pevzner. In this paper we consider the problem of finding all local alignments whose normalized scores are above a given threshold, and present a fast heuristic algorithm. Our algorithm is 180-330 times faster than Arslan et al.''s for sequences of length about 120 kbp and about 40-50 times faster for sequences of length about 30 kbp.
