Fast Molecular Shape Matching Using Contact Maps

No abstract is available for this paper.

• Publication year

  2007

• Venue

  J. Comput. Biol.

• Publication date

  2007-03-01

• Fields of study

  Mathematics, Computer Science, Medicine

• Identifiers
  DOI 10.1089/cmb.2007.0004PMID 17456012
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar, PubMed

• No claims are published for this paper.

• No concepts are published for this paper.

• A combinatorial problem in geometry

  2009cited by this paper
• Structural alignment of large—size proteins via lagrangian relaxation

  2002cited by this paper
• Principles of docking: An overview of search algorithms and a guide to scoring functions

  2002cited by this paper
• 101 optimal PDB structure alignments: a branch-and-cut algorithm for the maximum contact map overlap problem

  2001influential reference
• The Dense k -Subgraph Problem

  2001cited by this paper
• Computers and Intractability: A Guide to the Theory of NP-Completeness

  1999cited by this paper
• Algorithmic aspects of protein structure similarity

  1999influential reference
• Computing the Edit-Distance between Unrooted Ordered Trees

  1998cited by this paper
• Comprehensive assessment of automatic structural alignment against a manual standard, the scop classification of proteins

  1998cited by this paper
• The Art of Computer Programming, Volume I: Fundamental Algorithms, 2nd Edition

  1997cited by this paper
• Molecular modelling: Principles and applications

  1997cited by this paper
• On the approximation of protein threading

  1997cited by this paper
• Improving protein secondary structure prediction with aligned homologous sequences

  1996cited by this paper
• The FSSP database: fold classification based on structure-structure alignment of proteins

  1996cited by this paper
• SSAP: sequential structure alignment program for protein structure comparison.

  1996cited by this paper
• The structural alignment between two proteins: Is there a unique answer?

  1996cited by this paper
• Significance of root-mean-square deviation in comparing three-dimensional structures of globular proteins.

  1994cited by this paper
• Monte carlo simulations of protein folding. I. Lattice model and interaction scheme

  1994cited by this paper
• Protein structure comparison by alignment of distance matrices.

  1993cited by this paper
• On choosing a dense subgraph

  1993cited by this paper
• On the Largest Common Subgraph Problem

  1990cited by this paper
• Protein structure alignment.

  1989cited by this paper
• Johnson: computers and intractability: a guide to the theory of np- completeness (freeman

  1979cited by this paper
• The Art of Computer Programming—Volume 1: Fundamental Algorithms (Donald E. Knuth)

  1969cited by this paper

• Bijective enumeration of general stacks

  2023cites this paper
• Statistical Analysis of Random Objects Via Metric Measure Laplacians

  2022cites this paper
• On the Number of Saturated and Optimal Extended 2-Regular Simple Stacks in the Nussinov–Jacobson Energy Model

  2022cites this paper
• Finding sub-graphs from contact map overlap problem

  2017cites this paper
• Combinatorics of Contacts in Protein Contact Maps

  2017cites this paper
• ESTIMATION OF PROTEIN PACKING DENSITY FROM PROTEIN CONTACT MAP

  2017cites this paper
• Molecular Dynamics and Related Computational Methods with Applications to Drug Discovery

  2016cites this paper
• Regular Simple Queues of Protein Contact Maps

  2016influential citation
• Enumeration of Extended m-Regular Linear Stacks

  2016cites this paper
• A Gibbs sampling strategy for mining of protein-protein interaction networks and protein structures

  2015cites this paper
• Protein structure similarity using recurrence relation technique

  2015cites this paper
• Divide and conquer approach to contact map overlap problem using 2D-pattern mining of protein contact networks

  2015cites this paper
• Divide and Conquer Approach to Contact Map Overlap Problem Using 2D-Pattern Mining of Protein Contact Networks

  2015cites this paper
• GR-Align: fast and flexible alignment of protein 3D structures using graphlet degree similarity

  2014cites this paper
• Zigzag Stacks and m-Regular Linear Stacks

  2014cites this paper
• Benchmarking of HPCC: A novel 3D molecular representation combining shape and pharmacophoric descriptors for efficient molecular similarity assessments.

  2013cites this paper
• Approximations of Points: Combinatorics and Algorithms

  2013cites this paper
• A Gibbs sampling strategy for graph mining with applications to biological and social networks

  2012cites this paper
• Measuring the Similarity of Protein Structures Using Image Compression Algorithms

  2011cites this paper
• Maximum Contact Map Overlap Revisited

  2011cites this paper
• Fast Protein Structure Alignment

  2010cites this paper
• Fast overlapping of protein contact maps by alignment of eigenvectors

  2010cites this paper
• Combinatorial Algorithms for Protein Folding in Lattice Models: A Survey of Mathematical Results

  2009influential citation
• An Efficient Lagrangian Relaxation for the Contact Map Overlap Problem

  2008cites this paper
• Towards Structural Classification of Proteins based on Contact Map Overlap

  2007cites this paper