Startseite Supervised Detection of Conserved Motifs in DNA Sequences with Cosmo
Artikel
Lizenziert
Nicht lizenziert Erfordert eine Authentifizierung

Supervised Detection of Conserved Motifs in DNA Sequences with Cosmo

  • Oliver Bembom , Sunduz Keles und Mark J. van der Laan
Veröffentlicht/Copyright: 23. Februar 2007

A number of computational methods have been proposed for identifying transcription factor binding sites from a set of unaligned sequences that are thought to share the motif in question. We here introduce an algorithm, called cosmo, that allows this search to be supervised by specifying a set of constraints that the position weight matrix of the unknown motif must satisfy. Such constraints may be formulated, for example, on the basis of prior knowledge about the structure of the transcription factor in question. The algorithm is based on the same two-component multinomial mixture model used by MEME, with stronger reliance, however, on the likelihood principle instead of more ad-hoc criteria like the E-value. The intensity parameter in the ZOOPS and TCM models, for instance, is estimated based on a profile-likelihood approach, and the width of the unknown motif is selected based on BIC. These changes allow cosmo to outperform MEME even in the absence of any constraints, as evidenced by 2- to 3-fold greater sensitivity in some simulation studies. Additional improvements in performance can be achieved by selecting the model type (OOPS, ZOOPS, or TCM) data-adaptively or by supplying correctly specified constraints, especially if the motif appears only as a weak signal in the data. The algorithm can data-adaptively choose between working in a given constrained model or in the completely unconstrained model, guarding against the risk of supplying mis-specified constraints. Simulation studies suggest that this approach can offer 3 to 3.5 times greater sensitivity than MEME. The algorithm has been implemented in the form of a stand-alone C program as well as a web application that can be accessed at http://cosmoweb.berkeley.edu. An R package is available through Bioconductor (http://bioconductor.org).

Published Online: 2007-2-23

©2011 Walter de Gruyter GmbH & Co. KG, Berlin/Boston

Artikel in diesem Heft

  1. Article
  2. Accounting for Dependence in Similarity Data from DNA Fingerprinting
  3. Normalization of Dye Bias in Microarray Data Using the Mixture of Splines Model
  4. A Generalized Sidak-Holm Procedure and Control of Generalized Error Rates under Independence
  5. Using Duplicate Genotyped Data in Genetic Analyses: Testing Association and Estimating Error Rates
  6. Likelihood-Based Inference for Multi-Color Optical Mapping
  7. Sparse Logistic Regression with Lp Penalty for Biomarker Identification
  8. Super Learning: An Application to the Prediction of HIV-1 Drug Resistance
  9. Supervised Detection of Conserved Motifs in DNA Sequences with Cosmo
  10. Accurate Ranking of Differentially Expressed Genes by a Distribution-Free Shrinkage Approach
  11. Statistical Inference for Quantitative Polymerase Chain Reaction Using a Hidden Markov Model: A Bayesian Approach
  12. A Bayesian Model of AFLP Marker Evolution and Phylogenetic Inference
  13. Sequential Quantitative Trait Locus Mapping in Experimental Crosses
  14. Case-Control Inference of Interaction between Genetic and Nongenetic Risk Factors under Assumptions on Their Distribution
  15. Inference on the Limiting False Discovery Rate and the P-value Threshold Parameter Assuming Weak Dependence between Gene Expression Levels within Subject
  16. Reconstructing Gene Regulatory Networks with Bayesian Networks by Combining Expression Data with Multiple Sources of Prior Knowledge
  17. Cox Survival Analysis of Microarray Gene Expression Data Using Correlation Principal Component Regression
  18. A Method for Meta-Analysis of Case-Control Genetic Association Studies Using Logistic Regression
  19. Approximating the Variance of the Conditional Probability of the State of a Hidden Markov Model
  20. Using Linear Mixed Models for Normalization of cDNA Microarrays
  21. Experimental Design for Two-Color Microarrays Applied in a Pre-Existing Split-Plot Experiment
  22. The Cyclohedron Test for Finding Periodic Genes in Time Course Expression Studies
  23. H-Tuple Approach to Evaluate Statistical Significance of Biological Sequence Comparison with Gaps
  24. Multiple Testing Issues in Discriminating Compound-Related Peaks and Chromatograms from High Frequency Noise, Spikes and Solvent-Based Noise in LC - MS Data Sets
  25. A Bayesian Approach to Estimation and Testing in Time-course Microarray Experiments
  26. Super Learner
  27. Testing for Trends in Dose-Response Microarray Experiments: A Comparison of Several Testing Procedures, Multiplicity and Resampling-Based Inference
  28. On the Operational Characteristics of the Benjamini and Hochberg False Discovery Rate Procedure
  29. A Comparison of Methods to Control Type I Errors in Microarray Studies
  30. Selection of Biologically Relevant Genes with a Wrapper Stochastic Algorithm
  31. T-BAPS: A Bayesian Statistical Tool for Comparison of Microbial Communities Using Terminal-restriction Fragment Length Polymorphism (T-RFLP) Data
  32. Population Structure and Covariate Analysis Based on Pairwise Microsatellite Allele Matching Frequencies
  33. Estimating the Arm-Wise False Discovery Rate in Array Comparative Genomic Hybridization Experiments
  34. An Expectation Maximization Approach to Estimate Malaria Haplotype Frequencies in Multiply Infected Children
  35. Estimation of Expression Levels in Spotted Microarrays with Saturated Pixels
  36. Improving Divergence Time Estimation in Phylogenetics: More Taxa vs. Longer Sequences
  37. Fully Bayesian Mixture Model for Differential Gene Expression: Simulations and Model Checks
  38. Multiple Testing for SNP-SNP Interactions
Heruntergeladen am 8.9.2025 von https://www.degruyterbrill.com/document/doi/10.2202/1544-6115.1260/html
Button zum nach oben scrollen