A polynomial-time algorithm for the matching of crossing contact-map patterns

Contact maps are a model to capture the core information in the structure of biological molecules, e.g., proteins. A contact map consists of an ordered set S of elements (representing a protein\´s sequence of amino acids), and a set A of element pairs of S, called arcs (representing amino acids which are closely neighbored in the structure). Given two contact maps (S, A) and (S_p, A_p ) with |A| ges |A_p| the contact map pattern matching (CMPM) problem asks whether the "pattern" (S_p, A_p) "occurs" in (S, A), i.e., informally stated, whether there is a subset of |A_p| arcs in A whose arc structure coincides with A_p . CMPM captures the biological question of finding structural motifs in protein structures. In general, CMPM is NP-hard. In this paper, we show that CMPM is solvable in O(|A|⁶|A_p| time when the pattern is {<, }-structured, i.e., when each two arcs in the pattern are disjoint or crossing. Our algorithm extends to other closely related models. In particular, it answers an open question raised by Vialette that, rephrased in terms of contact maps, asked whether CMPM for {<, } -structured patterns is NP-hard or solvable in polynomial time. Our result stands in sharp contrast to the NP-hardness of closely related problems. We provide experimental results which show that contact maps derived from real protein structures can be processed efficiently