An adaptive branching scheme for the Branch & Prune algorithm applied to Distance Geometry
The Molecular Distance Geometry Problem (MDGP) is the one of finding molecular conformations that satisfy a set of distance constraints obtained through experimental techniques such as Nuclear Magnetic Resonance (NMR). We consider a subclass of MDGP instances that can be discretized, where the searc...
Gespeichert in:
| Veröffentlicht in: | 2014 Federated Conference on Computer Science and Information Systems Jg. 2; S. 457 - 463 |
|---|---|
| Hauptverfasser: | , , |
| Format: | Tagungsbericht Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
Polish Information Processing Society
01.09.2014
|
| Schlagworte: | |
| ISSN: | 2300-5963 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | The Molecular Distance Geometry Problem (MDGP) is the one of finding molecular conformations that satisfy a set of distance constraints obtained through experimental techniques such as Nuclear Magnetic Resonance (NMR). We consider a subclass of MDGP instances that can be discretized, where the search domain has the structure of a tree, which can be explored by using an interval Branch & Prune (iBP) algorithm. When all available distances are exact, all candidate positions for a given molecular conformation can be enumerated. This is however not possible in presence of interval distances, because a continuous subset of positions can actually be computed for some atoms. The focus of this work is on a new scheme for an adaptive generation of a discrete subset of candidate positions from this continuous subset. Our generated candidate positions do not only satisfy the distances employed in the discretization process, but also additional distances that might be available (the so-called pruning distances). Therefore, this new scheme is able to guide more efficiently the search in the feasible regions of the search domain. In this work, we motivate the development and formally introduce this new adaptive scheme. Presented computational experiments show that iBP, integrated with our new scheme, outperforms the standard iBP on a set of NMR-like instances. |
|---|---|
| AbstractList | The Molecular Distance Geometry Problem (MDGP) is the one of finding molecular conformations that satisfy a set of distance constraints obtained through experimental techniques such as Nuclear Magnetic Resonance (NMR). We consider a subclass of MDGP instances that can be discretized, where the search domain has the structure of a tree, which can be explored by using an interval Branch & Prune (iBP) algorithm. When all available distances are exact, all candidate positions for a given molecular conformation can be enumerated. This is however not possible in presence of interval distances, because a continuous subset of positions can actually be computed for some atoms. The focus of this work is on a new scheme for an adaptive generation of a discrete subset of candidate positions from this continuous subset. Our generated candidate positions do not only satisfy the distances employed in the discretization process, but also additional distances that might be available (the so-called pruning distances). Therefore, this new scheme is able to guide more efficiently the search in the feasible regions of the search domain. In this work, we motivate the development and formally introduce this new adaptive scheme. Presented computational experiments show that iBP, integrated with our new scheme, outperforms the standard iBP on a set of NMR-like instances. |
| Author | Mucherino, Antonio Lavor, Carlile Goncalves, Douglas |
| Author_xml | – sequence: 1 givenname: Douglas surname: Goncalves fullname: Goncalves, Douglas email: douglas.goncalves@irisa.fr organization: IRISA, Univ. of Rennes 1, Rennes, France – sequence: 2 givenname: Antonio surname: Mucherino fullname: Mucherino, Antonio email: antonio.mucherino@irisa.fr organization: IRISA, Univ. of Rennes 1, Rennes, France – sequence: 3 givenname: Carlile surname: Lavor fullname: Lavor, Carlile email: clavor@ime.unicamp.br organization: IMECC-UNICAMP, Campinas, Brazil |
| BookMark | eNo9jj1PwzAYhA0CiVIqsbN4YgvYee3EHkuhpVIlGGBhiRz7TeMqH5VjkPrviVrEdKe706O7Jhdd3yEht5w9cClAP6aMi6VOz8hM50pBxhRnUsE5maTAWCJ1BldkNgw7xljKBUtFNiFf844aZ_bR_yAtg-ls7bstHWyNLdKqDzTWSJ-OBb2n7-G7Q2qabR98rFtq9vvGo6Oxp89-iOMK6Qr7FmM43JDLyjQDzv50Sj6XLx-L12Tztlov5pvEpbmMSVWWRiEIDsDAVZhyy9GmYC0olGWWa6uwAuuUq5TgRslSKJ6XVem4dhJhStYnruvNrtgH35pwKHrji2PQh21hQvS2wUJomTEUymoLQgilcglqtJwLkELakXV3YnlE_GdlevwmOfwC8HdrKA |
| ContentType | Conference Proceeding Journal Article |
| DBID | 6IE 6IL CBEJK RIE RIL DOA |
| DOI | 10.15439/2014F92 |
| DatabaseName | IEEE Electronic Library (IEL) Conference Proceedings IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume IEEE Xplore All Conference Proceedings IEEE Electronic Library (IEL) IEEE Proceedings Order Plans (POP All) 1998-Present DOAJ Directory of Open Access Journals |
| DatabaseTitleList | |
| Database_xml | – sequence: 1 dbid: DOA name: DOAJ Directory of Open Access Journals url: https://www.doaj.org/ sourceTypes: Open Website – sequence: 2 dbid: RIE name: IEEE Electronic Library (IEL) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISBN | 9788360810583 8360810583 |
| EISSN | 2300-5963 |
| EndPage | 463 |
| ExternalDocumentID | oai_doaj_org_article_49560e48c9c3444887538c341143545c 6933051 |
| Genre | orig-research |
| GroupedDBID | 6IE 6IL CBEJK RIE RIL 6IF 6IN AAJGR AAWTH ADBBV ADZIZ ALMA_UNASSIGNED_HOLDINGS BCNDV BEFXN BFFAM BGNUA BKEBE BPEOZ CHZPO GROUPED_DOAJ IEGSK M~E OCL OK1 Y2W |
| ID | FETCH-LOGICAL-d275t-fbba8e3413303dfe21c1ec23cc38e5b679c8ef3cd8df841a85b4817bfbd19d5e3 |
| IEDL.DBID | DOA |
| ISICitedReferencesCount | 1 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000358008500057&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| IngestDate | Fri Oct 03 12:51:51 EDT 2025 Thu Jun 29 18:36:57 EDT 2023 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-d275t-fbba8e3413303dfe21c1ec23cc38e5b679c8ef3cd8df841a85b4817bfbd19d5e3 |
| OpenAccessLink | https://doaj.org/article/49560e48c9c3444887538c341143545c |
| PageCount | 7 |
| ParticipantIDs | doaj_primary_oai_doaj_org_article_49560e48c9c3444887538c341143545c ieee_primary_6933051 |
| PublicationCentury | 2000 |
| PublicationDate | 2014-Sept. |
| PublicationDateYYYYMMDD | 2014-09-01 |
| PublicationDate_xml | – month: 09 year: 2014 text: 2014-Sept. |
| PublicationDecade | 2010 |
| PublicationTitle | 2014 Federated Conference on Computer Science and Information Systems |
| PublicationTitleAbbrev | FedCSIS |
| PublicationYear | 2014 |
| Publisher | Polish Information Processing Society |
| Publisher_xml | – name: Polish Information Processing Society |
| SSID | ssj0002140246 |
| Score | 1.960475 |
| Snippet | The Molecular Distance Geometry Problem (MDGP) is the one of finding molecular conformations that satisfy a set of distance constraints obtained through... |
| SourceID | doaj ieee |
| SourceType | Open Website Publisher |
| StartPage | 457 |
| SubjectTerms | Atomic layer deposition Computer science Equations Geometry Nuclear magnetic resonance Optimization |
| SummonAdditionalLinks | – databaseName: IEEE Electronic Library (IEL) dbid: RIE link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV09T8MwELVKxcBUoEWUL3lATARw7DTOSIHCgKoOgCqWyB8XqESTKqRI_Ht8TihCYmGzHMmWLva9e7bvHSHHiFlGRCxgwmaBAC0DrUMVWAacq8S5ZS-m83Qfj8dyOk0mLXK6yoUBAP_4DM6w6e_ybWGWeFR2PkD2jfnSa3E8qHO1Gj3ZyOGq4_FMjPBO06vv_yqX4tFi1PnfPJuk95N2RycrQNkiLci3See77gJttmGXPF_mVFm1QE9FNVbGwGMk6ngqzIG6KJS6qI4O_Qd64oZc5kDV20tRzqrXOVV14Emrgl5j9IjT3kIxh6r87JHH0c3D1V3Q1EgIbBhHVZBprSQgFDksshmEzDAwITeGS4j0IE6MhIwbK20mBVMy0kKyWGfassRGwHdIOy9y2CVUcsV1ghJjEWACqna4pbWEgXXONFYXfTJEu6aLWgYjRWFq3-FslzbrPPV8C4Q0ieHCUT-kQ9I1GcZlIjJ90kV7rwZpTL33d_c-2cCfWr_pOiDtqlzCIVk3H9XsvTzyC-ALhfyz5A priority: 102 providerName: IEEE |
| Title | An adaptive branching scheme for the Branch & Prune algorithm applied to Distance Geometry |
| URI | https://ieeexplore.ieee.org/document/6933051 https://doaj.org/article/49560e48c9c3444887538c341143545c |
| Volume | 2 |
| WOSCitedRecordID | wos000358008500057&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 | |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV09T8MwELVQxcDCV0GUj8oDa0Qd24kzttDCAFUHQN0if1wAiSZVSJFY-O34koDKxMISRYl0kXzJvfcc-x0h54hZVkgWMOGyQIBRgTGhDhwDznXiy3JtpvN4G0-naj5PZmutvnBNWGMP3AzcRU3gQSibWC68lkB-rfwpQ6AX0mL1HcTJmpjCGhx63RCKqHWblR51vcpnYoJ_PGtv_l_NVGosmeyS7ZYE0mHz8D2yAfk-2flusEDb761L5sOcaqeXWJKowRYYOF9EvSCFBVBPN6mnb3RU36CzcpUD1a9Phdf7zwuqG35Jq4JeIUn0Eek1FAuoyo8D8jAZ31_eBG0rhMCFsayCzBitABHHQ47LIGSWgQ25tVyBNFGcWAUZt065TAmmlTRCsdhkxrHESeCHpJMXORwRqrjmJkEnMQm4z9R4eDJGQeR8zYz1oEdGOEDpsnG7SNF_ur7gs5K2WUn_ykqPdHF4f4JEOG8i2fF_xD4hW5jLZqHXKelU5QrOyKZ9r17eyn79Hvjj3ee4X-_m-wLIRrdX |
| linkProvider | Directory of Open Access Journals |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LSwMxEA5FBT35qlifOYgnV80m6WaPvmrFWjxUES9LHrMq2F2pW8F_byZdK4IXbyELCcwm882XZL4hZA8xywrJIiZcHgkwKjIm1pFjwLlOvVsOYjr3vaTfVw8P6W2DHExzYQAgPD6DQ2yGu3xX2jEelR21kX1jvvQsVs6qs7VqRVnpkdUzeSY6eKsZ9Pd_FUwJeNFZ_N9MS6T5k3hHb6eQskwaUKyQxe_KC7TeiKvk8aSg2uk39FXUYG0MPEiinqnCEKiPQ6mP6-hp-ED3_ZDjAqh-fSpHL9XzkOpJ6Emrkp5j_IjTXkI5hGr02SR3nYvBWTeqqyRELk5kFeXGaAUIRh6NXA4xswxszK3lCqRpJ6lVkHPrlMuVYFpJIxRLTG4cS50EvkZmirKAdUIV19ykKDImAVNQjUcuYxS0nXeniT5ukVO0a_Y2EcLIUJo6dHjbZfVKzwLjAqFsarnw5A8JkfJNhpGZkLZFVtHe00FqU2_83b1L5ruDm17Wu-pfb5IF_MGTF15bZKYajWGbzNmP6uV9tBMWwxcOcLct |
| 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%3Abook&rft.genre=proceeding&rft.title=2014+Federated+Conference+on+Computer+Science+and+Information+Systems&rft.atitle=An+adaptive+branching+scheme+for+the+Branch+%26+Prune+algorithm+applied+to+Distance+Geometry&rft.au=Goncalves%2C+Douglas&rft.au=Mucherino%2C+Antonio&rft.au=Lavor%2C+Carlile&rft.date=2014-09-01&rft.pub=Polish+Information+Processing+Society&rft.spage=457&rft.epage=463&rft_id=info:doi/10.15439%2F2014F92&rft.externalDocID=6933051 |