Mocapy++ is a machine learning toolkit for training and using Bayesian networks. It has been used to develop probabilistic models of biomolecular structures. The goal of this project is to develop a Python interface to Mocapy++ and integrate it with Biopython. This will allow the training of a probabilistic model using data extracted from a database. The integration of Mocapy++ with Biopython will provide a strong support for the field of protein structure prediction, design and simulation.
Discovering the structure of biomolecules is one of the biggest problems in biology. Given an amino acid or base sequence, what is the three dimensional structure? One approach to biomolecular structure prediction is the construction of probabilistic models. A Bayesian network is a probabilistic model composed of a set of variables and their joint probability distribution, represented as a directed acyclic graph. A dynamic Bayesian network is a Bayesian network that represents sequences of variables. These sequences can be time-series or sequences of symbols, such as protein sequences. Directional statistics is concerned mainly with observations which are unit vectors in the plane or in three-dimensional space. The sample space is typically a circle or a sphere. There must be special directional methods which take into account the structure of the sample spaces. The union of graphical models and directional statistics allows the development of probabilistic models of biomolecular structures. Through the use of dynamic Bayesian networks with directional output it becomes possible to construct a joint probability distribution over sequence and structure. Biomolecular structures can be represented in a geometrically natural, continuous space. Mocapy++ is an open source toolkit for inference and learning using dynamic Bayesian networks that provides support for directional statistics. Mocapy++ is excellent for constructing probabilistic models of biomolecular structures; it has been used to develop models of protein and RNA structure in atomic detail. Mocapy++ is used in several high-impact publications, and will form the core of the molecular modeling package Phaistos, which will be released soon. The goal of this project is to develop a highly useful Python interface to Mocapy++, and to integrate that interface with the Biopython project. Through the Bio.PDB module, Biopython provides excellent functionality for data mining biomolecular structure databases. Integrating Mocapy++ and Biopython will allow training a probabilistic model using data extracted from a database. Integrating Mocapy++ with Biopython will create a powerful toolkit for researchers to quickly implement and test new ideas, try a variety of approaches and refine their methods. It will provide strong support for the field of biomolecular structure prediction, design, and simulation.
Author & Mentors
Michele Silva email@example.com
- Thomas Hamelryck
- Eric Talevich
Gain understanding of SEM and directional statistics
- Review the theory behind machine learning for bioinformatics, Markov chain Monte Carlo and dynamic Bayesian networks.
- Build the theoretical background on the algorithms used in Mocapy++, such as parameter learning of Bayesian networks using Stochastic Expectation Maximization (SEM).
Study Mocapy++'s use cases
- Read several papers and attempt to replicate part of the experiments described using Mocapy++.
- Get a better understanding of biological sequence analysis done through probabilistic models of proteins and nucleic acids.
Work with Mocapy++
- Understand Mocapy++'s internal architecture and algorithms by exploring its source code and running its test cases.
- Research other applications of Mocapy++ in Bioinformatics.
Design Mocapy++'s Python interface
- Explore the source code of Biopython to understand its design and implementation. The Mocapy++ interface to be included in Biopython must be made compatible with the methods of solving problems in Biopython.
- Design a Python interface for Mocapy++, based on its data structures and algorithms. Examine Mocapy++'s use cases and existing test cases to provide guidance for the interface design.
Implement Python bindings
- Implement test cases in Python using the new interface to Mocapy++.
- Implement python bindings for the defined interface.
Explore Mocapy++'s applications
- Develop example applications that involve data mining of biomolecular structure databases using Biopython.
- Formulate probabilistic models using Python-Mocapy++. Apply the models to solve biological problems. Examples of problems that can be solved using dynamic Bayesian networks include deciding if a pair of sequences is evolutionarily related, finding sequences which are homologous to a known evolutionary family and predicting RNA secondary structure.
Before April 25
- Get involved with the Biopython project and community.
- Learn the statistical methods used in Mocapy++ and relevant concepts in structural biology.
Community bonding period
April 25 - May 22 (4 weeks)
- Familiarize myself with Mocapy++'s functionality and architecture.
- Configure a development environment and explore the Mocapy++ and Bio.PDB source code more thoroughly. Document the code during exploration.
- Study Mocapy++ and Bio.PDB test cases in order to understand the Mocapy++ interface requirements.
- Compare options to create python bindings to C++ code (Boost Python, Cython, Swig). Perform the necessary assesments and gathering of requirements to determine the best library to create the Python bindings.
- Try fixing bugs in Biopython in order to get familiar with the development cycle.
Begin of coding phase
May 23 - June 5 (2 weeks)
- Design and implement test cases for the Mocapy++ Python interface. The tests must include data structures such as the Multi-Dimentional array; and statistic models such as the hidden Markov Models, a special case of dynamic Bayesian networks.
- Identify functions and data structures which impose challenges for the creation of Python bindings.
- Implement Python bindings for the core functions and data structures, especially the ones which are straightforward to wrap.
June 6 - June 19 (2 weeks)
- Implement Python bindings for the remaining Mocapy++ functionality that composes its interface.
- Run and improve the previously designed test cases. Make sure the newly designed interface meets the requirements of the use cases.
- Do performance analysis (code profiling) in order to make sure the Python interface of Mocapy++ is fast enough to be usable.
- Try other options to create Python bindings to C++ code, in case the implementation doesn't meet the speed requirements.
June 20 - July 3 (2 weeks)
- Integrate the Mocapy++ Python interface with Biopython.
- Implement integration tests for Mocapy++ Biopython.
- Test the operation of each module of the modified source code.
June 4 - July 10 (1 week)
- Make further changes in the code to improve robustness and functionality.
- Gather, organize, and improve the documentation written during the previous weeks.
Mid-term evaluations (July 11)
July 11 - July 24 (2 weeks)
- Design probabilistic models for biological problems. Solve them using Mocapy++ Biopython.
- Offer the code to the community for testing and suggestions for further functionality.
July 25 - August 7 (2 weeks)
- Create applications which use the data mining provided by Bio.PDB together with the machine learning features of Mocapy++.
- Profile the code and work on speed and robustness improvements.
August 8 - August 14 (1 week)
- Perform last review and improvements on code and documentation.
August 15 - August 21 (1 week)
- A buffer for any unpredictable delay.
Firm pencils down (August 22)
Hosted at the gSoC11 Mocapy branch
Options to create Python bindings to C++ code
There is already an effort to provide bindings for Mocapy++ using Swig. However, Swig is not the best option if performance is to be required. The Sage project aims at providing an open source alternative to Mathematica or Maple. Cython was developed in conjunction with Sage (it is an independent project, though), thus it is based on Sage's requirements. They tried Swig, but declined it for performance issues. According to the Sage programming guide "The idea was to write code in C++ for SAGE that needed to be fast, then wrap it in SWIG. This ground to a halt, because the result was not sufficiently fast. First, there is overhead when writing code in C++ in the first place. Second, SWIG generates several layers of code between Python and the code that does the actual work". This was written back in 2004, but it seems things didn't evolve much. The only reason I would consider Swig is for future including Mocapy++ bindings on BioJava and BioRuby projects.
Boost Python is comprehensive and well accepted by the Python community. I would go for it for its extensive use and testing. I would decline it for being hard to debug and having a complicated building system. I don't think it would be worth including a boost dependency just for the sake of creating the Python bindings, but since Mocapy++ already depends on Boost, using it becomes a more attractive option. In my personal experience, Boost Python is very mature and there are no limitations on what one can do with it. When it comes to performance, Cython still overcomes it. Have a look at the Cython C++ wrapping benchmarks and check the timings of Cython against Boost Python. There are also previous benchmarks comparing Swig and Boost Python.
It is incredibly faster than other options to create python bindings to C++ code, according to several benchmarks available on the web. Check the Simple benchmark between Cython and Boost.Python. It is also very clean and simple, yet powerful. Python's doc on porting extension modules mentions cython: "If you are writing a new extension module, you might consider Cython." Cython has now support for efficient interaction with numpy arrays. it is a young, but developing language and I would definitely give it a try for its leanness and speed.
Since Boost is well supported and Mocapy++ already relies on it, we decided to use Boost.Python for the bindings.
For further information see Mocapy++Biopython - Box of ideas.
The source code for the prototype is on the gSoC11 branch: http://mocapy.svn.sourceforge.net/viewvc/mocapy/branches/gSoC11/bindings/
Bindings for a few Mocapy++ features and a couple of examples to find possible implementation and performance issues.
- Implemented the examples [hmm_discrete] and [discrete_hmm_with_prior] in Python, assuming the interface Mocapy++ already provides.
- Implemented the bindings to provide a minimum subset of functionality, in order to run the implemented examples.
- Compared the performance of C++ and Python versions.
Mocapy++’s interface remained unchanged, so the tests look similar to the ones in Mocapy/examples.
In the prototype the bindings were all implemented in a single module. For the actual implementation, we could mirror the src packages structure, having separated bindings for each package such as discrete, inference, etc.
It was possible to implement all the functionality required to run the examples. It was not possible to use the vector_indexing_suite when creating bindings for vectors of MDArrays. A few operators (in the MDArray) must be implemented in order to export indexable C++ containers to Python.
Two Mocapy++ examples that use discrete nodes were implemented in Python. There was no problem in exposing Mocapy’s data structures and algorithms. The performance of the Python version is very close to the original Mocapy++.
For additional details have a look at the Mocapy++ Bindings Prototype report.