Algorithm engineering for optimal alignment of protein structure distance matrices
Protein structural alignment is an important problem in computational biology. In this paper, we present first successes on provably optimal pairwise alignment of protein inter-residue distance matrices, using the popular dali scoring function. We introduce the structural alignment problem formally, which enables us to express a variety of scoring functions used in previous work as special cases in a unified framework. Further, we propose the first mathematical model for computing optimal structural alignments based on dense inter-residue distance matrices. We therefore reformulate the problem as a special graph problem and give a tight integer linear programming model. We then present algorithm engineering techniques to handle the huge integer linear programs of real-life distance matrix alignment problems. Applying these techniques, we can compute provably optimal dali alignments for the very first time.
KeywordsProtein structure distance matrix alignment Algorithm engineering Integer linear programming Branch-and-cut Preprocessing dali
Unable to display preview. Download preview PDF.
- 6.Collet, G., Andonov, R., Yanev, N., Gibrat, J.F.: Local protein threading by mixed integer programming. Discret. Appl. Math. (2010 in press)Google Scholar
- 10.Holm, L., Kääriäinen, S., Wilton, C., Plewczynski, D.: Using Dali for structural comparison of proteins. Curr. Protoc. Bioinform. Chapter 5 (2006)Google Scholar
- 12.Jain, B.J., Lappe, M.: Joining softassign and dynamic programming for the contact map overlap problem. In: Hochreiter, S., Wagner, R. (eds.) BIRD. Lecture Notes in Computer Science, vol. 4414, pp. 410–423. Springer, UK (2007)Google Scholar