New DNA Motif-Finding Algorithm Using Markov Chains
Author Information
Author(s): Bi Chengpeng, Michael Q Zhang, Michael S Waterman, Xuegong Zhang
Primary Institution: Children's Mercy Hospitals, Kansas City, Missouri, USA; University of Missouri, Kansas City, Missouri, USA
Hypothesis
Can a population of Markov chains with information exchange improve motif-finding in genomic sequences?
Conclusion
The new PMC algorithm improves convergence and outperforms other tested algorithms in motif discovery.
Supporting Evidence
- The PMC algorithm showed improved convergence compared to independent Markov chains.
- Experimental studies demonstrated that pooled information enhances motif-finding performance.
- PMC outperformed other popular algorithms in tests with simulated and biological motif sequences.
Takeaway
This study created a new way to find DNA patterns by using multiple Markov chains that share information, making it easier to find important sequences.
Methodology
The study used a novel motif-finding algorithm that evolves a population of Markov chains with information exchange, initialized as random alignments and updated through local alignments.
Limitations
The algorithm's performance may vary based on the size of the population and the complexity of the sequences.
Digital Object Identifier (DOI)
Want to read the original?
Access the complete publication on the publisher's website