XtalView/Xfit--A versatile program for manipulating atomic coordinates and electron density.

D E McRee

doi:10.1006/jsbi.1999.4094

Home/Archive/PubMed

PubMed · 10222271

XtalView/Xfit--A versatile program for manipulating atomic coordinates and electron density.

D E McRee

View original source ↗Export metadata ↓

Abstract

Xfit is a model-building and map viewing program in XtalView that is used by the structural biology community including researchers in the fields of crystallography, molecular modeling, and electron microscopy. Among its distinguishing features are built-in fast Fourier transforms that allow users flexibility in map calculations including the creation of OMIT maps and the updating of structure factors to reflect model changes from within the program. Written in C and using the freely available XView toolkit, it is highly portable to almost any X-windows based workstation including Intel-based LINUX systems. Its user interface is designed to aid in facile model-building and contains a semiautomated fitting system that allows the user to interactively and rapidly build chain de novo into an electron density map. The program is highly optimized to allow such features as interactive contour levels and map calculations to be completed within a few seconds. Features in the latest version including phase-combination, solvent-flattening, automated water addition, and small-probe dot contact surfaces, as well as basic design features, are discussed.

Explore related subjects

Computing Methodologies Crystallography, X-Ray Data Display Electrons Fourier Analysis Microscopy, Electron Models, Molecular Molecular Structure Programming Languages Protein Conformation Software User-Computer Interface Water Journal Article Research Support, U.S. Gov't, Non-P.H.S.

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

D E McRee. XtalView/Xfit--A versatile program for manipulating atomic coordinates and electron density.. https://doi.org/10.1006/jsbi.1999.4094

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related citations

PubMed2000

Molecular computing. RNA works out knight moves.

Explore the source record for details and available documents.

Computing Methodologies↗

PubMed2000

DNA computing on surfaces.

DNA computing was proposed as a means of solving a class of intractable computational problems in which the computing time can grow exponentially with problem size (the 'NP-complete' or non-deterministic polynomial time complete problems). The principle of the technique has been demonstrated experimentally for a simple example of the hamiltonian path problem (in this case, finding an airline flight path between several cities, such that each city is visited only once). DNA computational approaches to the solution of other problems have also been investigated. One technique involves the immobilization and manipulation of combinatorial mixtures of DNA on a support. A set of DNA molecules encoding all candidate solutions to the computational problem of interest is synthesized and attached to the surface. Successive cycles of hybridization operations and exonuclease digestion are used to identify and eliminate those members of the set that are not solutions. Upon completion of all the multistep cycles, the solution to the computational problem is identified using a polymerase chain reaction to amplify the remaining molecules, which are then hybridized to an addressed array. The advantages of this approach are its scalability and potential to be automated (the use of solid-phase formats simplifies the complex repetitive chemical processes, as has been demonstrated in DNA and protein synthesis). Here we report the use of this method to solve a NP-complete problem. We consider a small example of the satisfiability problem (SAT), in which the values of a set of boolean variables satisfying certain logical constraints are determined.

Computing Methodologies↗

PubMed2000

Computing with DNA by operating on plasmids.

A new method of computing using DNA plasmids is introduced and the potential advantages are listed. The new method is illustrated by reporting a laboratory computation of an instance of the NP-complete algorithmic problem of computing the cardinal number of a maximal independent subset of the vertex set of a graph. A circular DNA plasmid, specifically designed for this method of molecular computing, was constructed. This computational plasmid contains a specially inserted series of DNA sequence segments, each of which is bordered by a characteristic pair of restriction enzyme sites. For the computation reported here, the DNA sequence segments of this series were used to represent the vertices of the graph being investigated. By applying a scheme of enzymatic treatments to the computational plasmids, modified plasmids were generated from which the solution of the computational problem was selected. This new method of computing is applicable to a wide variety of algorithmic problems. Further computations in this style are in progress.

Computing Methodologies↗