SMS-Forbid: An Efficient Agorithm for Simple Motif Problem

Finding common motifs from a set of strings coding biological sequences is an important problem in Molecular Biology. Several versions of the motif finding problem have been proposed in the literature and for each version, numerous algorithms have been developed. However, many of these algorithms fall under the category of heuristics. In this paper, we concentrate on the Simple Motif Problem (SMP) and we propose an exact algorithm, called SMS-Forbid, for this version of motif finding problem. SMS-Forbid make use of less time and space than the known exact algorithms.

[1]  Francis Y. L. Chin,et al.  Voting algorithms for discovering long motifs , 2005, APBC.

[2]  William F. Smyth,et al.  An Adaptive Hybrid Pattern-Matching Algorithm on Indeterminate Strings , 2009, Int. J. Found. Comput. Sci..

[3]  Marie-France Sagot,et al.  Spelling Approximate Repeated or Common Motifs Using a Suffix Tree , 1998, LATIN.

[4]  David S. L. Wei,et al.  Computer Algorithms , 1998, Scalable Comput. Pract. Exp..

[5]  Sanguthevar Rajasekaran,et al.  High-Performance Exact Algorithms For Motif Search , 2005, Journal of Clinical Monitoring and Computing.

[6]  Maxime Crochemore,et al.  Algorithms on strings , 2007 .

[7]  Mark P. Styczynski,et al.  An extension and novel solution to the (l,d)-motif challenge problem. , 2004, Genome informatics. International Conference on Genome Informatics.

[8]  Francis Y. L. Chin,et al.  An efficient algorithm for the extended (l,d)-motif problem with unknown number of binding sites , 2005, Fifth IEEE Symposium on Bioinformatics and Bioengineering (BIBE'05).

[9]  Anil K. Kesarwani,et al.  Genome Informatics , 2019, Encyclopedia of Bioinformatics and Computational Biology.

[10]  John B. Shoven,et al.  I , Edinburgh Medical and Surgical Journal.

[11]  G. Navarro,et al.  Flexible Pattern Matching in Strings: Approximate matching , 2002 .

[12]  Sanguthevar Rajasekaran,et al.  Exact algorithms for planted motif challenge problems , 2005, APBC.

[13]  Sriram Ramabhadran,et al.  Finding subtle motifs by branching from sample strings , 2003, ECCB.

[14]  S. Rajasekaran,et al.  Algorithms for Motif Discovery based on Edit Distance ? , 2007 .