Multiple Sequence Local Alignment Using Monte Carlo EM Algorithm

  • Chengpeng Bi
Conference paper

DOI: 10.1007/978-3-540-72031-7_42

Part of the Lecture Notes in Computer Science book series (LNCS, volume 4463)
Cite this paper as:
Bi C. (2007) Multiple Sequence Local Alignment Using Monte Carlo EM Algorithm. In: Măndoiu I., Zelikovsky A. (eds) Bioinformatics Research and Applications. ISBRA 2007. Lecture Notes in Computer Science, vol 4463. Springer, Berlin, Heidelberg


The Expectation Maximization (EM) motif-finding algorithm is one of the most popular de novo motif discovery methods. However, the EM algorithm largely depends on its initialization and can be easily trapped in local optima. This paper implements a Monte Carlo version of the EM algorithm that performs multiple sequence local alignment to overcome the drawbacks inherent in conventional EM motif-finding algorithms. The newly implemented algorithm is named as Monte Carlo EM Motif Discovery Algorithm (MCEMDA). MCEMDA starts from an initial model, and then it iteratively performs Monte Carlo simulation and parameter update steps until convergence. MCEMDA is compared with other popular motif-finding algorithms using simulated, prokaryotic and eukaryotic motif sequences. Results show that MCEMDA outperforms other algorithms. MCEMDA successfully discovers a helix-turn-helix motif in protein sequences as well. It provides a general framework for motif-finding algorithm development. A website of this program will be available at


Expectation Maximization (EM) Monte Carlo EM Motif Discovery Multiple Sequence Local Alignment Transcriptional Regulation 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Chengpeng Bi
    • 1
  1. 1.Children’s Mercy Hospitals, Schools of Medicine, Computing and Engineering, University of Missouri, 2401 Gillham Road, Kansas City, MO 64108USA

Personalised recommendations