Fast motif recognition via application of statistical thresholds
Open Access
- 18 January 2010
- journal article
- Published by Springer Nature in BMC Bioinformatics
- Vol. 11 (1) , S11
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- Exact Algorithms for Planted Motif ProblemsJournal of Computational Biology, 2005
- Identification of transcription factor binding sites with variable-order Bayesian networksBioinformatics, 2005
- Assessing computational tools for the discovery of transcription factor binding sitesNature Biotechnology, 2005
- Weeder Web: discovery of transcription factor binding sites in a set of sequences from co-regulated genesNucleic Acids Research, 2004
- Finding functional sequence elements by multiple local alignmentNucleic Acids Research, 2004
- On the complexity of finding common approximate substringsTheoretical Computer Science, 2003
- Finding Similar Regions in Many SequencesJournal of Computer and System Sciences, 2002
- Finding Motifs Using Random ProjectionsJournal of Computational Biology, 2002
- On covering problems of codesTheory of Computing Systems, 1997
- TRANSFAC: a database on transcription factors and their DNA binding sitesNucleic Acids Research, 1996