MEET: Motif elements estimation toolkit

MEET is an R package that integrates a set of algorithms for the detection of transcription factor binding sites (TFBS). The MEET R package includes five motif searching algorithms: MEME/MAST(Multiple Expectation-Maximization for Motif Elicitation), Q-residuals, MDscan (Motif Discovery scan), ITEME (Information Theory Elements for Motif Estimation) and MATCH. In addition MEET allows the user to work with different alignment algorithms: MUSCLE (Multiple Sequence Comparison by Log-Expectation), ClustalW and MEME. The package can work in two modes, training and detection. The training mode allows the user to choose the best parameters of a detector. Once the parameters are chosen, the detection mode allows to analyze a genome looking for binding sites. Both modes can combine the different alignment and detection methods, offering multiple possibilities. Combining the alignments and the detection algorithms makes possible the comparison between detection models at the same level, without having to care about the differences produced during the alignment process. The MEET R package can be downloaded from http://sisbio.recerca.upc.edu/R/MEET_1.0. tar.gz

[1]  R. A. Leibler,et al.  On Information and Sufficiency , 1951 .

[2]  J. Thompson,et al.  CLUSTAL W: improving the sensitivity of progressive multiple sequence alignment through sequence weighting, position-specific gap penalties and weight matrix choice. , 1994, Nucleic acids research.

[3]  Nicola J. Rinaldi,et al.  Transcriptional Regulatory Networks in Saccharomyces cerevisiae , 2002, Science.

[4]  Andres Cicuttin,et al.  Entropic approach to information coding in DNA molecules , 2001 .

[5]  Robert C. Edgar,et al.  MUSCLE: multiple sequence alignment with high accuracy and high throughput. , 2004, Nucleic acids research.

[6]  Charles Elkan,et al.  Fitting a Mixture Model By Expectation Maximization To Discover Motifs In Biopolymer , 1994, ISMB.

[7]  L. Kraal,et al.  Transcriptional Regulatory Networks in Saccharomyces cerevisiae , 2009 .

[8]  H. K. Dai,et al.  A survey of DNA motif finding algorithms , 2007, BMC Bioinformatics.

[9]  A. Rényi.  On Measures of Entropy and Information , 1961 .

[10]  Alexander E. Kel,et al.  MATCHTM: a tool for searching transcription factor binding sites in DNA sequences , 2003, Nucleic Acids Res..

[11]  Alexandre Perera-Lluna,et al.  A Subspace Method for the Detection of Transcription Factor Binding Sites , 2012, BIOINFORMATICS.

[12]  Michael Gribskov,et al.  Combining evidence using p-values: application to sequence homology searches , 1998, Bioinform..

[13]  Pere Caminal,et al.  Computational Detection of Transcription Factor Binding Sites Through Differential Rényi Entropy , 2010, IEEE Transactions on Information Theory.

[14]  Wei Wei,et al.  Comparative Analysis of Regulatory Motif Discovery Tools for Transcription Factor Binding Sites , 2007, Genom. Proteom. Bioinform..