Abstract
In this paper, we systematically review weighted persistent homology (WPH) models and their applications in biomolecular data analysis. Essentially, the weight value, which reflects physical, chemical and biological properties, can be assigned to vertices (atom centers), edges (bonds), or higher order simplexes (cluster of atoms), depending on the biomolecular structure, function, and dynamics properties. Further, we propose the first localized weighted persistent homology (LWPH). Inspired by the great success of element specific persistent homology (ESPH), we do not treat biomolecules as an inseparable system like all previous weighted models, instead we decompose them into a series of local domains, which may be overlapped with each other. The general persistent homology or weighted persistent homology analysis is then applied on each of these local domains. In this way, functional properties, that are embedded in local structures, can be revealed. Our model has been applied to systematically study DNA structures. It has been found that our LWPH based features can be used to successfully discriminate the A-, B-, and Z-types of DNA. More importantly, our LWPH based principal component analysis (PCA) model can identify two configurational states of DNA structures in ion liquid environment, which can be revealed only by the complicated helical coordinate system. The great consistence with the helical-coordinate model demonstrates that our model captures local structure variations so well that it is comparable with geometric models. Moreover, geometric measurements are usually defined in local regions. For instance, the helical-coordinate system is limited to one or two basepairs. However, our LWPH can quantitatively characterize structure information in regions or domains with arbitrary sizes and shapes, where traditional geometrical measurements fail.
Subject terms: Biophysical chemistry, Structural biology
Introduction
The great advancement in biological sciences and technologies has led to the accumulation of unprecedented gigantic amount of biomolecular data. Generally speaking, biological data can be classified into several categories, including genomics, transcriptomics, proteomics and metabolomics, which are deposited in several major databanks. A quick look at these databanks gives us a general perspective of the great amount of biological data that is available. Currently, in GenBank, there are more than 100 million gene sequences, which is more than 1 billion bases. In protein data bank (PDB)1, there are about 150,000 three-dimensional biomolecular structures. The availability of the tremendous amount of the biological data has posed unprecedented opportunities for researchers from all areas. With great opportunities come great challenges. The high dimensionality, complexity, and variety of the biological data have rendered most powerful traditional methods and models useless. Data analysis methods and models, including statistical learning, machine learning, data mining, manifold learning, graph/network models, topological data analysis (TDA), etc, have provided great promise in big data era and became more and more popular in bioinformatics and computational biology in the past two decades. Among these models, TDA has drawn special attention from mathematicians and computational scientists due to its unique characteristics. Unlike the general data analysis models, TDA studies topological invariants, which are global intrinsic structure properties. Roughly speaking, TDA can identify the “shape of the data”, thus it works as a powerful tool for simplification and dimensionality reduction. The key component of TDA is persistent homology (PH), which is developed from computational topology and algebraic topology. By assigning a geometric measurement to topological invariants, PH provides a bridge between geometry and topology. Recently, PH based machine learning models have delivered one of the best results in protein-ligand binding affinity prediction, partition coefficients, and mutation-induced folding energy variation2–7 and won champions in several categories in the recent D3R Grand Challenges8, which is widely regarded as the most difficult challenge in drug design.
The great success of persistent homology based machine learning models depends on the multiscale topological features obtained from biomolecular structures9–11. Unlike all previous geometric and topological models, which either focus on local structure information or study qualitative global properties, persistent homology embeds the geometric information into the topological invariants, thus provides the first quantitative topological measurements. With the proposed filtration process, a series of nested simplicial complexes, which are encoded with structural topological information from different scales, are generated in PH. These simplicial complexes provide a multiscale topological profile of the structures. Topological features, such as individual components, holes, circles, and voids, can be evaluated from them. More importantly, some features persist while other die quickly during the filtration. The “lifespans” or “persisting times” provide a size measurement of the topological features12–14. With its unique power in data simplification and structure representation, PH has already been applied to various fields, including shape recognition15, network structure16–18, image analysis19–23, data analysis24–28, chaotic dynamics verification29, computer vision23, computational biology30–37, amorphous material structures38,39, etc. Many powerful softwares, including JavaPlex40, Perseus41, Dipha42, Dionysus43, jHoles44, GUDHI45, Ripser46, PHAT47, DIPHA48, R-TDA package49, etc, have been developed. The persistent times of topological features can be represented or visualized by several models, including persistent diagram (PD)14, persistent barcode (PB)50, persistent landscape51,52, persistent image53, persistent curves54,55, etc. However, traditional persistent homology models use only one filtration parameter, significantly hindering their applications in revealing some heterogeneous properties. To overcome this problem, several multidimensional filtration PH models have been proposed. These models can greatly boost the performance of traditional PH models. Another important approach is to design weighted persistent homology (WPH). The essential idea of WPH is to introduce weight information, which reflects certain physical, chemical or biological properties, into the simplicial complex generation or homological generator calculation. In this way, the topological features, obtained from WPH, will characterize more heterogeneous biomolecular properties.
Generally speaking, the weighted persistent homology can be characterized into three major categories, vertex-weighted35,56–60, edge-weighted2,5,35,44,61,62, and simplex-weighted models63–65. For vertex-weighted models, a weight value is defined on each vertex. Among these methods, the weighted alpha complex is the first model that has been used in biomolecular structure characterization58. By assigning a weight value to each atom, a modified distance function can be proposed and further used to generate the weighted Voronoi cell. The weighted alpha complex is a subset of weighted Delaunay complex, which is the dual of weighted Voronoi diagram. Other vertex-weighted models consider different types of weighted distance functions56,57,59. In a weighted Vietoris-Rips and Čech complex model, a new distance function is proposed as a minimal value of the scaled Euclidean distances between the current position to all atoms56. The inverse of the distance function represents the union of balls centered at the atom, and naturally induces weighted Čech complexes through nerve theorem56,59. Weighted Vietoris-Rips complexes can be constructed by scaling the Euclidean distances between any two atoms by their weights56. Similarly, k-distance functions are proposed and can be used to produce weighted Čech complexes59. To characterize the multiscale properties of the biomolecules, a multiscale rigidity function is proposed35,60,66. Each atom is associated with a weighted kernel function with a scale parameter. A rigidity function is defined as the summation of all the kernel functions and can be used to generate a series of nested Morse complexes in persistent homology. Unlike vertex-weighted models, edge-weighted models usually specify unique weight values on edges44,61. Using weight value as a filtration parameter, Vietoris-Rips or clique complex can be defined as a maximal simplicial complex, whose 1-skeleton has weight values larger (or smaller) than a certain filtration value57. For weighted clique rank homology model61, a network/graph, with a weight value on each edge, is considered. Clique complex can be defined on the subgraph composed of edges with weight larger than filtration value. A series of physics-aware models are proposed to characterize interactions within and between the biomolecules2–8,35,62. Various modified or generalized distance matrixes are used in these models. Further, simplex-weighted persistent homology models, based on weighted boundary operators, are proposed63–65. In these models, weight values are defined on simplexes in different dimensions. To ensure the consistence of the homology definition, weight values on different simplexes need to satisfy certain constraints or relations, so that a weighted boundary operation can be well-defined.
In this paper, we propose a localized weighted persistent homology LWPH. Our LWPH model is inspired by the recent great success of element specific persistent homology (ESPH) models as mentioned above. Unlike all previous weighted persistent homology models, which treat biomolecules as an inseparable system, ESPH decomposes the structure into a series of sub-structures made of certain type(s) of atoms. The subnetworks or subgraphs, especially those from protein-ligand complexes, have been proved to capture important biological properties, such as hydrophobic or hydrophilic interactions. In this way, ESPH models have delivered amazing results in biomolecular data analysis2–8. Further, our LWPH models are different from traditional persistent local homology (PLH)67–72. The PLH studies the relative homology groups between a topological space and its subspace. It is usually used to assess the local structure of a special point within a topological space. In our LWPH, the biomolecular structures and configurations are decomposed into a series of local domains, that may overlap with each other. The general persistent homology or weighted persistent homology analysis is then applied on each of these local domains. In this way, DNA local structure, dynamics and functional properties can be embedded in our LWPH models. Our model has been used in the analysis of DNAs. It has been found that our LWPH based features can be used to successfully discriminate A-, B-, and Z-types of DNA. More importantly, our LWPH based principal component analysis (PCA) model can identify two configurational states of a DNA system in ion liquid environment, which can only be revealed by the complicated helical coordinate representation. The great consistence with the helical-coordinate model demonstrates that our model captures the local structure variations so well that it is comparable with geometric models. Moreover, geometric measurements are usually defined in very local regions, for instance the helical-coordinate system is limited to one or two basepairs. However, our localized weighted homology can quantitatively characterize structure information in a much larger domain, where traditional geometrical measurements fail.
Methods
In this section, we will provide a brief review of the weighted persistent homology models and their applications in biomolecular data analysis. After that, a detailed discussion of our localized weighted persistent homology model will be presented.
Weighted persistent homology
The essential idea of weighted persistent homology models is to introduce a specially-designed weight function/parameter that incorporates the biomolecular physical, chemical or biological properties, into the construction of simplicial complexes or homology generator evaluation. Generally speaking, all these WPH models can be classified into three types, including vertex-weighted35,56–60, edge-weighted2,5,35,44,61,62, and simplex-weighted models63–65.
To facilitate our discussion, we define a weighted point set as with and . For each point xi, a weight vi is assigned to it. We use to represent the Euclidean distances between two points xi and xj. Biologically, the weight V is usually chosen to be the radius, atom number, etc.
Vertex-weighted persistent homology
Weighted alpha complex: In weighted alpha complex58, a weighted distance is defined as . The weighted Voronoi region or Voronoi cell can be defined as
A t-weighted closed ball for is defined as . The intersection of -weighted closed balls and Voronoi cells is . In this way, the weighted alpha complex can be expressed as,
Essentially, the weighted alpha complex is a subsect of weighted Delaunay complex, which is the dual of weighted Voronoi diagram.
Weighted Vietoris-Rips and Čech: Bell et al., have proposed a weighted Vietoris-Rips model and a weighted Čech model56. The weighted Čech complex is defined as Čech. Here is the closed ball centered at with radius . The nerve is the abstract simplicial complex from the closed balls. The weighted Vietoris-Rips Complex is defined as = .
For a filtration parameter , weighted Čech complex at scale t can be denoted as
1 |
and the weighted Vietoris-Rips Complex at scale t can be expressed as
Moreover, we can define a distance function as . In this way, we have the inverse function
2 |
and it is homotopy equivalent to Čech as in Eq. (1).
Computationally, the weighted Vietoris-Rips Complex56 can be constructed by using a weighted distance matrix with
Various softwares, such as JavaPlex40, Perseus41, Dipha42, GUDHI45, Ripser46, PHAT47, DIPHA48, R-TDA package49, can use distance matrix as their input data.
k-distance based model
Definition 1.
For any point set X and k is nonnegative integer, the k-distance57,59 can be denoted as
with denotes the k nearest neighbors in X to the point x.
Further, it can be expressed as power distance as follows,
Here denotes the barycenters of any subsets of k points of X and . Moreover, the sublevel sets of the k-distance are finite union of balls,
3 |
Similar to Eq. (2), the inverse of this distance function is homotopy equivalent to a weighted Čech complex, which is the nerve of the closed balls59.
Rigidity function based models: Multiscale topological simplification models have been proposed35,60,66. The key part of these models is multiscale rigidity function,
Here is the scale parameter and can be chosen from any monotonically-decreasing functions, such as the generalized power-law equation,
4 |
and the generalized exponential equation,
5 |
Unlike previous distance functions in Eqs. (2) and (3), the inverse of rigidity function may not be expressed as a union of balls. However, it can generate Morse complexes. Computationally, the discrete Morse models can be used to evaluate the persistent homology.
Edge-weighted persistent homology
The essential idea for the edge-weighted persistent homology models is to assign a weight to each edge. With weight as filtration parameter, the Vietoris-Rips complex can be defined as the maximal simplicial complex whose 1-skeleton has weight values larger (or smaller) than the filtration value. Computationally, a weighted distance matrix is usually proposed. The filtration is achieved through the increasing (or decreasing) of the weighted distance value.
Weighted clique rank homology: The weighted clique rank homology is defined on weighted complex networks44,61. For weighted networks, each edge/link has a weight on it. The filtration goes from the largest weight to the lowest one. At each filtration value t, a subgraph composed of edges with weight larger than t is formed. Based on the subgraph, clique complex can be constructed. In this way, with the decrease of filtration value, a series of clique complexes are built and their homology and persistence can be calculated.
Physics-aware models: Recently, a series of new persistent homology models have been proposed to characterize the various physical interactions within and between the biomolecules2,5,35,62. In these models, the distance matrix between atoms is modified based on their physical properties, including covalent bonds, protein-ligand interactions, electrostatic interactions, etc. To avoid confusion, we call them as physics-aware persistent homology.
For a biomolecule or biomolecular complex, we denote their atomic coordinates as , a distance matrix can be constructed as . Various modified distance matrices are proposed to characterize different physical, chemical and biological properties of the biomolecular structure.
Definition 2.
Multi-level persistent homology model2 considers a modified distance matrix as follows,
6 |
In computation, we can take as any value larger than the filtration size. More generally, we can define an n-th level matrix2 as
It has been found that when the modified matrices are employed, the barcode representation is significantly enriched and is able to capture the tiny structure perturbation between the conformations. Further, an interactive persistent homology model is proposed for protein-ligand binding analysis.
Definition 3.
An interactive persistent homology model is based on the revised distance matrix as follows,
7 |
In this way, interactions between two molecules, such as protein-protein, protein-DNA/RNA, protein-ligand, DNA/RNA-ligand, etc, can be incorporated into topological invariants.
Essentially, Physics-aware persistent homology models2 are all based on the generalized matrix . Here can be any function properties, including van der Waals interaction, electrostatic potential, or any other generalized correlations.
Simplex-weighted persistent homology
Weighted simplicial homology: Weighted simplicial homology is a generalization of simplicial homology63–65. Every simplex has a weight in a ring R, and the boundary map is weighted accordingly. When all the simplices have the same weight , the resulting weighted homology is the same as the usual simplicial homology. We list some of the key definitions and results below.
Definition 4.
A weighted simplicial complex is a pair consisting of a simplicial complex K and a weight function , where R is a commutative ring, such that for any , with , we have .
Theorem 1.
Let I be an ideal of a commutative ring R. Let be a weighted simplicial complex, where is a weight function. Then is a simplicial subcomplex of K.
For the definition of homology of weighted simplicial complexes, we require R to be an integral domain with unity 1.
Definition 5.
The weighted boundary map is the map:
where the face maps di are defined as:
for any n-simplex .
Theorem 2.
Let be a simplicial map. Then , where refers to the relevant weighted boundary map.
Definition 6.
We define the weighted homology of a weighted simplicial complex to be
where is the weighted boundary map.
Proposition 2.1.
Proposition. If all the simplices in have the same weight , the weighted homology functor is the same as the usual simplicial homology functor.
Weighted persistent homology: Given a weighted filtered complex , for the i-th complex Ki, we have the associated weighted boundary maps and chain group , cycle group , boundary group , and homology group for all integers i and k.
Definition 7.
The weighted boundary map , where i denotes the filtration index, is the weighted boundary map of the i-th complex Ki. That is, is the map . The chain group is the group . The cycle group is the group , while the boundary group is the group . The homology group is the quotient group .
Definition 8.
The p-persistent k-th homology group of is defined as
Localized weighted persistent homology
In all the above WPH models, weights are defined on the whole system to reveal the intrinsic global structural properties. Stated differently, all these models treat a biomolecule structure as an inseparable system, and explore their topological properties using the whole structure. In contrast, ESPH models2–8 decompose a biomolecular structure into a series of sub-structures made of certain type(s) of atoms. It has been found that the generated subnetworks or subgraphs, especially those from protein-ligand complexes, can capture important biological properties, such as hydrophobic or hydrophilic interactions2. Different from WPH and ESPH models, persistent local homology considers the relative homology groups between a topological space and its subspace. Usually, persistent local homology focuses on the local structure around a special point in a certain topological space.
Motivated by the success of ESPH models, we introduce our localized weighted persistent homology. Instead of decomposing biomolecular structures by their atom types, we focus on local biomolecular regions or domains and study their topological properties. For a better introduction of our LWPH, we will briefly review ESPH and PLH first.
Element specific persistent homology: Biomolecules are made of various atoms with different properties. In protein, DNA or RNA, there are five common types of atoms, including C, N, O, P, and S, and several metal ions, such as Fe, Mn, Zn, etc. Ligands are small molecules, that interact with the protein, DNA or RNA. Other than the common five types of atoms, they may have some other unique atoms, such as F, Cl, Br, I, etc.
Generally speaking, ESPH is proposed to characterize the topological properties within the structure formed by one or several types of atoms2–5,7. Mathematically, it is achieved by assigning weight value 1 to the selected types of atoms, and weight value 0 to all the rest atoms. For instance, all C atoms from both protein and ligand can be selected to form C-networks or graphs. The topological properties of these structures characterize the hydrophobic interactions between protein and ligands. Similarly, hydrophilic interactions can be well captured by networks from protein nitrogen atoms and ligand oxygen atoms.
One of the most important properties for ESPH is to generate a series of sub-structures from the biomolecule, and systematically explore their topological properties. These element based sub-structures reveal more structure information that is directly related to the biomolecular physical, chemical, and biological properties.
Persistent local homology. The persistent local homology67–71 is based on the algebraic topological concept called local homology groups72.
Definition 9.
If X is a space and if is a point, then the local homology groups of X at x are the singular homology groups .
From the excision theorem, we have the following Lemma.
Lemma 2.1.
Let X be a Hausdorff space and let . If A contains a neighborhood of the point x, then . Therefore, for Hausdorff spaces X and Y, if and have neighbourhoods U, V, respectively, such that is homeomorphic to , then the local homology groups of X at x and of Y at y are isomorphic.
Generally speaking, local homology is used to evaluate the local structure of a topological space. Persistent local homology can be used in dimension reduction and manifold dimension detection69–71.
Localized weighted persistent homology: The essential idea of our LWPH is to focus on local regions, of biomolecular structures or configurations, that incorporate the important physical, chemical or biological information, and perform the persistent homology analysis on them. In many situations, there may be several domains that are of great interest and we need to perform LPH on each domain. More generally, we can decompose biomolecular structures into a series of (overlapping) domains. For each domain, we carry out LWPH on all (or certain type(s) of) atoms that are of particular interest. In this way, a series of local topological properties can be obtained and we call them localized topological fingerprints. To avoid confusion, if the general persistent homology is considered, we call it localized persistent homology (LPH). If a weighted persistent homology is considered, we call it localized weighted persistent homology (LWPH).
More specifically, for a biomolecule or biomolecular complex with atomic coordinates . The coordinate set X can be decomposed into a series of domains XI, with . Similar distance matrix MI as in Eqs. (6) and (7) can be constructed on each of the domain. In this paper, we will focus on the study of DNA, which is made of paired nucleotides. We can consider the weighted distance matrix on the domain XI as follows,
8 |
By using different weight values, LWPH can be designed to capture various local properties in biomolecular structures. The application of LPH and LWPH can be found in following sections.
It should be noticed that we still regard our LPH as a weighted persistent homology model. Essentially, we can set weight as a vector composed of only 1 and 0, and only atoms within the local region have weight values as 1.
Results
In this section, we discuss the application of our localized persistent homology and localized weighted persistent homology in the study of DNA structures. To avoid confusion, only the weight definition as in Eq. (8) is used in our LWPH. The persistent barcodes are used for the representation and visualization of LPH and LWPH results. The persistent Betti numbers (PBNs) are evaluated from barcodes. A systematical evaluation of PBNs under helical coordinates demonstrates the incorporation of the geometric information in our LPH and LWPH models. Further, we show that PCA of the feature vectors from LWPH based PBNs can be successfully used in the classification of the A-, B-, and Z-types of DNAs. Moreover, we explore DNA structure variations in both water and ion liquid (IL) environments using molecular dynamics. With LWPH based feature vectors, we can not only reveal the confinement effect of DNA configurations from water to IL environment, but also identify two DNA configurational states in IL environment. Detailed analysis shows that global-scale PCA models, including atom-coordinate-based PCA, common PH-based PCA, and ESPH-based PCA, all fail in clustering the DNA configurational states in IL. In contrast, LWPH based all-atom or selected-atom models are always able to characterize the DNA structure variations in IL environment. The LWPH results are highly consistent with the helical-coordinate based PCA model.
DNA local topological features
DNA molecule has a double helical structure composed of four types of nucleotides, i.e., A, T, G, and C. It has remarkably different scales, ranging from nucleobases, minor and major grooves, to larger structures like nucleosome, chromatin, and then to chromosome. We have proposed a multi-resolution PH model to characterize structural topological features or topological fingerprints of DNA structures in different scales60,66. However, the model focuses on the global DNA topology. In this section, we explore DNA topological features from local structures, i.e., DNA localized topological fingerprints. We study the barcodes for both LPH and LWPH models, i.e., one with traditional persistent homology and the other with the weighted persistent homology as in Eq. (8). Different local structures can be systematically studied. In the current paper, our focus is local topological features from different DNA base pairs or base steps.
To facilitate a better description, we introduce some basic notations. In general, results from PH can be represented as pairs of “birth” and “death” times, i.e., the filtration values for homology generators to appear and disappear. We denote them as follows,
here , , to represent “birth”, “death”, and “persistence” for -th generator of -th dimensional Betti number, respectively. And is the total number of -th dimensional topological generators. Due to the limited number of atoms in a local structure, we only consider dimension equals to 0 and 1. Further, different PH based functions are proposed for the visualization, representation and modeling of topological information24,51,54,73. Persistent Betti number, or Betti curve, is one of them. It is defined as the summation of all the -th dimensional barcodes,
9 |
Function is a step function, which equals to one in the region and zero otherwise.
As a simple one-dimensional function, PBN has been used in data analysis for dimensionality and complexity reduction. Moreover, PBN based feature vectors can be input into various machine learning models2–8. In this section, PBN based PCA models are used in DNA structure classification and trajectory clustering.
LPH and LWPH for DNA structure representation
As stated above, we consider two types of LPHs, one is LPH with Euclidean distance matrix and the other is LWPH with a similar weighted distance matrix as in Eq. (8). For LWPH, we assume the distance between two atoms from same nucleotide residue to be infinity, and the distance between two atoms from different residues to be their Euclidean distance. In this way, our LPH characterizes topology from covalent-bond-formed structure, while our LWPH reveals topological information on non-covalent bond properties. The DNA base-pair structures are generated by using the 3DNA software74.
Figure 1 illustrates LPH barcodes for different combinations of base pairs. Shorter bars (with length around 1.0 Å to 1.5 Å) correspond to covalent bonds, longer bars with length around 2.8 Å correspond to the hydrogen bonds between paired bases. For bars, longer ones appear in earlier stage of filtration, i.e., from around 1.4 Å to 2.4 Å, correspond to sugar rings and nitrogenous base rings. The longer bars range from around 2.9 Å to 3.6 Å, representing loops between paired bases. It can be seen that each A-T pair only contributes one such longer bar, while each G-C pair contributes two.
Figure 2 illustrates the corresponding LWPH barcodes for different combinations of base pairs. Similar to LPH results, the total number of bars is exactly the number of atoms, and shorter bars with length around 2.8 Å correspond to hydrogen bonds between paired bases. Different from LPH results, more hydrogen-bond related bars appear in LWPH barcode than LPH barcodes. And the lengths of bars for LWPH are systematically longer than those for LPH model, indicating that more long-range interactions related information are preserved in our LWPH model. Moreover, the barcodes for LWPH are much more complicated. Their geometric meanings are not as straightforward as LPH models. Generally speaking, the bar in LWPH represents loop or ring structure with edges between different nucleotides. In this way, a much larger amount of bars are generated. Moreover, when there are only two nucleotides (or one base pair), the bars persist forever.
In general, LPH and LWPH characterize different structure properties, the former is more about covalent-bond related topology while the latter is more about topology from non-covalent bonds. Physically, covalent bonds are much stronger than non-covalent bonds. In this way, LPH are relatively more “stable” and less sensitive to structure variations under thermal fluctuations. While LWPH are less “stable” and much easier to change if there is some external perturbations.
LPH and LWPH based DNA structural analysis
With the embedded geometric information, LPH and LWPH can be used in not only qualitative but also quantitative analysis of different structures. To assess LPH and LWPH based quantitative analysis, we systematically generate a series of DNA base-pair configurations using DNA helical coordinates. According to the Cambridge University Engineering Department Helix computation Scheme (CEHS)75, the motion of a base pair or two neighbouring base pairs can be depicted by 12 helical parameters, including 6 one-base-step related parameters, i.e., shear, stretch, stagger, buckle, propeller and opening, and another 6 two-base-step related parameters, i.e., shift, slide, rise, tilt, roll and twist. For each parameter, we prepare 11 DNA structures, with parameter value taken equally from to , using 3DNA74. Here , are the mean value and standard deviation of parameter i. And the rest of the helical parameters remain as constants, i.e., their mean values. The mean value and standard deviation of each parameter can be obtained from crystal structures75. In DNA helical coordinate evaluation, only the base atoms and C1′ of the sugar ring are considered. For a fair comparison, the same atoms are used in our LPH and LWPH models.
We apply our LPH and LWPH on these series of DNA local structures and check if the quantitative structure variations are reflected in their barcodes. To facilitate a systematical comparison, we consider the PBN function in Eq. (9). For each helical parameter, we take the natural logarithm of all its PBN functions and stack them together to form a two-dimensional image. Note that we systematically add 1 to all PBN functions to avoid computational problem (from ln 0). Figures 3 and 4 illustrate the results of our LPH and LWPH for two-base-step parameters, respectively. The AT/AT base steps are considered. It can be seen that instead of remaining unchanged for all helical parameter values, both and PBN functions for LPH and LWPH models vary greatly, indicating that both models are sensitive to subtle structure variations. More specifically, in LPH based PBN, functions seem to have comparably larger variations than functions. In LWPH based PBN, functions seem to have greater variations than functions. We also check the and PBN functions for LPH and LWPH models for one base step. The results are demonstrated in Figs. 9 and 10 in Supplementary. Both functions in those two models show variations with the change of helical parameter value.
Since PBN functions from LPH and LWPH are sensitive to the structure variations, we can use them as measurements for DNA structure, function and dynamics analysis. In the following sections, PBN and PBN based features are used in the classification of DNA types and clustering of DNA trajectories.
Local topological feature based DNA classification and clustering
In this section, we study local topological feature based DNA classification and clustering. Essentially, topological features are extracted from PBNs, which are generated from LPH or LWPH. Figure 5 illustrates the LPH and LWPH based DNA featurization. Note that the results from LPH and LWPH can also be represented as persistent diagram14, persistent barcode50, persistent landscape51,52, persistent image53, persistent curves55, etc. Based on these representations, other featurization forms can also be considered76. In this paper, we focus on PBN based featurization.
Classification of three typical DNA forms
We consider three types of DNA structures, including A-, B- and Z-forms. We randomly pick 10 PDB files from each form of DNA and the PDB IDs are shown in Table 2 in Supplementary. In LPH and LWPH, the same atom combination of each base step is chosen as in the above case, i.e., base atoms and C1′ of the sugar ring. The PBN function is calculated for each base step. To systematically compare the PBNs for three types of DNA forms, we summarize all the PBNs from the same DNA form and then compute the average.
The results from LWPH are demonstrated in Fig. 6. It can be seen that the three PBN profiles have very different , particularly on the filtration range from 4.0 Å to 7.0 Å. Further, we consider the PCA for DNA classification. For each DNA structure, we define a vector made of the average and PBN values equally taken from 2.0 Å to 8.0 Å with an interval 0.1 Å. In this way, a feature vector with 120 elements is defined for all 30 DNA structures. The PCA results are demonstrated in Fig. 6. Here x-axis and y-axis represent the first and second eigenvectors (principal components), respectively. It can be seen that three forms of DNA locate in the different regions with clear boundary, which further confirms that LWPH based features can distinguish the subtle conformational deviation. Figure 11 in Supplementary shows the results from LPH. In comparison with LWPH, LPH based PBNs show no obvious difference, and PBN based PCA does not classify the dataset into three individual clusters.
Clustering of DNA conformations in different environments
We have demonstrated the DNA structure classification with our LWPH. However, A-, B- and Z- forms of DNAs are static and have relatively “large” configurational differences. In the following, we consider a more challenging case. That is the clustering of the molecular dynamics simulations of the same DNA molecule in different solvent environments.
Molecular dynamics setting
A brief introduction of the MD procedure is presented as follows. The initial structure of 16-mer DNA duplex is prepared using 3DNA74 and centered in a cubic box. Two different solution environments are used, including ion liquid (IL) and water (WAT). For IL environment, 600 BMIM+ and 600 are firstly inserted and the box is then solvated with TIP3P water and Na+. For WAT environment, the box is directly solvated with water and Na+. After a 100 ps thermostat and 100 ps barostat, the system then goes through a 100 ns product MD. Under each environment setting, we conduct 3 repeated MD simulations, so we obtain 6 trajectories in total. We denoted them as IL1-3 (trajectory 1 to 3 in IL) and WAT1-3 (trajectory 1 to 3 in water). All the simulations are conducted using GROMACS 4.6 package77. In our data analysis, 5000 sample frames evenly sampled from the last 10 ns trajectory of 6 simulations are considered. The detailed MD simulation setting and parameters can be found in the related paper78.
Weighted persistent homology modeling
For DNA conformation clustering, we extract 13 non-terminal DNA base steps for each frame of the simulation data. Similar to DNA-type classification case, for each base step, we construct a 120-element PBN feature from the LWPH. Then, we concatenate all 13 sets of PBN values together into feature vector for each DNA configuration. This LWPH based feature vector is used in the PCA of DNA trajectories in different environments. More specifically, a covariance matrix of feature vectors for all the frames is built up, and further eigen-decomposed into principal components (eigenvectors). The first two eigenvectors construct a plane and all feature vectors are projected to it. For comparison, in both IL and water, we apply PCA not only on three individual MD trajectories, but also the ensemble made of all three trajectories together. The results are demonstrated in Fig. 7. The projected points are illustrated as their contour values for a better visualization. To avoid confusion, Fig. 7(a1–a4) are for DNA trajectories in IL environment. Among them, Fig. 7(a1) is for the ensemble of all three trajectories. Figure 7(a2–a4) are for the three trajectories, respectively. Figure 7(b1–b4) are for DNA trajectories in water environment. Among them, Fig. 7(b2–b4) are for the three trajectories, respectively, and Fig. 7(b1) is for the ensemble of all three trajectories.
Several unique properties can be seen from Fig. 7. Firstly, the confinement effect, i.e., the reduction of distribution area, can be clearly observed in IL environment. In fact, we can count the area of the distribution in IL and water and the results are listed in Table 1. It can be seen that, the areas of distribution map in IL are up to 2/3 of that in water, the smaller area confirms the fluctuation of DNA in IL is greatly attenuated. Secondly, contour graphs for IL and WAT show significantly different patterns. For IL solution, two centers can be clearly identified from contour graph in Fig. 7(a1). Among them, one locates on upper left and the other locates on right part. In contrast, for water solution, only one center can be found and its position differs greatly from the ones of IL systems. The huge difference indicates the change of DNA conformations in different environments. Further, for water solution, all contour graphs have nearly the same distribution, indicating that all three trajectories behaved quite similarly. In contrast, for IL solution, contour graph for IL1 shows a clear difference of those for IL2 and IL3, meaning there is a subtle change of ion-DNA binding mode in trajectory IL1. Figure 12 in Supplementary shows the observed variation of ion-DNA binding in different metastates in IL1. Our LWPH based PCA is sensitive enough to capture this subtle structure variation.
Table 1.
IL1 | IL2 | IL3 | Wat1 | Wat2 | Wat3 | |
---|---|---|---|---|---|---|
AC-PCA | 212 | 167 | 173 | 307 | 301 | 268 |
HP-PCA | — | 217 | 203 | 350 | 352 | 341 |
LPH-PCA | 340 | 321 | 333 | 345 | 357 | 354 |
LWPH-PCA | — | 211 | 186 | 354 | 295 | 313 |
The area of distribution of each MD trajectory repeat. The area is counted as the number of grids with population larger than 5% of the largest population grid. Four different methods are considered, including the atom-coordinate-based PCA (AC-PCA), the helical-parameter-based PCA (HP-PCA), the LPH-based PCA (LPH-PCA), and LWPH-based PCA (LWPH-PCA). We have not listed the area for IL1 from HP-PCA and LWPH-PCA, as dynamic transition is observed in these representations and the area cannot be treated as the measurement of degree of conformational fluctuation.
Our LWPH based results are highly consistent with previous results from the helical parameter based model78. As demonstrated in Fig. 8, similar confinement effect is also observed in CEHS based contour graphs for IL solution. Further, CEHS results show two different centers, while WAT contour graphs have only one center. This means that, CEHS model also captures the subtle change of ion-DNA binding mode in trajectory IL1. To further check if our LWPH and CEHS models identify the same type of ion-DNA configurational changes, we decompose the contour graphs of IL1 into 10 separated subgraphs, each of them represent the DNA trajectories in 1 ns. We can clearly identify four center regions from these subgraphs, and they are consistent with results from HP based PCA. This further indicates that our LWPH based models are highly sensitive to DNA local structural variations. The results are demonstrated in Figs. 13 and 14 in Supplementary.
Further, it should be noted that the local DNA structure variations in IL1 cannot be captured by the general global models. As demonstrated in Fig. 15 in Supplementary, the general atom-coordinates based PCA fails to capture the DNA structure variation in IL1, even thought it manages to preserve the confinement effect (details in Table 1). Similarly, LPH based model also fails to reveal the variation. Moreover, it even cannot reveal the confinement effect of IL environment. Details can be found in Table 1 and Fig. 16 in Supplementary. This is largely due to the reason that LPH based model focuses more on the covalent bonds and its related structures. Even though different combination of atoms are considered, both coordinate-based PCA and LPH-based PCA are unable to identify the structure variation. In contrast, not only the general LWPH model works, we also construct different LWPH models by taking different combinations of backbone atoms and base atoms at local scale. For instance, according to CEHS scheme, we can take , , and C1′ of purine base and , and C1′ of pyrimidine base, as shown in Fig. 17 in Supplementary. These selected atoms based LWPH can also capture very well the confinement effect and ion-DNA configurational changes. The corresponding trajectories also show great consistence with both helical-parameter based and LWPH based results. Figures 18 and 19 in Supplementary show the corresponding results.
Lastly, our LWPH based models are very flexible and easy to be combined with machine learning models. Traditional CEHS helical coordinate systems work well only for one and two base steps. They tend to fail if the local structure variation is induced by adjacent three or more base steps. Moreover, CEHS models are only suitable for DNA or RNA and cannot be used in proteins or other biomolecules. In comparison, our LWPH are more general and can be used for any local structures from DNAs, RNAs, proteins, biomolecular complexes, or biomolecular assemblies. Another important property of LWPH based feature vectors are that they are unit free and can be used to compare different-sized local structures. In this way, these feature vectors are extremely suitable for machine learning models.
Conclusion Remarks
In this paper, we discuss weighted persistent homology models and their applications in biomolecular structure, function, and dynamics analysis. We briefly review all the WPH approaches, including vertex-weighted, edge-weighted, and simplex-weighted models. Essentially, weight values, which reflects physical, chemical and biological properties, are assigned to vertices (atom centers), edges (bonds), or higher order simplexes (cluster of atoms), depending on the biomolecular structure, function, and dynamics properties.
Further, we propose the first localized persistent homology and localized weighted persistent homology and apply them in the DNA structure classification and clustering. Our LPH and LWPH models are inspired by the great success of element specific persistent homology. In our models, biomolecules are not treated as an inseparable system, instead they are decomposed into a series of local domains, which may overlap with each other. The general persistent homology or weighted persistent homology analysis is then applied on each of these local domains. In this way, functional properties, that embedded in localized topological invariants, can be revealed. Our models characterize structural variations at any level and provide a new featurization of biomolecules for machine learning models.
Supplementary information
Acknowledgements
This work was supported in part by Nanyang Technological University Startup Grant M4081842 and Singapore Ministry of Education Academic Research fund Tier 1 RG31/18, Tier 2 MOE2018-T2-1-033.
Author contributions
K.X. and Z.M. contributed the algorithm design. K.X. wrote the main manuscript text. V.D.A., Y.L. and J.W. reviewed the manuscript.
Competing interests
The authors declare no competing interests.
Footnotes
Publisher’s note Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Supplementary information
is available for this paper at 10.1038/s41598-019-55660-3.
References
- 1.Berman HM, et al. The Protein Data Bank. Nucleic acids research. 2000;28(1):35–242. doi: 10.1093/nar/28.1.235. [DOI] [PMC free article] [PubMed] [Google Scholar]
- 2.Cang ZX, Mu L, Wei GW. Representability of Algebraic Topology for Biomolecules in Machine Learning Based Scoring And Virtual Screening. PLoS computational biology. 2018;14(1):e1005929. doi: 10.1371/journal.pcbi.1005929. [DOI] [PMC free article] [PubMed] [Google Scholar]
- 3.Cang ZX, Wei GW. Analysis and Prediction of Protein Folding Energy Changes Upon Mutation by Element Specific Persistent Homology. Bioinformatics. 2017;33(22):3549–3557. doi: 10.1093/bioinformatics/btx460. [DOI] [PubMed] [Google Scholar]
- 4.Cang, Z. X. & Wei, G. W. Integration of Element Specific Persistent Homology and Machine Learning for Protein-Ligand Binding Affinity Prediction. International journal for numerical methods in biomedical engineering, page, 10.1002/cnm.2914 (2017). [DOI] [PubMed]
- 5.Cang ZX, Wei GW. TopologyNet: Topology Based Deep Convolutional And Multi-Task Neural Networks for Biomolecular Property Predictions. PLOS Computational Biology. 2017;13(7):e1005690. doi: 10.1371/journal.pcbi.1005690. [DOI] [PMC free article] [PubMed] [Google Scholar]
- 6.Nguyen DD, Xiao T, Wang ML, Wei GW. Rigidity Strengthening: A Mechanism for Protein–Ligand Binding. Journal of chemical information and modeling. 2017;57(7):1715–1721. doi: 10.1021/acs.jcim.7b00226. [DOI] [PubMed] [Google Scholar]
- 7.Wu, K. D. & Wei, G. W. Quantitative Toxicity Prediction Using Topology Based Multi-Task Deep Neural Networks. Journal of chemical information and modeling, page, 10.1021/acs.jcim.7b00558 (2018). [DOI] [PubMed]
- 8.Nguyen DD, et al. Wei. Mathematical Deep Learning for Pose and Binding Affinity Prediction and Ranking in D3R Grand Challenges. Journal of computer-aided molecular design. 2019;33(1):71–82. doi: 10.1007/s10822-018-0146-6. [DOI] [PMC free article] [PubMed] [Google Scholar]
- 9.Edelsbrunner H, Letscher D, Zomorodian A. Topological Persistence and Simplification. Discrete Comput. Geom. 2002;28:511–533. doi: 10.1007/s00454-002-2885-2. [DOI] [Google Scholar]
- 10.Zomorodian A, Carlsson G. Computing Persistent Homology. Discrete Comput. Geom. 2005;33:249–274. doi: 10.1007/s00454-004-1146-y. [DOI] [Google Scholar]
- 11.Zomorodian A, Carlsson G. Localized Homology. Computational Geometry - Theory and Applications. 2008;41(3):126–148. doi: 10.1016/j.comgeo.2008.02.003. [DOI] [Google Scholar]
- 12.Dey, T. K., Li, K. Y., Sun, J. & David, C. S. Computing Geometry Aware Handle and Tunnel Loops in 3d Models. ACM Trans. Graph. 27 (2008).
- 13.Dey TK, Wang YS. Reeb graphs: Approximation and Persistence. Discrete and Computational Geometry. 2013;49(1):46–73. doi: 10.1007/s00454-012-9463-z. [DOI] [Google Scholar]
- 14.Mischaikow K, Nanda V. Morse Theory for Filtrations and Efficient Computation of Persistent Homology. Discrete and Computational Geometry. 2013;50(2):330–353. doi: 10.1007/s00454-013-9529-6. [DOI] [Google Scholar]
- 15.Di Fabio B, Landi C. A Mayer-Vietoris Formula for Persistent Homology with an Application to Shape Recognition in The Presence of Occlusions. Foundations of Computational Mathematics. 2011;11:499–527. doi: 10.1007/s10208-011-9100-x. [DOI] [Google Scholar]
- 16.Horak D, Maletic S, Rajkovic M. Persistent Homology of Complex Networks. Journal of Statistical Mechanics: Theory and Experiment. 2009;2009(03):P03034. doi: 10.1088/1742-5468/2009/03/P03034. [DOI] [Google Scholar]
- 17.Lee H, Kang H, Chung MK, Kim B, Lee DS. Persistent Brain Network Homology from The Perspective of Dendrogram. Medical Imaging, IEEE Transactions on. 2012;31(12):2267–2277. doi: 10.1109/TMI.2012.2219590. [DOI] [PubMed] [Google Scholar]
- 18.Silva, V. D. & Ghrist, R. Blind Swarms for Coverage in 2-d. In Proceedings of Robotics: Science and Systems, page 01 (2005).
- 19.Bendich P, Edelsbrunner H, Kerber M. Computing Robustness and Persistence for Images. IEEE Transactions on Visualization and Computer Graphics. 2010;16:1251–1260. doi: 10.1109/TVCG.2010.139. [DOI] [PubMed] [Google Scholar]
- 20.Carlsson G, Ishkhanov T, Silva V, Zomorodian A. On The Local Behavior of Spaces of Natural Images. International Journal of Computer Vision. 2008;76(1):1–12. doi: 10.1007/s11263-007-0056-x. [DOI] [Google Scholar]
- 21.Frosini P, Landi C. Persistent Betti numbers for A Noise Tolerant Shape-Based Approach to Image Retrieval. Pattern Recognition Letters. 2013;34(8):863–872. doi: 10.1016/j.patrec.2012.10.015. [DOI] [Google Scholar]
- 22.Pachauri D, Hinrichs C, Chung MK, Johnson SC, Singh V. Topology-Based Kernels with Application to Inference Problems in Alzheimer’s Disease. Medical Imaging, IEEE Transactions on. 2011;30(10):1760–1770. doi: 10.1109/TMI.2011.2147327. [DOI] [PMC free article] [PubMed] [Google Scholar]
- 23.Singh, G. et al. Topological Analysis of Population Activity in Visual Cortex. Journal of Vision8(8) (2008). [DOI] [PMC free article] [PubMed]
- 24.Carlsson G. Topology and Data. Am. Math. Soc. 2009;46(2):255–308. doi: 10.1090/S0273-0979-09-01249-X. [DOI] [Google Scholar]
- 25.Liu X, Xie Z, Yi DY. A Fast Algorithm for Constructing Topological Structure in Large Data. Homology, Homotopy and Applications. 2012;14:221–238. doi: 10.4310/HHA.2012.v14.n1.a11. [DOI] [Google Scholar]
- 26.Niyogi P, Smale S, Weinberger S. A Topological View of Unsupervised Learning from Noisy Data. SIAM Journal on Computing. 2011;40:646–663. doi: 10.1137/090762932. [DOI] [Google Scholar]
- 27.Rieck B, Mara H, Leitte H. Multivariate Data Analysis Using Persistence-Based Filtering and Topological signatures. IEEE Transactions on Visualization and Computer Graphics. 2012;18:2382–2391. doi: 10.1109/TVCG.2012.248. [DOI] [PubMed] [Google Scholar]
- 28.Wang B, Summa B, Pascucci V, Vejdemo-Johansson M. Branching and Circular Features in High Dimensional Data. IEEE Transactions on Visualization and Computer Graphics. 2011;17:1902–1911. doi: 10.1109/TVCG.2011.177. [DOI] [PubMed] [Google Scholar]
- 29.Mischaikow K, Mrozek M, Reiss J, Szymczak A. Construction of Symbolic Dynamics from Experimental Time Series. Physical Review Letters. 1999;82:1144–1147. doi: 10.1103/PhysRevLett.82.1144. [DOI] [Google Scholar]
- 30.Gameiro, M. et al. Topological Measurement of Protein Compressibility Via Persistence Diagrams. preprint (2013).
- 31.Kasson PM, et al. Persistent Voids A New Structural Metric for Membrane Fusion. Bioinformatics. 2007;23:1753–1759. doi: 10.1093/bioinformatics/btm250. [DOI] [PubMed] [Google Scholar]
- 32.Wang B, Wei GW. Object-Oriented Persistent Homology. Journal of Computational Physics. 2016;305:276–299. doi: 10.1016/j.jcp.2015.10.036. [DOI] [PMC free article] [PubMed] [Google Scholar]
- 33.Xia KL, Feng X, Tong YY, Wei GW. Persistent Homology for The Quantitative Prediction of Fullerene Stability. Journal of Computational Chemsitry. 2015;36:408–422. doi: 10.1002/jcc.23816. [DOI] [PMC free article] [PubMed] [Google Scholar]
- 34.Xia KL, Wei GW. Persistent Homology Analysis of Protein Structure, Flexibility and Folding. International Journal for Numerical Methods in Biomedical Engineerings. 2014;30:814–844. doi: 10.1002/cnm.2655. [DOI] [PMC free article] [PubMed] [Google Scholar]
- 35.Xia KL, Wei GW. Multidimensional Persistence in Biomolecular Data. Journal Computational Chemistry. 2015;36:1502–1520. doi: 10.1002/jcc.23953. [DOI] [PMC free article] [PubMed] [Google Scholar]
- 36.Xia KL, Wei GW. Persistent Topology for Cryo-EM Data Analysis. International Journal for Numerical Methods in Biomedical Engineering. 2015;31:e02719. doi: 10.1002/cnm.2719. [DOI] [PubMed] [Google Scholar]
- 37.Yao Y, et al. Topological Methods for Exploring Low-Density States in Biomolecular Folding Pathways. The Journal of Chemical Physics. 2009;130:144115. doi: 10.1063/1.3103496. [DOI] [PMC free article] [PubMed] [Google Scholar]
- 38.Hiraoka Y, et al. Hierarchical Structures of Amorphous Solids Characterized by Persistent Homology. Proceedings of the National Academy of Sciences. 2016;113(26):7035–7040. doi: 10.1073/pnas.1520877113. [DOI] [PMC free article] [PubMed] [Google Scholar]
- 39.Saadatfar M, Takeuchi H, Robins V, Francois N, Hiraoka Y. Pore Configuration Landscape of Granular Crystallization. Nature communications. 2017;8:15082. doi: 10.1038/ncomms15082. [DOI] [PMC free article] [PubMed] [Google Scholar]
- 40.Tausz, A., Vejdemo-Johansson, M. & Adams, H. Javaplex: A Research Software Package for Persistent (co)Homology. Software available at http://code.google.com/p/javaplex (2011).
- 41.Nanda, V. Perseus: The Persistent Homology Software. Software Available at, http://www.sas.upenn.edu/~vnanda/perseus.
- 42.Bauer, U., Kerber, M. & Reininghaus, J. Distributed Computation of Persistent Homology. Proceedings of the Sixteenth Workshop on Algorithm Engineering and Experiments (ALENEX) (2014).
- 43.Dionysus: The Persistent Homology Software. Software Available at http://www.mrzv.org/software/dionysus.
- 44.Binchi J, Merelli E, Rucco M, Petri G, Vaccarino F. Jholes: A Tool for Understanding Biological Complex Networks Via Clique Weight Rank Persistent Homology. Electronic Notes in Theoretical Computer Science. 2014;306:5–18. doi: 10.1016/j.entcs.2014.06.011. [DOI] [Google Scholar]
- 45.Maria, C. Filtered Complexes. In GUDHI User and Reference Manual (GUDHI Editorial Board, 2015).
- 46.Bauer, U. Ripser: a lean C++ code for The Computation of Vietoris-Rips Persistence Barcodes. Software available athttps://github.com/Ripser/ripser (2017).
- 47.Bauer, U., Kerber, M., Reininghaus, J. & Wagner, H. PHAT–Persistent Homology Algorithms Toolbox. In International Congress on Mathematical Software, pages 137–143 (Springer, 2014).
- 48.Bauer, U., Kerber, M. & Reininghaus, J. Distributed Computation of Persistent Homology. In 2014 proceedings of the sixteenth workshop on algorithm engineering and experiments (ALENEX), pages 31–38 (SIAM, 2014).
- 49.Fasy, B. T., Kim, J., Lecci, F. & Maria, C. Introduction to The r Package tda. arXiv preprint arXiv:1411.1830 (2014).
- 50.Ghrist R. Barcodes: The Persistent Topology of Data. Bulletin of the American Mathematical Society. 2008;45(1):61–75. doi: 10.1090/S0273-0979-07-01191-3. [DOI] [Google Scholar]
- 51.Bubenik P. Statistical Topological Data Analysis Using Persistence Landscapes. The Journal of Machine Learning Research. 2015;16(1):77–102. [Google Scholar]
- 52.Bubenik P, Kim PT. A Statistical Approach to Persistent Homology. Homology, Homotopy and Applications. 2007;19:337–362. doi: 10.4310/HHA.2007.v9.n2.a12. [DOI] [Google Scholar]
- 53.Adams H, et al. Persistence Images: A Stable Vector Representation of Persistent Homology. The Journal of Machine Learning Research. 2017;18(1):218–252. [Google Scholar]
- 54.Chung, Y. M., Hu, C. S., Lawson, A. & Smyth, C. TopoResNet: A Hybrid Deep Learning Architecture and its Application to Skin Lesion Classification (2019).
- 55.Chung, Y. M. & Lawson, A. Persistence curves: A Canonical Framework for Summarizing Persistence Diagrams. (2019).
- 56.Bell, G., Lawson, A., Martin, J., Rudzinski, J. & Smyth, C. Weighted Persistent Homology. arXiv preprint arXiv:1709.00097 (2017).
- 57.Buchet M, Chazal F, Oudot SY, Sheehy DR. Efficient and Robust Persistent Homology For Measures. Computational Geometry. 2016;58:70–96. doi: 10.1016/j.comgeo.2016.07.001. [DOI] [Google Scholar]
- 58.Edelsbrunner, H. Weighted Alpha Shapes, volume 92 (University of Illinois at Urbana-Champaign, Department of Computer Science, 1992).
- 59.Guibas L, Morozov D, Mérigot Q. Witnessed k-Distance. Discrete & Computational Geometry. 2013;49(1):22–45. doi: 10.1007/s00454-012-9465-x. [DOI] [Google Scholar]
- 60.Xia KL, Zhao ZX, Wei GW. Multiresolution Persistent Homology for Excessively Large Biomolecular Datasets. The Journal of chemical physics. 2015;143(13):10B603_1. doi: 10.1063/1.4931733. [DOI] [PMC free article] [PubMed] [Google Scholar]
- 61.Petri G, Scolamiero M, Donato I, Vaccarino F. Topological Strata of Weighted Complex Networks. PloS one. 2013;8(6):e66506. doi: 10.1371/journal.pone.0066506. [DOI] [PMC free article] [PubMed] [Google Scholar]
- 62.Xia KL, Wei GW. Persistent Homology Analysis of Protein Structure, Flexibility, And Folding. International journal for numerical methods in biomedical engineering. 2014;30(8):814–844. doi: 10.1002/cnm.2655. [DOI] [PMC free article] [PubMed] [Google Scholar]
- 63.Dawson RJM. Homology of Weighted Simplicial Complexes. Cahiers de Topologie et Géométrie Différentielle Catégoriques. 1990;31(3):229–243. [Google Scholar]
- 64.Ren SQ, Wu CY, Wu J. Weighted Persistent Homology. Rocky Mountain Journal of Mathematics. 2018;48(8):2661–2687. doi: 10.1216/RMJ-2018-48-8-2661. [DOI] [Google Scholar]
- 65.Wu, C. Y., Ren, S. Q., Wu, J. & Xia, K. L. Weighted (co) Homology and Weighted Laplacian. arXiv preprint arXiv:1804.06990 (2018).
- 66.Xia KL, Zhao ZX, Wei GW. Multiresolution topological Simplification. Journal Computational Biology. 2015;22:1–5. doi: 10.1089/cmb.2015.0104. [DOI] [PMC free article] [PubMed] [Google Scholar]
- 67.Ahmed, M., Fasy, B. T. & Wenk, C. Local Persistent Homology Based Distance Between Maps. In Proceedings of the 22nd ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, pages 43–52 (ACM, 2014).
- 68.Bendich, P., Cohen-Steiner, D., Edelsbrunner, H., Harer, J. & Morozov, D. Inferring Local Homology from Sampled Stratified Spaces. In Foundations of Computer Science, 2007. FOCS’07. 48th Annual IEEE Symposium on, pages 536–546 (IEEE, 2007).
- 69.Bendich, P., Gasparovic, E., Harer, J., Izmailov, R. & Ness, L. Multi-Scale Local Shape Analysis and Feature Selection in Machine Learning Applications. In Neural Networks (IJCNN), 2015 International Joint Conference on, pages 1–8 (IEEE, 2015).
- 70.Bendich, P., Wang, B. & Mukherjee, S. Local Homology Transfer and Stratification Learning. In Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms, pages 1355–1370 (SIAM, 2012).
- 71.Fasy, B. T. & Wang, B. Exploring Persistent Local Homology in Topological Data Analysis. In Acoustics, Speech and Signal Processing (ICASSP), 2016 IEEE International Conference on, pages 6430–6434 (IEEE, 2016).
- 72.Munkres, J. R. Elements of algebraic topology (CRC Press, 2018).
- 73.Chintakunta H, Gentimis T, Gonzalez-Diaz R, Jimenez MJ, Krim H. An Entropy-Based Persistence Barcode. Pattern Recognition. 2015;48(2):391–401. doi: 10.1016/j.patcog.2014.06.023. [DOI] [Google Scholar]
- 74.Lu XJ, Olson WK. 3DNA: A Software Package for The Analysis, Rebuilding and Visualization Of Three-Dimensional Nucleic Acid Structures. Nucleic acids research. 2003;31(17):5108–5121. doi: 10.1093/nar/gkg680. [DOI] [PMC free article] [PubMed] [Google Scholar]
- 75.Lu XJ, El Hassan MA, Hunter CA. Structure and Conformation of Helical Nucleic Acids: Analysis Program (SCHNAaP) Journal of molecular biology. 1997;273(3):668–680. doi: 10.1006/jmbi.1997.1346. [DOI] [PubMed] [Google Scholar]
- 76.Pun, C. S., Xia, K. L. & Lee, S. X. Persistent-Homology-Based Machine Learning and its Applications–A Survey. arXiv preprint arXiv:1811.00252 (2018).
- 77.Hess B, Kutzner C, Van Der Spoel D, Lindahl E. GROMACS 4: Algorithms for Highly Efficient, Load-Balanced, and Scalable Molecular Simulation. Journal of chemical theory and computation. 2008;4(3):435–447. doi: 10.1021/ct700301q. [DOI] [PubMed] [Google Scholar]
- 78.Meng ZY, Kubar T, Mu YG, Shao FW. A Molecular Dynamics-Quantum Mechanics Theoretical Study of DNA-Mediated Charge Transport in Hydrated Ionic Liquids. Journal of chemical theory and computation. 2018;14(5):2733–2742. doi: 10.1021/acs.jctc.7b01201. [DOI] [PubMed] [Google Scholar]
Associated Data
This section collects any data citations, data availability statements, or supplementary materials included in this article.