Nicholas M. Glykos

Learn More
A computer program has been developed to aid the analysis of molecular dynamics trajectories. The program is tuned for macromolecular large-scale problems and supports features such as removal of global translations-rotations of the solute, calculation of average distance maps and their corresponding standard deviations, calculation of the(More)
We report the availability of grcarma, a program encoding for a fully automated set of tasks aiming to simplify the analysis of molecular dynamics trajectories of biological macromolecules. It is a cross-platform, Perl/Tk-based front-end to the program carma and is designed to facilitate the needs of the novice as well as those of the expert user, while at(More)
A computational solution to the protein folding problem is the holy grail of biomolecular simulation and of the corresponding force fields. The complexity of the systems used for folding simulations precludes a direct feedback between the simulations and the force fields, thus necessitating the study of simpler systems with sufficient experimental data to(More)
Conventional wisdom has it that the presence of disordered regions in the three-dimensional structures of polypeptides not only does not contribute significantly to the thermodynamic stability of their folded state, but, on the contrary, that the presence of disorder leads to a decrease of the corresponding proteins' stability. We have performed extensive(More)
We present Pinda, a Web service for the detection and analysis of possible duplications of a given protein or DNA sequence within a source species. Pinda fully automates the whole gene duplication detection procedure, from performing the initial similarity searches, to generating the multiple sequence alignments and the corresponding phylogenetic trees, to(More)
Detailed knowledge of the influence of various parameters on macromolecular solubility is essential for crystallization. The concept of so-called 'ionic strength reducers' provides insight into the changes in solubility induced by organic solvents and hydrophilic polymers in aqueous electrolytic solutions. A simple and efficient procedure is presented which(More)
We describe a robust, fast, and memory-efficient procedure that can cluster millions of structures derived from molecular dynamics simulations. The essence of the method is based on a peak-picking algorithm applied to three-and five-dimensional distributions of the principal components derived from the trajectory and automatically supports both Cartesian(More)
Quantifying convergence and sufficient sampling of macromolecular molecular dynamics simulations is more often than not a source of controversy (and of various ad hoc solutions) in the field. Clearly, the only reasonable, consistent, and satisfying way to infer convergence (or otherwise) of a molecular dynamics trajectory must be based on probability(More)
  • 1