On the applicability of genetic algorithms to protein folding

Ron Unger; John Moult

doi:10.1109/HICSS.1993.270669

On the applicability of genetic algorithms to protein folding

Ron Unger, John Moult

University of Maryland, College Park

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

28 Scopus citations

Abstract

Discusses the protein folding problem and suggests the use of genetic algorithms for protein folding simulations. The issues of protein energy functions, search algorithms, and folding pathways are discussed. The authors review the current approaches to the protein folding problem, point out the limitations of the approaches, and present the genetic algorithm method, which is based on viewing evolution as an optimization process. The schemata theorem is proved in the context of protein structure, showing that during a genetic algorithm search more and more attention will be given to favorable local structures while unfavorable local structures will be rapidly abandoned. It is shown that genetic algorithms are a suitable tool in protein structure predictions. A version of the genetic algorithm is presented that is suitable for protein structure prediction. The behavior of the algorithm is explored in a single model of folding, and it is shown that the algorithm behaves as expected and is able to find the correct conformation.

Original language	English
Title of host publication	Proceedings of the 26th Hawaii International Conference on System Sciences, HICSS 1993
Publisher	IEEE Computer Society
Pages	715-725
Number of pages	11
ISBN (Electronic)	0818632305
DOIs	https://doi.org/10.1109/HICSS.1993.270669
State	Published - 1993
Externally published	Yes
Event	26th Hawaii International Conference on System Sciences, HICSS 1993 - Wailea, United States Duration: 8 Jan 1993 → …

Publication series

Name	Proceedings of the Annual Hawaii International Conference on System Sciences
Volume	1
ISSN (Print)	1530-1605

Conference

Conference	26th Hawaii International Conference on System Sciences, HICSS 1993
Country/Territory	United States
City	Wailea
Period	8/01/93 → …

Bibliographical note

Publisher Copyright:
© 1993 IEEE.

Funding

This work has been supported in part by NIH grant GM41034 to J. M.

Funders	Funder number
National Institutes of Health	GM41034

Access to Document

10.1109/HICSS.1993.270669

Cite this

@inproceedings{6c24f7aad7d04e14a6130f87c2c59afa,

title = "On the applicability of genetic algorithms to protein folding",

abstract = "Discusses the protein folding problem and suggests the use of genetic algorithms for protein folding simulations. The issues of protein energy functions, search algorithms, and folding pathways are discussed. The authors review the current approaches to the protein folding problem, point out the limitations of the approaches, and present the genetic algorithm method, which is based on viewing evolution as an optimization process. The schemata theorem is proved in the context of protein structure, showing that during a genetic algorithm search more and more attention will be given to favorable local structures while unfavorable local structures will be rapidly abandoned. It is shown that genetic algorithms are a suitable tool in protein structure predictions. A version of the genetic algorithm is presented that is suitable for protein structure prediction. The behavior of the algorithm is explored in a single model of folding, and it is shown that the algorithm behaves as expected and is able to find the correct conformation.",

author = "Ron Unger and John Moult",

note = "Publisher Copyright: {\textcopyright} 1993 IEEE.; 26th Hawaii International Conference on System Sciences, HICSS 1993 ; Conference date: 08-01-1993",

year = "1993",

doi = "10.1109/HICSS.1993.270669",

language = "אנגלית",

series = "Proceedings of the Annual Hawaii International Conference on System Sciences",

publisher = "IEEE Computer Society",

pages = "715--725",

booktitle = "Proceedings of the 26th Hawaii International Conference on System Sciences, HICSS 1993",

address = "ארצות הברית",

}

Unger, R & Moult, J 1993, On the applicability of genetic algorithms to protein folding. in Proceedings of the 26th Hawaii International Conference on System Sciences, HICSS 1993., 270669, Proceedings of the Annual Hawaii International Conference on System Sciences, vol. 1, IEEE Computer Society, pp. 715-725, 26th Hawaii International Conference on System Sciences, HICSS 1993, Wailea, United States, 8/01/93. https://doi.org/10.1109/HICSS.1993.270669

On the applicability of genetic algorithms to protein folding. / Unger, Ron; Moult, John.
Proceedings of the 26th Hawaii International Conference on System Sciences, HICSS 1993. IEEE Computer Society, 1993. p. 715-725 270669 (Proceedings of the Annual Hawaii International Conference on System Sciences; Vol. 1).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - On the applicability of genetic algorithms to protein folding

AU - Unger, Ron

AU - Moult, John

PY - 1993

Y1 - 1993

N2 - Discusses the protein folding problem and suggests the use of genetic algorithms for protein folding simulations. The issues of protein energy functions, search algorithms, and folding pathways are discussed. The authors review the current approaches to the protein folding problem, point out the limitations of the approaches, and present the genetic algorithm method, which is based on viewing evolution as an optimization process. The schemata theorem is proved in the context of protein structure, showing that during a genetic algorithm search more and more attention will be given to favorable local structures while unfavorable local structures will be rapidly abandoned. It is shown that genetic algorithms are a suitable tool in protein structure predictions. A version of the genetic algorithm is presented that is suitable for protein structure prediction. The behavior of the algorithm is explored in a single model of folding, and it is shown that the algorithm behaves as expected and is able to find the correct conformation.

AB - Discusses the protein folding problem and suggests the use of genetic algorithms for protein folding simulations. The issues of protein energy functions, search algorithms, and folding pathways are discussed. The authors review the current approaches to the protein folding problem, point out the limitations of the approaches, and present the genetic algorithm method, which is based on viewing evolution as an optimization process. The schemata theorem is proved in the context of protein structure, showing that during a genetic algorithm search more and more attention will be given to favorable local structures while unfavorable local structures will be rapidly abandoned. It is shown that genetic algorithms are a suitable tool in protein structure predictions. A version of the genetic algorithm is presented that is suitable for protein structure prediction. The behavior of the algorithm is explored in a single model of folding, and it is shown that the algorithm behaves as expected and is able to find the correct conformation.

UR - http://www.scopus.com/inward/record.url?scp=85063472174&partnerID=8YFLogxK

U2 - 10.1109/HICSS.1993.270669

DO - 10.1109/HICSS.1993.270669

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:85063472174

T3 - Proceedings of the Annual Hawaii International Conference on System Sciences

SP - 715

EP - 725

BT - Proceedings of the 26th Hawaii International Conference on System Sciences, HICSS 1993

PB - IEEE Computer Society

T2 - 26th Hawaii International Conference on System Sciences, HICSS 1993

Y2 - 8 January 1993

ER -

On the applicability of genetic algorithms to protein folding

Abstract

Publication series

Conference

Bibliographical note

Funding

Access to Document

Other files and links

Fingerprint

Cite this