191 search results - page 6 / 39 » On the rigidity of molecular graphs |
CORR
2007
Springer
13 years 7 months ago
2007
Springer
—A recent paper [1] proposed a provably optimal polynomial time method for performing near-isometric point pattern matching by means of exact probabilistic inference in a chordal...
GD
2009
Springer
13 years 5 months ago
2009
Springer
Abstract. The study of (minimally) rigid graphs is motivated by numerous applications, mostly in robotics and bioinformatics. A major open problem concerns the number of embeddings...
SGAI
2007
Springer
14 years 1 months ago
2007
Springer
Mining subgraphs is an area of research where we have a given set of graphs, and we search for (connected) subgraphs contained in these graphs. In this paper we focus on the analy...
BMCBI
2010
13 years 7 months ago
2010
Background: Many molecules are flexible and undergo significant shape deformation as part of their function, and yet most existing molecular shape comparison (MSC) methods treat t...
ISBI
2006
IEEE
14 years 8 months ago
2006
IEEE
In this work we propose a novel rigid image registration approach to determine the position of high-resolution molecular structures in medium-resolution macromolecular complexes. ...