On the Complexity of the Crossing Contact Map Pattern Matching Problem

  • Shuai Cheng Li
  • Ming Li
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4175)


Contact maps are concepts that are often used to represent structural information in molecular biology. The contact map pattern matching (CMPM) problem is to decide if a contact map (called the pattern) is a substructure of another contact map (called the target). In general, the problem is NP-hard, but when there are restrictions on the form of the pattern, the problem can, in some case, be solved in polynomial time. In particular, a polynomial time algorithm has been proposed [1] for the case when the patterns are so-called crossing contact maps. In this paper we show that the problem is actually NP-hard, and show a flaw in the proposed polynomial-time algorithm. Through the same method, we also show that a related problem, namely, the 2-interval patten matching problem with \(\{<, \between\}\) -structured patterns and disjoint interval ground set, is NP-hard.


Polynomial Time Match Problem Size Clique Graph Theoretic Concept Protein Structure Similarity 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Gramm, J.: A polynomial-time algorithm for the matching of crossing contact-map patterns. IEEE/ACM Trans. Comput. Biol. Bioinformatics 1, 171–180 (2004)CrossRefGoogle Scholar
  2. 2.
    Goldman, D., Papadimitriou, C., Istrail, S.: Algorithmic aspects of protein structure similarity. In: Proc. 40th Symp. on Foundations of Computer Science FOCS 1999, p. 512. IEEE Computer Society, Los Alamitos (1999)Google Scholar
  3. 3.
    Vialette, S.: On the computational complexity of 2-interval pattern matching problems. Theor. Comput. Sci. 312, 223–249 (2004)MATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    Blin, G., Fertin, G., Vialette, S.: New results for the 2-interval problem. In: Sahinalp, S.C., Muthukrishnan, S.M., Dogrusoz, U. (eds.) CPM 2004. LNCS, vol. 3109, pp. 311–322. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  5. 5.
    Crochemore, M., Hermelin, D., Landau, G., Vialette, S.: Approximating the 2-interval pattern problem. In: Brodal, G.S., Leonardi, S. (eds.) ESA 2005. LNCS, vol. 3669, pp. 426–437. Springer, Heidelberg (2005)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Shuai Cheng Li
    • 1
  • Ming Li
    • 1
  1. 1.David R. Cheriton School of Computer ScienceUniversity of WaterlooWaterlooCanada

Personalised recommendations