PhyME: A probabilistic algorithm for finding motifs in sets of orthologous sequences

151Citations
Citations of this article
121Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

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, and human. Conclusions: The results demonstrate that the new approach improves motif discovery by exploiting multiple species information. © 2004 Sinha et al; licensee BioMed Central Ltd.

Cite

CITATION STYLE

APA

Sinha, S., Blanchette, M., & Tompa, M. (2004). PhyME: A probabilistic algorithm for finding motifs in sets of orthologous sequences. BMC Bioinformatics, 5. https://doi.org/10.1186/1471-2105-5-170

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free