Refining motifs by improving information content scores using neighborhood profile search
2006
Improving Motif Finding with Neighborhood Profile Search
publication
Evidence: moderate
Author Information
Author(s): Chandan K. Reddy, Yao-Chung Weng, Hsiao-Dong Chiang
Primary Institution: Cornell University
Hypothesis
Can a novel optimization framework improve motif finding by systematically exploring local optimal solutions?
Conclusion
The proposed neighborhood profile search method significantly enhances the information content scores of motif finding algorithms.
Supporting Evidence
- The new framework systematically explores local maxima to improve motif finding.
- Experiments show significant improvements in information content scores using the proposed method.
- The method can be applied to both synthetic and real datasets.
Takeaway
This study shows a new way to find patterns in DNA by looking around the best solutions to find even better ones.
Methodology
The study introduces a hybrid algorithm that combines global and local search methods to refine motifs in DNA sequences.
Limitations
The method may still converge to local optima and requires careful selection of initial conditions.
Digital Object Identifier (DOI)
Want to read the original?
Access the complete publication on the publisher's website