Finding sub-graphs from contact map overlap problem.

K. Suvarna Vani K. Praveen Kumar M. Veda Sri

Published in: CIBCB (2017)

Keyphrases

maximum clique
contact map
protein structure alignment
computational biology
association graph
branch and bound algorithm
graph matching
fine grained
graph theoretic
maximal cliques
similarity measure
upper bound
nearest neighbor
graph theory
contact maps