Efficient P-value Computation for Position Weight Matrices
Author Information
Author(s): Hélène Touzet, Jean-Stéphane Varré
Primary Institution: LIFL, UMR CNRS 8022, Université des Sciences et Technologies de Lille
Hypothesis
Can we develop a novel algorithm to compute P-values for Position Weight Matrices efficiently?
Conclusion
The TFM-PVALUE software demonstrates improved performance in computational time and precision for calculating P-values compared to existing tools.
Supporting Evidence
- The algorithm can calculate exact P-values without error for matrices with non-integer coefficients.
- TFM-PVALUE outperforms existing tools in terms of computational time.
- Experimental results show that the algorithm is capable of handling a large set of PWMs efficiently.
Takeaway
This study created a new tool that helps scientists quickly find important patterns in DNA and proteins by calculating P-values more accurately.
Methodology
The study involved developing a novel algorithm and testing it on a large set of Position Weight Matrices representing transcription factor binding sites.
Limitations
The algorithms may still require significant computation time and memory for some matrices due to the NP-hard nature of the problem.
Digital Object Identifier (DOI)
Want to read the original?
Access the complete publication on the publisher's website