1 resultado para Amino acids in nutrition
em Bulgarian Digital Mathematics Library at IMI-BAS
Filtro por publicador
- Aberdeen University (1)
- Abertay Research Collections - Abertay University’s repository (1)
- Acceda, el repositorio institucional de la Universidad de Las Palmas de Gran Canaria. España (2)
- AMS Tesi di Dottorato - Alm@DL - Università di Bologna (3)
- Aquatic Commons (14)
- ArchiMeD - Elektronische Publikationen der Universität Mainz - Alemanha (11)
- Archimer: Archive de l'Institut francais de recherche pour l'exploitation de la mer (1)
- Archive of European Integration (1)
- Archivo Digital para la Docencia y la Investigación - Repositorio Institucional de la Universidad del País Vasco (2)
- Aston University Research Archive (25)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (19)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (BDPI/USP) (19)
- Biblioteca Digital de Teses e Dissertações Eletrônicas da UERJ (1)
- Bioline International (2)
- BORIS: Bern Open Repository and Information System - Berna - Suiça (49)
- Brock University, Canada (5)
- Bucknell University Digital Commons - Pensilvania - USA (1)
- Bulgarian Digital Mathematics Library at IMI-BAS (1)
- CaltechTHESIS (11)
- CentAUR: Central Archive University of Reading - UK (72)
- Chinese Academy of Sciences Institutional Repositories Grid Portal (59)
- Cochin University of Science & Technology (CUSAT), India (2)
- Coffee Science - Universidade Federal de Lavras (1)
- CORA - Cork Open Research Archive - University College Cork - Ireland (3)
- Digital Commons - Michigan Tech (3)
- Digital Commons at Florida International University (2)
- DigitalCommons - The University of Maine Research (1)
- DigitalCommons@The Texas Medical Center (8)
- Duke University (2)
- eResearch Archive - Queensland Department of Agriculture; Fisheries and Forestry (4)
- Greenwich Academic Literature Archive - UK (3)
- Helda - Digital Repository of University of Helsinki (10)
- Illinois Digital Environment for Access to Learning and Scholarship Repository (2)
- Indian Institute of Science - Bangalore - Índia (93)
- Instituto Gulbenkian de Ciência (1)
- Instituto Politécnico de Bragança (3)
- Instituto Politécnico do Porto, Portugal (1)
- National Center for Biotechnology Information - NCBI (77)
- Plymouth Marine Science Electronic Archive (PlyMSEA) (15)
- Publishing Network for Geoscientific & Environmental Data (144)
- QUB Research Portal - Research Directory and Institutional Repository for Queen's University Belfast (32)
- Queensland University of Technology - ePrints Archive (34)
- Repositorio Academico Digital UANL (1)
- Repositório Alice (Acesso Livre à Informação Científica da Embrapa / Repository Open Access to Scientific Information from Embrapa) (1)
- Repositório Digital da UNIVERSIDADE DA MADEIRA - Portugal (2)
- Repositorio Institucional da UFLA (RIUFLA) (2)
- Repositório Institucional da Universidade de Aveiro - Portugal (2)
- Repositorio Institucional de la Universidad de Málaga (1)
- Repositório Institucional UNESP - Universidade Estadual Paulista "Julio de Mesquita Filho" (85)
- SAPIENTIA - Universidade do Algarve - Portugal (2)
- Universidad de Alicante (4)
- Universidad del Rosario, Colombia (2)
- Universidad Politécnica de Madrid (5)
- Universidade Estadual Paulista "Júlio de Mesquita Filho" (UNESP) (1)
- Universitat de Girona, Spain (1)
- Universitätsbibliothek Kassel, Universität Kassel, Germany (1)
- Université de Lausanne, Switzerland (3)
- Université de Montréal (1)
- Université de Montréal, Canada (10)
- University of Canberra Research Repository - Australia (1)
- University of Michigan (10)
- University of Queensland eSpace - Australia (34)
- WestminsterResearch - UK (1)
Resumo:
One of the most widely studied protein structure prediction models is the hydrophobic-hydrophilic (HP) model, which explains the hydrophobic interaction and tries to maximize the number of contacts among hydrophobic amino-acids. In order to find a lower bound for the number of contacts, a number of heuristics have been proposed, but finding the optimal solution is still a challenge. In this research, we focus on creating a new integer programming model which is capable to provide tractable input for mixed-integer programming solvers, is general enough and allows relaxation with provable good upper bounds. Computational experiments using benchmark problems show that our formulation achieves these goals.