Performance and analysis of modified voting algorithm for planted motif search
Abbas, Mostafa M.; Bahig, Hazem;
Abstract
We consider the planted (l, d) motif search problem, which consists of finding a substring of length l that occurs in a set of input sequences {s , s , ⋯ s } with maximum Hamming distance, d, around the similar substring. In this paper, we present an experimental comparison between voting algorithm and its modification for planted motif on simulated data from (9, d) to (15, d) in case of challenging instances. The experimental results show that the modified voting algorithm is not better than voting algorithm as theoretically suggested. The results show that the running of voting algorithm is faster than modified voting algorithm in all the cases studied. We also determine, experimentally, the number of sequences that are required to make the modified voting algorithm faster than voting algorithm. © 2009 IEEE. 1 2 n
Other data
| Title | Performance and analysis of modified voting algorithm for planted motif search | Authors | Abbas, Mostafa M.; Bahig, Hazem | Keywords | Bioinformatics;Voting technique;Planted motif search problem;Exact algorithms | Issue Date | 19-Oct-2009 | Journal | 2009 IEEE/ACS International Conference on Computer Systems and Applications, AICCSA 2009 | ISBN | 9781424438068 | DOI | 10.1109/AICCSA.2009.5069407 | Scopus ID | 2-s2.0-70349931755 |
Recommend this item
Similar Items from Core Recommender Database
Items in Ain Shams Scholar are protected by copyright, with all rights reserved, unless otherwise indicated.