The Community for Technology Leaders
Green Image
Issue No. 04 - October-December (2010 vol. 7)
ISSN: 1545-5963
pp: 752-762
Laxmi Parida , IBM T.J. Watson Research Center, Yorktown Heights
Alberto Apostolico , Georgia Institute of Technology, Atlanta and University of Padova, Padova,
Matteo Comin , University of Padova, Padova
ABSTRACT
The discovery of motifs in biosequences is frequently torn between the rigidity of the model on one hand and the abundance of candidates on the other hand. In particular, motifs that include wild cards or “don't cares” escalate exponentially with their number, and this gets only worse if a don't care is allowed to stretch up to some prescribed maximum length. In this paper, a notion of extensible motif in a sequence is introduced and studied, which tightly combines the structure of the motif pattern, as described by its syntactic specification, with the statistical measure of its occurrence count. It is shown that a combination of appropriate saturation conditions and the monotonicity of probabilistic scores over regions of constant frequency afford us significant parsimony in the generation and testing of candidate overrepresented motifs. A suite of software programs called Varun¹ is described, implementing the discovery of extensible motifs of the type considered. The merits of the method are then documented by results obtained in a variety of experiments primarily targeting protein sequence families. Of equal importance seems the fact that the sets of all surprising motifs returned in each experiment are extracted faster and come in much more manageable sizes than would be obtained in the absence of saturation constraints.
INDEX TERMS
Computational genomics, pattern discovery, data mining, motif, protein sequence, protein family.
CITATION
Laxmi Parida, Alberto Apostolico, Matteo Comin, "VARUN: Discovering Extensible Motifs under Saturation Constraints", IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol. 7, no. , pp. 752-762, October-December 2010, doi:10.1109/TCBB.2008.123
98 ms
(Ver 3.3 (11022016))