期刊
COMPUTER GRAPHICS FORUM
卷 29, 期 7, 页码 2243-2252出版社
WILEY
DOI: 10.1111/j.1467-8659.2010.01813.x
关键词
-
资金
- NSF [IIS-0705474, IIS-0705538]
- NCMI through NIH [RR002250]
- NATIONAL CENTER FOR RESEARCH RESOURCES [P41RR002250] Funding Source: NIH RePORTER
In this paper, we study a registration problem that is motivated by a practical biology problem - fitting protein structures to low-resolution density maps. We consider registration between two sets of lines features (e. g., helices in the proteins) that have undergone not a single, but multiple isometric transformations (e. g., hinge-motions). The problem is further complicated by the presence of symmetry in each set. We formulate the problem as a clique-finding problem in a product graph, and propose a heuristic solution that includes a fast clique-finding algorithm unique to the structure of this graph. When tested on a suite of real protein structures, the algorithm achieved high accuracy even for very large inputs containing hundreds of helices.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据