Chemical trees enumeration algorithms

In the chemical community the need for representing chemical structures within a given family and of efficiently enumerating these structures suggested the use of computers and the implementation of fast enumeration algorithms. This paper considers the isomeric acyclic structures focusing on the enu...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:4OR Ročník 1; číslo 1; s. 67 - 83
Hlavní autori: Aringhieri, Roberto, Hansen, Pierre, Malucelli, Federico
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Heidelberg Springer Nature B.V 01.03.2003
Predmet:
ISSN:1619-4500, 1614-2411
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Abstract In the chemical community the need for representing chemical structures within a given family and of efficiently enumerating these structures suggested the use of computers and the implementation of fast enumeration algorithms. This paper considers the isomeric acyclic structures focusing on the enumeration of the alkane molecular family. For this family, Trinajstić et al. (1991) devised an enumeration algorithm which is the most widely known and utilized nowadays. Kvasnička and Pospichal (1991) have proposed an algorithmic scheme which, from the computational complexity point of view, can prove to be more efficient than the Trinajstić one, nevertheless, this algorithm, to the best of our knowledge, has never been implemented. Indeed an efficient implementation requires the introduction of non trivial data structures and other computational tricks. The main contribution of this paper consists of the definition of the implementation details of Kvasnička-Pospichal’s algorithm, in a comparison of Trinajstić’s, Kvasnička-Pospichal’s and two new algorithms, proposed here, in terms of both computational complexity analysis and running times.
AbstractList In the chemical community the need for representing chemical structures within a given family and of efficiently enumerating these structures suggested the use of computers and the implementation of fast enumeration algorithms. This paper considers the isomeric acyclic structures focusing on the enumeration of the alkane molecular family. For this family, Trinajstić et al. (1991) devised an enumeration algorithm which is the most widely known and utilized nowadays. Kvasnička and Pospichal (1991) have proposed an algorithmic scheme which, from the computational complexity point of view, can prove to be more efficient than the Trinajstić one, nevertheless, this algorithm, to the best of our knowledge, has never been implemented. Indeed an efficient implementation requires the introduction of non trivial data structures and other computational tricks. The main contribution of this paper consists of the definition of the implementation details of Kvasnička-Pospichal’s algorithm, in a comparison of Trinajstić’s, Kvasnička-Pospichal’s and two new algorithms, proposed here, in terms of both computational complexity analysis and running times.
Author Malucelli, Federico
Aringhieri, Roberto
Hansen, Pierre
Author_xml – sequence: 1
  givenname: Roberto
  surname: Aringhieri
  fullname: Aringhieri, Roberto
– sequence: 2
  givenname: Pierre
  surname: Hansen
  fullname: Hansen, Pierre
– sequence: 3
  givenname: Federico
  surname: Malucelli
  fullname: Malucelli, Federico
BookMark eNp9kD1PAzEMhiNUJNrCD2CrhBgDTpzkkhFVfEmVWGCO0lxCr7qPkqQD_54rZWLoYNnD-9jyMyOTfugDIdcM7hhAdZ8ZcK0pAB8LNDVnZMoUE5QLxia_s6FCAlyQWc5bAEQUMCW3y03oGu_aRUkh5EXo911IrjRDv3Dt55CasunyJTmPrs3h6q_PycfT4_vyha7enl-XDyvqUYhCdR1MbZwOtaxlBRUqHmodVRWl9jI6U60RtTQ1apQ-Ri65ZMIxt0auzNrjnNwc9-7S8LUPudjtsE_9eNIiZ4qjUEaeSjGuldKjChhT1THl05BzCtH6pvw-VpJrWsvAHszZozk7mrMHc9aMJPtH7lLTufR9gvkBjilwGw
CitedBy_id crossref_primary_10_1016_j_ejor_2015_02_019
crossref_primary_10_1002_net_20281
crossref_primary_10_1016_j_jda_2014_07_004
ContentType Journal Article
Copyright Springer-Verlag Berlin/Heidelberg 2003.
Copyright Springer Nature B.V. Mar 2003
Copyright_xml – notice: Springer-Verlag Berlin/Heidelberg 2003.
– notice: Copyright Springer Nature B.V. Mar 2003
DBID AAYXX
CITATION
3V.
7WY
7WZ
7XB
87Z
8AL
8FE
8FG
8FK
8FL
ABJCF
ABUWG
AFKRA
ARAPS
AZQEC
BENPR
BEZIV
BGLVJ
CCPQU
DWQXO
FRNLG
F~G
GNUQQ
HCIFZ
JQ2
K60
K6~
K7-
L.-
L6V
M0C
M0N
M7S
P62
PHGZM
PHGZT
PKEHL
PQBIZ
PQBZA
PQEST
PQGLB
PQQKQ
PQUKI
PRINS
PTHSS
PYYUZ
Q9U
DOI 10.1007/s10288-002-0008-9
DatabaseName CrossRef
ProQuest Central (Corporate)
ABI/INFORM Collection
ABI/INFORM Global (PDF only)
ProQuest Central (purchase pre-March 2016)
ABI/INFORM Collection
Computing Database (Alumni Edition)
ProQuest SciTech Collection
ProQuest Technology Collection
ProQuest Central (Alumni) (purchase pre-March 2016)
ABI/INFORM Collection (Alumni)
Materials Science & Engineering Collection
ProQuest Central (Alumni)
ProQuest Central UK/Ireland
Advanced Technologies & Computer Science Collection
ProQuest Central Essentials - QC
ProQuest Central Database Suite (ProQuest)
Business Premium Collection
Technology Collection
ProQuest One
ProQuest Central Korea
Business Premium Collection (Alumni)
ABI/INFORM Global (Corporate)
ProQuest Central Student
SciTech Collection (ProQuest)
ProQuest Computer Science Collection
ProQuest Business Collection (Alumni Edition)
ProQuest Business Collection
Computer Science Database
ABI/INFORM Professional Advanced
ProQuest Engineering Collection
ABI/INFORM Global
Computing Database
Engineering Database
ProQuest Advanced Technologies & Aerospace Collection
ProQuest Central Premium
ProQuest One Academic (New)
ProQuest One Academic Middle East (New)
ProQuest One Business
ProQuest One Business (Alumni)
ProQuest One Academic Eastern Edition (DO NOT USE)
ProQuest One Applied & Life Sciences
ProQuest One Academic (retired)
ProQuest One Academic UKI Edition
ProQuest Central China
Engineering Collection
ABI/INFORM Collection China
ProQuest Central Basic
DatabaseTitle CrossRef
ABI/INFORM Global (Corporate)
ProQuest Business Collection (Alumni Edition)
ProQuest One Business
Computer Science Database
ProQuest Central Student
Technology Collection
ProQuest One Academic Middle East (New)
ProQuest Advanced Technologies & Aerospace Collection
ProQuest Central Essentials
ProQuest Computer Science Collection
ProQuest Central (Alumni Edition)
SciTech Premium Collection
ProQuest One Community College
ProQuest Central China
ABI/INFORM Complete
ProQuest Central
ABI/INFORM Professional Advanced
ProQuest One Applied & Life Sciences
ProQuest Engineering Collection
ProQuest Central Korea
ProQuest Central (New)
ABI/INFORM Complete (Alumni Edition)
Engineering Collection
Advanced Technologies & Aerospace Collection
Business Premium Collection
ABI/INFORM Global
ProQuest Computing
Engineering Database
ABI/INFORM Global (Alumni Edition)
ProQuest Central Basic
ProQuest Computing (Alumni Edition)
ProQuest One Academic Eastern Edition
ABI/INFORM China
ProQuest Technology Collection
ProQuest SciTech Collection
ProQuest Business Collection
ProQuest One Academic UKI Edition
Materials Science & Engineering Collection
ProQuest One Business (Alumni)
ProQuest One Academic
ProQuest Central (Alumni)
ProQuest One Academic (New)
Business Premium Collection (Alumni)
DatabaseTitleList ABI/INFORM Global (Corporate)
ABI/INFORM Global (Corporate)
Database_xml – sequence: 1
  dbid: BENPR
  name: ProQuest Central Database Suite (ProQuest)
  url: https://www.proquest.com/central
  sourceTypes: Aggregation Database
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISSN 1614-2411
EndPage 83
ExternalDocumentID 2889292131
10_1007_s10288_002_0008_9
GroupedDBID -Y2
.86
.VR
06D
0R~
0VY
1N0
203
23M
2J2
2JN
2JY
2KG
2LR
2P1
2VQ
2~H
30V
4.4
406
408
409
40D
40E
5VS
67Z
6NX
7WY
8FE
8FG
8FL
8TC
95-
95.
95~
96X
AAAVM
AABHQ
AACDK
AAHNG
AAIAL
AAJBT
AAJKR
AANZL
AAPKM
AARHV
AARTL
AASML
AATNV
AATVU
AAUYE
AAWCG
AAYIU
AAYQN
AAYTO
AAYXX
ABAKF
ABBBX
ABBRH
ABBXA
ABDBE
ABDZT
ABECU
ABFTD
ABFTV
ABHLI
ABHQN
ABJCF
ABJNI
ABJOX
ABKCH
ABKTR
ABMNI
ABMQK
ABNWP
ABQBU
ABQSL
ABRTQ
ABSXP
ABTEG
ABTHY
ABTKH
ABTMW
ABULA
ABUWG
ABWNU
ABXPI
ACAOD
ACBXY
ACDTI
ACGFS
ACHSB
ACHXU
ACIWK
ACKNC
ACMDZ
ACMLO
ACOKC
ACOMO
ACPIV
ACREN
ACSNA
ACZOJ
ADFRT
ADHHG
ADHIR
ADHKG
ADKNI
ADKPE
ADRFC
ADTPH
ADURQ
ADYFF
ADYOE
ADZKW
AEBTG
AEFQL
AEGAL
AEGNC
AEJHL
AEJRE
AEKMD
AEMSY
AEOHA
AEPYU
AETLH
AEVLU
AEXYK
AFDZB
AFFHD
AFGCZ
AFKRA
AFLOW
AFOHR
AFQWF
AFWTZ
AFYQB
AFZKB
AGAYW
AGDGC
AGJBK
AGMZJ
AGQEE
AGQMX
AGQPQ
AGRTI
AGWIL
AGWZB
AGYKE
AHAVH
AHBYD
AHPBZ
AHSBF
AHYZX
AIAKS
AIGIU
AIIXL
AILAN
AITGF
AJBLW
AJRNO
AJZVZ
ALMA_UNASSIGNED_HOLDINGS
ALWAN
AMKLP
AMTXH
AMXSW
AMYLF
AMYQR
AOCGG
ARAPS
ARMRJ
ASPBG
ATHPR
AVWKF
AXYYD
AYFIA
AYQZM
AZFZN
AZQEC
B-.
BA0
BAPOH
BDATZ
BENPR
BEZIV
BGLVJ
BGNMA
BPHCQ
BSONS
CAG
CCPQU
CITATION
COF
CS3
CSCUP
DDRTE
DL5
DNIVK
DPUIP
DWQXO
EBLON
EBS
EIOEI
EJD
EOH
ESBYG
FEDTE
FERAY
FFXSO
FIGPU
FINBP
FNLPD
FRNLG
FRRFC
FSGXE
FWDCC
GGCAI
GGRSB
GJIRD
GNUQQ
GNWQR
GQ7
GQ8
GXS
H13
HCIFZ
HF~
HG5
HG6
HLICF
HMJXF
HQYDN
HRMNR
HVGLF
HZ~
I09
IJ-
IKXTQ
IWAJR
IXC
IXD
IXE
IZIGR
IZQ
I~X
I~Z
J-C
J0Z
J9A
JBSCW
JCJTX
JZLTJ
K60
K6V
K6~
K7-
KDC
KOV
L6V
LAS
LLZTM
M0C
M4Y
M7S
MA-
N2Q
N9A
NB0
NPVJJ
NQJWS
NU0
O9-
O93
O9G
OAM
P9M
PF0
PHGZM
PHGZT
PQBIZ
PQBZA
PQGLB
PQQKQ
PROAC
PT4
PTHSS
Q2X
QOS
R89
R9I
ROL
RPX
RSV
S16
S1Z
S27
S3B
SAP
SBE
SDH
SHX
SISQX
SJYHP
SNE
SNPRN
SNX
SOHCF
SOJ
SPISZ
SRMVM
SSLCW
STPWE
SZN
T13
TSG
TSK
TSV
TUC
U2A
UG4
UOJIU
UTJUX
UZXMN
VC2
VFIZW
W23
W48
WK8
YLTOR
Z45
ZMTXR
~A9
3V.
7XB
8AL
8FK
AESKC
JQ2
L.-
M0N
P62
PKEHL
PQEST
PQUKI
PRINS
Q9U
ID FETCH-LOGICAL-c344t-8de9d9a8ed5d5707362ed8f67f58c5fa97b33859d3835cff252514a1ab3269bc3
IEDL.DBID K7-
ISICitedReferencesCount 12
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000209573200006&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 1619-4500
IngestDate Wed Nov 05 14:53:36 EST 2025
Wed Nov 05 14:49:34 EST 2025
Tue Nov 18 20:40:22 EST 2025
Sat Nov 29 02:47:19 EST 2025
IsDoiOpenAccess false
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 1
Language English
License http://www.springer.com/tdm
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c344t-8de9d9a8ed5d5707362ed8f67f58c5fa97b33859d3835cff252514a1ab3269bc3
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
OpenAccessLink http://hdl.handle.net/2318/55616
PQID 1286680280
PQPubID 326374
PageCount 17
ParticipantIDs proquest_journals_3216234695
proquest_journals_1286680280
crossref_citationtrail_10_1007_s10288_002_0008_9
crossref_primary_10_1007_s10288_002_0008_9
PublicationCentury 2000
PublicationDate 2003-03-01
PublicationDateYYYYMMDD 2003-03-01
PublicationDate_xml – month: 03
  year: 2003
  text: 2003-03-01
  day: 01
PublicationDecade 2000
PublicationPlace Heidelberg
PublicationPlace_xml – name: Heidelberg
PublicationTitle 4OR
PublicationYear 2003
Publisher Springer Nature B.V
Publisher_xml – name: Springer Nature B.V
SSID ssj0033340
Score 1.6470207
Snippet In the chemical community the need for representing chemical structures within a given family and of efficiently enumerating these structures suggested the use...
SourceID proquest
crossref
SourceType Aggregation Database
Enrichment Source
Index Database
StartPage 67
SubjectTerms Algorithms
Alkanes
Complexity
Data structures
Enumeration
Operations research
Studies
Title Chemical trees enumeration algorithms
URI https://www.proquest.com/docview/1286680280
https://www.proquest.com/docview/3216234695
Volume 1
WOSCitedRecordID wos000209573200006&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVPQU
  databaseName: ABI/INFORM Collection
  customDbUrl:
  eissn: 1614-2411
  dateEnd: 20241209
  omitProxy: false
  ssIdentifier: ssj0033340
  issn: 1619-4500
  databaseCode: 7WY
  dateStart: 20030301
  isFulltext: true
  titleUrlDefault: https://www.proquest.com/abicomplete
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: ABI/INFORM Global
  customDbUrl:
  eissn: 1614-2411
  dateEnd: 20241209
  omitProxy: false
  ssIdentifier: ssj0033340
  issn: 1619-4500
  databaseCode: M0C
  dateStart: 20030301
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/abiglobal
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Computer Science Database
  customDbUrl:
  eissn: 1614-2411
  dateEnd: 20241209
  omitProxy: false
  ssIdentifier: ssj0033340
  issn: 1619-4500
  databaseCode: K7-
  dateStart: 20030301
  isFulltext: true
  titleUrlDefault: http://search.proquest.com/compscijour
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Engineering Database
  customDbUrl:
  eissn: 1614-2411
  dateEnd: 20241209
  omitProxy: false
  ssIdentifier: ssj0033340
  issn: 1619-4500
  databaseCode: M7S
  dateStart: 20030301
  isFulltext: true
  titleUrlDefault: http://search.proquest.com
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: ProQuest Central Database Suite (ProQuest)
  customDbUrl:
  eissn: 1614-2411
  dateEnd: 20241209
  omitProxy: false
  ssIdentifier: ssj0033340
  issn: 1619-4500
  databaseCode: BENPR
  dateStart: 20030301
  isFulltext: true
  titleUrlDefault: https://www.proquest.com/central
  providerName: ProQuest
– providerCode: PRVAVX
  databaseName: Springer LINK
  customDbUrl:
  eissn: 1614-2411
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0033340
  issn: 1619-4500
  databaseCode: RSV
  dateStart: 20030301
  isFulltext: true
  titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22
  providerName: Springer Nature
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LT8MwDLbYxgEOvBGDMfUAF6SIvtImJwQTCAkxTeM1TlWSJoAEG6yD34_TB2MS2oWLL22q6pNjf44dG-BA2oYmOjCEovqQUBhBpAopQU-iqGFUSGHyYRNxt8sGA94rD9yysqyysom5oU5Hyp6RH6MdjSJmE4En7x_ETo2y2dVyhEYNGp7ve1bPr2JSWeIgCIoLkRgkkJC6P1nN4uqcjzpi7YF1g4TP-qVZs5z7movV__7lGqyULNM5LdRiHRb0cAOWf_Ue3ITDqlWAY_PSmWNL4nWhDo54fcKPTp7fsi24uzi_7VyScmYCUUEYTghLNU-5YDqlKY1x_0a-TpmJYkMZgi94LDEopTzFyJQqY3yKBCcUnpDI47hUwTbUh6Oh3gGHCoP0AemepyQGcZzFUrmRkEh5UlcbtwluhViiyobidq7FazJthWxBThBkm-NmCW_C0c-S96KbxryXWxXGSbmxsmQK8J-PA99DPochP92dv3oPlvKyvLyarAX1yfhT78Oi-pq8ZOM21OKHxzY0zs67vX47VyqU127HyvgGZf_m_huqHNHC
linkProvider ProQuest
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V3JTsMwEB2xScCBHbEUyIFekCzSxE7sA0KogIqAikORegu2YwNSaYEUED_FNzJOGhYJ9dYD58SWk3mZeZPZAHaVa2hiQksYwodQaSVRmjKClkQzy5lU0ubDJuJmk7fb4moMPspaGJdWWerEXFGnPe3-ke-jHo0i7gKBh49PxE2NctHVcoRGAYtz8_6GLlt2cHaM8q0GwelJq94gg6kCRIeU9glPjUiF5CZlKYsR4VFgUm6j2DKOx5MiVui2MZGi78a0tQFDCkBlTSpkOkLpEPcdh0lK8XNwqYJ-vdT8YRgWBZjolBDK_K8oalGqFyAmnf5xZpeI33bwtxnIbdvp_H97KwswN2DR3lEB-0UYM90lmP3RW3EZqmUrBM_F3TPPpfybAu6e7NziQ_TvHrIVuB7JOVdhotvrmjXwmLRIj5DO1rRCJ1XwWGk_kgopXeob66-DX0oo0YOG6W5uRyf5bvXshJqgUF0MnydiHfa-ljwW3UKG3VwpZZoMFEeWfAv0z8thUEO-SiPBNoav3oHpRuvyIrk4a55vwkyegphnzlVgov_8YrZgSr_277Pn7RzCHtyMGh2fKjApZw
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=Chemical+trees+enumeration+algorithms&rft.jtitle=4OR&rft.au=Aringhieri%2C+Roberto&rft.au=Hansen%2C+Pierre&rft.au=Malucelli%2C+Federico&rft.date=2003-03-01&rft.pub=Springer+Nature+B.V&rft.issn=1619-4500&rft.eissn=1614-2411&rft.volume=1&rft.issue=1&rft.spage=67&rft.epage=83&rft_id=info:doi/10.1007%2Fs10288-002-0008-9&rft.externalDocID=2889292131
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1619-4500&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1619-4500&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1619-4500&client=summon