A hybrid approach to protein folding problem integrating constraint programming with local search
Background The protein folding problem remains one of the most challenging open problems in computational biology. Simplified models in terms of lattice structure and energy function have been proposed to ease the computational hardness of this optimization problem. Heuristic search algorithms and c...
Gespeichert in:
| Veröffentlicht in: | BMC bioinformatics Jg. 11; H. Suppl 1; S. S39 |
|---|---|
| Hauptverfasser: | , |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
London
BioMed Central
18.01.2010
Springer Nature B.V BMC |
| Schlagworte: | |
| ISSN: | 1471-2105, 1471-2105 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | Background
The protein folding problem remains one of the most challenging open problems in computational biology. Simplified models in terms of lattice structure and energy function have been proposed to ease the computational hardness of this optimization problem. Heuristic search algorithms and constraint programming are two common techniques to approach this problem. The present study introduces a novel hybrid approach to simulate the protein folding problem using constraint programming technique integrated within local search.
Results
Using the face-centered-cubic lattice model and 20 amino acid pairwise interactions energy function for the protein folding problem, a constraint programming technique has been applied to generate the neighbourhood conformations that are to be used in generic local search procedure. Experiments have been conducted for a few small and medium sized proteins. Results have been compared with both pure constraint programming approach and local search using well-established local move set. Substantial improvements have been observed in terms of final energy values within acceptable runtime using the hybrid approach.
Conclusion
Constraint programming approaches usually provide optimal results but become slow as the problem size grows. Local search approaches are usually faster but do not guarantee optimal solutions and tend to stuck in local minima. The encouraging results obtained on the small proteins show that these two approaches can be combined efficiently to obtain better quality solutions within acceptable time. It also encourages future researchers on adopting hybrid techniques to solve other hard optimization problems. |
|---|---|
| AbstractList | Abstract Background The protein folding problem remains one of the most challenging open problems in computational biology. Simplified models in terms of lattice structure and energy function have been proposed to ease the computational hardness of this optimization problem. Heuristic search algorithms and constraint programming are two common techniques to approach this problem. The present study introduces a novel hybrid approach to simulate the protein folding problem using constraint programming technique integrated within local search. Results Using the face-centered-cubic lattice model and 20 amino acid pairwise interactions energy function for the protein folding problem, a constraint programming technique has been applied to generate the neighbourhood conformations that are to be used in generic local search procedure. Experiments have been conducted for a few small and medium sized proteins. Results have been compared with both pure constraint programming approach and local search using well-established local move set. Substantial improvements have been observed in terms of final energy values within acceptable runtime using the hybrid approach. Conclusion Constraint programming approaches usually provide optimal results but become slow as the problem size grows. Local search approaches are usually faster but do not guarantee optimal solutions and tend to stuck in local minima. The encouraging results obtained on the small proteins show that these two approaches can be combined efficiently to obtain better quality solutions within acceptable time. It also encourages future researchers on adopting hybrid techniques to solve other hard optimization problems. Background The protein folding problem remains one of the most challenging open problems in computational biology. Simplified models in terms of lattice structure and energy function have been proposed to ease the computational hardness of this optimization problem. Heuristic search algorithms and constraint programming are two common techniques to approach this problem. The present study introduces a novel hybrid approach to simulate the protein folding problem using constraint programming technique integrated within local search. Results Using the face-centered-cubic lattice model and 20 amino acid pairwise interactions energy function for the protein folding problem, a constraint programming technique has been applied to generate the neighbourhood conformations that are to be used in generic local search procedure. Experiments have been conducted for a few small and medium sized proteins. Results have been compared with both pure constraint programming approach and local search using well-established local move set. Substantial improvements have been observed in terms of final energy values within acceptable runtime using the hybrid approach. Conclusion Constraint programming approaches usually provide optimal results but become slow as the problem size grows. Local search approaches are usually faster but do not guarantee optimal solutions and tend to stuck in local minima. The encouraging results obtained on the small proteins show that these two approaches can be combined efficiently to obtain better quality solutions within acceptable time. It also encourages future researchers on adopting hybrid techniques to solve other hard optimization problems. The protein folding problem remains one of the most challenging open problems in computational biology. Simplified models in terms of lattice structure and energy function have been proposed to ease the computational hardness of this optimization problem. Heuristic search algorithms and constraint programming are two common techniques to approach this problem. The present study introduces a novel hybrid approach to simulate the protein folding problem using constraint programming technique integrated within local search.BACKGROUNDThe protein folding problem remains one of the most challenging open problems in computational biology. Simplified models in terms of lattice structure and energy function have been proposed to ease the computational hardness of this optimization problem. Heuristic search algorithms and constraint programming are two common techniques to approach this problem. The present study introduces a novel hybrid approach to simulate the protein folding problem using constraint programming technique integrated within local search.Using the face-centered-cubic lattice model and 20 amino acid pairwise interactions energy function for the protein folding problem, a constraint programming technique has been applied to generate the neighbourhood conformations that are to be used in generic local search procedure. Experiments have been conducted for a few small and medium sized proteins. Results have been compared with both pure constraint programming approach and local search using well-established local move set. Substantial improvements have been observed in terms of final energy values within acceptable runtime using the hybrid approach.RESULTSUsing the face-centered-cubic lattice model and 20 amino acid pairwise interactions energy function for the protein folding problem, a constraint programming technique has been applied to generate the neighbourhood conformations that are to be used in generic local search procedure. Experiments have been conducted for a few small and medium sized proteins. Results have been compared with both pure constraint programming approach and local search using well-established local move set. Substantial improvements have been observed in terms of final energy values within acceptable runtime using the hybrid approach.Constraint programming approaches usually provide optimal results but become slow as the problem size grows. Local search approaches are usually faster but do not guarantee optimal solutions and tend to stuck in local minima. The encouraging results obtained on the small proteins show that these two approaches can be combined efficiently to obtain better quality solutions within acceptable time. It also encourages future researchers on adopting hybrid techniques to solve other hard optimization problems.CONCLUSIONConstraint programming approaches usually provide optimal results but become slow as the problem size grows. Local search approaches are usually faster but do not guarantee optimal solutions and tend to stuck in local minima. The encouraging results obtained on the small proteins show that these two approaches can be combined efficiently to obtain better quality solutions within acceptable time. It also encourages future researchers on adopting hybrid techniques to solve other hard optimization problems. The protein folding problem remains one of the most challenging open problems in computational biology. Simplified models in terms of lattice structure and energy function have been proposed to ease the computational hardness of this optimization problem. Heuristic search algorithms and constraint programming are two common techniques to approach this problem. The present study introduces a novel hybrid approach to simulate the protein folding problem using constraint programming technique integrated within local search. Using the face-centered-cubic lattice model and 20 amino acid pairwise interactions energy function for the protein folding problem, a constraint programming technique has been applied to generate the neighbourhood conformations that are to be used in generic local search procedure. Experiments have been conducted for a few small and medium sized proteins. Results have been compared with both pure constraint programming approach and local search using well-established local move set. Substantial improvements have been observed in terms of final energy values within acceptable runtime using the hybrid approach. Constraint programming approaches usually provide optimal results but become slow as the problem size grows. Local search approaches are usually faster but do not guarantee optimal solutions and tend to stuck in local minima. The encouraging results obtained on the small proteins show that these two approaches can be combined efficiently to obtain better quality solutions within acceptable time. It also encourages future researchers on adopting hybrid techniques to solve other hard optimization problems. |
| ArticleNumber | S39 |
| Author | Ullah, Abu Dayem Steinhöfel, Kathleen |
| AuthorAffiliation | 1 King's College London, Department of Computer Science, London WC2R 2LS, UK |
| AuthorAffiliation_xml | – name: 1 King's College London, Department of Computer Science, London WC2R 2LS, UK |
| Author_xml | – sequence: 1 givenname: Abu Dayem surname: Ullah fullname: Ullah, Abu Dayem email: abu.dayem_ullah@kcl.ac.uk organization: King's College London, Department of Computer Science – sequence: 2 givenname: Kathleen surname: Steinhöfel fullname: Steinhöfel, Kathleen organization: King's College London, Department of Computer Science |
| BackLink | https://www.ncbi.nlm.nih.gov/pubmed/20122212$$D View this record in MEDLINE/PubMed |
| BookMark | eNp9Uk1v1TAQjFAR_YBfgIQiLpwCXjuO7QtSVUFbqRKHwtlynE3ip8R-2HlF_fc4vLa0PVRayevxzHjt3ePiwAePRfEeyGcA2XyBWkBFgfAKoLrOwdSr4ugBPXiUHxbHKW0IASEJf1McUgKUUqBHhTktx9s2uq40220Mxo7lEsqcLeh82Yepc35Y9-2Ec-n8gkM0y4rZ4NMSTYbW44zO8wr_cctYTsGaqUxooh3fFq97MyV8d7eeFL--f_t5dlFd_Ti_PDu9qiyv6VJZqmppSQMEVa8EFQIJ8E5ybhSRDRKLPSVtx5Qgsu1qpMBr0wEVHROWGXZSXO59u2A2ehvdbOKtDsbpf0CIgzZxcXZCjW2veoAWKZE1EVQiyWnbMqj7fE2fvb7uvba7dsbOos8vnZ6YPj3xbtRDuNGMEMUBssGnO4MYfu8wLXp2yeI0GY9hl7RgDBjwpsnMj8-Ym7CLPv-UVgSkaKTgmfThcT0Phdz3MRPUnmBjSClir61bcp_CWp6bNBC9zoxeJ0KvE5G3-joHU1nLnmnv7V9W1XtVymw_YPxf90uyv-nK1aM |
| CitedBy_id | crossref_primary_10_3390_ijms160715136 crossref_primary_10_1109_TCBB_2016_2610967 crossref_primary_10_1155_2014_985968 crossref_primary_10_1186_1477_5956_11_S1_S19 crossref_primary_10_3390_biom4010056 crossref_primary_10_1007_s11047_014_9427_8 crossref_primary_10_1016_j_cels_2020_08_016 crossref_primary_10_1155_2013_924137 crossref_primary_10_1186_1471_2105_14_S2_S19 crossref_primary_10_1098_rsos_150238 crossref_primary_10_1155_2014_867179 crossref_primary_10_1016_j_compbiolchem_2016_01_008 crossref_primary_10_1109_TEVC_2015_2505317 |
| Cites_doi | 10.1186/1471-2105-4-8 10.1006/jmbi.1996.0114 10.1073/pnas.92.1.146 10.1089/cmb.1997.4.1 10.1017/CBO9780511615320 10.1007/BF00940812 10.1016/S1570-8667(03)00076-5 10.1006/jmbi.1995.0311 10.1002/pro.5560040401 10.1007/s10601-006-6848-8 10.1016/j.compbiolchem.2008.03.004 10.1007/978-3-540-71233-6_30 10.1007/978-3-540-70600-7_13 10.1002/spe.810 10.1126/science.220.4598.671 10.1089/cmb.1998.5.423 10.1007/978-3-540-87361-7_31 10.1186/1471-2105-9-230 10.1126/science.181.4096.223 10.1186/1471-2105-5-186 |
| ContentType | Journal Article |
| Copyright | Ullah and Steinhöfel; licensee BioMed Central Ltd. 2010 2010 Ullah and Steinhöfel; licensee BioMed Central Ltd. This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. Copyright ©2010 Ullah and Steinhöfel; licensee BioMed Central Ltd. 2010 Ullah and Steinhöfel; licensee BioMed Central Ltd. |
| Copyright_xml | – notice: Ullah and Steinhöfel; licensee BioMed Central Ltd. 2010 – notice: 2010 Ullah and Steinhöfel; licensee BioMed Central Ltd. This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. – notice: Copyright ©2010 Ullah and Steinhöfel; licensee BioMed Central Ltd. 2010 Ullah and Steinhöfel; licensee BioMed Central Ltd. |
| DBID | C6C AAYXX CITATION CGR CUY CVF ECM EIF NPM 3V. 7QO 7SC 7X7 7XB 88E 8AL 8AO 8FD 8FE 8FG 8FH 8FI 8FJ 8FK ABUWG AEUYN AFKRA ARAPS AZQEC BBNVY BENPR BGLVJ BHPHI CCPQU DWQXO FR3 FYUFA GHDGH GNUQQ HCIFZ JQ2 K7- K9. L7M LK8 L~C L~D M0N M0S M1P M7P P5Z P62 P64 PHGZM PHGZT PIMPY PJZUB PKEHL PPXIY PQEST PQGLB PQQKQ PQUKI PRINS Q9U 7X8 5PM DOA |
| DOI | 10.1186/1471-2105-11-S1-S39 |
| DatabaseName | Springer Nature OA Free Journals CrossRef Medline MEDLINE MEDLINE (Ovid) MEDLINE MEDLINE PubMed ProQuest Central (Corporate) Biotechnology Research Abstracts Computer and Information Systems Abstracts Health & Medical Collection ProQuest Central (purchase pre-March 2016) Medical Database (Alumni Edition) Computing Database (Alumni Edition) ProQuest Pharma Collection Technology Research Database ProQuest SciTech Collection ProQuest Technology Collection ProQuest Natural Science Collection Hospital Premium Collection Hospital Premium Collection (Alumni Edition) ProQuest Central (Alumni) (purchase pre-March 2016) ProQuest Central (Alumni) ProQuest One Sustainability ProQuest Central UK/Ireland Advanced Technologies & Computer Science Collection ProQuest Central Essentials Biological Science Collection ProQuest Central ProQuest Technology Collection Natural Science Collection ProQuest One ProQuest Central Korea Engineering Research Database ProQuest Health & Medical Collection Health Research Premium Collection (Alumni) ProQuest Central Student SciTech Premium Collection ProQuest Computer Science Collection Computer Science Database (ProQuest) ProQuest Health & Medical Complete (Alumni) Advanced Technologies Database with Aerospace Biological Sciences Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional Computing Database ProQuest Health & Medical Collection Medical Database Biological Science Database Advanced Technologies & Aerospace Database ProQuest Advanced Technologies & Aerospace Collection Biotechnology and BioEngineering Abstracts ProQuest Central Premium ProQuest One Academic (New) Publicly Available Content Database ProQuest Health & Medical Research Collection ProQuest One Academic Middle East (New) ProQuest One Health & Nursing 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 ProQuest Central Basic MEDLINE - Academic PubMed Central (Full Participant titles) 开放获取期刊（Open Access Journals） |
| DatabaseTitle | CrossRef MEDLINE Medline Complete MEDLINE with Full Text PubMed MEDLINE (Ovid) Publicly Available Content Database Computer Science Database ProQuest Central Student ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Essentials ProQuest Computer Science Collection Computer and Information Systems Abstracts SciTech Premium Collection ProQuest Central China ProQuest One Applied & Life Sciences ProQuest One Sustainability Health Research Premium Collection Natural Science Collection Health & Medical Research Collection Biological Science Collection ProQuest Central (New) ProQuest Medical Library (Alumni) Advanced Technologies & Aerospace Collection ProQuest Biological Science Collection ProQuest One Academic Eastern Edition ProQuest Hospital Collection ProQuest Technology Collection Health Research Premium Collection (Alumni) Biological Science Database ProQuest Hospital Collection (Alumni) Biotechnology and BioEngineering Abstracts ProQuest Health & Medical Complete ProQuest One Academic UKI Edition Engineering Research Database ProQuest One Academic ProQuest One Academic (New) Technology Collection Technology Research Database Computer and Information Systems Abstracts – Academic ProQuest One Academic Middle East (New) ProQuest Health & Medical Complete (Alumni) ProQuest Central (Alumni Edition) ProQuest One Community College ProQuest One Health & Nursing ProQuest Natural Science Collection ProQuest Pharma Collection ProQuest Central ProQuest Health & Medical Research Collection Biotechnology Research Abstracts Health and Medicine Complete (Alumni Edition) ProQuest Central Korea Advanced Technologies Database with Aerospace ProQuest Computing ProQuest Central Basic ProQuest Computing (Alumni Edition) ProQuest SciTech Collection Computer and Information Systems Abstracts Professional Advanced Technologies & Aerospace Database ProQuest Medical Library ProQuest Central (Alumni) MEDLINE - Academic |
| DatabaseTitleList | Publicly Available Content Database MEDLINE - Academic MEDLINE |
| Database_xml | – sequence: 1 dbid: DOA name: 开放获取期刊（Open Access Journals） url: https://www.doaj.org/ sourceTypes: Open Website – sequence: 2 dbid: NPM name: PubMed url: http://www.ncbi.nlm.nih.gov/entrez/query.fcgi?db=PubMed sourceTypes: Index Database – sequence: 3 dbid: PIMPY name: Publicly Available Content Database url: http://search.proquest.com/publiccontent sourceTypes: Aggregation Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Biology |
| EISSN | 1471-2105 |
| EndPage | S39 |
| ExternalDocumentID | oai_doaj_org_article_ebf9f11be20840728e0e20bb314fceff PMC3009511 2501736491 20122212 10_1186_1471_2105_11_S1_S39 |
| Genre | Journal Article |
| GroupedDBID | --- 0R~ 23N 2VQ 2WC 4.4 53G 5VS 6J9 7X7 88E 8AO 8FE 8FG 8FH 8FI 8FJ AAFWJ AAJSJ AAKPC AASML ABDBF ABUWG ACGFO ACGFS ACIHN ACIWK ACPRK ACUHS ADBBV ADMLS ADRAZ ADUKV AEAQA AENEX AEUYN AFKRA AFPKN AFRAH AHBYD AHMBA AHSBF AHYZX ALMA_UNASSIGNED_HOLDINGS AMKLP AMTXH AOIJS ARAPS AZQEC BAPOH BAWUL BBNVY BCNDV BENPR BFQNJ BGLVJ BHPHI BMC BPHCQ BVXVI C1A C6C CCPQU CS3 DIK DU5 DWQXO E3Z EAD EAP EAS EBD EBLON EBS EJD EMB EMK EMOBN ESX F5P FYUFA GNUQQ GROUPED_DOAJ GX1 H13 HCIFZ HMCUK HYE IAO ICD IHR INH INR IPNFZ ISR ITC K6V K7- KQ8 LK8 M1P M48 M7P MK~ ML0 M~E O5R O5S OK1 OVT P2P P62 PGMZT PHGZM PHGZT PIMPY PJZUB PPXIY PQGLB PQQKQ PROAC PSQYO PUEGO RBZ RIG RNS ROL RPM RSV SBL SOJ SV3 TR2 TUS UKHRP W2D WOQ WOW XH6 XSB AAYXX AFFHD CITATION ALIPV CGR CUY CVF ECM EIF NPM 3V. 7QO 7SC 7XB 8AL 8FD 8FK FR3 JQ2 K9. L7M L~C L~D M0N P64 PKEHL PQEST PQUKI PRINS Q9U 7X8 5PM |
| ID | FETCH-LOGICAL-c542t-c2948c0610e9f97277e015d855a9086e0cef20bd39708bd4e2154ad127d37c3a3 |
| IEDL.DBID | DOA |
| ISICitedReferencesCount | 24 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000277537900020&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 1471-2105 |
| IngestDate | Fri Oct 03 12:53:09 EDT 2025 Tue Nov 04 02:00:07 EST 2025 Thu Sep 04 18:37:02 EDT 2025 Mon Oct 06 18:40:00 EDT 2025 Thu Apr 03 06:59:42 EDT 2025 Sat Nov 29 05:39:49 EST 2025 Tue Nov 18 21:38:30 EST 2025 Sat Sep 06 07:27:15 EDT 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | Suppl 1 |
| Keywords | Constraint Satisfaction Problem Local Search Method Local Search Constraint Programming Hybrid Approach |
| Language | English |
| License | http://creativecommons.org/licenses/by/2.0 This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c542t-c2948c0610e9f97277e015d855a9086e0cef20bd39708bd4e2154ad127d37c3a3 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 content type line 23 |
| OpenAccessLink | https://doaj.org/article/ebf9f11be20840728e0e20bb314fceff |
| PMID | 20122212 |
| PQID | 901876875 |
| PQPubID | 44065 |
| ParticipantIDs | doaj_primary_oai_doaj_org_article_ebf9f11be20840728e0e20bb314fceff pubmedcentral_primary_oai_pubmedcentral_nih_gov_3009511 proquest_miscellaneous_733131566 proquest_journals_901876875 pubmed_primary_20122212 crossref_citationtrail_10_1186_1471_2105_11_S1_S39 crossref_primary_10_1186_1471_2105_11_S1_S39 springer_journals_10_1186_1471_2105_11_S1_S39 |
| PublicationCentury | 2000 |
| PublicationDate | 20100118 |
| PublicationDateYYYYMMDD | 2010-01-18 |
| PublicationDate_xml | – month: 1 year: 2010 text: 20100118 day: 18 |
| PublicationDecade | 2010 |
| PublicationPlace | London |
| PublicationPlace_xml | – name: London – name: England |
| PublicationTitle | BMC bioinformatics |
| PublicationTitleAbbrev | BMC Bioinformatics |
| PublicationTitleAlternate | BMC Bioinformatics |
| PublicationYear | 2010 |
| Publisher | BioMed Central Springer Nature B.V BMC |
| Publisher_xml | – name: BioMed Central – name: Springer Nature B.V – name: BMC |
| References | S Miyazawa (3989_CR13) 1996; 256 P Crescenzi (3989_CR3) 1998; 5 K Steinhöfel (3989_CR26) 2007 3989_CR20 HJ Böckenhauer (3989_CR6) 2008 BH Park (3989_CR19) 1995; 249 3989_CR28 K Yue (3989_CR9) 1995; 92 P Clote (3989_CR21) 2001 S Kirkpatrick (3989_CR23) 1983; 220 AA Albrecht (3989_CR7) 2008; 32 R Backofen (3989_CR10) 2006; 11 A Dal Palù (3989_CR16) 2004; 5 EHL Aarts (3989_CR25) 1998 L Kapsokalivas (3989_CR8) 2008 KR Apt (3989_CR22) 2003 V Cerny (3989_CR24) 1985; 45 A Dal Palù (3989_CR18) 2007; 37 A Dayem Ullah (3989_CR15) 2009 M Mann (3989_CR12) 2008; 9 M Berrera (3989_CR14) 2003; 4 R Backofen (3989_CR11) 2004; 2 KA Dill (3989_CR2) 1995; 4 N Lesh (3989_CR5) 2003 WE Hart (3989_CR4) 1997; 4 CB Anfinsen (3989_CR1) 1973; 181 A Dal Palù (3989_CR17) 2005 P Schuster (3989_CR27) 2004 9773342 - J Comput Biol. 1998 Fall;5(3):423-65 7613459 - Protein Sci. 1995 Apr;4(4):561-602 18485827 - Comput Biol Chem. 2008 Aug;32(4):248-55 9109034 - J Comput Biol. 1997 Spring;4(1):1-22 15571634 - BMC Bioinformatics. 2004 Nov 30;5:186 4124164 - Science. 1973 Jul 20;181(4096):223-30 7783205 - J Mol Biol. 1995 Jun 2;249(2):493-507 18462492 - BMC Bioinformatics. 2008;9:230 17813860 - Science. 1983 May 13;220(4598):671-80 7816806 - Proc Natl Acad Sci U S A. 1995 Jan 3;92(1):146-50 8604144 - J Mol Biol. 1996 Mar 1;256(3):623-44 12689348 - BMC Bioinformatics. 2003 Feb 28;4:8 |
| References_xml | – volume: 4 start-page: 8 year: 2003 ident: 3989_CR14 publication-title: BMC Bioinformatics doi: 10.1186/1471-2105-4-8 – start-page: 187 volume-title: Handbook of Computational Chemistry and Biology year: 2004 ident: 3989_CR27 – volume: 256 start-page: 623 year: 1996 ident: 3989_CR13 publication-title: Journal of Molecular Biology doi: 10.1006/jmbi.1996.0114 – volume: 92 start-page: 146 year: 1995 ident: 3989_CR9 publication-title: Proc Natural Academy of Sciences USA doi: 10.1073/pnas.92.1.146 – volume: 4 start-page: 1 year: 1997 ident: 3989_CR4 publication-title: Journal of Computational Biology doi: 10.1089/cmb.1997.4.1 – volume-title: Principles of constraint programming year: 2003 ident: 3989_CR22 doi: 10.1017/CBO9780511615320 – start-page: 188 volume-title: ICCB '03: 7th Annual International Conference on Computational Biology year: 2003 ident: 3989_CR5 – volume-title: ISICA '09: 4th International Symposium on Intelligence Computation and Applications year: 2009 ident: 3989_CR15 – volume: 45 start-page: 41 year: 1985 ident: 3989_CR24 publication-title: Journal of Optimization Theory and Applications doi: 10.1007/BF00940812 – volume: 2 start-page: 161 issue: 2 year: 2004 ident: 3989_CR11 publication-title: Journal of Discrete Algorithms doi: 10.1016/S1570-8667(03)00076-5 – volume-title: Local search in combinatorial optimization year: 1998 ident: 3989_CR25 – volume: 249 start-page: 493 issue: 2 year: 1995 ident: 3989_CR19 publication-title: Journal of Molecular Biology doi: 10.1006/jmbi.1995.0311 – volume: 4 start-page: 561 issue: 4 year: 1995 ident: 3989_CR2 publication-title: Protein Science doi: 10.1002/pro.5560040401 – volume: 11 start-page: 5 year: 2006 ident: 3989_CR10 publication-title: Constraints doi: 10.1007/s10601-006-6848-8 – ident: 3989_CR20 – volume: 32 start-page: 248 issue: 4 year: 2008 ident: 3989_CR7 publication-title: Comput Biol Chem doi: 10.1016/j.compbiolchem.2008.03.004 – start-page: 230 volume-title: International Conference on Principles and Practice of Declarative Programming year: 2005 ident: 3989_CR17 – start-page: 381 volume-title: BIRD'07: 1st International Conference on Bioinformatics Research and Development year: 2007 ident: 3989_CR26 doi: 10.1007/978-3-540-71233-6_30 – ident: 3989_CR28 – start-page: 167 volume-title: BIRD'08: 2nd International Conference on Bioinformatics Research and Development year: 2008 ident: 3989_CR8 doi: 10.1007/978-3-540-70600-7_13 – volume: 37 start-page: 1405 year: 2007 ident: 3989_CR18 publication-title: Software-Practice and Experience doi: 10.1002/spe.810 – volume: 220 start-page: 671 year: 1983 ident: 3989_CR23 publication-title: Science doi: 10.1126/science.220.4598.671 – volume: 5 start-page: 423 year: 1998 ident: 3989_CR3 publication-title: Journal of Computational Biology doi: 10.1089/cmb.1998.5.423 – start-page: 369 volume-title: WABI '08: 8th international workshop on Algorithms in Bioinformatics year: 2008 ident: 3989_CR6 doi: 10.1007/978-3-540-87361-7_31 – volume-title: Computational Molecular Biology year: 2001 ident: 3989_CR21 – volume: 9 start-page: 230 year: 2008 ident: 3989_CR12 publication-title: BMC Bioinformatics doi: 10.1186/1471-2105-9-230 – volume: 181 start-page: 223 issue: 96 year: 1973 ident: 3989_CR1 publication-title: Science doi: 10.1126/science.181.4096.223 – volume: 5 start-page: 186 year: 2004 ident: 3989_CR16 publication-title: BMC Bioinformatics doi: 10.1186/1471-2105-5-186 – reference: 9109034 - J Comput Biol. 1997 Spring;4(1):1-22 – reference: 9773342 - J Comput Biol. 1998 Fall;5(3):423-65 – reference: 4124164 - Science. 1973 Jul 20;181(4096):223-30 – reference: 8604144 - J Mol Biol. 1996 Mar 1;256(3):623-44 – reference: 18462492 - BMC Bioinformatics. 2008;9:230 – reference: 7783205 - J Mol Biol. 1995 Jun 2;249(2):493-507 – reference: 18485827 - Comput Biol Chem. 2008 Aug;32(4):248-55 – reference: 7816806 - Proc Natl Acad Sci U S A. 1995 Jan 3;92(1):146-50 – reference: 12689348 - BMC Bioinformatics. 2003 Feb 28;4:8 – reference: 15571634 - BMC Bioinformatics. 2004 Nov 30;5:186 – reference: 17813860 - Science. 1983 May 13;220(4598):671-80 – reference: 7613459 - Protein Sci. 1995 Apr;4(4):561-602 |
| SSID | ssj0017805 |
| Score | 2.1036851 |
| Snippet | Background
The protein folding problem remains one of the most challenging open problems in computational biology. Simplified models in terms of lattice... The protein folding problem remains one of the most challenging open problems in computational biology. Simplified models in terms of lattice structure and... Abstract Background: The protein folding problem remains one of the most challenging open problems in computational biology. Simplified models in terms of... Abstract Background The protein folding problem remains one of the most challenging open problems in computational biology. Simplified models in terms of... |
| SourceID | doaj pubmedcentral proquest pubmed crossref springer |
| SourceType | Open Website Open Access Repository Aggregation Database Index Database Enrichment Source Publisher |
| StartPage | S39 |
| SubjectTerms | Algorithms Amino acids Bioinformatics Biomedical and Life Sciences Computational Biology - methods Computational Biology/Bioinformatics Computer Appl. in Life Sciences Heuristic Life Sciences Microarrays Models, Molecular Protein Conformation Protein Folding Proteins - chemistry Studies Thermodynamics |
| SummonAdditionalLinks | – databaseName: Health & Medical Collection dbid: 7X7 link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1Lb9QwEB5BAakX3o9QQD5wxGqcx8Y-oYKoOKAKqSDtzXL8oCuVpOymlfrvmXGcwALaC1IOu05WsnfG9jeZ8fcBvC6cUK5pDG_y2vNKBMVb5-gUiPCqRTxhfWTX_9ScnMjlUn1OtTmbVFY5rYlxoXa9pXfkh4rU4xaIrt9e_OAkGkXJ1aSgcRNukWo2uXmznOMtQXT9iWhIyMWhwHWYY4RT01GyU7xIIPy3zShy9v8LaP5dL_lH0jTuRcf3_nMU9-FuAqHsaPSaB3DDdw_hzihLef0IzBE7u6aTXGxiHGdDzyKjw6pjYcxXsSRFwybCCWqzhDZJdGJgqfDrOzXTy14Wd002zqzH8PX4w5f3H3mSYuC2roqB20JV0uLen3sVFGKexiOOcLKujcKgyKNJQ5G3DtFNLltXeUQSlXGiaFzZ2NKUT2Cv6zv_DJgsgzAG40jjimpRh5bUf1pra-NsqNQig2KyibaJp5x6fq5jvCIXmgypyZD4VZ_iVaoM3sw_uhhpOnY__o6MPT9KHNuxoV9_02nKat8GFYRofZFLopGTPsePLTpwFXC4IYODycY6TfyNng2cAZvv4oylNIzpfH-50aSSWVLYnMHT0a_mfhSU6EQwkUGz5XFbHd2-063OIil4GcGyyIBPvvmrUzv-iec7B3EA-2O1hOBCvoC9YX3pX8JtezWsNutXcbb9BG6XMts priority: 102 providerName: ProQuest – databaseName: SpringerLINK Contemporary 1997-Present dbid: RSV link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1Lb9QwEB6VAhIXypvQgnzgiEWcxIl9LKgVh6pCWkC9WY4fdCXIot20Uv99Z5wHWh6VQMohsR1pYs_Y32TsbwBeF15o3zSWN7kMvBJR89Z7OgUigm4RT7iQ2PVPmtNTdXamP-6AnM7CpN3uU0gyzdTJrFX9VuA0ytFBkXQSbIFXqW_BbUl0M-SkL77MwQOi6R8Jhv7y4tYilLj6_wQwf98n-UuwNK1Bx3v_Kf0DuD-CTnY4aMlD2AndI7g7pKG8egz2kJ1f0cktNjGMs37FEoPDsmNxiE-xMfUMmwgmqMwRuqQkEz0bN3p9p2L6ucvSKskGS3oCn4-PPr3_wMfUC9zJqui5K3SlHK71edBRI8ZpAuIGr6S0Gp2ggEMYi7z1iGZy1foqIHKorBdF48vGlbZ8CrvdqgvPgakyCmvRb7S-qGoZW8r20zonrXex0nUGxTQWxo285CT5N5P8E1Ub6jtDfYePZoFXqTN4M7_0Y6DluLn5OxrkuSlxaqeC1fqrGU3UhDbqKEQbilwRbZwKOd62qLBVxM-NGexPKmJGQ98YTUkNa3T6MmBzLVoohV1sF1YXG0NZMUtykzN4NujTLEdBgU0EDxk0W5q2Jeh2Tbc8TyTgZQLHIgM-6dtPoW7oiRf_2H4f7g37JQQX6gB2-_VFeAl33GW_3KxfJbu7Bi08Kig priority: 102 providerName: Springer Nature |
| Title | A hybrid approach to protein folding problem integrating constraint programming with local search |
| URI | https://link.springer.com/article/10.1186/1471-2105-11-S1-S39 https://www.ncbi.nlm.nih.gov/pubmed/20122212 https://www.proquest.com/docview/901876875 https://www.proquest.com/docview/733131566 https://pubmed.ncbi.nlm.nih.gov/PMC3009511 https://doaj.org/article/ebf9f11be20840728e0e20bb314fceff |
| Volume | 11 |
| WOSCitedRecordID | wos000277537900020&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: PRVADU databaseName: BioMed Central Open Access Free customDbUrl: eissn: 1471-2105 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0017805 issn: 1471-2105 databaseCode: RBZ dateStart: 20000101 isFulltext: true titleUrlDefault: https://www.biomedcentral.com/search/ providerName: BioMedCentral – providerCode: PRVAON databaseName: 开放获取期刊（Open Access Journals） customDbUrl: eissn: 1471-2105 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0017805 issn: 1471-2105 databaseCode: DOA dateStart: 20000101 isFulltext: true titleUrlDefault: https://www.doaj.org/ providerName: Directory of Open Access Journals – providerCode: PRVHPJ databaseName: ROAD: Directory of Open Access Scholarly Resources customDbUrl: eissn: 1471-2105 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0017805 issn: 1471-2105 databaseCode: M~E dateStart: 20000101 isFulltext: true titleUrlDefault: https://road.issn.org providerName: ISSN International Centre – providerCode: PRVPQU databaseName: Advanced Technologies & Aerospace Database customDbUrl: eissn: 1471-2105 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0017805 issn: 1471-2105 databaseCode: P5Z dateStart: 20090101 isFulltext: true titleUrlDefault: https://search.proquest.com/hightechjournals providerName: ProQuest – providerCode: PRVPQU databaseName: Biological Science Database customDbUrl: eissn: 1471-2105 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0017805 issn: 1471-2105 databaseCode: M7P dateStart: 20090101 isFulltext: true titleUrlDefault: http://search.proquest.com/biologicalscijournals providerName: ProQuest – providerCode: PRVPQU databaseName: Computer Science Database (ProQuest) customDbUrl: eissn: 1471-2105 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0017805 issn: 1471-2105 databaseCode: K7- dateStart: 20090101 isFulltext: true titleUrlDefault: http://search.proquest.com/compscijour providerName: ProQuest – providerCode: PRVPQU databaseName: Health & Medical Collection customDbUrl: eissn: 1471-2105 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0017805 issn: 1471-2105 databaseCode: 7X7 dateStart: 20090101 isFulltext: true titleUrlDefault: https://search.proquest.com/healthcomplete providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest Central customDbUrl: eissn: 1471-2105 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0017805 issn: 1471-2105 databaseCode: BENPR dateStart: 20090101 isFulltext: true titleUrlDefault: https://www.proquest.com/central providerName: ProQuest – providerCode: PRVPQU databaseName: Publicly Available Content Database customDbUrl: eissn: 1471-2105 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0017805 issn: 1471-2105 databaseCode: PIMPY dateStart: 20090101 isFulltext: true titleUrlDefault: http://search.proquest.com/publiccontent providerName: ProQuest – providerCode: PRVAVX databaseName: SpringerLINK Contemporary 1997-Present customDbUrl: eissn: 1471-2105 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0017805 issn: 1471-2105 databaseCode: RSV dateStart: 20001201 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/eLvHCXMwrV1LbxMxEB5BAakXxJulEPnAkVXX-7J9bFErEBCtGkCBi7XrhxoJNlWzReq_Z8b7oAFULkgrK2tvImdmHH-TGX8D8DK1XFkh6lgkhYtz7lXcWEunQLhTDeIJ4wK7_nsxn8vlUlVXSn1RTlhPD9wLbt81XnnOG5cmksi8pEvwZYMfk3vjvKdf30So0Zka4gfE1B_OFQkeo1NTDHxDXJb7Ux-dKFvgRXXCr-xJgbr_b3jzz7TJ32KnYUs6vgd3ByzJDvrvcB9uuPYB3OmrS14-hPqAnV7SgSw2Eoezbs0CMcOqZb4PO7GhogwbeSOozxBopNoRHRvyt75TN_1ny8Lmx_oF8gg-HR99fP0mHioqxKbI0y42qcqlwS08ccorhC7CIRywsihqhb6NQ814FK5FkJLIxuYOAUFeW54KmwmT1dlj2GnXrXsKTGae1zVqpLZpXha-oSI-jTFFbY3PVRlBOspUm4FunGb-TQe3Q5aaFKFJEXirF3hlKoJX05vOeraN6x8_JGVNjxJVduhAA9KDAel_GVAEe6Oq9bB-N1pRrcISfbkI2DSKC4-iKXXr1hcbTcUuM_J-I3jS28U0j5TilYgJIhBbFrM10e2RdnUauL2zgHl5BPFoW78mdY0knv0PSezBbp8bwWMun8NOd37hXsBt86Nbbc5ncFMsRWjlDG4dHs2rk1lYdNi-E_GMsmYrbKviK45Xbz9UX_DuZPH5J8sMMUM |
| linkProvider | Directory of Open Access Journals |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1Jb9NAFH4qKahc2BdTljnADauesR17DgiVpWrUNIrUIpXTYM9CIxW7JC4oP4r_yHveIIBy6wHJB2fsWG_sN2-ZN_N9AM-F4dIkSeYnQWz9iDvp58bQLhBuZY7xhLY1uv44mUzSkxM53YAf3V4YWlbZ2cTaUJtS0xz5jiT2uCFG16_Pv_pEGkXF1Y5Bo9GKA7v8jhnb4tXoHX7eF0LsvT9-u--3pAK-jiNR-VrIKNXoxQIrnUTvnVj0iCaN40xieG9ROCeC3KCfDtLcRBZ9YpQZLhITJjrMQnzuFdiMUNeDAWxOR4fTj33ZgggCWmgjng53OFp-H3OqmDavHeFBlOS_ub-aJeBfoe3fKzT_KNPW3m_v5n_23m7BjTbMZrvNuLgNG7a4A9ca4s3lXch22emS9qqxDlOdVSWrMStmBXNNRY61ZDusg9SgNk3xNNFqVKxd2vaFmmk6m9VxAWt6ew8-XEr_7sOgKAv7EFgaOp5lmClnRkTD2OXEb5RrHWdGu0gOPRCdDijdIrGT5GeqzsjSoSLFUaQ4-FMd4RFKD172fzpvgEjW3_6GlKu_lVDE64Zy_lm1RknZ3EnHeW5FkBJQXmoDPM1xiEYOu-s82O50SrWmbaF6hfKA9VfRJlGhKStsebFQxAMa0sSABw8aPe7lEFTKxXDJg2RFw1cEXb1SzE5r2POwTge4B343Fn4JteZNPFrbiWewtX98OFbj0eRgG643a0O4z9PHMKjmF_YJXNXfqtli_rQd6ww-XfYw-QnwYY9V |
| linkToPdf | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1Zb9QwEB5BOcQL9xHK4QceiRrntB_LsQJRrSoWUN8sx0e7EmSr3RSp_54ZxwlajkpISHlIHFty7Bn7m8z4G4AXueXSNo1Om6xyacm9TFtr6RQId7JFPGFcYNc_aOZzcXQkD2M04WaMdh9dksOZBmJp6vq9U-sHFRf1HsclNUVjpaJTYQu8CnkZrpRoylBU18fFl8mRQJT9kWzoLw23NqTA2_8nsPl7zOQvjtOwH81u_YcvuQ03Ixhl-4P03IFLrrsL14b0lOf3QO-zk3M60cVG5nHWr1hgdlh2zA9-KxZT0rCReILKDKFOSj7RsxgA9o2K6acvC7snGzTsPnyevf30-l0aUzKkpirzPjW5LIVBDJA56SVin8YhnrCiqrRE48jh1Po8ay2inEy0tnSIKEpted7YojGFLh7ATrfq3CNgovBca7Qntc3LuvItZQFqjam0Nb6UdQL5OC_KRL5y6vlXFewWUSsaO0Vjh49qgVchE3g5NTod6Dourv6KJnyqSlzboWC1PlZRdZVrvfScty7PBNHJCZfhbYuCXHr8XJ_A7iguKi4AGyUp2WGNxmACbHqLmkvuGN251dlGUbbMgsznBB4OsjX1IyeHJ4KKBJotqdvq6PabbnkSyMGLAJp5Aukoez87dcFIPP7H-s_h-uGbmTp4P_-wCzeGkAqecvEEdvr1mXsKV833frlZPwvq-ANLKjXw |
| 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+hybrid+approach+to+protein+folding+problem+integrating+constraint+programming+with+local+search&rft.jtitle=BMC+bioinformatics&rft.au=Ullah%2C+Abu+Dayem&rft.au=Steinh%C3%B6fel%2C+Kathleen&rft.date=2010-01-18&rft.eissn=1471-2105&rft.volume=11+Suppl+1&rft.spage=S39&rft_id=info:doi/10.1186%2F1471-2105-11-S1-S39&rft_id=info%3Apmid%2F20122212&rft.externalDocID=20122212 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1471-2105&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1471-2105&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1471-2105&client=summon |