Feasibility check for the distance geometry problem: an application to molecular conformations
The distance geometry problem (DGP) consists in finding an embedding in a metric space of a given weighted undirected graph such that for each edge in the graph, the corresponding distance in the embedding belongs to a given distance interval. We discuss the relationship between the existence of a g...
| Autor principal: | |
|---|---|
| Outros Autores: | , , , , |
| Formato: | article |
| Idioma: | eng |
| Publicado em: |
2017
|
| Assuntos: | |
| Texto completo: | http://hdl.handle.net/10773/18405 |
| País: | Portugal |
| Oai: | oai:ria.ua.pt:10773/18405 |