Protein folding analysis using features obtained by persistent homology
Takashi Ichinomiya, Ippei Obayashi, and Yasuaki Hiraoka

TL;DR
This paper introduces a novel application of persistent homology to analyze protein folding dynamics, successfully identifying key states and transitions in molecular simulations.
Contribution
The study develops a new topological analysis method using persistent homology for characterizing protein structures from molecular dynamics data.
Findings
Identified native, misfolded, and transition states in protein folding.
Revealed an unfolded state with slow dynamics.
Demonstrated the method's potential as a tool for understanding protein folding.
Abstract
Understanding the protein folding process is an outstanding issue in biophysics; recent developments in molecular dynamics simulation have provided insights into this phenomenon. However, the large freedom of atomic motion hinders the understanding of this process. In this study, we applied persistent homology, an emerging methods to analyze topological features in a dataset, to reveal protein folding dynamics. We developed a new method to characterize protein structure based on persistent homology and applied this method to molecular dynamics simulations of chignolin. Using principle component analysis or non-negative matrix factorization, our analysis method revealed two stable states and one saddle state, corresponding to the native, misfolded, and transition states, respectively. We also identified an unfolded state with slow dynamics in the reduced space. Our method serves as a…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
\corrauthor
Protein folding analysis using features obtained by persistent homology
Takashi Ichinomiya
Gifu University School of Medicine, Yangido 1-1, Gifu, 501-1194, Gifu, Japan
The United Graduate School of Drug Discovery and Medical Information Sciences of Gifu University, Yanagido 1-1, Gifu, 501-1194, Gifu, Japan
Ippei Obayashi
Center for Advanced Intelligence Project, RIKEN, Nihonbashi 1-chome Mitsui Building, 15th floor,1-4-1 Nihonbashi, Chuo-ku, Tokyo 103-0027, Japan
Yasuaki Hiraoka
WPI-ASHBi, Kyoto University Institute for Advanced Study, Kyoto University, Yoshida Ushinomiya-cho, Sakyo-ku, Kyoto 606-8501, Japan
Center for Advanced Intelligence Project, RIKEN, Nihonbashi 1-chome Mitsui Building, 15th floor,1-4-1 Nihonbashi, Chuo-ku, Tokyo 103-0027, Japan
Abstract
Understanding the protein folding process is an outstanding issue in biophysics; recent developments in molecular dynamics simulation have provided insights into this phenomenon. However, the large freedom of atomic motion hinders the understanding of this process. In this study, we applied persistent homology, an emerging methods to analyze topological features in a dataset, to reveal protein folding dynamics. We developed a new method to characterize protein structure based on persistent homology and applied this method to molecular dynamics simulations of chignolin. Using principle component analysis or non-negative matrix factorization, our analysis method revealed two stable states and one saddle state, corresponding to the native, misfolded, and transition states, respectively. We also identified an unfolded state with slow dynamics in the reduced space. Our method serves as a promising tool to understand the protein folding process.
{sigstatement}
To understand the protein folding process, protein forms must be presented in a comprehensible way. In this paper, we propose a method to represent the internal protein configuration using persistent homology, an emerging data analysis technique based on topology. Using this method, we simplified the complex dynamics of chignolin and identified two metastable and transition states as fixed points. Our method is applicable to other macromolecules and will help to understand the functions and dynamics of biomolecules such as proteins and DNA.
1 Introduction
Since the proposal of Levinthal’s paradox in 1968, the folding of biomolecules, including proteins, has attracted the interest of numerous scientists(Levinthal1968AreFolding). Molecular dynamic (MD) simulations have contributed to the understanding of the folding mechanisms(Lane2013). However, the atoms in the MD simulations have a large degree of freedom, and the essential folding dynamics must be extracted to comprehend the protein dynamics. Therefore, several methods have been proposed, such as principal component analysis(PCA)(Kitao1991TheVacuum), relaxation mode analysis(RMA)(doi:10.1063/1.4931813), time structure-based independent component analysis(tICA)(doi:10.1063/1.3554380, Schwantes2016), and manifold-learning(Fujisaki2018).
Previous studies attempted to identify the essential motion related to the large deformation that leads to protein folding. However, the definition of "large deformation" is ambiguous. For example, when a protein unfolds into nearly a straight line, a small bend at the center of the molecule will cause a large dislocation of the atoms at the end of the chain. In this case, the deformation in a Ramachandran plot(Ramachandran1968) is small, but large in atom Cartegian coordinates. Moreover, the importance of deformations also depends on the protein structure. For example, in a small protein that has only one -sheet, a small change in the bond angle at the hairpin of the molecule may disrupt the -sheet structure. Thus, this small change in the angle results in a "large deformation". Alternatively, if this protein is completely unfolded, then a slight change in the hairpin region bond angle does not cause a "large deformation". These examples show the difficulties in defining a "large deformation" in a protein.
We propose using topological data analysis(TDA) to characterize the structure and deformation of a protein. Using TDA, we investigated the topological signatures such as loops or vacancies, embedded in a dataset. This approach yields successful results in many fields, including RNA hairpin folding analysis(doi:10.1063/1.3103496) or gene regulation networks(Nicolau2011). TDA has several advantages compared with standard protein structure analysis tools, such as Ramachandran plots, distance matrices, and the atomic cartesian coordinates. First, TDA captures changes in the global structure, whereas other methods, such as Ramachandran plots only consider local properties, such as bond angles. In contrast, "loops" or "vacancies" are formed by several atoms. Thus, TDA captures the non-local structure. Second, topological changes strongly depend on the atom conformation. For example, if a protein forms a straight chain, then there are no loops. If a small bend occurs at the center of this chain, then the atoms at the end of the chain exhibit large dislocations; however, loops do not form. Alternatively, a small change in the bond angle at the hairpin of a -sheet can break the loops formed by the atoms in the -sheet. Finally, TDA provides intuitive insights into protein dynamics. For example, loop emergence and disappearance are more clearly visualized using TDA than using the coordinated atomic motion.
Here we applied persistent homology (PH) analysis (Edelsbrunner2002) for TDA. PH is based on algebraic topology, and has been applied to many problems in physics, chemistry, biology, and medicine(Xia2014, Xia2015MultidimensionalData, Carlsson2014, Hiraoka2016, Ichinomiya2017). Although PH is a highly effective tool for the analysis of non-local structures, it has several inherent limitations. First, PH results are sometimes difficult to interpret. In the original PH analysis, we obtain two values called "birth" and "death" for each loop or cavity, and make decisions based on the distribution of these values. Frequently, these two values are insufficient to understand the physical relevance provided by PH. For example, consider the folding of a protein which has two -helices. If the birth and death values obtained from these -helices are nearly identical, it is difficult to distinguish which -helix is created first in the folding process. Recently, Escolar et al. developed a method to calculate "volume optimal cycles," which enables identification of the atoms that form loops or cavities(Escolar2016, Obayashi2018). This method is useful to explain PH results and has revealed hidden structures in glass and amorphous polymers(Hiraoka2016, Ichinomiya2017). Another difficulty of PH lies in the fluctuation in the loop number. Even if the number of atoms is constant, the number of loops obtained by PH depends on the configuration of the atoms. However, standard machine-learning techniques, such as PCA or k-means clustering, require that all the input data have the same dimension. These machine-learning techniques were avoided in previous studies using PH to analyze biomolecular structures(Xia2014, Xia2015MultidimensionalData). To overcome this difficulty, several methods such as persistent diagram vectorization(Kimura2018), kernel methods(Kusano2016), and persistent landscapes(Bubenik2014) have been proposed.
In this paper, we propose a new technique to apply machine learning to PH analysis. The key concept is to construct a "topological feature vector"(TFV) using volume optimal cycles. In this approach, we considered the volume optimal cycles as the "text" that describes the protein structure. Each volume optimal cycle is a collection of simplices (edges or faces), similar to a text being a collection of words. This concept enables the use of text-mining techniques. Next, we applied PCA and non-negative matrix factorization (NMF) to reduce the TFVs obtained from MD simulations of chignolin. Finally, we compared the result with analyses based on atom-position and contact mapping. A previous study showed that chignolin has native, misfolded, unfolded, and intermediate structures (doi:10.1063/1.4931813, Fujisaki2018). Therefore, we performed a full atomic MD simulation of chignolin in aqueous solution, and analyzed the result using TFV. We observed that NMF of TFV provides essential information on protein structure and dynamics. Additionally, we found that the dynamics in the reduced space yielded two stable- and one saddle-fixed points, which correspond to native, misfolded, and transition states, respectively. The unfolded state did not corresponds to a fixed point. However, the dynamics in the unfolded state were extremely slow.
The remainder of the paper is structured as follows: In Sec. 2, we describe the PH method, TFV construction, and dimension reduction by NMF. We also describe the details of the chignolin MD simulation. In Sec. 3, we present the analysis results and compare them with analysis based on cartesian coordinates and contact mapping. PH provides an intuitive description of the folded, misfolded, transition, and unfolded states. The challenges to overcome, as well as the future direction are discussed in Sec. 4.
2 Method
Our analysis process is composed of three procedures. First, we performed PH analysis and identified all loops with their volume optimal cycles. Second, we constructed a "TFV", which stores the edge contributions to the volume optimal cycles formation are stored. Third, we reduce the dataset dimensionality using PCA or NMF. We explain each step in the following sections. The dataset and scripts we used are uploaded on Open Science Framework (https://osf.io/hsp5w).
2.1 Persistent homology with volume optimal cycles
The general mathematical definition of PH is described in terms of the filtration of simplicial complexes(Edelsbrunner2002) or quiver representation(Zomorodian2005). In this section, we explain the degree 1 PH of an complex composed of a point cloud, which was used to analyze protein folding.
Consider there are atoms at in a three-dimensional space (Fig. 1). The PH of the -complexes can be regarded as a topological structure when we place a ball of radius at . If , all the balls are disconnected (Fig. 1(a)). As we increase , the balls coalesce, and a loop emerges at (Fig. 1(b)). We call the "birth" of this loop, and the three edges, , , and , surround this loop. This loop shrinks as increases, and at , the loop is fulfilled and disappears (Fig. 1(c)). We call the "death" of this loop. In this case, the edges that surround the loop are unique, however, not always uniquely determined. For example, in the case of Fig. 1(d), the loop that emerged at is surrounded by 5 edges, , and , as depicted by solid line. However, we can take another set of edges that surround this loop: , and , depicted as dashed lines. To avoid the ambiguity when defining the set of edges that surround the loop, the volume optimal cycle is defined as the loop that has minimum number of triangles inside. In our example, the first loop has 5 edges, and can be divided into 3 triangles: , , and . Of course, there are many other ways to decompose this loop into triangles, however, the number of triangles is uniquely determined. The second loop consists of 6 edges, and 4 triangles are needed to construct this loop. Therefore, we choose the first loop structure as the "volume optimal cycle."
We frequently designate loops that emerge in PH as "generators". From one atomic conformation, we obtain several generators. In PH, the generator birth and death distributions give important insights into the dataset structure. To visualize this distribution, we use the scatter plot of births and deaths, which is called a persistence diagram. Another visualization method is persistent barcodes, in which horizontal lines represent generator births and deaths. We will present several barcode plots in Sec.3.
As we have mentioned in Sec. 1, the number of generators strongly depends on the atom configuration. Even if the number of atoms is the same, the number of generators can differ. This fact makes it difficult to combine machine-learning techniques with PH. We attempted to overcome this challenge by introducing a "TFV" composed of the volume optimal cycles (see below). The calculation of births, deaths, and volume optimal cycles was performed by HomCloud ver.1.2.1(Homcloud).
PH is strongly related to Betti numbers, which are topological invariants in mathematics. In topology, the -th Betti number is defined as the rank of -th homology groups. In our case, , it is the number of "loops." Therefore, if we put balls with radius at , the first Betti number of this set is the number of generators whose births and deathes are smaller and larger than , respectively.
Before concluding this subsection, we discuss the use of higher-degree PH. In homology, "degree" is the dimension of "boundaries," and the PH with degree 2 is used to investigate the vacancies surrounded by triangles. Degree 2 PH often plays an important role in material science as it provides information on the voids. However, Xia and Wei found that PH with degree 2 gives little information on protein structure(Xia2014). Further, they revealed that both -helices and -sheets give provide voids when analyzing Cα atoms as a point cloud. The native chignolin structure contains only one -sheet and no tertiary structure. Thus, we choose to ignore higher-degree PH in this study.
2.2 Construction of topological feature vector (TFV)
Using the loop information, we defined a "TFV," , which describes the point cloud topology. First, for each edge , we listed the generators , whose volume optimal cycles include . We then calculated the "importance" of the edge as the sum of the deaths of . If an edge was not included in any volume optimal cycles, we set the edge "importance" as 0 (Fig.2). By this method, we obtained the TFV, whose dimension is .
Feature vector construction was similar to a "bag-of-words" and "term frequency-inverse document frequency," which are standard methods used in natural language processing(manning2010introduction). These methods regard a document as a multiset of terms and calculate the "importance" for each term. In our approach, edges were defined as the terms that describe the protein shape.
There are several possible methods to construct a TFV from the volume optimal cycles. For example, we could create another TFV using births instead of deaths. Lifetime, the difference between death and birth, is also often used as an important PH variable. In this study, we examined the results of birth-based and death-based TFV. These qualitatively yielded the same result. Alternatively, we could use the products of deaths instead of sums of deaths. In this study, we used the sum of deaths for simplicity. Indeed, there may be more a complex and sophisticated definition of the TFV (See Sec. 4).
2.3 Dimension reduction by non-negative matrix factorization
The dimensions of a TFV are generally high, making dimension reduction using PCA or another method useful. We primarily employed NMF to reduce the dimensionality of TFV(Lee1999). We assumed that the -dimensional TFV at time are , where , where represents the transverse of the matrix, respectively. In NMF, we attempted to reduce the system into -dimensional space, under the assumption that both coefficients and bases are non-negative. We calculated non-negative matrix and a non-negative matrix that minimized , where represents the Frobenius norm. Using this method, we can approximated , where are the bases of the reduced space.
Compared with PCA, NMF has several advantages. First, when we reconstructed TFVs from the information in reduced spaces, NMF consistently generated non-negative vectors. Both NMF and PCA attempt to approximate the feature vector by the linear combination of several bases vectors : . In NMF, we set and to be non-negative, and approximated was also non-negative. Conversely, certain components in can be negative in PCA. When is defined as non-negative vectors, understanding large negative components in is difficult. Another advantage of NMF is that the bases can capture important local features. Though there is no theoretical explanation, the application of NMF to face-recognition problems shows that NMF can extract localized characteristics such as noses or eyes, while PCA captures non-local structures (Lee1999). In the case of protein folding analysis, the ability of NMF to capture local structure is desirable. For example, we considered the folding of proteins with several secondary helices and sheet structures. In this case, it is natural to assume that the secondary structure formation does not occur simultaneously. In NMF, we expected several bases to represent secondary structures. However, if we used PCA for decomposition, each basis represents the complex structural change, such as the disappearance of several helices and appearance of several sheets. Therefore, we need further investigation to understand the formation of these structures.
Though useful, NMF has several disadvantages. First, the NMF decomposition is not unique. Suppose that and are non-negative matrices. If both and are non-negative matrices, then and are non-negative, and we obtain another decomposition . In practice, when the feature matrix is sparse and we initialize and by a non-negative double singular value decomposition, then optimization with a coordinate descent solver generally yields small residue with low computational costs(Boutsidis2008). This method is deterministic and free from the problem caused by non-uniqueness of NMF decomposition. Since our feature vector is sparse, we applied this initialization and optimization method. NMF also has the ambiguity of "scales." We can "rescale" the basis ; and where ’s are positive constants, which provides another decomposition. Here, we scaled s so that . Thus, can be assumed as a dimensionless vector, and has the same dimension as births and deaths.
Another disadvantage of NMF is the need to determine the rank of reduced space a priori. Though there is no de facto standard to estimate rank , several methods are proposed (Brunet2004, Hutchins2008). In our study, we used the method proposed by Hutchins et al.(Hutchins2008) who showed that if the dataset is random, the residual sums of squares (RSS) between and decreases linearly with rank , and proposed to use at the inflection point. We performed these calculations using scikit-learn 0.19.1 and NMF 0.21.0(scikit-learn, Gaujoux2010).
2.4 Chignolin molecular dynamics simulation
Using the method described in Mitsutake and Takano(doi:10.1063/1.4931813), we conducted MD simulations of aqueous chignolin near a transition temperature. We placed one chignolin molecule, 2 Na*+* atoms, and 3674 H2O molecules in a cube and set the temperature and pressure at 450K and 1 atm, respectively. After energy minimization and equilibration for 50–ns, we performed a 1s NPT-constant MD simulation. We captured snapshots of the molecules every 10 ps to create 100,000 samples. In this simulation, we used the ff99SB force field and TIP3P models for the water molecules. From each snapshot, we obtained the coordinates of ten Cα atoms in chignolin and performed the PH analysis. The simulation was conducted using GROMACS 16.4(Berendsen1995).
3 Result
In this study, we performed PH analysis of a point cloud composed of ten Cα-atoms. We calculated the TFVs from snapshots of chignolin and reduced the configuration into low dimensional spaces by PCA and NMF.
3.1 Analysis using TFV
To carry out NMF analysis, we first determined the rank of reduced space. To determine the rank, we calculated RSS to determine the rank of reduced space . To reduce the computational cost, we randomly selected 1,000 samples from our dataset, and carried out NMF for . The obtained RSS is shown in Fig. 3. In Fig. 3(a), when we used births to construct the TFV, the RSS rapidly decreased as increased from 1 to 3, and slowly decreased for . This result indicates that or 3 are the best reduced space ranks. When we used deaths to construct the TFV, the RSS shown in Fig. 3(b) was obtained, again suggesting that or 3 is the best rank of reduced space.
To investigate the effect caused by changing , we compared the results obtained by TFVs constructed from births and deaths for , 3 and 4. Fig. 4 represents the dynamics in the reduced space for to 100ns. In this figure, at time represents the value of , where is the TFV index obtained from the snapshot at time . Fig. 4(a) shows the dynamics when and births were used to construct the TFV. Clearly, there are two phases: the first shows that while Å; the other shows that Åwhile Å. We also noted that short periods occur where both . Therefore, it seems that there are two or three phases. This result is not modified when deaths are used instead of births to define TFV, as shown in Fig. 4(b). The correlation between in Fig. 4(a) and (b) was 0.9967, and the correlation between was 0.9968. Fig. 4(c) and 4(d) show the plots when . When we compared Fig. 4(a) and 4(c), we found that at the second phase in Fig.4(a) where and , in Fig. 4(c) is large: while . Additionally, when in Fig. 4(a), in Fig. 4(c), while no clear difference was observed between and . Third, when in Fig. 4(a), while in Fig. 4(c). However, the third observation seems controversial, due to the short phase duration. From these observations, we found no additional stable phase by increasing the rank from 2 to 3. However, the analysis for may be useful to understand the details of the phase where both and are small in Fig.4(a). These observations are not modified when we set rank , shown in Fig. 4(e) and 4(f). Thus, we used rank and deaths to construct TFVs.
Fig. 5(a) shows the TFV distribution in the reduced space by NMF, . We observed two large peaks at and , which we designated, region A and B, respectively. The density was high along the straight line connecting these peaks, with the minimum at . We also noted that the density in the area around was high. This result is consistent with the results obtained by PCA of TFVs shown in Fig. 5(b). Here, we clearly identified two clusters, which are distinguished by 1st principal components. The correlation between 1st principle component and are 0.941 and -0.927 respectively. Therefore, the right and left clusters in Fig. 5(b) correspond to clusters at region A and B in Fig. 5(a), respectively. Though NMF and PCA gave qualitatively similar results, we only discuss the results of NMF in the following sections of this paper as they more clearly reveal protein structures; whereaas PCA indicated only the "difference" of these two clusters. As described in the Sec.2, we found negative components when we reconstructed the TFV from PCA, which exacerbates the difficulty in understanding the protein structure. The NMF result in Fig.5(a) indicates that the peaks of clusters are nearly on the and axes, respectively. Thus, we can infer the "typical" chignolin TFVs in each cluster by checking and directly.
To investigate the structures at the two density peaks, we examined the bases and obtained by NMF, as shown in Fig. 6. Chignolin has ten Cα atoms and the TFV dimension is 45, which is the number of Cα atom pairs. In the top panel of this figure, we plotted the value of each component in and . Darker squares represent that the corresponding edge component is large. We omitted the component in the lower left triangle. For example, in the case of , the color at the second row-ninth column is dark, which implies that the component of that corresponds to the Tyr2–Trp9 pair is large. From this figure, when the protein was in region A in Fig.5(a), the edge between Tyr2 and Trp9 made a large contribution to loop formation, since the corresponding feature vector was well approximated by . In the bottom panel of this figure, edges with corresponding components in larger than 0.2 are indicated by blue lines. We note that ’s are dimensionless, as discussed in Sec. 2.
From this figure, we noted that the adjacent amino acid pairs, such as Gly1–Tyr2 or Asp3–Pro4, made a large contribution to the cycle formation. This is natural since the distances between adjacent amino acids are short, due to chemical bonding. There was a large difference between and on the components corresponding to Tyr2–Trp9, Tyr2–Thr8, and Pro4–Gly7. In particular, the components corresponding to Tyr2–Trp9 and Tyr2–Thr8 showed clear differences; , while that of . while . Therefore, becomes large if there is a loop whose volume optimal cycle includes Tyr2–Trp9, and becomes large when a loop forms whose volume optimal cycle includes Tyr2–Thr8. These results are depicted in the bottom panel of this figure. To determine which state corresponds to the native structure, prior knowledge on the native state is needed. When we applied PH to the native structure, we found that Tyr2–Trp9 was dominant in the native state. The TFV component for Tyr2–Trp9 was 1.249, while that for Tyr2–Thr8 was 0.130. Therefore, we conclude that the cluster at region A in Fig. 5(a) corresponds to the native state, whereas the cluster at region B corresponds to the misfolded state. Concerning the state around , we noted that a small and implies that there are no loops. Since the feature vectors were approximated as , suggests that . Therefore, we hypothesized that the state with a small is unfolded.
This hypothesis was supported by the molecule snapshots. In Fig. 7, we plotted examples of the chignolin configuration in the native, misfolded, and unfolded structures. This figure presents results consistent with our hypotheses. Figs.7(d)–7(f) show the distance between amino acids in each state. In this plot, we calculated the distance between Cα atoms and inferred that this was the "distance" between corresponding amino acids. In the folded state, the distance between Tyr2–Trp9 is small, while the distance between Tyr2–Thr8 is small in misfolded states. We also noted that both the distances between Tyr2–Trp9 and Tyr2–Thr8 are small enough to assume these amino acids are "contacted," as discussed in the next subsection. In the unfolded state, the distance map shown in Fig.7(f) has no clear structure.
Finally, we compared the TFV-based analysis and other PH analysis. When applying PH to proteins, Xia and Wei proposed the molecular topological fingerprint (MTF) method(Xia2014, Xia2015MultidimensionalData), and claimed that "accumulated bar length" of persistent barcodes are useful in identifying protein structure. To investigate the MTF, we plotted a "barcodes" diagram for the sample data in Fig. 7(g)-7(i). In the barcode plot, each cycle is represented by a horizontal line, which begins at birth and ends at death. In this plot, cycles are sorted in ascending birth order. At ns, we have 8 loops, however, several loops had life times too short for observation in Fig. 7(g). Fig.7(h) and 7(i) represent examples of barcodes for misfolded and unfolded states, respectively. In the misfolded state, we observed 9 cycles, however, it was difficult to distinguish the native and misfolded states. We observed 4 loops with very short lifetimes in the unfolded state, which can be easily distinguished from other states. Xia and Wei proposed to use accumulated bar length, i.e. the sum of bar length of all cycles, to describe the structure of protein. In Fig. 8, we show the density plot of , and accumulated bar length. Clearly, the accumulated bar length for both clusters was approximately 1.5—2.0 Å. Thus, we cannot distinguish these two peaks by accumulated bar length. The advantage of TFV analysis compared with other PH analyses relies on the volume optimal cycles, which offer much more information than persistent barcodes. For example, we show samples of volume optimal cycles for native and misfolded states in Fig.9. From the list of native state cycles shown in Fig.9(a), we found that, as the amino acid radius of increases, the edge Tyr2-Tr9 emerge first, and by increasing further, the Gly1–Gly10, Pro4-Gly7, Asp3–Thr8, Asp3–Gly7, Asp3–Thr6, Tyr2–Thr8, and Gly1–Trp9 edges emerge, in this order. Compared with the MTF for the 2JOX protein presented by Xia and Wei(Xia2014), the chignolin’s MTF is more complex. For 2JOX, the edges emerged between the closest adjacent amino acids, with one amino acid having only one edge in contact with the another strand of the -sheet. In our case, several amino acids contact two or more neighbors. For example, Gly1 contacts Trp9 and Gly10, while Asp3 contacts Gly7, Thr6, and Thr8. The list of volume optimal cycles in Fig. 9(a) also showed that 4 of 8 cycles include the edge Tyr2–Trp9. However, in the misfolded state at ns, we observed 4 of 9 cycles included the edge Tyr2–Thr8, as shown in Fig. 9(b). These observations are consistent with the result presented in Fig. 6. We also noted that births and deaths are not sufficient to distinguish the cycles in the native and misfolded states. For example, cycles Gly1–Tyr2–Trp9–Gly10 in Fig. 9(a) and Gly1–Tyr2–Thr8–Gly10 in Fig. 9(b) have nearly the same births and deaths. The volume optimal cycle reveals the difference between these "similar" generators.
3.2 Comparison with the cartesian coordinates and contact-map results
It was instructive to investigate the relationship between our TFV analysis and other previous methods. Here, we compare our result with those of cartesian coordinate and contact map-based analysis.
First, we compared our results and those based on the cartesian coordinates of Cα atoms, as described by Mitsutake and Takano(doi:10.1063/1.4931813). In this analysis, we constructed the -dimensional vector , where represents the position of -th Cα atom. We then reduced dimensionality by PCA. NMF is not available in this case as cartesian coordinates can be negative. The density plots in the reduced space are represented in Fig. 10. We identified two clear peaks of density in Fig. 10. These results are consistent with the result of Mitsutake and Takano(doi:10.1063/1.4931813). Importantly, the first principal component does not contribute to the cluster identification. These results indicate that the PCA is strongly affected by structural changes which are not related to the transition between the folded and misfolded states. A possible explanation is the large degree of freedom in the unfolded state. In unfolded states, most amino acids can move freely, which results in large cartegian coordinate fluctuations. In TFV analysis, we had few cycles in the unfolded state, and the corresponding TFV became nearly [math]. Therefore, we were able to avoid this large fluctuation in the unfolded state by using TFV.
To confirm the cluster consistency between the TFV-based analysis and cartesian coordinate-based analysis, we investigated the relationship between the in Fig. 5(a) and the PCA result. Fig. 11 shows the scatter plot of the second and third principal components, where the point color indicates the score and obtained by NMF. Comparing this figure with Fig. 10, returns large values for the cluster PC3 , while are large for the cluster at PC3 . Therefore, we concluded that the clusters obtained by cartesian coordinate PCA and TFV-based analysis coincide.
Next, we conducted PCA and NMF analysis based on contact maps using the method proposed by Ernst et al.(Ernst2015Contact-Dynamics). In this method, we calculated the distance between atoms and created the contact map as
[TABLE]
is non-negative, so we could apply both PCA and NMF. In Fig.12, we show the density plot obtained by PCA and NMF of . In both cases, it was difficult to identify the folded or misfolded states.
Compared with the analysis based on contact maps, TFV selects the "shortest" distance automatically. When the distance between Tyr2–Tyr8 and Tyr2–Trp9 are both shorter than 8 Å, for both pairs. In this case, we cannot distinguish the folded and misfolded states by contact map. Of 100,000 samples, 80,366 samples showed that both Tyr2–Tyr8 and Tyr2–Trp9 are "contacted" and we failed to distinguish the native and misfolded states. However, TFV depends on the distance difference; if the distance between Tyr2–Trp9 is smaller than that between Tyr2–Tyr8, the edge between Tyr2–Tyr8 is not included in the volume optimal cycle since at the birth of the cycle including Tyr2–Tyr8, Tyr2–Trp9 is not "contacted." In other words, TFV is sensitive to the difference in distance between atoms, while contact maps are sensitive to the absolute distance. This explains why TFV successfully detected two clusters that were not captured by the contact map-based method.
Before concluding this subsection, we discuss a previous study by Mitsutake and Takano describing the structure of native and misfolded state(doi:10.1063/1.4931813) in which they investigated the distance between many atom pairs and found that the hydrogen bond between Asp3 and Gly7 is strongly related to the difference between the native and misfolded states. Fig. 6 shows that the contribution of the edge between Asp3 and Gly7 is larger in than in , which is consistent with their results. However, our analysis showed that the edge between Tyr2 and Thr8 is more remarkable in , which is not mentioned previously. Thus, further studies are needed to determine the difference between our work and previous studies.
3.3 Dynamics in reduced space
To investigate the transition between native, misfolded and unfolded states, we plotted the average flow in Fig.13. First, we calculated , where = 10ps. Next, we divided the two-dimensional space into grids of size Å Åand calculated the average of for each grid. Fig. 13 shows the flow in the entire two-dimensional space. The results indicate that there are two stable solutions at and , respectively. These two stable points correspond to folded and misfolded states, as discussed above. The positions of these fixed points differ slightly from the density peak, which is due to the constraint of . Though the density peak is on the and axis, these points cannot be fixed point as any configuration change drives the system away from the axis. We also found that the flow along the line is strong, whereas the flow at small is very weak. To investigate the dynamics in this area more clearly, we plotted the flow at in Fig. 13. These results strongly suggest that there is a saddle point at . Therefore, this position is likely the transition state. These results also demonstrate that there is no fixed point corresponding to the unfolded state. Once the chignolin molecule reaches the thermal noise-induced unfolded state, it remains unfolded for an extended period of time. However, this is not due to the attraction to the stable fixed point, but rather the slow dynamics in reduced space.
4 Conclusion
In this study, we analyzed the chignolin folding process using PH and proposed TFV as a feature to characterize protein structure. TFV allows us to combine PH with machine learning methods, such as PCA or NMF. In particular, we show that NMF analysis of TFV provides essential information on folding dynamics. By investigating flow in the reduced space, we found that there are two stable fixed points that correspond to the native and misfolded states, one saddle point corresponding to transient state, and one unfolded state. The difference between the native and misfolded states lies in the edge differences between Tyr2–Trp9 and Tyr2–Thr8. The unfolded state has no fixed point, while the protein remains unfolded for a long time due to the slow dynamics.
Our results show that featurization of protein structure by TDA is promising. Several previous studies attempted to apply TDA to biomolecule dynamics. For example, Yao et al. applied Mapper, a major TDA method, to investigate RNA folding(doi:10.1063/1.3103496). Xia and Wei proposed MTF to characterize protein structure(Xia2014, Xia2015MultidimensionalData). Gameiro et al. investigated the relationship between PH and protein compressibility(Gameiro2015). Compared to these previous works, there are several advantages to the TFV-based analysis. First, TFV uses volume optimal cycles, which include significantly more information than does persistent barcodes. As shown in Sec. 3, volume optimal cycles can distinguish different structures that have same births and deaths. Another advantage is applicability to machine learning. As we discussed in the Introduction, the fluctuation in number of cycles causes difficulty when applying machine learning with PH. However, the TFV dimension only depends on the number of amino acids; therefore we can easily apply machine learning methods, such as PCA, NMF, and deep learning. Notably, TFV calculations require large computational cost. Therefore, it would be difficult to calculate TFV using all atoms in macromolecules.
The method developed in this study is powerful, however, further development is also possible. First, several approaches can be taken to construct TFVs from the volume optimal cycles. Here, we used the sum of the deaths as the edge weight, but we could alternatively use the sum of births, the product of deaths, or a combination of births and deaths. For chignolin, there is no qualitative difference when we use the sum of the births in place of the deaths since the births or deaths of every cycle are the same order, as shown in Fig. 7(g) and 7(h). However, if we analyze more complex molecules, the analysis may depend on the TFV definition. Chignolin is a small molecule with only one -sheet and no tertiary structure. If we need to investigate a more complex protein with tertiary structures, then the TFV definition may affect the analysis results. Another improvement could be achieved by the selection of the TFV analysis method. In this study, we applied NMF to reduce the structure into two dimensions; however, when analyzing more complex proteins, the reduced dimensions will increase, so requiring careful determination of the appropriate reduced space dimension. In this case, other analysis method may be more appropriate. Once the TFV is calculated, we can apply several data mining and time-series analysis methods, such as hierarchical clustering, PCA, Fourier analysis, RMA, and ICA. In time-series analysis, Markov models are also promising, as it is a powerful tool for time-series analysis of protein dynamics(Fujisaki2018). The difficulty in applying Markov modeling lies in the definition of the states. In our study, we identified the misfolded and folded states, however, it is difficult to identify the boundary between them. Application of a hidden Markov model(HMM)(Baum1966) may solve this problem as this method classifies each state automatically. Moreover, we can also apply text-mining methods. In our approach, an edge is regarded as a "term" to describe the protein shape. In this analogy, the set of generators is a document that describes the protein shape, and the volume optimal cycles are the sentences in the document. Therefore, we will be able to use text-mining methods such as topic models, term network analysis, and deep learning.
The method we developed here is applicable not only to protein folding but also to other problems in physics, chemistry, and engineering. For example, we could capture protein binding with small molecules, which will contribute to new drug development. Another interesting application is active matter dynamics, such as schools of fish or flocks of birds. Although the active matter dynamics is keenly studied, quantitatively analyzing the shapes of clusters of active matter is difficult. Our method will provide insights regarding this problem.
Author Contribution
T. I. performed research. I. O. and Y. H. contributed to the development of analytical tools. T. I, I. O and Y. H. wrote the paper.
Acknowledgement
The authors thank to Hiroya Nakao, Hiromichi Suetani, Takenobu Nakamura, Kenji Fukumizu for their helpful comments. We would like to thank Editage (www.editage.com) for English language editing. This work was financially supported by JST CREST grant number JPMJCR15D3, Japan.
