SA-REPC: sequence alignment with regular expression path constraint

Authors:
Nimrod Milo;Tamar Pinhas;Michal Ziv-Ukelson
Affiliations:
Department of Computer Science, Ben-Gurion University of the Negev, Be'er Sheva, Israel;Department of Computer Science, Ben-Gurion University of the Negev, Be'er Sheva, Israel;Department of Computer Science, Ben-Gurion University of the Negev, Be'er Sheva, Israel
Venue:
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Year:
2010

Citing 7
Cited 1

Algorithms on strings, trees, and sequences: computer science and computational biology

Algorithms on strings, trees, and sequences: computer science and computational biology
Algorithms for the Longest Common Subsequence Problem

Journal of the ACM (JACM)
A Subquadratic Sequence Alignment Algorithm for Unrestricted Scoring Matrices

SIAM Journal on Computing
Multiseed Lossless Filtration

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Introduction to Automata Theory, Languages, and Computation (3rd Edition)

Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Regular expression constrained sequence alignment

Journal of Discrete Algorithms
Prediction of both conserved and nonconserved microRNA targets in animals

Bioinformatics

Algorithms for path-constrained sequence alignment

Journal of Discrete Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we define a novel variation on the constrained sequence alignment problem, the Sequence Alignment with Regular Expression Path Constraint problem, in which the constraint is given in the form of a regular expression. Our definition extends and generalizes the existing definitions of alignment-path constrained sequence alignments to the expressive power of regular expressions. We give a solution for the new variation of the problem and demonstrate its application to integrate microRNA-target interaction patterns into the target prediction computation. Our approach can serve as an efficient filter for more computationally demanding target prediction filtration algorithms. We compare our implementation for the SA-REPC problem, cAlign, to other microRNA target prediction algorithms.