Efficient algorithms for regular expression constrained sequence alignment

Imposing constraints is an effective means to incorporate biological knowledge into alignment procedures. As in the PROSITE database, functional sites of proteins can be effectively described as regular expressions. In an alignment of protein sequences it is natural to expect that functional motifs...

Full description

Saved in:
Bibliographic Details
Published in:Information processing letters 2007-09, Vol.103 (6), p.240-246
Main Authors: Chung, Yun-Sheng, Lu, Chin Lung, Tang, Chuan Yi
Format: Article
Language:English
Subjects:
Algorithmics. Computability. Computer arithmetics
Algorithms
Applied sciences
Artificial intelligence
Complexity theory
Computer science
control theory
systems
Constrained sequence alignment
Dynamic programming
Efficiency
Exact sciences and technology
Information systems. Data bases
Learning and adaptive systems
Memory organisation. Data processing
Miscellaneous
Regular expression
Software
Studies
Theoretical computing
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Imposing constraints is an effective means to incorporate biological knowledge into alignment procedures. As in the PROSITE database, functional sites of proteins can be effectively described as regular expressions. In an alignment of protein sequences it is natural to expect that functional motifs should be aligned together. Due to this motivation, Arslan introduced the regular expression constrained sequence alignment problem and proposed an algorithm which, if implemented naïvely, can take time and space up to O ( | Σ | 2 | V | 4 n 2 ) and O ( | Σ | 2 | V | 4 n ) , respectively, where Σ is the alphabet, n is the sequence length, and V is the set of states in an automaton equivalent to the input regular expression. In this paper we propose a more efficient algorithm solving this problem which takes O ( | V | 3 n 2 ) time and O ( | V | 2 n ) space in the worst case. If | V | = O ( log n ) we propose another algorithm with time complexity O ( | V | 2 log | V | n 2 ) . The time complexity of our algorithms is independent of Σ, which is desirable in protein applications where the formulation of this problem originates; a factor of | Σ | 2 = 400 in the time complexity of the previously proposed algorithm would significantly affect the efficiency in practice.
ISSN:0020-0190
1872-6119
DOI:10.1016/j.ipl.2007.04.007