Seeder: discriminative seeding DNA motif discovery
Open Access
- 21 August 2008
- journal article
- research article
- Published by Oxford University Press (OUP) in Bioinformatics
- Vol. 24 (20) , 2303-2307
Abstract
Motivation: The computational identification of transcription factor binding sites is a major challenge in bioinformatics and an important complement to experimental approaches. Results: We describe a novel, exact discriminative seeding DNA motif discovery algorithm designed for fast and reliable prediction of cis-regulatory elements in eukaryotic promoters. The algorithm is tested on biological benchmark data and shown to perform equally or better than other motif discovery tools. The algorithm is applied to the analysis of plant tissue-specific promoter sequences and successfully identifies key regulatory elements. Availability: The Seeder Perl distribution includes four modules. It is available for download on the Comprehensive Perl Archive Network (CPAN) at http://www.cpan.org. Contact:martina.stromvik@mcgill.ca Supplementary information: Supplementary data are available at Bioinformatics online.Keywords
This publication has 26 references indexed in Scilit:
- Improved benchmarks for computational motif discoveryBMC Bioinformatics, 2007
- STAMP: a web tool for exploring DNA-binding motif similaritiesNucleic Acids Research, 2007
- Computational identification of transcriptional regulatory elements in DNA sequenceNucleic Acids Research, 2006
- A gene expression map of Arabidopsis thaliana developmentNature Genetics, 2005
- Assessing computational tools for the discovery of transcription factor binding sitesNature Biotechnology, 2005
- Applied bioinformatics for the identification of regulatory elementsNature Reviews Genetics, 2004
- Statistical significance for genomewide studiesProceedings of the National Academy of Sciences, 2003
- Gibberellin Biosynthesis and Response during Arabidopsis Seed Germination[W]The Plant Cell, 2003
- Finding motifs in the twilight zoneBioinformatics, 2002
- A Survey of Fast Exponentiation MethodsJournal of Algorithms, 1998