@misc{WeberMeyer, author = {Weber, Marcus and Meyer, Holger}, title = {ZIBgridfree - Adaptive Conformation Analysis with qualified Support of Transition States and Thermodynamic Weights}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-8514}, number = {05-17}, abstract = {This paper introduces a new algorithm of conformational analysis based on mesh-free methods as described in [M. Weber. Mehless methods in Conformation Dynamics.(2005)]. The adaptive decomposition of the conformational space by softly limiting functions avoids trapping effects and allows adaptive refinement strategies. These properties of the algorithm makes ZIBgridfree particularly suitable for the complete exploration of high-dimensional conformational space. The adaptive control of the algorithm benefits from the tight integration of molecular simulation and conformational analysis. An emphasized part of the analysis is the Robust Perron Cluster Analysis (PCCA+) based on the work of Peter Deuflhard and Marcus Weber. PCCA+ supports an almost-characteristic cluster definition with an outstanding mapping of transition states. The outcome is expressed by the metastable sets of conformations, their thermodynamic weights and flexibility.}, language = {en} } @misc{GalliatDeuflhardRoitzschetal., author = {Galliat, Tobias and Deuflhard, Peter and Roitzsch, Rainer and Cordes, Frank}, title = {Automatic Identification of Metastable Conformations via Self-Organized Neural Networks}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-6197}, number = {00-51}, abstract = {As has been shown recently, the identification of metastable chemical conformations leads to a Perron cluster eigenvalue problem for a reversible Markov operator. Naive discretization of this operator would suffer from combinatorial explosion. As a first remedy, a pre-identification of essential degrees of freedom out of the set of torsion angles had been applied up to now. The present paper suggests a different approach based on neural networks: its idea is to discretize the Markov operator via self-organizing (box) maps. The thus obtained box discretization then serves as a prerequisite for the subsequent Perron cluster analysis. Moreover, this approach also permits exploitation of additional structure within embedded simulations. As it turns out, the new method is fully automatic and efficient also in the treatment of biomolecules. This is exemplified by numerical results.}, language = {en} } @misc{WeberGalliat, author = {Weber, Marcus and Galliat, Tobias}, title = {Characterization of Transition States in Conformational Dynamics using Fuzzy Sets}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-6791}, number = {02-12}, abstract = {Recently, a novel approach for the analysis of molecular dynamics on the basis of a transfer operator has been introduced. Therein conformations are considered to be disjoint metastable clusters within position space of a molecule. These clusters are defined by almost invariant characteristic functions that can be computed via {\em Perron Cluster} analysis. The present paper suggests to replace crisp clusters with {\em fuzzy} clusters, i.e. to replace characteristic functions with membership functions. This allows a more sufficient characterization of transiton states between different confor conformations and therefore leads to a better understanding of molecular dynamics. Fur thermore, an indicator for the uniqueness of metastable fuzzy clusters and a fast algorithm for the computation of these clusters are described. Numerical examples are included.}, language = {en} } @misc{CordesWeberSchmidtEhrenberg, author = {Cordes, Frank and Weber, Marcus and Schmidt-Ehrenberg, Johannes}, title = {Metastable Conformations via successive Perron-Cluster Cluster Analysis of dihedrals}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-7074}, number = {02-40}, abstract = {Decomposition of the high dimensional conformational space of bio-molecules into metastable subsets is used for data reduction of long molecular trajectories in order to facilitate chemical analysis and to improve convergence of simulations within these subsets. The metastability is identified by the Perron-cluster cluster analysis of a Markov process that generates the thermodynamic distribution. A necessary prerequisite of this analysis is the discretization of the conformational space. A combinatorial approach via discretization of each degree of freedom will end in the so called ''curse of dimension''. In the following paper we analyze Hybrid Monte Carlo simulations of small, drug-like biomolecules and focus on the dihedral degrees of freedom as indicators of conformational changes. To avoid the ''curse of dimension'', the projection of the underlying Markov operator on each dihedral is analyzed according to its metastability. In each decomposition step of a recursive procedure, those significant dihedrals, which indicate high metastability, are used for further decomposition. The procedure is introduced as part of a hierarchical protocol of simulations at different temperatures. The convergence of simulations within metastable subsets is used as an ''a posteriori'' criterion for a successful identification of metastability. All results are presented with the visualization program AmiraMol.}, language = {en} } @misc{KubeWeber, author = {Kube, Susanna and Weber, Marcus}, title = {Conformation Kinetics as a Reduced Model for Transition Pathways}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-8763}, number = {05-43}, abstract = {The complexity of molecular kinetics can be reduced significantly by a restriction to metastable conformations which are almost invariant sets of molecular dynamical systems. With the Robust Perron Cl uster Analysis PCCA+, developed by Weber and Deuflhard, we have a tool available which can be used to identify these conformations from a transition probability matrix. This method can also be applied to the corresponding transition rate matrix which provides important information concerning transition pathways of single molecules. In the present paper, we explain the relationship between these tw o concepts and the extraction of conformation kinetics from transition rates. Moreover, we show how transition rates can be approximated and conclude with numerical examples.}, language = {en} } @misc{WeberRungsarityotinSchliep, author = {Weber, Marcus and Rungsarityotin, Wasinee and Schliep, Alexander}, title = {Perron Cluster Analysis and Its Connection to Graph Partitioning for Noisy Data}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-8140}, number = {04-39}, abstract = {The problem of clustering data can be formulated as a graph partitioning problem. Spectral methods for obtaining optimal solutions have reveceived a lot of attention recently. We describe Perron Cluster Cluster Analysis (PCCA) and, for the first time, establish a connection to spectral graph partitioning. We show that in our approach a clustering can be efficiently computed using a simple linear map of the eigenvector data. To deal with the prevalent problem of noisy and possibly overlapping data we introduce the min Chi indicator which helps in selecting the number of clusters and confirming the existence of a partition of the data. This gives a non-probabilistic alternative to statistical mixture-models. We close with showing favorable results on the analysis of gene expressi on data for two different cancer types.}, language = {en} } @misc{Weber, author = {Weber, Marcus}, title = {Improved Perron Cluster Analysis}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-7260}, number = {03-04}, abstract = {The problem of clustering data can often be transformed into the problem of finding a hidden block diagonal structure in a stochastic matrix. Deuflhard et al. have proposed an algorithm that state s the number \$k\$ of clusters and uses the sign structure of \$k\$ eigenvectors of the stochastic matrix to solve the cluster problem. Recently Weber and Galliat discovered that this system of eigenvectors can easily be transformed into a system of \$k\$ membership functions or soft characteristic functions describing the clusters. In this article we explain the corresponding cluster algorithm and point out the underlying theory. By means of numerical examples we explain how the grade of membership can be interpreted.}, language = {en} } @misc{DeuflhardWeber, author = {Deuflhard, Peter and Weber, Marcus}, title = {Robust Perron Cluster Analysis in Conformation Dynamics}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-7415}, number = {03-19}, abstract = {The key to molecular conformation dynamics is the direct identification of metastable conformations, which are almost invariant sets of molecular dynamical systems. Once some reversible Markov operator has been discretized, a generalized symmetric stochastic matrix arises. This matrix can be treated by Perron cluster analysis, a rather recent method involving a Perron cluster eigenproblem. The paper presents an improved Perron cluster analysis algorithm, which is more robust than earlier suggestions. Numerical examples are included.}, language = {en} } @misc{Weber, author = {Weber, Marcus}, title = {Clustering by using a simplex structure}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-7782}, number = {04-03}, abstract = {In this paper we interpret clustering as a mapping of data into a simplex. If the data itself has simplicial struture this mapping becomes linear. Spectral analysis is an often used tool for clustering data. We will show that corresponding singular vectors or eigenvectors comprise simplicial structure. Therefore they lead to a cluster algorithm, which consists of a simple linear mapping. An example for this kind of algorithms is the Perron cluster analysis (PCCA). We have applied it in practice to identify metastable sets of molecular dynamical systems. In contrast to other algorithms, this kind of approach provides an a priori criterion to determine the number of clusters. In this paper we extend the ideas to more general problems like clustering of bipartite graphs.}, language = {en} } @misc{WeberWalterKubeetal., author = {Weber, Marcus and Walter, Lionel and Kube, Susanna and Deuflhard, Peter}, title = {Stable computation of probability densities for metastable dynamical systems}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-9331}, number = {06-39}, abstract = {Whenever the invariant stationary density of metastable dynamical systems decomposes into almost invariant partial densities, its computation as eigenvector of some transition probability matrix is an ill-conditioned problem. In order to avoid this computational difficulty, we suggest to apply an aggregation/disaggregation method which only addresses wellconditioned sub-problems and thus results in a stable algorithm. In contrast to existing methods, the aggregation step is done via a sampling algorithm which covers only small patches of the sampling space. Finally, the theoretical analysis is illustrated by two biomolecular examples.}, language = {en} }