Assigned and unassigned distance geometry: applications to biological molecules and nanostructures (Q503659): Difference between revisions
From MaRDI portal
Created a new Item |
Normalize DOI. |
||
(11 intermediate revisions by 9 users not shown) | |||
Property / DOI | |||
Property / DOI: 10.1007/s10288-016-0314-2 / rank | |||
Property / author | |||
Property / author: Carlile C. Lavor / rank | |||
Property / author | |||
Property / author: Carlile C. Lavor / rank | |||
Normal rank | |||
Property / review text | |||
The present survey paper focuses on the applications of distance geometry to the studies of biological molecules and nanostructures. Distance geometry is the study of geometry and structure based on the notion of distance. In most applications, an incomplete list of distances between pairs of points (vertices) is given and the goal is to find positions for these vertices in some Euclidean space realizing the given distances. Moreover, sometimes the distances are not pre-assigned to specific pairs of objects and therefore, this information is a part of the solution. The first described problem is known as \textit{assigned distance geometry problem} and the second one is the \textit{unassigned distance geometry problem}. In the beginning of the paper, the definition and some historical information relating the problem is explained. In Section 2, the uniqueness of the distance geometry problem is discussed. Since the goal is to find a realization of vertices in the Euclidean space such that they are consistent with a given list \(\mathcal{D}\) of distances, the natural question is the following: given a list \(\mathcal{D}\) of distances, is there more than one realization? In some practical applications, the information about the pairs of vertices that corresponds to a given known distance is not provided. Therefore, in Section 3, some recent methods and algorithms for the unassigned distance geometry problem are described. In the following section, the discretization of the assigned distance geometry problem is considered. This is useful in some cases where the number of given distances is too small to guarantee rigidity. In Section 5, some applications of the distance geometry problem are given. The first main application is identification of three-dimensional conformations of biological molecules. In this area, some new approaches to distance measurements in biological and inorganic materials have been developed recently. The second main application is the problem of finding the atomic positions in some nanostructures. Moreover, an example is added showing that it is possible to reconstruct the \(C_{60}\) fullerene from unassigned distance lists extracted from real experiments. | |||
Property / review text: The present survey paper focuses on the applications of distance geometry to the studies of biological molecules and nanostructures. Distance geometry is the study of geometry and structure based on the notion of distance. In most applications, an incomplete list of distances between pairs of points (vertices) is given and the goal is to find positions for these vertices in some Euclidean space realizing the given distances. Moreover, sometimes the distances are not pre-assigned to specific pairs of objects and therefore, this information is a part of the solution. The first described problem is known as \textit{assigned distance geometry problem} and the second one is the \textit{unassigned distance geometry problem}. In the beginning of the paper, the definition and some historical information relating the problem is explained. In Section 2, the uniqueness of the distance geometry problem is discussed. Since the goal is to find a realization of vertices in the Euclidean space such that they are consistent with a given list \(\mathcal{D}\) of distances, the natural question is the following: given a list \(\mathcal{D}\) of distances, is there more than one realization? In some practical applications, the information about the pairs of vertices that corresponds to a given known distance is not provided. Therefore, in Section 3, some recent methods and algorithms for the unassigned distance geometry problem are described. In the following section, the discretization of the assigned distance geometry problem is considered. This is useful in some cases where the number of given distances is too small to guarantee rigidity. In Section 5, some applications of the distance geometry problem are given. The first main application is identification of three-dimensional conformations of biological molecules. In this area, some new approaches to distance measurements in biological and inorganic materials have been developed recently. The second main application is the problem of finding the atomic positions in some nanostructures. Moreover, an example is added showing that it is possible to reconstruct the \(C_{60}\) fullerene from unassigned distance lists extracted from real experiments. / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Niko Tratnik / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 51K99 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 51P05 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 92E10 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 82D80 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 92-02 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 51-02 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 51K05 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6674453 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
distance geometry | |||
Property / zbMATH Keywords: distance geometry / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
molecular conformations | |||
Property / zbMATH Keywords: molecular conformations / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
nanostructure | |||
Property / zbMATH Keywords: nanostructure / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
graph rigidity | |||
Property / zbMATH Keywords: graph rigidity / rank | |||
Normal rank | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q62562129 / rank | |||
Normal rank | |||
Property / describes a project that uses | |||
Property / describes a project that uses: CNS / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2337478696 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An Overview on Protein Structure Determination by NMR: Historical and Future Perspectives of the use of Distance Geometry Methods / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Reconstructing a three-dimensional model with arbitrary errors / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5818996 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: WHICH POINT CONFIGURATIONS ARE DETERMINED BY THE DISTRIBUTION OF THEIR PAIRWISE DISTANCES? / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Extending the geometric build-up algorithm for the molecular distance geometry problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Discretization vertex orders in distance geometry / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3974964 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Generic global rigidity / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Discretization orders for protein side chains / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5461825 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A linear-time algorithm for solving the molecular distance geometry problem with exact inter-atomic distances / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The unassigned distance geometry problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Discretization orders and efficient computation of Cartesian coordinates for distance geometry / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An algorithm for two-dimensional rigidity percolation: The pebble game / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Characterizing generic global rigidity / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4279195 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Conditions for Unique Graph Realizations / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Molecule Problem: Exploiting Structure in Global Optimization / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Connected rigidity matroids and unique realizations of graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On graphs and rigidity of plane skeletal structures / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the computation of protein backbones by using artificial backbones of hydrogens / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Discretization orders for distance geometry problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The discretizable molecular distance geometry problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The interval branch-and-prune algorithm for the discretizable molecular distance geometry problem with inexact distances / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Clifford algebra and the discretizable molecular distance geometry problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Six mathematical gems from the history of distance geometry / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Discretizable Molecular Distance Geometry Problem seems Easier on Proteins / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Euclidean Distance Geometry and Applications / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the number of realizations of certain Henneberg graphs arising in protein conformation / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On Generic Rigidity in the Plane / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An efficient algorithm for testing the generic rigidity of graphs in the plane / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the Identification of Discretization Orders for Distance Geometry with Intervals / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The discretizable distance geometry problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Distance Geometry / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Preface / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A point set puzzle revisited / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5692717 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Rigidity of multi-graphs. I: Linking rigid bodies in n-space / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Distance Geometry Methods for Protein Structure Determination / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An updated geometric build-up algorithm for solving the molecular distance geometry problems with sparse distance data / rank | |||
Normal rank | |||
Property / DBLP publication ID | |||
Property / DBLP publication ID: journals/4or/BillingeDGLM16 / rank | |||
Normal rank | |||
Property / DOI | |||
Property / DOI: 10.1007/S10288-016-0314-2 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 19:39, 9 December 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Assigned and unassigned distance geometry: applications to biological molecules and nanostructures |
scientific article |
Statements
Assigned and unassigned distance geometry: applications to biological molecules and nanostructures (English)
0 references
13 January 2017
0 references
The present survey paper focuses on the applications of distance geometry to the studies of biological molecules and nanostructures. Distance geometry is the study of geometry and structure based on the notion of distance. In most applications, an incomplete list of distances between pairs of points (vertices) is given and the goal is to find positions for these vertices in some Euclidean space realizing the given distances. Moreover, sometimes the distances are not pre-assigned to specific pairs of objects and therefore, this information is a part of the solution. The first described problem is known as \textit{assigned distance geometry problem} and the second one is the \textit{unassigned distance geometry problem}. In the beginning of the paper, the definition and some historical information relating the problem is explained. In Section 2, the uniqueness of the distance geometry problem is discussed. Since the goal is to find a realization of vertices in the Euclidean space such that they are consistent with a given list \(\mathcal{D}\) of distances, the natural question is the following: given a list \(\mathcal{D}\) of distances, is there more than one realization? In some practical applications, the information about the pairs of vertices that corresponds to a given known distance is not provided. Therefore, in Section 3, some recent methods and algorithms for the unassigned distance geometry problem are described. In the following section, the discretization of the assigned distance geometry problem is considered. This is useful in some cases where the number of given distances is too small to guarantee rigidity. In Section 5, some applications of the distance geometry problem are given. The first main application is identification of three-dimensional conformations of biological molecules. In this area, some new approaches to distance measurements in biological and inorganic materials have been developed recently. The second main application is the problem of finding the atomic positions in some nanostructures. Moreover, an example is added showing that it is possible to reconstruct the \(C_{60}\) fullerene from unassigned distance lists extracted from real experiments.
0 references
distance geometry
0 references
molecular conformations
0 references
nanostructure
0 references
graph rigidity
0 references
0 references
0 references
0 references
0 references