A New Method for Finding Patterns in DNA and Protein Sequences
Author Information
Author(s): Elena Zaslavsky, Mona Singh
Primary Institution: Princeton University
Hypothesis
Can a combinatorial optimization framework improve motif finding in biological sequences?
Conclusion
The study shows that a combined graph theoretic and mathematical programming approach is effective for diverse motif finding applications.
Supporting Evidence
- The method identifies statistically significant motifs corresponding to known motifs.
- It finds optimal solutions to the underlying optimization problem in most cases.
- The approach is flexible enough to model several variants of the motif finding problem.
Takeaway
This study introduces a new way to find patterns in DNA and protein sequences, which helps scientists understand how genes work.
Methodology
The authors developed a combinatorial optimization framework that uses graph pruning techniques and integer linear programming to find motifs in biological sequences.
Potential Biases
Potential biases may arise from the choice of datasets and the assumptions made in the statistical significance testing.
Limitations
The method may not be optimal for all types of motif finding problems, especially those with highly variable sequences.
Statistical Information
P-Value
p<0.05
Statistical Significance
p<0.05
Digital Object Identifier (DOI)
Want to read the original?
Access the complete publication on the publisher's website