Title :
HMMF: An Hidden Markov Model Based Approach for Motif Finding
Author :
Liu, Chunmei ; Song, Yinglei ; Garuba, Moses ; Burge, Legand
Author_Institution :
Dept. of Syst. & Comput. Sci., Howard Univ., Washington, DC, USA
Abstract :
Transcriptional factor binding site (TFBS) motifs on DNA genomes play important functional roles in gene expression and regulation. Accurately identifying the motifs is thus an important problem in bioinformatics. However, exhaustively enumerating all possible locations for a motif in a set of sequences is computationally intractable. Many heuristic or approximation algorithms and machine learning based approaches have been developed for this problem. In this paper, we develop a novel approach that can efficiently explore all possible locations of TFBS motifs in a set of sequences with high accuracy. Our approach constructs an ensemble of k Hidden Markov Models (HMM) through local alignments of two sequences in the set and then progressively aligns each HMM in the ensemble to other sequences in the set and update the parameters of the k HMMs. Our experimental results showed that our approach could achieve higher accuracy with satisfying efficiency than previous state-of-art approaches.
Keywords :
DNA; bioinformatics; genetics; genomics; hidden Markov models; learning (artificial intelligence); DNA genomes; DNA sequences; HMMF; TFBS motif finding; bioinformatics; gene expression; hidden Markov model; machine learning; transcriptional factor binding site; Approximation algorithms; Bioinformatics; DNA; Gene expression; Genomics; Heuristic algorithms; Hidden Markov models; Machine learning; Machine learning algorithms; Sequences;
Conference_Titel :
Bioinformatics and Biomedical Engineering , 2009. ICBBE 2009. 3rd International Conference on
Conference_Location :
Beijing
Print_ISBN :
978-1-4244-2901-1
Electronic_ISBN :
978-1-4244-2902-8
DOI :
10.1109/ICBBE.2009.5162905