文章基本信息

标题：Pattern Matching Based Technique to Solve Motif-Finding Problem
本地全文：下载
作者：Pankaj Agarwal ; S.A.M. Rizvi
期刊名称：BVICAM's International Journal of Information Technology
印刷版ISSN：0973-5658
出版年度：2009
卷号：1
期号：1
出版社：Bharati Vidyapeeth's Institute of Computer Applications and Management
摘要：The problem of finding motifs from multiple molecular sequences is considered to be a difficult problem in molecular biology. In fact it is considered to be a Non-Deterministic Polynomial (NP)-complete problem and constant research is been carried out to solve the problem using some deterministic algorithm in polynomial time. Finding motifs from a set of DNA sequences is a critical step for understanding the gene regulatory network. This paper is an attempt to solve the motif problem using a deterministic method in polynomial time. The proposed method is not an exact algorithm but the probability of success is quite high by using it. Significance of the technique is its simplicity and time efficiency. The proposed technique is implemented as one of the modules in our generalpurpose tool by the name “Sequence Comparison and Analysis Tool” for solving a number of sequence comparison problems encountered in the field of bioinformatics.