The discretizable distance geometry problem (DDGP3)

Carlile Lavor; Leo Liberti; Weldon A. Lodwick; Tiago Mendonça da Costa

doi:10.1007/978-3-319-57183-6_4

The discretizable distance geometry problem (DDGP₃)

Carlile Lavor
, Leo Liberti
, Weldon A. Lodwick
, Tiago Mendonça da Costa

University of Campinas (UNICAMP)
University of Colorado at Denver

Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

Abstract

We begin this chapter by describing an important class of the DGP in ℝ³ having a vertex order as described in Sect. 3.3, called the Discretizable DGP₃ (DDGP₃). Even though this definition can be extended to ℝ^K [65], we will consider just the case K = 3.

Original language	English
Title of host publication	SpringerBriefs in Computer Science
Publisher	Springer
Pages	21-29
Number of pages	9
Edition	9783319571829
DOIs	https://doi.org/10.1007/978-3-319-57183-6_4
Publication status	Published - 1 Jan 2017

Publication series

Name	SpringerBriefs in Computer Science
Number	9783319571829
Volume	0
ISSN (Print)	2191-5768
ISSN (Electronic)	2191-5776

Access to Document

10.1007/978-3-319-57183-6_4

Cite this

@inbook{8628a1c83a994791a670e9fb131890a3,

title = "The discretizable distance geometry problem (DDGP3)",

abstract = "We begin this chapter by describing an important class of the DGP in ℝ3 having a vertex order as described in Sect. 3.3, called the Discretizable DGP3 (DDGP3). Even though this definition can be extended to ℝK [65], we will consider just the case K = 3.",

author = "Carlile Lavor and Leo Liberti and Lodwick, \{Weldon A.\} and \{Mendon{\c c}a da Costa\}, Tiago",

note = "Publisher Copyright: {\textcopyright} The Author(s) 2017.",

year = "2017",

month = jan,

day = "1",

doi = "10.1007/978-3-319-57183-6\_4",

language = "English",

series = "SpringerBriefs in Computer Science",

publisher = "Springer",

number = "9783319571829",

pages = "21--29",

booktitle = "SpringerBriefs in Computer Science",

edition = "9783319571829",

}

TY - CHAP

T1 - The discretizable distance geometry problem (DDGP3)

AU - Lavor, Carlile

AU - Liberti, Leo

AU - Lodwick, Weldon A.

AU - Mendonça da Costa, Tiago

PY - 2017/1/1

Y1 - 2017/1/1

N2 - We begin this chapter by describing an important class of the DGP in ℝ3 having a vertex order as described in Sect. 3.3, called the Discretizable DGP3 (DDGP3). Even though this definition can be extended to ℝK [65], we will consider just the case K = 3.

AB - We begin this chapter by describing an important class of the DGP in ℝ3 having a vertex order as described in Sect. 3.3, called the Discretizable DGP3 (DDGP3). Even though this definition can be extended to ℝK [65], we will consider just the case K = 3.

U2 - 10.1007/978-3-319-57183-6_4

DO - 10.1007/978-3-319-57183-6_4

M3 - Chapter

AN - SCOPUS:85044934145

T3 - SpringerBriefs in Computer Science

SP - 21

EP - 29

BT - SpringerBriefs in Computer Science

PB - Springer