The discretizable molecular distance geometry problem (DMDGP)

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

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

The discretizable molecular distance geometry problem (DMDGP)

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

University of Campinas (UNICAMP)
University of Colorado at Denver

Résultats de recherche: Le chapitre dans un livre, un rapport, une anthologie ou une collection › Chapitre › Revue par des pairs

1 Citation (Scopus)

Résumé

We know that to ensure the finiteness of the solution set of the DGP, we can impose an order on the vertices of the associated graph. If such an order exists, it is not hard to find it in the DGP graph.

langue originale	Anglais
titre	SpringerBriefs in Computer Science
Editeur	Springer
Pages	31-39
Nombre de pages	9
Edition	9783319571829
Les DOIs	https://doi.org/10.1007/978-3-319-57183-6_5
état	Publié - 1 janv. 2017

Série de publications

Nom	SpringerBriefs in Computer Science
nombre	9783319571829
Volume	0
ISSN (imprimé)	2191-5768
ISSN (Electronique)	2191-5776

Accès au document

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

Contient cette citation

@inbook{92c5ecb87df24654b8675059262958d8,

title = "The discretizable molecular distance geometry problem (DMDGP)",

abstract = "We know that to ensure the finiteness of the solution set of the DGP, we can impose an order on the vertices of the associated graph. If such an order exists, it is not hard to find it in the DGP graph.",

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\_5",

language = "English",

series = "SpringerBriefs in Computer Science",

publisher = "Springer",

number = "9783319571829",

pages = "31--39",

booktitle = "SpringerBriefs in Computer Science",

edition = "9783319571829",

}

The discretizable molecular distance geometry problem (DMDGP). / Lavor, Carlile; Liberti, Leo; Lodwick, Weldon A. et al.
SpringerBriefs in Computer Science. 9783319571829. Ed. Springer, 2017. p. 31-39 (SpringerBriefs in Computer Science; Vol 0, Numéro 9783319571829).

Résultats de recherche: Le chapitre dans un livre, un rapport, une anthologie ou une collection › Chapitre › Revue par des pairs

TY - CHAP

T1 - The discretizable molecular distance geometry problem (DMDGP)

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 know that to ensure the finiteness of the solution set of the DGP, we can impose an order on the vertices of the associated graph. If such an order exists, it is not hard to find it in the DGP graph.

AB - We know that to ensure the finiteness of the solution set of the DGP, we can impose an order on the vertices of the associated graph. If such an order exists, it is not hard to find it in the DGP graph.

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

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

M3 - Chapter

AN - SCOPUS:85044941448

T3 - SpringerBriefs in Computer Science

SP - 31

EP - 39

BT - SpringerBriefs in Computer Science

PB - Springer

ER -

The discretizable molecular distance geometry problem (DMDGP)

Résumé

Série de publications

Accès au document

Empreinte digitale

Contient cette citation