A Branch-and-Prune algorithm for the Molecular Distance Geometry Problem

The Molecular Distance Geometry Problem consists in finding the positions in of the atoms of a molecule, given some of the inter‐atomic distances. We show that under an additional requirement on the given distances this can be transformed to a combinatorial problem. We propose a Branch‐and‐Prune alg...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:International transactions in operational research Ročník 15; číslo 1; s. 1 - 17
Hlavní autori: Liberti, Leo, Lavor, Carlile, Maculan, Nelson
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Oxford, UK Blackwell Publishing Ltd 01.01.2008
Predmet:
ISSN:0969-6016, 1475-3995
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Abstract The Molecular Distance Geometry Problem consists in finding the positions in of the atoms of a molecule, given some of the inter‐atomic distances. We show that under an additional requirement on the given distances this can be transformed to a combinatorial problem. We propose a Branch‐and‐Prune algorithm for the solution of this problem and report on very promising computational results.
AbstractList The Molecular Distance Geometry Problem consists in finding the positions in of the atoms of a molecule, given some of the inter‐atomic distances. We show that under an additional requirement on the given distances this can be transformed to a combinatorial problem. We propose a Branch‐and‐Prune algorithm for the solution of this problem and report on very promising computational results.
The Molecular Distance Geometry Problem consists in finding the positions in of the atoms of a molecule, given some of the inter-atomic distances. We show that under an additional requirement on the given distances this can be transformed to a combinatorial problem. We propose a Branch-and-Prune algorithm for the solution of this problem and report on very promising computational results. [PUBLICATION ABSTRACT]
Author Lavor, Carlile
Maculan, Nelson
Liberti, Leo
Author_xml – sequence: 1
  givenname: Leo
  surname: Liberti
  fullname: Liberti, Leo
  email: LIX, Ecole Polytechnique, F-91128 Palaiseau, France liberti@lix.polytechnique.fr
  organization: LIX, Ecole Polytechnique, F-91128 Palaiseau, FranceE-mail: liberti@lix.polytechnique.fr
– sequence: 2
  givenname: Carlile
  surname: Lavor
  fullname: Lavor, Carlile
  email: Departamento de Matemática Aplicada (IMECC-UNICAMP), Universidade Estadual de Campinas, CP 6065, 13081-970, Campinas-SP, Brazil clavor@ime.unicam.br
  organization: Departamento de Matemática Aplicada (IMECC-UNICAMP), Universidade Estadual de Campinas, CP 6065, 13081-970, Campinas-SP, BrazilE-mail: clavor@ime.unicam.br
– sequence: 3
  givenname: Nelson
  surname: Maculan
  fullname: Maculan, Nelson
  email: COPPE, Universidade Federal do Rio de Janeiro (UFRJ) C.P. 68511, Rio de Janerio 21945-970, Brazil maculan@cos.ufrj.br
  organization: COPPE, Universidade Federal do Rio de Janeiro (UFRJ) C.P. 68511, Rio de Janerio 21945-970, BrazilE-mail: maculan@cos.ufrj.br
BookMark eNqNkF1PwjAUhhuDiYD-h8b7zdNt7dYLTRDkIwEhBONlU7pOhmPFbkT49xYxXHhF06RN-j7vSZ8WapSm1AhhAj5x62HtkyimXsg59QOA2AdgQeDvr1Dz_NBATeCMewwIu0GtqloDAKEkbqJhBz9bWaqVJ8vUm9ldqbEsPozN69UGZ8bieqXxxBRa7QppcS-vahfXeKDNRtf2gGfWLAu9uUXXmSwqffd3ttFb_2XRHXrj6WDU7Yw9FUUQeMtIpUQFhEQKQEVZFmeM05TqlErFuQ5psAwSt1PIpOREpcwhUSiTmLFlGoVtdH_q3VrztdNVLdZmZ0s3UrjvB0DjhLpQcgopa6rK6kxsbb6R9iAIiKM2sRZHO-Jo58jF4leb2Dv06R-q8lrWuSlrK_PikoLHU8F3XujDxYPFaDGdu5vjvRPvTOv9mZf2U7A4dOj760DwZNifQK8v5uEPwj6Xng
CitedBy_id crossref_primary_10_1007_s10472_011_9261_y
crossref_primary_10_1007_s10898_021_01023_0
crossref_primary_10_1007_s10479_018_2989_6
crossref_primary_10_1007_s11590_018_1294_2
crossref_primary_10_1111_itor_13309
crossref_primary_10_1007_s10898_016_0493_6
crossref_primary_10_1007_s11128_022_03583_w
crossref_primary_10_1109_TRO_2021_3123841
crossref_primary_10_1007_s00006_018_0925_0
crossref_primary_10_1017_S1446181117000372
crossref_primary_10_1016_j_amc_2020_125586
crossref_primary_10_1016_j_orl_2011_07_007
crossref_primary_10_1111_itor_70054
crossref_primary_10_1007_s11750_020_00563_0
crossref_primary_10_1007_s11590_017_1207_9
crossref_primary_10_1016_j_jctb_2022_02_004
crossref_primary_10_1111_itor_12283
crossref_primary_10_1007_s11590_011_0358_3
crossref_primary_10_1111_j_1475_3995_2009_00757_x
crossref_primary_10_1007_s10589_023_00526_8
crossref_primary_10_1007_s00006_015_0532_2
crossref_primary_10_1111_itor_12249
crossref_primary_10_1007_s10898_018_0693_3
crossref_primary_10_1007_s10589_011_9402_6
crossref_primary_10_1057_jors_2010_29
crossref_primary_10_1007_s10898_010_9584_y
crossref_primary_10_1093_nar_gkv100
crossref_primary_10_1186_s12859_015_0451_1
crossref_primary_10_3390_math10234415
crossref_primary_10_1111_j_1475_3995_2011_00807_x
crossref_primary_10_1089_cmb_2024_0522
crossref_primary_10_1016_j_ejor_2011_11_007
crossref_primary_10_1007_s00006_020_01085_5
crossref_primary_10_1007_s11590_011_0302_6
crossref_primary_10_1007_s40314_021_01479_6
crossref_primary_10_1007_s00453_021_00835_6
crossref_primary_10_1002_jcc_26796
crossref_primary_10_1016_j_ins_2017_06_015
crossref_primary_10_1007_s11590_017_1225_7
crossref_primary_10_1007_s00006_016_0653_2
crossref_primary_10_1007_s10898_019_00771_4
crossref_primary_10_1007_s10898_018_00734_1
crossref_primary_10_1007_s11590_018_1302_6
crossref_primary_10_1016_j_dam_2013_01_020
crossref_primary_10_1002_mma_4422
crossref_primary_10_1137_120875909
crossref_primary_10_1016_j_eswa_2021_115993
crossref_primary_10_1007_s00006_019_0995_7
crossref_primary_10_1111_itor_12626
crossref_primary_10_1016_j_ins_2020_12_072
crossref_primary_10_1088_2040_8986_ac3a9e
crossref_primary_10_1007_s10898_011_9799_6
crossref_primary_10_1007_s00454_016_9846_7
crossref_primary_10_1007_s10898_018_0610_9
Cites_doi 10.1090/dimacs/023/12
10.1109/INFCOM.2004.1354686
10.1137/S1052623495283024
10.1137/0805040
10.1023/A:1008380219900
10.1002/(SICI)1096-987X(199910)20:13<1354::AID-JCC3>3.0.CO;2-N
10.1007/978-0-387-22464-0
10.1007/0-387-30528-9_14
10.1023/A:1013857218127
ContentType Journal Article
Copyright 2007 International Federation of Operational Research Societies
Copyright_xml – notice: 2007 International Federation of Operational Research Societies
DBID BSCLL
AAYXX
CITATION
7SC
7TB
8FD
FR3
JQ2
L7M
L~C
L~D
DOI 10.1111/j.1475-3995.2007.00622.x
DatabaseName Istex
CrossRef
Computer and Information Systems Abstracts
Mechanical & Transportation Engineering Abstracts
Technology Research Database
Engineering Research Database
ProQuest Computer Science Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
DatabaseTitle CrossRef
Technology Research Database
Computer and Information Systems Abstracts – Academic
Mechanical & Transportation Engineering Abstracts
ProQuest Computer Science Collection
Computer and Information Systems Abstracts
Engineering Research Database
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts Professional
DatabaseTitleList
Technology Research Database
CrossRef
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
Computer Science
Business
EISSN 1475-3995
EndPage 17
ExternalDocumentID 1406983171
10_1111_j_1475_3995_2007_00622_x
ITOR622
ark_67375_WNG_98HFM0DF_R
Genre article
GroupedDBID --K
.3N
.GA
.Y3
05W
0R~
10A
1B1
1OC
1XV
29J
31~
33P
4.4
50Y
50Z
51W
51Y
52M
52O
52Q
52S
52T
52U
52W
5GY
5HH
5LA
5VS
66C
702
7PT
8-0
8-1
8-3
8-4
8-5
8UM
8VB
930
A04
AABNI
AAEDT
AAESR
AAHQN
AALRI
AAMMB
AAMNL
AANHP
AAONW
AAOUF
AAQFI
AAQXK
AASGY
AAXRX
AAXUO
AAYCA
AAZKR
ABCQN
ABCUV
ABEML
ABJNI
ABPVW
ABSOO
ABWVN
ACAHQ
ACBKW
ACBWZ
ACCZN
ACGFS
ACHQT
ACIWK
ACPOU
ACRPL
ACSCC
ACVFH
ACXQS
ACYXJ
ADBBV
ADCNI
ADEMA
ADEOM
ADIZJ
ADKYN
ADMGS
ADMUD
ADNMO
ADXAS
ADZMN
AEFGJ
AEIGN
AEIMD
AEMOZ
AENEX
AEUPX
AEUYR
AEYWJ
AFBPY
AFEBI
AFFPM
AFGKR
AFKFF
AFPUW
AFWVQ
AFZJQ
AGHNM
AGQPQ
AGXDD
AHBTC
AHQJS
AIDQK
AIDYY
AIURR
AKVCP
ALAGY
ALMA_UNASSIGNED_HOLDINGS
ALUQN
ALVPJ
AMBMR
AMVHM
AMYDB
ASPBG
ASTYK
AVWKF
AZBYB
AZFZN
AZVAB
BAFTC
BDRZF
BFHJK
BMXJE
BNVMJ
BQESF
BROTX
BRXPI
BSCLL
BY8
CAG
COF
CS3
D-C
D-D
DCZOG
DPXWK
DR2
DRFUL
DRSSH
DU5
EBA
EBO
EBR
EBS
EBU
EJD
EMK
F00
F01
F5P
FDB
FEDTE
FGOYB
FIRID
G-S
G.N
G50
GODZA
HGLYW
HVGLF
HZI
HZ~
I-F
IHE
IX1
J0M
K1G
K48
LATKE
LC2
LC4
LEEKS
LG8
LH4
LITHE
LOXES
LP6
LP7
LUTES
LW6
LYRES
M41
MEWTI
MK4
MRFUL
MRSSH
MSFUL
MSSSH
MXFUL
MXSSH
N04
N06
N9A
NF~
NQ-
O66
O9-
OIG
P2P
P2W
P2Y
P4C
PQQKQ
Q.N
Q11
QB0
QWB
R.K
R2-
ROL
RPZ
RX1
SEW
SUPJJ
TH9
UB1
UHS
W8V
W99
WBKPD
WEBCB
WIH
WII
WOHZO
WQZ
WSUWO
WXSBR
XG1
ZL0
ZZTAW
~IA
~WP
9DU
AAYXX
CITATION
O8X
7SC
7TB
8FD
FR3
JQ2
L7M
L~C
L~D
ID FETCH-LOGICAL-c4402-b4cd1c2114c00c4ff7f695d5ed5ac99e352b28b28d0faa91cd6b4c43a8766bd43
IEDL.DBID DRFUL
ISSN 0969-6016
IngestDate Fri Jul 25 02:37:20 EDT 2025
Sat Nov 29 08:19:42 EST 2025
Tue Nov 18 21:43:00 EST 2025
Tue Nov 11 03:10:16 EST 2025
Tue Sep 09 05:32:20 EDT 2025
IsDoiOpenAccess false
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 1
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c4402-b4cd1c2114c00c4ff7f695d5ed5ac99e352b28b28d0faa91cd6b4c43a8766bd43
Notes istex:3F8AF5221F5D935BEDA299F262501392A48EDA50
ArticleID:ITOR622
ark:/67375/WNG-98HFM0DF-R
ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
OpenAccessLink https://onlinelibrary.wiley.com/doi/pdfdirect/10.1111/j.1475-3995.2007.00622.x
PQID 200205785
PQPubID 45259
PageCount 17
ParticipantIDs proquest_journals_200205785
crossref_primary_10_1111_j_1475_3995_2007_00622_x
crossref_citationtrail_10_1111_j_1475_3995_2007_00622_x
wiley_primary_10_1111_j_1475_3995_2007_00622_x_ITOR622
istex_primary_ark_67375_WNG_98HFM0DF_R
PublicationCentury 2000
PublicationDate 2008-01
January 2008
2008-01-00
20080101
PublicationDateYYYYMMDD 2008-01-01
PublicationDate_xml – month: 01
  year: 2008
  text: 2008-01
PublicationDecade 2000
PublicationPlace Oxford, UK
PublicationPlace_xml – name: Oxford, UK
– name: Oxford
PublicationTitle International transactions in operational research
PublicationYear 2008
Publisher Blackwell Publishing Ltd
Publisher_xml – name: Blackwell Publishing Ltd
References Dong, Q., Wu, Z., 2002. A linear-time algorithm for solving the molecular distance geometry problem with exact inter-atomic distances. Journal of Global Optimization 22, 365-375.
Crippen, G.M., Havel, T.F., 1988. Distance Geometry and Molecular Conformation. John Wiley & Sons, New York.
Moré, J.J., Wu, Z., 1997. Global continuation for distance geometry problems. SIAM Journal on Optimization 7, 814-836.
Pogorelov, A., 1987. Geometry. Mir Publishers, Moscow.
Klepeis, J.L., Floudas, C.A., Morikis, D., Lambris, J.D., 1999. Predicting peptide structures using NMR data and deterministic global optimization. Journal of Computational Chemistry 20, 13, 1354-1370.
Moré, J.J., Wu, Z., 1999. Distance geometry optimization for protein structures. Journal of Global Optimization 15, 219-234.
Hendrickson, B.A., 1995. The molecule problem: Exploiting structure in global optimization. SIAM Journal on Optimization 5, 835-857.
Creighton, T.E., 1993. Proteins: Structures and Molecular Properties. W.H. Freeman and Company, New York.
Wu, D., Wu, Z., Yuan, Y., to appear. Rigid versus unique determination of protein structures with geometric buildup. Optimization Letters.
Phillips, A.T., Rosen, J.B., Walke, V.H., 1996. Molecular structure determination by convex underestimation of local energy minima. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 23, 181-198, American Mathematical Society, Providence.
Schlick, T., 2002. Molecular modelling and simulation: an interdisciplinary guide. Springer, New York.
1996; 1027
1999; 15
2002; 22
1987
2006
1999; 20
1993
2004
2002
1995; 5
1979
1997; 7
1996; 23
1988
e_1_2_7_6_1
e_1_2_7_5_1
e_1_2_7_9_1
e_1_2_7_8_1
Creighton T.E. (e_1_2_7_2_1) 1993
e_1_2_7_7_1
e_1_2_7_16_1
e_1_2_7_15_1
Crippen G.M. (e_1_2_7_3_1) 1988
e_1_2_7_12_1
e_1_2_7_11_1
Cruz I.F. (e_1_2_7_4_1) 1996
e_1_2_7_10_1
Wu D. (e_1_2_7_17_1)
Phillips A.T. (e_1_2_7_13_1) 1996; 23
Pogorelov A. (e_1_2_7_14_1) 1987
References_xml – reference: Dong, Q., Wu, Z., 2002. A linear-time algorithm for solving the molecular distance geometry problem with exact inter-atomic distances. Journal of Global Optimization 22, 365-375.
– reference: Pogorelov, A., 1987. Geometry. Mir Publishers, Moscow.
– reference: Wu, D., Wu, Z., Yuan, Y., to appear. Rigid versus unique determination of protein structures with geometric buildup. Optimization Letters.
– reference: Hendrickson, B.A., 1995. The molecule problem: Exploiting structure in global optimization. SIAM Journal on Optimization 5, 835-857.
– reference: Moré, J.J., Wu, Z., 1997. Global continuation for distance geometry problems. SIAM Journal on Optimization 7, 814-836.
– reference: Moré, J.J., Wu, Z., 1999. Distance geometry optimization for protein structures. Journal of Global Optimization 15, 219-234.
– reference: Schlick, T., 2002. Molecular modelling and simulation: an interdisciplinary guide. Springer, New York.
– reference: Crippen, G.M., Havel, T.F., 1988. Distance Geometry and Molecular Conformation. John Wiley & Sons, New York.
– reference: Klepeis, J.L., Floudas, C.A., Morikis, D., Lambris, J.D., 1999. Predicting peptide structures using NMR data and deterministic global optimization. Journal of Computational Chemistry 20, 13, 1354-1370.
– reference: Phillips, A.T., Rosen, J.B., Walke, V.H., 1996. Molecular structure determination by convex underestimation of local energy minima. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 23, 181-198, American Mathematical Society, Providence.
– reference: Creighton, T.E., 1993. Proteins: Structures and Molecular Properties. W.H. Freeman and Company, New York.
– volume: 7
  start-page: 814
  year: 1997
  end-page: 836
  article-title: Global continuation for distance geometry problems
  publication-title: SIAM Journal on Optimization
– volume: 22
  start-page: 365
  year: 2002
  end-page: 375
  article-title: A linear‐time algorithm for solving the molecular distance geometry problem with exact inter‐atomic distances
  publication-title: Journal of Global Optimization
– volume: 5
  start-page: 835
  year: 1995
  end-page: 857
  article-title: The molecule problem
  publication-title: SIAM Journal on Optimization
– year: 2002
– year: 1988
– year: 1987
– year: 2006
– volume: 1027
  start-page: 162
  year: 1996
  end-page: 165
– year: 2004
– volume: 20
  start-page: 1354
  issue: 13
  year: 1999
  end-page: 1370
  article-title: Predicting peptide structures using NMR data and deterministic global optimization
  publication-title: Journal of Computational Chemistry
– volume: 15
  start-page: 219
  year: 1999
  end-page: 234
  article-title: Distance geometry optimization for protein structures
  publication-title: Journal of Global Optimization
– article-title: Rigid versus unique determination of protein structures with geometric buildup
  publication-title: Optimization Letters
– start-page: 405
  year: 2006
  end-page: 414
– volume: 23
  start-page: 181
  year: 1996
  end-page: 198
  article-title: Molecular structure determination by convex underestimation of local energy minima
  publication-title: DIMACS Series in Discrete Mathematics and Theoretical Computer Science
– year: 1979
– year: 1993
– ident: e_1_2_7_10_1
– volume: 23
  start-page: 181
  year: 1996
  ident: e_1_2_7_13_1
  article-title: Molecular structure determination by convex underestimation of local energy minima
  publication-title: DIMACS Series in Discrete Mathematics and Theoretical Computer Science
  doi: 10.1090/dimacs/023/12
– volume-title: Geometry
  year: 1987
  ident: e_1_2_7_14_1
– ident: e_1_2_7_6_1
  doi: 10.1109/INFCOM.2004.1354686
– ident: e_1_2_7_11_1
  doi: 10.1137/S1052623495283024
– ident: e_1_2_7_7_1
  doi: 10.1137/0805040
– volume-title: Distance Geometry and Molecular Conformation
  year: 1988
  ident: e_1_2_7_3_1
– ident: e_1_2_7_12_1
  doi: 10.1023/A:1008380219900
– ident: e_1_2_7_8_1
  doi: 10.1002/(SICI)1096-987X(199910)20:13<1354::AID-JCC3>3.0.CO;2-N
– ident: e_1_2_7_17_1
  article-title: Rigid versus unique determination of protein structures with geometric buildup
  publication-title: Optimization Letters
– start-page: 162
  volume-title: Graph Drawing, Symposium on Graph Drawing, GD ’95, Passau, Germany LNCS
  year: 1996
  ident: e_1_2_7_4_1
– ident: e_1_2_7_16_1
  doi: 10.1007/978-0-387-22464-0
– ident: e_1_2_7_9_1
  doi: 10.1007/0-387-30528-9_14
– volume-title: Proteins: Structures and Molecular Properties
  year: 1993
  ident: e_1_2_7_2_1
– ident: e_1_2_7_5_1
  doi: 10.1023/A:1013857218127
– ident: e_1_2_7_15_1
SSID ssj0001517
Score 2.100495
Snippet The Molecular Distance Geometry Problem consists in finding the positions in of the atoms of a molecule, given some of the inter‐atomic distances. We show that...
The Molecular Distance Geometry Problem consists in finding the positions in of the atoms of a molecule, given some of the inter-atomic distances. We show that...
SourceID proquest
crossref
wiley
istex
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 1
SubjectTerms Algorithms
Branch-and-Prune algorithm
Geometry
Molecular Distance Geometry Problem
Molecular structure
Operations research
Studies
Title A Branch-and-Prune algorithm for the Molecular Distance Geometry Problem
URI https://api.istex.fr/ark:/67375/WNG-98HFM0DF-R/fulltext.pdf
https://onlinelibrary.wiley.com/doi/abs/10.1111%2Fj.1475-3995.2007.00622.x
https://www.proquest.com/docview/200205785
Volume 15
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVWIB
  databaseName: Wiley Online Library Full Collection 2020
  customDbUrl:
  eissn: 1475-3995
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0001517
  issn: 0969-6016
  databaseCode: DRFUL
  dateStart: 19970101
  isFulltext: true
  titleUrlDefault: https://onlinelibrary.wiley.com
  providerName: Wiley-Blackwell
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1LT9tAEB6hBFXlUCAtakpBe0DcXPmxfuyRkhqQQogiULlZ6901oIKDnFDRW38Cv5FfwowfUYI4IIRkWT541trHzHyznv0GYEcSi5xntMV9lVnchLTRlBrLUZHK0MHLQJfs-v1wMIjOz8Wwzn-iszAVP8Rsw400o7TXpOAynTxT8tC36Ghmw0QYuO4PxJNtF5ex34J2bxSf9Wd2GX1beXhaBMIiEpLFvJ4X21pwVm0a9_sFJDqPZ0uHFK--Z1fW4FMNS9letY7WYcnkHfjQZMV3YLWp_sBqY9CBlTkqw8_Q32M_qUbH5eP_B5lrvA-Lu9wweX0xLq6mlzcM0TFDtMmOm4K8rEfYFdtiB2Z8Y6bFPzasytt8gbP41-n-oVVXarAUxwDUSrnSjsJYkivbVjzLwiwQvvaN9qUSwiDKS90IL21nUgpH6QBFuCfRFgep5t4GtPJxbr4Ccz1tfB06JhKaq9TBeEcRYbIQqfRUqLoQNlOSqJrGnKppXCfz4UzoJzSaVGST_q_jaCb3XXBmkrcVlccrZHbLWZ8JyOIPpcLhu78HB4mIDuNjuxcnoy5sNssiqa3AhFpybWIT6kJQzv-rv5scnZ6M8OnbWwU34WOV2UKbRd-hNS3uzBYsq7_Tq0mxXavGE3BaC_0
linkProvider Wiley-Blackwell
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1Lb9NAEB6hBvE4UAhUhPLYA-Jm5Mf6scdCcFPhhChKRW-r9e6aVm0d5KZVe-Mn8Bv5Jcz4ESWIQ4WQLMsHz1pez8zOjGe_D-CtIhS5wBqHh7pwuI2p0JRbx9OJLnCBV5Gp0fWzeDJJjo7EtKUDor0wDT7EquBGllH7azJwKkj_YeVx6NDezA6KMPL99xhQ9jhqFap7bzhLD7OVY8bFrd49LSLhEArJZmPPX8faWK16NPHXG6HoekBbr0jp9n99l8fwqA1M2V6jSU_gji37cK_ri-_Ddsf_wFp30IeHa2CGTyHbYx-IpeP414-fqjR4nlaXpWXq7NuiOlkenzOMjxnGm2zcUfKyIUWvOBbbt4tzu6xu2LQhuHkGh-mn-ceR03I1OJpjCurkXBtPYzbJtetqXhRxEYnQhNaESgthMc7L_QQP4xZKCU-bCEV4oNAbR7nhwQ5slYvSPgfmB8aGJvZsIgzXuYcZjybIZCFyFehYDyDuvonULZA58WmcyfWEJg4lzSbRbNIfdpxNeT0AbyX5vQHzuIXMu_qzrwRUdUrNcHjv18m-FMkoHbvDVM4GsNvphWz9wAWN5LuEJzSAqFaAWz9XHsy_zPDqxb8KvoH7o_k4k9nB5PMuPGj6XKh09BK2ltWlfQV39dXy5KJ63drJb4wOD-0
linkToPdf http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1LT9tAEB5VSYXaAymhVQNt2UPVm5Ef68ceaVMHREijCAQ3a727hqjBQSZU9Naf0N_YX9IZP6Kk6gEhJMvywbO2d3de69nvA_goCUXOM9rivsosbkJaaEqN5ahIZejgZaBLdP1hOBpFFxdiXNMB0V6YCh9iueBGmlHaa1Jwc6Ozf7Q89C3am9lAEQauu48BZZsTp0wL2v1JfDZcGmZ0buXuaREIi1BI1gt7_tvWmrdqU8ffr4WiqwFt6ZHizpN-yyvYrANTdlDNpC14ZvIubDR18V3oNPwPrDYHXXi5Ama4DcMD9plYOq7-_Potc43ncXGXGyZnl_Niuri6ZhgfM4w32UlDycv6FL1iW2xg5tdmUfxk44rg5jWcxV9PvxxaNVeDpTimoFbKlXYUZpNc2bbiWRZmgfC1b7QvlRAG47zUjfDQdialcJQOUIR7Eq1xkGruvYFWPs_NW2Cup42vQ8dEQnOVOpjxKIJMFiKVngpVD8JmTBJVA5kTn8YsWU1oQj-h3iSaTfrDjr2Z3PfAWUreVGAeD5D5VA77UkAW36kYDu89Hw0SER3GJ3Y_TiY92G3mRVLbgVtqybUJT6gHQTkBHvzc5Oj02wSvdh4ruAcbY3yv4dHoeBdeVGUutHL0DlqL4s68h-fqx2J6W3yo1eQv_SIPaA
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=A+Branch%E2%80%90and%E2%80%90Prune+algorithm+for+the+Molecular+Distance+Geometry+Problem&rft.jtitle=International+transactions+in+operational+research&rft.au=Liberti%2C+Leo&rft.au=Lavor%2C+Carlile&rft.au=Maculan%2C+Nelson&rft.date=2008-01-01&rft.issn=0969-6016&rft.eissn=1475-3995&rft.volume=15&rft.issue=1&rft.spage=1&rft.epage=17&rft_id=info:doi/10.1111%2Fj.1475-3995.2007.00622.x&rft.externalDBID=n%2Fa&rft.externalDocID=10_1111_j_1475_3995_2007_00622_x
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0969-6016&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0969-6016&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0969-6016&client=summon