Related Experiment Video
Updated: Jun 25, 2026

A Practical Guide to Phylogenetics for Nonexperts
Published on: February 5, 2014
DNA motif alignment by evolving a population of Markov chains
1Bioinformatics and Intelligent Computing Lab, Division of Clinical Pharmacology, Children's Mercy Hospitals, Kansas City, Missouri, USA. cbi@cmh.edu
This study introduces a novel algorithm for de novo motif-finding in genomes. By enabling information exchange between Markov chains, the new method improves convergence and outperforms existing algorithms for identifying cis-regulatory elements.
Area of Science:
- Genomics
- Bioinformatics
- Computational Biology
Background:
- De novo motif-finding in genomes is challenging, with existing Markov chain Monte Carlo (MCMC) methods like Gibbs samplers often getting stuck in local maxima.
- Current MCMC approaches require multiple independent runs without information exchange, limiting their efficiency in finding optimal local alignments.
Purpose of the Study:
- To develop a novel motif-finding algorithm that overcomes the limitations of existing methods by enabling information exchange between computational processes.
- To improve the accuracy and efficiency of identifying cis-regulatory elements and de novo motifs in genomic sequences.
Main Methods:
- Introduced a population-based motif-finding algorithm using information exchange (PMC) that evolves a population of Markov chains.
- Employed the Metropolis-Hastings sampler (MHS) and a population-based proposal distribution for stochastic sampling and adaptive evolution towards a global maximum.
- Developed an independent Markov chains (IMC) algorithm for comparison, running multiple chains without information exchange.
Main Results:
- Experimental studies confirmed that pooling information among motif samplers enhances performance.
- The novel PMC algorithm demonstrated improved convergence rates compared to traditional methods.
- The PMC algorithm outperformed other popular motif-finding algorithms on both simulated and biological motif sequences.
Conclusions:
- Utilizing pooled information in a population of motif samplers significantly improves performance in de novo motif-finding.
- The developed PMC algorithm offers a more effective and convergent approach for identifying genomic motifs compared to existing methods.
Related Concept Videos
Evolutionary Relationships through Genome Comparisons
Conserved Binding Sites
Binding sites are often located in large pockets, and if their location on a protein’s surface is unknown, it can be predicted using various approaches. The energetic method computationally analyses the...
Conservation of Protein Domains Over Different Proteins
A limited set of protein domains often duplicate and recombine during evolution. These domains can be organized in different combinations to form...
Conservation of Protein Domains
A limited set of protein domains often duplicate and recombine during evolution. These domains can be organized in different combinations to form...
Modern Molecular Taxonomy
Gene Evolution - Fast or Slow?
In contrast, regions which code...

