Abstract
The problem of identifying meaningful patterns (i.e., motifs) from biological data has been studied extensively due to its paramount importance. Motifs are fundamental functional elements in proteins vital for understanding gene function, human disease, and identifying potential therapeutic drug targets. Several versions of the motif search problem have been identified in the literature. Numerous algorithms have been proposed for motif search as well. In this talk we survey some of these algorithms. We also summarize our contributions to motif search and related problems. In addition, we will summarize MnM, a web based system built by us for motif search that is used by biologists widely.
Chapter PDF
Similar content being viewed by others
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rajasekaran, S. (2011). Computational Techniques for Motif Search. In: Aluru, S., et al. Contemporary Computing. IC3 2011. Communications in Computer and Information Science, vol 168. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22606-9_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-22606-9_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22605-2
Online ISBN: 978-3-642-22606-9
eBook Packages: Computer ScienceComputer Science (R0)