摘要: … to work well on protein contact maps, also being as challenging … contact maps, we consider two residues to be in contact if their C α are within 7.5 Å, without taking into account contacts …
liebertonline.com参考文章(26)
ROBERT D. CARR, GIUSEPPE LANCIA, SORIN ISTRAIL, Branch-and-Cut Algorithms for Independent Set Problems: Integrality Gap and An Application to Protein Structure Alignment Other Information: PBD: 1 Sep 2000. ,(2000) , 10.2172/764804
Rumen Andonov, Nicola Yanev, Noël Malod-Dognin, An Efficient Lagrangian Relaxation for the Contact Map Overlap Problem workshop on algorithms in bioinformatics. ,vol. 5251, pp. 162- 173 ,(2008) , 10.1007/978-3-540-87361-7_14
Giuseppe Lancia, Sorin Istrail, Protein Structure Comparison: Algorithms and Applications Lecture Notes in Computer Science. pp. 1- 33 ,(2003) , 10.1007/978-3-540-44827-3_1
Brijnesh J. Jain, Michael Lappe, Joining Softassign and Dynamic Programming for the Contact Map Overlap Problem Bioinformatics Research and Development. pp. 410- 423 ,(2007) , 10.1007/978-3-540-71233-6_32
D. Goldman, S. Istrail, C.H. Papadimitriou, Algorithmic aspects of protein structure similarity foundations of computer science. pp. 512- 521 ,(1999) , 10.1109/SFFCS.1999.814624
Jean-Francois Gibrat, Thomas Madej, Stephen H Bryant, Surprising similarities in structure comparison Current Opinion in Structural Biology. ,vol. 6, pp. 377- 385 ,(1996) , 10.1016/S0959-440X(96)80058-3
James J. McGregor, Backtrack search algorithms and the maximal common subgraph problem Software: Practice and Experience. ,vol. 12, pp. 23- 34 ,(1982) , 10.1002/SPE.4380120103
Pankaj K. Agarwal, Nabil H. Mustafa, Yusu Wang, Fast Molecular Shape Matching Using Contact Maps Journal of Computational Biology. ,vol. 14, pp. 131- 143 ,(2007) , 10.1089/CMB.2007.0004
Alberto Caprara, Robert Carr, Sorin Istrail, Giuseppe Lancia, Brian Walenz, 1001 optimal PDB structure alignments: integer programming methods for finding the maximum contact map overlap. Journal of Computational Biology. ,vol. 11, pp. 27- 52 ,(2004) , 10.1089/106652704773416876
Michael R. Garey, David S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness ,(1979)