Theses and Dissertations - UTB/UTPA

Date of Award


Document Type


Degree Name

Master of Science (MS)


Computer Science

First Advisor

Dr. Bin Fu

Second Advisor

Dr. Zhixiang Chen

Third Advisor

Dr. Artem Chebotko


In this thesis, a natural probabilistic model has been used to test the quality of motif discovery programs. In this model, there are k background sequences, in which each character is a random character from Σ. Motif is a string G = g1g2 . . . gm. Each background sequence is implanted a probabilistically generated approximate copy of G. For each copy b1b2 . . . bm of G, every character bi is probabilistically generated such that the probability for bi 6= gi is at most α. Based on this model, two randomized algorithms ,one deterministic algorithm and one enumerative algorithm are designed, which can handle any motif patterns, and run much faster than those before, one can even run in sublinear time. These methods have been implemented in software.


Copyright 2013 Yuan Xue. All Rights Reserved.

Granting Institution

University of Texas-Pan American