This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Polynomial-Time Algorithm for the Matching of Crossing Contact-Map Patterns
October-December 2004 (vol. 1 no. 4)
pp. 171-180

Abstract—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|\geq |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|^6|A_p|^2) time when the pattern is \{<,{\hbox{{\rlap{)}\kern -1pt{\hbox{(}}}}}\}{\hbox{-}}{\rm{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 \{<,{\hbox{{\rlap{)}\kern -1pt{\hbox{(}}}}}\}{\hbox{-}}{\rm{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.

[1] J. Alber , J. Gramm , J. Guo , and R. Niedermeier , “Computing the Similarity of Two Sequences with Nested Arc Annotations,” Theoretical Computer Science, vol. 312, pp. 337-358, 2004.
[2] A. Bateman , L. Coin , R. Durbin , R.D. Finn , V. Hollich , S. Griffiths-Jones , A. Khanna , M. Marshall , S. Moxon , E.L.L. Sonnhammer , D.J. Stud Holme , C. Yeats , and S.R. Eddy , “The PFAM Protein Families Database,” Nucleic Acids Research, vol. 32, pp. D138-D141, 2004.
[3] H.M. Berman , J. Westbrook , Z. Feng , G. Gilliland , T.N. Bhat , H. Weissig , I.N. Shindyalov , and P.E. Bourne , “The Protein Data Bank,” Nucleic Acids Research, vol. 28, pp. 235-242, 2000, .
[4] G. Blin , G. Fertin , and S. Vialette , “New Results for the 2-Interval Pattern Problem,” Proc. 15th Ann. Symp. Combinatorial Pattern Matching (CPM), pp. 311-322, 1999.
[5] N. Cristianini and J. Shawe-Taylor , Kernel Methods for Pattern Analysis. Cambridge Univ. Press, 2004.
[6] R.G. Downey and M.R. Fellows , Parameterized Complexity. Springer, 1999.
[7] I. Eidhammer , I. Jonassen , and W.R. Taylor , “Structure Comparison and Structure Patterns,” J. Computational Biology, vol. 7, pp. 685-716, 2000.
[8] P.A. Evans , “Finding Common Subsequences with Arcs and Pseudoknots,” Proc. 10th Ann. Symp. Combinatorial Pattern Matching (CPM), pp. 270-280, 1999.
[9] J. Gramm , J. Guo , and R. Niedermeier , “Pattern Matching for Arc-Annotated Sequences,” Proc. 22nd Conf. Foundations of Software Technology and Theoretical Computer Science, pp. 182-193, 2002.
[10] D. Goldman , S. Istrail , and C.H. Papadimitriou , “Algorithmic Aspects of Protein Structure Similarity,” Proc. 40th Symp. Foundations of Computer Science (FOCS), pp. 512-521, 1999.
[11] M.A. Harrison , Introduction to Formal Language Theory. Reading, Mass.: Addison-Wesley, 1978.
[12] T. Jiang , G.-H. Lin , B. Ma , and K. Zhang , “The Longest Common Subsequence Problem for Arc-Annotated Sequences,” J. Discrete Algorithms, vol. 2, no. 2, pp. 257-270, 2004.
[13] A. Caprara , R. Carr , S. Istrail , G. Lancia , and B. Walenz , “1001 Optimal PDB Structure Alignments: Integer Programming Methods for Finding the Maximum Contact Map Overlap,” J. Computational Biology, vol. 11, no. 1, pp. 27-52, 2004.
[14] B. Carr , W. Hart , N. Krasnogor , J. Hirst , E. Burke , and J. Smith , “Alignment of Protein Structures with a Memetic Evolutionary Algorithm,” Proc. Genetic and Evolutionary Computation Conf. (GECCO), pp. 1027-1034, 2002.
[15] L. Lo Conte , B. Ailey , T.J.P. Hubbard , S.E. Brenner , A.G. Murzin , and C. Chotia , “SCOP: A Structural Classification of Proteins Database,” Nucleic Acids Research, vol. 28, pp. 257-259, 2000, .
[16] C.A. Orengo , A.D. Michie , S. Jones , D.T. Jones , M.B. Swindells , and J.M. Thornton , “CATH— A Hierarchic Classification of Protein Domain Structures,” Structure, vol. 5, no. 8, pp. 1093-1108, 1997, .
[17] Z. Wang and K. Zhang , “RNA Secondary Structure Prediction,” Current Topics in Computational Molecular Biology, T. Jiang et al., eds., pp. 345-364, 2002.
[18] G. Yona , N. Linial , and M. Linial , “ProtoMap: Automatic Classification of Protein Sequences and Hierarchy of Protein Families,” Nucleic Acids Research, vol. 28, pp. 49-55, 2000.
[19] S. Vialette , “On the Computational Complexity of 2-Interval Pattern Matching Problems,” Theoretical Computer Science, vol. 312, nos. 2-3, pp. 223-249, 2004.

Index Terms:
Pattern matching, algorithm design and analysis, biology and genetics.
Citation:
Jens Gramm, "A Polynomial-Time Algorithm for the Matching of Crossing Contact-Map Patterns," IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol. 1, no. 4, pp. 171-180, Oct.-Dec. 2004, doi:10.1109/TCBB.2004.35
Usage of this product signifies your acceptance of the Terms of Use.