Abstract
We consider the planted (l,d)-motif search problem, which consists of finding a substring of length l that occurs in each s i in a set of input sequences {s 1,…,s t } with at most d substitutions. In this paper, we study the effect of using Balla, Davila, and Rajasekaran strategy on voting algorithm practically. We call this technique, modified voting algorithm. We present an experimental study between original and modified voting algorithms on simulated data from (9,d) to (15,d). The comparison shows that the voting algorithm is faster than its modification in all instances except the instance (15,3). We also study the effect of increasing h, which is proposed by Balla, Davila, and Rajasekaran on the modified voting algorithm. From this study, we obtained the values of the number of sequences that make the running time of modified voting algorithm less than the voting algorithm and minimum. Finally, we analyze the experimental results and give some observations according to the relations: (1) l is fixed and d is variable. (2) l is variable and d is fixed. (3) l and d are variables. (4) (l,d) is challenging.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
M M Abbas, H M Bahig (2009) Performance and analysis of modified voting algorithm for planted motif search. In Proc. of the 7th ACS/IEEE International Conference on Computer Systems and Applications, 725–731.
S Balla, J Davila, S Rajasekaran (2006) On the challenging instances of the planted motif problem. Technical Report, Department of Computer Science and Engineering, University of Connecticut, Storrs, CT.
J Buhler, M Tompa (2002) Finding motifs using random projections. Journal of Computational Biology, 9(2):225–242.
A M Carvalho, A T Freitas, A L Oliveira, M F Sagot (2005) A highly scalable algorithm for the extraction of CIS-regulatory regions. In Proc. of the 3rd Asia Pacific Bioinformatics Conference, 273–282.
F Y Chin, H C Leung (2005) Voting algorithms for discovering long motifs. In Proc. 3rd Asia Pacific Bioinformatics Conference, 261–271.
J Davila, S Balla, S Rajasekaran (2006) Space and time efficient algorithms for planted motif search. LNCS, Vol. 3992, 822–829.
L Marsan, M F Sagot (2000) Algorithms for extracting structured motifs using a suffix tree with an application to promoter and regulatory site consensus identification. Journal of Computational Biology, 7(3–4):345–362.
P Pevzner, S H Sze (2000) Combinatorial approaches to finding subtle signals in DNA sequences. In Proc. of the 8th International Conference on Intelligent Systems for Molecular Biology, 269–278.
N Pisanti, A M Carvalho, L Marsan, M F Sagot (2006) RISOTTO: Fast extraction of motifs with mismatches. LNCS, Vol. 3887, 757–768.
S Rajasekaran, S Balla, C-H Huang (2005) Exact algorithms for planted motif problems. Journal of Computational Biology, 12(8), 1117–1128.
Acknowledgments
We are grateful to Henry Leung and Francis Chin for providing us with a complete program for voting algorithm. We also thank M.M. Mohie Eldin for useful discussion.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer Science+Business Media, LLC
About this paper
Cite this paper
Bahig, H.M., Abbas, M.M., Bhery, A. (2010). Experimental Study of Modified Voting Algorithm for Planted (l,d)-Motif Problem. In: Arabnia, H. (eds) Advances in Computational Biology. Advances in Experimental Medicine and Biology, vol 680. Springer, New York, NY. https://doi.org/10.1007/978-1-4419-5913-3_8
Download citation
DOI: https://doi.org/10.1007/978-1-4419-5913-3_8
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4419-5912-6
Online ISBN: 978-1-4419-5913-3
eBook Packages: Biomedical and Life SciencesBiomedical and Life Sciences (R0)