BACKGROUND:This paper addresses the problem of discovering transcription factor binding sites in heterogeneous sequence data, which includes regulatory sequences of one or more genes, as well as their orthologs in other species.RESULTS:We propose an algorithm that integrates two important aspects of a motif's significance overrepresentation and cross-species conservation into one probabilistic score. The algorithm allows the input orthologous sequences to be related by any user-specified phylogenetic tree. It is based on the Expectation-Maximization technique, and scales well with the number of species and the length of input sequences. We evaluate the algorithm on synthetic data, and also present results for data sets from yeast, fly, an...
Abstract Background Algorithms that locate evolutionarily conserved sequences have become powerful t...
Novel computational methods for finding transcription factor binding motifs have long been sought du...
We address the problem of de novo motif identification. That is, given a set of DNA sequences we try...
Abstract Background This paper addresses the problem of discovering transcription factor binding sit...
A central problem in the bioinformatics of gene regulation is to find the binding sites for regulato...
The identification of sequence motifs is a funda-mental method for suggesting good candidates for bi...
<div><p>A central problem in the bioinformatics of gene regulation is to find the binding sites for ...
Motivation: Discovery of regulatory motifs in unaligned DNA sequences remains a fundamental problem ...
Motivation: Finding common patterns, motifs, from a set of promoter regions of coregulated genes is ...
Motivation: Finding common patterns, motifs, from a set of promoter regions of coregulated genes is ...
Motivation: A variety of algorithms have been developed to predict transcription factor binding site...
discovery of transcription factor binding sites is still a challenging problem. The growing number ...
discovery of transcription factor binding sites is still a challenging problem. The growing number ...
BACKGROUND: Computational de novo discovery of transcription factor binding sites is still a challen...
Abstract Background Computational methods for characterizing novel transcription factor binding site...
Abstract Background Algorithms that locate evolutionarily conserved sequences have become powerful t...
Novel computational methods for finding transcription factor binding motifs have long been sought du...
We address the problem of de novo motif identification. That is, given a set of DNA sequences we try...
Abstract Background This paper addresses the problem of discovering transcription factor binding sit...
A central problem in the bioinformatics of gene regulation is to find the binding sites for regulato...
The identification of sequence motifs is a funda-mental method for suggesting good candidates for bi...
<div><p>A central problem in the bioinformatics of gene regulation is to find the binding sites for ...
Motivation: Discovery of regulatory motifs in unaligned DNA sequences remains a fundamental problem ...
Motivation: Finding common patterns, motifs, from a set of promoter regions of coregulated genes is ...
Motivation: Finding common patterns, motifs, from a set of promoter regions of coregulated genes is ...
Motivation: A variety of algorithms have been developed to predict transcription factor binding site...
discovery of transcription factor binding sites is still a challenging problem. The growing number ...
discovery of transcription factor binding sites is still a challenging problem. The growing number ...
BACKGROUND: Computational de novo discovery of transcription factor binding sites is still a challen...
Abstract Background Computational methods for characterizing novel transcription factor binding site...
Abstract Background Algorithms that locate evolutionarily conserved sequences have become powerful t...
Novel computational methods for finding transcription factor binding motifs have long been sought du...
We address the problem of de novo motif identification. That is, given a set of DNA sequences we try...