Supervised detection of conserved motifs in DNA sequences cosmo searches a set of unaligned DNA sequences for a shared motif that may, for example, represent a common transcription factor binding site. The algorithm is similar to MEME, but also allows the user to specify a set of constraints that the position weight matrix of the unknown motif must satisfy. Such constraints may include bounds on the information content across certain regions of the unknown motif, for example, and can often be formulated on the basis of prior knowledge about the structure of the transcription factor in question. The unknown motif width, the distribution of motif occurrences (OOPS, ZOOPS, or TCM), as well as the appropriate constraint set can be selected data-adaptively.
Keywords for this software
References in zbMATH (referenced in 3 articles , 1 standard article )
Showing results 1 to 3 of 3.
- Marras, Simone; Kelly, James F.; Moragues, Margarida; Müller, Andreas; Kopera, Michal A.; Vázquez, Mariano; Giraldo, Francis X.; Houzeaux, Guillaume; Jorba, Oriol: A review of element-based Galerkin methods for numerical weather prediction: finite elements, spectral elements, and discontinuous Galerkin (2016)
- Kopera, Michal A.; Giraldo, Francis X.: Analysis of adaptive mesh refinement for IMEX discontinuous Galerkin solutions of the compressible Euler equations with application to atmospheric simulations (2014)
- Bembom, Oliver; Keles, Sunduz; van der Laan, Mark J.: Supervised detection of conserved motifs in DNA sequences with cosmo (2007)