Cargando…
Combinatorial Pattern Discovery Approach for the Folding Trajectory Analysis of a β-Hairpin
The study of protein folding mechanisms continues to be one of the most challenging problems in computational biology. Currently, the protein folding mechanism is often characterized by calculating the free energy landscape versus various reaction coordinates, such as the fraction of native contacts...
Autores principales: | , |
---|---|
Formato: | Texto |
Lenguaje: | English |
Publicado: |
Public Library of Science
2005
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC1183514/ https://www.ncbi.nlm.nih.gov/pubmed/16103909 http://dx.doi.org/10.1371/journal.pcbi.0010008 |
_version_ | 1782124703072124928 |
---|---|
author | Parida, Laxmi Zhou, Ruhong |
author_facet | Parida, Laxmi Zhou, Ruhong |
author_sort | Parida, Laxmi |
collection | PubMed |
description | The study of protein folding mechanisms continues to be one of the most challenging problems in computational biology. Currently, the protein folding mechanism is often characterized by calculating the free energy landscape versus various reaction coordinates, such as the fraction of native contacts, the radius of gyration, RMSD from the native structure, and so on. In this paper, we present a combinatorial pattern discovery approach toward understanding the global state changes during the folding process. This is a first step toward an unsupervised (and perhaps eventually automated) approach toward identification of global states. The approach is based on computing biclusters (or patterned clusters)—each cluster is a combination of various reaction coordinates, and its signature pattern facilitates the computation of the Z-score for the cluster. For this discovery process, we present an algorithm of time complexity c∈RO((N + nm) log n), where N is the size of the output patterns and (n × m) is the size of the input with n time frames and m reaction coordinates. To date, this is the best time complexity for this problem. We next apply this to a β-hairpin folding trajectory and demonstrate that this approach extracts crucial information about protein folding intermediate states and mechanism. We make three observations about the approach: (1) The method recovers states previously obtained by visually analyzing free energy surfaces. (2) It also succeeds in extracting meaningful patterns and structures that had been overlooked in previous works, which provides a better understanding of the folding mechanism of the β-hairpin. These new patterns also interconnect various states in existing free energy surfaces versus different reaction coordinates. (3) The approach does not require calculating the free energy values, yet it offers an analysis comparable to, and sometimes better than, the methods that use free energy landscapes, thus validating the choice of reaction coordinates. (An abstract version of this work was presented at the 2005 Asia Pacific Bioinformatics Conference [1].) |
format | Text |
id | pubmed-1183514 |
institution | National Center for Biotechnology Information |
language | English |
publishDate | 2005 |
publisher | Public Library of Science |
record_format | MEDLINE/PubMed |
spelling | pubmed-11835142005-08-12 Combinatorial Pattern Discovery Approach for the Folding Trajectory Analysis of a β-Hairpin Parida, Laxmi Zhou, Ruhong PLoS Comput Biol Research Article The study of protein folding mechanisms continues to be one of the most challenging problems in computational biology. Currently, the protein folding mechanism is often characterized by calculating the free energy landscape versus various reaction coordinates, such as the fraction of native contacts, the radius of gyration, RMSD from the native structure, and so on. In this paper, we present a combinatorial pattern discovery approach toward understanding the global state changes during the folding process. This is a first step toward an unsupervised (and perhaps eventually automated) approach toward identification of global states. The approach is based on computing biclusters (or patterned clusters)—each cluster is a combination of various reaction coordinates, and its signature pattern facilitates the computation of the Z-score for the cluster. For this discovery process, we present an algorithm of time complexity c∈RO((N + nm) log n), where N is the size of the output patterns and (n × m) is the size of the input with n time frames and m reaction coordinates. To date, this is the best time complexity for this problem. We next apply this to a β-hairpin folding trajectory and demonstrate that this approach extracts crucial information about protein folding intermediate states and mechanism. We make three observations about the approach: (1) The method recovers states previously obtained by visually analyzing free energy surfaces. (2) It also succeeds in extracting meaningful patterns and structures that had been overlooked in previous works, which provides a better understanding of the folding mechanism of the β-hairpin. These new patterns also interconnect various states in existing free energy surfaces versus different reaction coordinates. (3) The approach does not require calculating the free energy values, yet it offers an analysis comparable to, and sometimes better than, the methods that use free energy landscapes, thus validating the choice of reaction coordinates. (An abstract version of this work was presented at the 2005 Asia Pacific Bioinformatics Conference [1].) Public Library of Science 2005-06 2005-06-24 /pmc/articles/PMC1183514/ /pubmed/16103909 http://dx.doi.org/10.1371/journal.pcbi.0010008 Text en Copyright: © 2005 Parida and Zhou. http://creativecommons.org/licenses/by/4.0/ This is an open-access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are properly credited. |
spellingShingle | Research Article Parida, Laxmi Zhou, Ruhong Combinatorial Pattern Discovery Approach for the Folding Trajectory Analysis of a β-Hairpin |
title | Combinatorial Pattern Discovery Approach for the Folding Trajectory Analysis of a β-Hairpin |
title_full | Combinatorial Pattern Discovery Approach for the Folding Trajectory Analysis of a β-Hairpin |
title_fullStr | Combinatorial Pattern Discovery Approach for the Folding Trajectory Analysis of a β-Hairpin |
title_full_unstemmed | Combinatorial Pattern Discovery Approach for the Folding Trajectory Analysis of a β-Hairpin |
title_short | Combinatorial Pattern Discovery Approach for the Folding Trajectory Analysis of a β-Hairpin |
title_sort | combinatorial pattern discovery approach for the folding trajectory analysis of a β-hairpin |
topic | Research Article |
url | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC1183514/ https://www.ncbi.nlm.nih.gov/pubmed/16103909 http://dx.doi.org/10.1371/journal.pcbi.0010008 |
work_keys_str_mv | AT paridalaxmi combinatorialpatterndiscoveryapproachforthefoldingtrajectoryanalysisofabhairpin AT zhouruhong combinatorialpatterndiscoveryapproachforthefoldingtrajectoryanalysisofabhairpin |