An experimental comparison of PMSprune and other algorithms for motif search Online publication date: Wed, 29-Apr-2015
by Dolly Sharma; Sanguthevar Rajasekaran; Sudipta Pathak
International Journal of Bioinformatics Research and Applications (IJBRA), Vol. 10, No. 6, 2014
Abstract: A comparative study of the various motif search algorithms is very important for several reasons. For example, we could identify the strengths and weaknesses of each. As a result, we might be able to devise hybrids that will perform better than the individual components. In this paper, we (either directly or indirectly) compare the performance of PMSprune (an algorithm based on the (l, d)-motif model) and several other algorithms in terms of seven measures and using well-established benchmarks. We have employed several benchmark datasets including the one used by Tompa et al. It is observed that both PMSprune and DME (an algorithm based on position-specific score matrices), in general, perform better than the 13 algorithms reported in Tompa et al. Subsequently, we have compared PMSprune and DME on other benchmark datasets including ChIP-Chip, ChIP-Seq and ABS. Between PMSprune and DME, PMSprune performs better than DME on six measures. DME performs better than PMSprune on one measure (namely, specificity).
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Bioinformatics Research and Applications (IJBRA):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook