scispace - formally typeset
Search or ask a question
Author

Lee G. Pedersen

Bio: Lee G. Pedersen is an academic researcher from University of North Carolina at Chapel Hill. The author has contributed to research in topics: Ab initio & Molecular orbital. The author has an hindex of 46, co-authored 251 publications receiving 44444 citations. Previous affiliations of Lee G. Pedersen include Research Triangle Park & National Institutes of Health.


Papers
More filters
Journal ArticleDOI
TL;DR: An N⋅log(N) method for evaluating electrostatic energies and forces of large periodic systems is presented based on interpolation of the reciprocal space Ewald sums and evaluation of the resulting convolutions using fast Fourier transforms.
Abstract: An N⋅log(N) method for evaluating electrostatic energies and forces of large periodic systems is presented. The method is based on interpolation of the reciprocal space Ewald sums and evaluation of the resulting convolutions using fast Fourier transforms. Timings and accuracies are presented for three large crystalline ionic systems.

24,332 citations

Journal ArticleDOI
TL;DR: It is demonstrated that arbitrary accuracy can be achieved, independent of system size N, at a cost that scales as N log(N), which is comparable to that of a simple truncation method of 10 A or less.
Abstract: The previously developed particle mesh Ewald method is reformulated in terms of efficient B‐spline interpolation of the structure factors This reformulation allows a natural extension of the method to potentials of the form 1/rp with p≥1 Furthermore, efficient calculation of the virial tensor follows Use of B‐splines in place of Lagrange interpolation leads to analytic gradients as well as a significant improvement in the accuracy We demonstrate that arbitrary accuracy can be achieved, independent of system size N, at a cost that scales as N log(N) For biomolecular systems with many thousands of atoms this method permits the use of Ewald summation at a computational cost comparable to that of a simple truncation method of 10 A or less

17,897 citations

Journal ArticleDOI
TL;DR: The GA/KNN method is capable of selecting a subset of predictive genes from a large noisy data set for sample classification and is a multivariate approach that can capture the correlated structure in the data.
Abstract: Motivation: We recently introduced a multivariate approach that selects a subset of predictive genes jointly for sample classification based on expression data. We tested the algorithm on colon and leukemia data sets. As an extension to our earlier work, we systematically examine the sensitivity, reproducibility and stability of gene selection/sample classification to the choice of parameters of the algorithm. Methods: Our approach combines a Genetic Algorithm (GA) and the k-Nearest Neighbor (KNN) method to identify genes that can jointly discriminate between different classes of samples (e.g. normal versus tumor). The GA/KNN method is a stochastic supervised pattern recognition method. The genes identified are subsequently used to classify independent test set samples. Results: The GA/KNN method is capable of selecting a subset of predictive genes from a large noisy data set for sample classification. It is a multivariate approach that can capture the correlated structure in the data. We find that for a given data set gene selection is highly repeatable in independent runs using the GA/KNN method. In general, however, gene selection may be less robust than classification. Availability: The method is available at http://dir.niehs.nih. gov/microarray/datamining

647 citations

Journal ArticleDOI
TL;DR: This paper presents the results of a large-scale parallel supercomputing experiment conducted at the North Carolina Supercomputing Center (NCSC) using the HL-06350 supercomputer, a state-of-the-art supercomputer developed at the National Institutes of Health (NIEHS) in 2015.

597 citations

Journal ArticleDOI
TL;DR: In this article, Darden et al. showed that long-range electrostatic interactions are essential for proper representation of the HIV-1 protease crystal structure and showed that the particle mesh Ewald method represents an efficient implementation of the Particle Mesh Ewald (PME) method.
Abstract: Simulations of the HIV‐1 protease unit cell using a 9 A cutoff, 9/18 A ‘‘twin‐range’’ cutoff, and full Ewald sums have been carried out to 300 ps. The results indicate that long‐range electrostatic interactions are essential for proper representation of the HIV‐1 protease crystal structure. The 9 A simulation did not converge in 300 ps. Inclusion of a 9/18 A ‘‘twin‐range’’ cutoff showed significant improvement. Simulation using the Ewald summation convention gave the best overall agreement with x‐ray crystallographic data, and showed the least internal differences in the time average structures of the asymmetric units. The Ewald simulation represents an efficient implementation of the Particle Mesh Ewald method [Darden et al., J. Chem. Phys. 98, 10 089 (1993)], and illustrates the importance of including long‐range electrostatic forces in large macromolecular systems.

588 citations


Cited by
More filters
01 May 1993
TL;DR: Comparing the results to the fastest reported vectorized Cray Y-MP and C90 algorithm shows that the current generation of parallel machines is competitive with conventional vector supercomputers even for small problems.
Abstract: Three parallel algorithms for classical molecular dynamics are presented. The first assigns each processor a fixed subset of atoms; the second assigns each a fixed subset of inter-atomic forces to compute; the third assigns each a fixed spatial region. The algorithms are suitable for molecular dynamics models which can be difficult to parallelize efficiently—those with short-range forces where the neighbors of each atom change rapidly. They can be implemented on any distributed-memory parallel machine which allows for message-passing of data between independently executing processors. The algorithms are tested on a standard Lennard-Jones benchmark problem for system sizes ranging from 500 to 100,000,000 atoms on several parallel supercomputers--the nCUBE 2, Intel iPSC/860 and Paragon, and Cray T3D. Comparing the results to the fastest reported vectorized Cray Y-MP and C90 algorithm shows that the current generation of parallel machines is competitive with conventional vector supercomputers even for small problems. For large problems, the spatial algorithm achieves parallel efficiencies of 90% and a 1840-node Intel Paragon performs up to 165 faster than a single Cray C9O processor. Trade-offs between the three algorithms and guidelines for adapting them to more complex molecular dynamics simulations are also discussed.

29,323 citations

Journal ArticleDOI
TL;DR: An N⋅log(N) method for evaluating electrostatic energies and forces of large periodic systems is presented based on interpolation of the reciprocal space Ewald sums and evaluation of the resulting convolutions using fast Fourier transforms.
Abstract: An N⋅log(N) method for evaluating electrostatic energies and forces of large periodic systems is presented. The method is based on interpolation of the reciprocal space Ewald sums and evaluation of the resulting convolutions using fast Fourier transforms. Timings and accuracies are presented for three large crystalline ionic systems.

24,332 citations

28 Jul 2005
TL;DR: PfPMP1)与感染红细胞、树突状组胞以及胎盘的单个或多个受体作用,在黏附及免疫逃避中起关键的作�ly.
Abstract: 抗原变异可使得多种致病微生物易于逃避宿主免疫应答。表达在感染红细胞表面的恶性疟原虫红细胞表面蛋白1(PfPMP1)与感染红细胞、内皮细胞、树突状细胞以及胎盘的单个或多个受体作用,在黏附及免疫逃避中起关键的作用。每个单倍体基因组var基因家族编码约60种成员,通过启动转录不同的var基因变异体为抗原变异提供了分子基础。

18,940 citations

Journal ArticleDOI
TL;DR: It is demonstrated that arbitrary accuracy can be achieved, independent of system size N, at a cost that scales as N log(N), which is comparable to that of a simple truncation method of 10 A or less.
Abstract: The previously developed particle mesh Ewald method is reformulated in terms of efficient B‐spline interpolation of the structure factors This reformulation allows a natural extension of the method to potentials of the form 1/rp with p≥1 Furthermore, efficient calculation of the virial tensor follows Use of B‐splines in place of Lagrange interpolation leads to analytic gradients as well as a significant improvement in the accuracy We demonstrate that arbitrary accuracy can be achieved, independent of system size N, at a cost that scales as N log(N) For biomolecular systems with many thousands of atoms this method permits the use of Ewald summation at a computational cost comparable to that of a simple truncation method of 10 A or less

17,897 citations

Journal ArticleDOI
TL;DR: NAMD as discussed by the authors is a parallel molecular dynamics code designed for high-performance simulation of large biomolecular systems that scales to hundreds of processors on high-end parallel platforms, as well as tens of processors in low-cost commodity clusters, and also runs on individual desktop and laptop computers.
Abstract: NAMD is a parallel molecular dynamics code designed for high-performance simulation of large biomolecular systems. NAMD scales to hundreds of processors on high-end parallel platforms, as well as tens of processors on low-cost commodity clusters, and also runs on individual desktop and laptop computers. NAMD works with AMBER and CHARMM potential functions, parameters, and file formats. This article, directed to novices as well as experts, first introduces concepts and methods used in the NAMD program, describing the classical molecular dynamics force field, equations of motion, and integration methods along with the efficient electrostatics evaluation algorithms employed and temperature and pressure controls used. Features for steering the simulation across barriers and for calculating both alchemical and conformational free energy differences are presented. The motivations for and a roadmap to the internal design of NAMD, implemented in C++ and based on Charm++ parallel objects, are outlined. The factors affecting the serial and parallel performance of a simulation are discussed. Finally, typical NAMD use is illustrated with representative applications to a small, a medium, and a large biomolecular system, highlighting particular features of NAMD, for example, the Tcl scripting language. The article also provides a list of the key features of NAMD and discusses the benefits of combining NAMD with the molecular graphics/sequence analysis software VMD and the grid computing/collaboratory software BioCoRE. NAMD is distributed free of charge with source code at www.ks.uiuc.edu.

14,558 citations