SA-REPC: sequence alignment with regular expression path constraint

LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS(2010)

引用 2|浏览0
暂无评分
摘要
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.
更多
查看译文
关键词
regular expression path constraint,target prediction computation,sequence alignment,sa-repc problem,target prediction filtration algorithm,microrna target prediction algorithm,novel variation,regular expression,new variation,sequence alignment problem,expressive power,microrna
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要