By Topic

Adaptation of Reference Frame into Bipartite Graph for protein tertiary structure recognition based on the backbone features

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Fazilah Othmana ; Sch. of Comput. Sci., Univ. Sains Malaysia, Minden, Malaysia ; Rosni Abdullahb ; Nur'Aini Abdul Rashidc

Data representation, matching algorithm and similarity measure are the main concern in protein structure matching. The above three points are considered in the implementation of Bipartite Graph Matching with Reference Frame algorithm (BGMRF). In BGMRF, the tertiary structures of protein Cα backbone are defined in reference frames representation. The matching vectors generated from the reference frames are integrated into bipartite graph as a representation to do the matching of structures. From bipartite graph, the problem is reduced to a network flow graph. The matching is solved using Ford-Fulkerson algorithm with Breadth First Search algorithm to find maximum weight matching. The experiment to identify Crambin-like family from dataset of small proteins shows that reference frames representation is well adapted to graph-based matching technique in BGMRF. For a dataset of 266 small proteins, BGMRF has successfully identified all 12 Crambin-like family members in the dataset.

Published in:

Computer Technology and Development (ICCTD), 2010 2nd International Conference on

Date of Conference:

2-4 Nov. 2010