Structure alignment via Delaunay tetrahedralization.
نویسندگان
چکیده
A novel protein structure alignment technique has been developed reducing much of the secondary and tertiary structure to a sequential representation greatly accelerating many structural computations, including alignment. Constructed from incidence relations in the Delaunay tetrahedralization, alignments of the sequential representation describe structural similarities that cannot be expressed with rigid-body superposition and complement existing techniques minimizing root-mean-squared distance through superposition. Restricting to the largest substructure superimposable by a single rigid-body transformation determines an alignment suitable for root-mean-squared distance comparisons and visualization. Restricted alignments of a test set of histones and histone-like proteins determined superpositions nearly identical to those produced by the established structure alignment routines of DaliLite and ProSup. Alignment of three, increasingly complex proteins: ferredoxin, cytidine deaminase, and carbamoyl phosphate synthetase, to themselves, demonstrated previously identified regions of self-similarity. All-against-all similarity index comparisons performed on a test set of 45 class I and class II aminoacyl-tRNA synthetases closely reproduced the results of established distance matrix methods while requiring 1/16 the time. Principal component analysis of pairwise tetrahedral decomposition similarity of 2300 molecular dynamics snapshots of tryptophanyl-tRNA synthetase revealed discrete microstates within the trajectory consistent with experimental results. The method produces results with sufficient efficiency for large-scale multiple structure alignment and is well suited to genomic and evolutionary investigations where no geometric model of similarity is known a priori.
منابع مشابه
The Strange Complexity of Constrained Delaunay Triangulation
The problem of determining whether a polyhedron has a constrained Delaunay tetrahedralization is NP-complete. However, if no five vertices of the polyhedron lie on a common sphere, the problem has a polynomial-time solution. Constrained Delaunay tetrahedralization has the unusual status (for a small-dimensional problem) of being NP-hard only for degenerate inputs.
متن کاملFlipping to Robustly Delete a Vertex in a Delaunay Tetrahedralization
We discuss the deletion of a single vertex in a Delaunay tetrahedralization (DT). While some theoretical solutions exist for this problem, the many degeneracies in three dimensions make them impossible to be implemented without the use of extra mechanisms. In this paper, we present an algorithm that uses a sequence of bistellar flips to delete a vertex in a DT, and we present two different mech...
متن کاملDelaunay Tetrahedralizations: Honor Degenerated Cases
The definition of a Delaunay tetrahedralization (DT) of a set S of points is well known: a DT is a tetrahedralization of S in which every simplex (tetrahedron, triangle, or edge) is Delaunay. A simplex is Delaunay if all of its vertices can be connected by a circumsphere that encloses no other vertex. An important remark made in virtually all papers on this topic is that “although any number of...
متن کاملAn Approach for Delaunay Tetrahedralization of Bodies with Curved Boundaries
Problem of tetrahedral meshing of three-dimensional domains whose boundaries are curved surfaces is wide open. Traditional approach consists in an approximation of curved boundaries by piecewise linear boundaries before mesh generation. As the result mesh quality may deteriorate. This paper presents a technique for Delaunay-based tetrahedralization in which a set of constrained facets is formed...
متن کاملValidation and Storage of Polyhedra through Constrained Delaunay Tetrahedralization
Closed, watertight, 3D geometries are represented by polyhedra. Current data models define these polyhedra basically as a set of polygons, leaving the test on intersecting polygons or open gaps to external validation rules. If this testing is not performed well, or not at all, non-valid polyhedra could be stored in geo-databases. This paper proposes the utilization of the Constrained Delaunay T...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Proteins
دوره 60 1 شماره
صفحات -
تاریخ انتشار 2005