Paper Info
Title
Bipartite Graph for Protein Structure Matching
Abstract
Bipartite graph-based matching technique has a powerful ability to give a global and optimized matching result. At the same time, we can take the advantage of graph-based data representation used with the technique. Graph-based representation has the ability to encapsulate the attribute of the objects and also the relationship details among the elements of the compared objects. The combination of graph-based matching technique and graph-based data structure are best applied in protein tertiary structure matching because protein structure has rich information that needs to be handled with care. The main contribution of the paper is (1) to design bipartite graph matching for protein matching and also (2) to incorporate graph-based data structure called ‘reference frame’ originally used in computer vision into bipartite graph matching. The matching result is measured using exponential similarity function.
Year
DOI
Venue
2008
10.1109/AMS.2008.89
Asia International Conference on Modelling and Simulation
Keywords
Field
DocType
bipartite graph matching,bipartite graph,protein matching,protein structure matching,protein structure,optimized matching result,matching result,graph-based data structure,graph-based matching technique,protein tertiary structure,graph-based data representation,proteins,computational modeling,reference frame,computer vision,data structure,graph theory,pattern matching,spine,molecular biophysics,optimal matching,computer simulation,data representation,data structures
Line graph,Graph factorization,Folded cube graph,Bipartite graph,Theoretical computer science,Factor-critical graph,3-dimensional matching,Voltage graph,Mathematics,Blossom algorithm
Conference
ISBN
Citations 
PageRank 
978-0-7695-3136-6
0
0.34
References 
Authors
5
3
Name
Order
Citations
PageRank
Fazilah Othman130.74
Rosni Abdullah215624.82
Rosalina Abdul Salam37010.83