Please use this identifier to cite or link to this item:
http://hdl.handle.net/11375/22706
Title: | Stochastic Heuristic Program for Target Motif Identification |
Authors: | Zhang, Xian |
Advisor: | Jiang, Tao |
Department: | Computer Science |
Keywords: | stochastic heuristic program, target motif, identification, computational biology, solution algorithms |
Publication Date: | 12-Aug-1999 |
Abstract: | <p> Identifying motifs that are "close" to one or more substrings in each sequence in a given set of sequences and hence characterize that set is an important problem in computational biology. The target motif identification problem requires motifs that characterize one given set of sequences but are far from every substring in another given set of sequences. This problem is N P-hard and hence is unlikely to have efficient optimal solution algorithms. In this thesis, we propose a set of modifications to one of the most popular stochastic heuristics for finding motifs, Gibbs Sampling [LAB+93], which allow this heuristic to detect target motifs. We also present the results of four simulation studies and tests on real protein datasets which suggest that these modified heuristics are very good at (and are even, in some cases, necessary for) detecting target motifs.</p> |
URI: | http://hdl.handle.net/11375/22706 |
Appears in Collections: | Digitized Open Access Dissertations and Theses |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Zhang_Xian_1999Aug_Masters..pdf | 2.7 MB | Adobe PDF | View/Open |
Items in MacSphere are protected by copyright, with all rights reserved, unless otherwise indicated.