Computational techniques for motif search.
In the study of protein-protein interactions, one is interested in identifying domains as well as short motifs that bind to these domains. Short motifs also confer functions to proteins such as post-translational modification, protein-protein interaction, and protein trafficking. Identification of domains is relatively easy since they are sufficiently long enough to render the likelihood of occurrences by random chance very low. On the other hand, the identification of motifs is a challenge since they are typically very short. Thus it is vital to develop efficient techniques to identify motifs. In this paper we survey some of the techniques that have been proposed in the literature for motifs identification.
Rajasekaran
Sanguthevar
S
Dept. of CSE, University of Connecticut, Storrs, CT 06269-2155, USA. rajasek@engr.uconn.edu
D000465:Algorithms; D001185:Artificial Intelligence; D016000:Cluster Analysis; D019295:Computational Biology / Q000379:methods; D003627:Data Interpretation, Statistical; D020407:Internet; D010363:Pattern Recognition, Automated / Q000706:statistics & numerical data; D054730:Protein Interaction Domains and Motifs; D025941:Protein Interaction Mapping / Q000706:statistics & numerical data*