DECOD
Computational Tool
FAIR Metrics
0 evaluations
General Information
DescriptionFast and accurate discriminative DNA motif finding
Homepagehttp://www.sb.cs.cmu.edu/DECOD
Publications
DECOD: fast and accurate discriminative DNA motif finding
Peter Huggins; Shan Zhong; Idit Shiff; Rachel Beckerman; Oleg Laptenko; Carol Prives; Marcel H. Schulz; Itamar Simon; Ziv Bar-Joseph
Motivation: Motif discovery is now routinely used in high-throughput studies including large-scale sequencing and proteomics. These datasets present new challenges. The first is speed. Many motif discovery methods do not scale well to large datasets. Another issue is identifying discriminative rather than generative motifs. Such discriminative motifs are important for identifying co-factors and for explaining changes in behavior between different conditions.
Results: To address these issues we developed a method for DECOnvolved Discriminative motif discovery (DECOD). DECOD uses a k-mer count table and so its running time is independent of the size of the input set. By deconvolving the k-mers DECOD considers context information without using the sequences directly. DECOD outperforms previous methods both in speed and in accuracy when using simulated and real biological benchmark data. We performed new binding experiments for p53 mutants and used DECOD to identify p53 co-factors, suggesting new mechanisms for p53 activation.
Availability: The source code and binaries for DECOD are available at http://www.sb.cs.cmu.edu/DECOD
Contact: zivbj@cs.cmu.edu
Supplementary information: Supplementary data are available at Bioinformatics online.
Metrics:
13
Canned Analyses generated by the tool
There are no indexed analyses by this tool at the moment.
Datasets analyzed by the tool
There are no indexed analyses by this tool at the moment.
FAIR Evaluation
Sorry, you must be signed in to evaluate this object.