Semi-isometric Registration of Line Features for Flexible Fitting of Protein Structures

Simple item page
dc.contributor.authorAbeysinghe, S.S.en_US
dc.contributor.authorBaker, M. L.en_US
dc.contributor.authorChiu, W.en_US
dc.contributor.authorJu, T.en_US
dc.date.accessioned2015-02-23T17:37:55Z
dc.date.available2015-02-23T17:37:55Z
dc.date.issued2010en_US
dc.description.abstractIn this paper, we study a registration problem that is motivated by a practical biology problem - fitting protein structures to low-re solution 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.en_US
dc.description.number7en_US
dc.description.seriesinformationComputer Graphics Forumen_US
dc.description.volume29en_US
dc.identifier.doi10.1111/j.1467-8659.2010.01813.xen_US
dc.identifier.issn1467-8659en_US
dc.identifier.pages2243-2252en_US
dc.identifier.urihttps://doi.org/10.1111/j.1467-8659.2010.01813.xen_US
dc.publisherThe Eurographics Association and Blackwell Publishing Ltden_US
dc.titleSemi-isometric Registration of Line Features for Flexible Fitting of Protein Structuresen_US
Files
Collections
29-Issue 7