Title :
Poster: Randomized algorithms for planted Motif Search
Author :
Merlin, Jerlin C. ; Dinh, Hieu
Author_Institution :
Dept. of Comput. Sci., Univ. of Connecticut, Storrs, CT, USA
Abstract :
Planted (l, d) Motif Search is one of the well studied problems in computational biology. Two kinds of algorithms for solving this problem can be found in the literature, namely, exact and approximate. We introduce a third kind, namely, randomized algorithms with an estimate on the probability of identifying the planted motif. We present one such algorithm. An experimental study of this algorithm has yielded promising results.
Keywords :
biology computing; probability; randomised algorithms; computational biology; planted motif search; probability; randomized algorithms; Algorithm design and analysis; Approximation algorithms; Approximation methods; Bioinformatics; Biology; Search problems; Silicon; Planted Motif Search. (l,d) Motif Search; Randomized Motif Search;
Conference_Titel :
Computational Advances in Bio and Medical Sciences (ICCABS), 2012 IEEE 2nd International Conference on
Conference_Location :
Las Vegas, NV
Print_ISBN :
978-1-4673-1320-9
Electronic_ISBN :
978-1-4673-1319-3
DOI :
10.1109/ICCABS.2012.6182654
