In this thesis, we present a search engine capable of giving good heuristic answers to the queries on a structural database. A structural database holds structural objects, e.g., protein secondary and tertiary structures, 3D molecules, phylogenetic trees, neuroanatomical networks, parse trees, CAD/CAM parts, and XML documents. Answering queries on such databases often requires solving variants of the graph isomorphism or subisomorphism problems. We also describe a graphic user interface which interacts with users to facilitate visualizing query results. We use 3D molecules (graphs) as illustrating examples, though our prototype is able to handle many other different types of structural data
Exploring, examining, and manipulating 3D shapes is an increasingly important application area. In t...
In this paper. we present ideas how visualization technology can be used to improve the difficult pr...
This paper proposes the application of approximate graph matching techniques for best-match searchin...
This dissertation is composed of two parts. In the first part, we present a framework for finding in...
This dissertation is composed of two parts. In the first part, we present a framework for finding in...
As the size of structural databases grows, the need for efficiently searching these databases arises...
As the size of structural databases grows, the need for efficiently searching these databases arises...
This paper proposes the application of a geometric hash technique to the searching of 3D chemical st...
The visual exploration of large databases raises a number of unresolved inference problems and calls...
In this paper. we present ideas how visualization technology can be used to improve the difficult pr...
In this paper. we present ideas how visualization technology can be used to improve the difficult pr...
In this paper. we present ideas how visualization technology can be used to improve the difficult pr...
Exploring, examining, and manipulating 3D shapes is an increasingly important application area. In t...
Exploring, examining, and manipulating 3D shapes is an increasingly important application area. In t...
Exploring, examining, and manipulating 3D shapes is an increasingly important application area. In t...
Exploring, examining, and manipulating 3D shapes is an increasingly important application area. In t...
In this paper. we present ideas how visualization technology can be used to improve the difficult pr...
This paper proposes the application of approximate graph matching techniques for best-match searchin...
This dissertation is composed of two parts. In the first part, we present a framework for finding in...
This dissertation is composed of two parts. In the first part, we present a framework for finding in...
As the size of structural databases grows, the need for efficiently searching these databases arises...
As the size of structural databases grows, the need for efficiently searching these databases arises...
This paper proposes the application of a geometric hash technique to the searching of 3D chemical st...
The visual exploration of large databases raises a number of unresolved inference problems and calls...
In this paper. we present ideas how visualization technology can be used to improve the difficult pr...
In this paper. we present ideas how visualization technology can be used to improve the difficult pr...
In this paper. we present ideas how visualization technology can be used to improve the difficult pr...
Exploring, examining, and manipulating 3D shapes is an increasingly important application area. In t...
Exploring, examining, and manipulating 3D shapes is an increasingly important application area. In t...
Exploring, examining, and manipulating 3D shapes is an increasingly important application area. In t...
Exploring, examining, and manipulating 3D shapes is an increasingly important application area. In t...
In this paper. we present ideas how visualization technology can be used to improve the difficult pr...
This paper proposes the application of approximate graph matching techniques for best-match searchin...