Algorithms for Local Alignment with Length Constraints

Authors:
Abdullah N. Arslan;Ömer Egecioglu
Affiliations:
-;-
Venue:
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Year:
2002

Citing 4
Cited 2

Partial Shape Recognition Using Dynamic Programming

IEEE Transactions on Pattern Analysis and Machine Intelligence
On a cyclic string-to-string correction problem

Information Processing Letters
An improved algorithm for solving the banded cyclic string-to-string correction problem

Theoretical Computer Science
Incremental String Comparison

SIAM Journal on Computing

Efficient algorithms for locating the length-constrained heaviest segments with applications to biomolecular sequence analysis

Journal of Computer and System Sciences - Computational biology 2002
Efficient Algorithms for Locating the Length-Constrained Heaviest Segments, with Applications to Biomolecular Sequence Analysis

MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

The local sequence alignment problem is the detection of similar subsequences in two given sequences of lengths n = m. Unfortunately the common notion of local alignment suffers from some wellknown anomalies which result from not taking into account the lengths of the aligned subsequences. We introduce the length restricted local alignment problem which includes as a constraint an upper limit T on the length of one of the subsequences to be aligned. We propose an efficient approximation algorithm, which finds a solution satisfying the length bound, and whose score is within difference 驴 of the optimum score for any given positive integer 驴. The algorithm runs in time O(nmT/驴) using O(mT/驴) space. We also introduce the cyclic local alignment problem and show how our idea can be applied to this case as well. This is a dual approach to the well-known cyclic edit distance problem.