Rmsd Len Time Rmsd Len Time Rmsd Len Time

نویسندگان

  • C. A. Orengo
  • D. T. Jones
چکیده

This paper proposes new algorithms for protein structure alignment. Protein structure alignment is, given two three-dimensional protein structures, to nd spatially equivalent residue pairs. Each algorithm consists of the following two steps: rst an initial superposition is computed; then a structure alignment is computed and re ned using bipartite graph matching. The proposed algorithms are shown to be useful through an experimental comparison with a previous alignment algorithm.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Data Dp Rand Frag Data 1 Data 2 Rmsd Len Time Rmsd Len Time Rmsd Len Time

This paper proposes new algorithms for protein structure alignment. Protein structure alignment is, given two three-dimensional protein structures, to nd spatially equivalent residue pairs. Each algorithm consists of the following two steps: rst an initial superposition is computed; then a structure alignment is computed and re ned using bipartite graph matching. The proposed algorithms are sho...

متن کامل

Efficient Substructure RMSD Query Algorithms

Protein structure analysis is a very important research topic in the molecular biology of the post-genomic era. The root mean square deviation (RMSD) is the most frequently used measure for comparing two protein three-dimensional (3-D) structures. In this paper, we deal with two fundamental problems related to the RMSD. We first deal with a problem called the "range RMSD query" problem. Given a...

متن کامل

The Weighted All-Pairs-Shortest-Path-Length Problem on Two-Terminal Series-Parallel Graphs

Let G(V, E) be a n-vertex graph with V = { , ..., } and each edge e = ( , ) is associated with two real weights, W( → ) and W( → ). Let P be a path from any source vertex s to any destination vertex d and assume that P is s = → → ... → = d, t ≥ 2. The length of P, denoted by Len(P), is defined as ∑ . Given any two distinct vertices s and d, the length from s to d is defined as Len(s ⇒ d) = min{...

متن کامل

Relaxation Estimation of RMSD in Molecular Dynamics Immunosimulations

Molecular dynamics simulations have to be sufficiently long to draw reliable conclusions. However, no method exists to prove that a simulation has converged. We suggest the method of "lagged RMSD-analysis" as a tool to judge if an MD simulation has not yet run long enough. The analysis is based on RMSD values between pairs of configurations separated by variable time intervals Δt. Unless RMSD(Δ...

متن کامل

Multiple structure alignment by optimal RMSD implies that the average structure is a consensus.

Root mean square deviation (RMSD) is often used to measure the difference between structures. We show mathematically that, for multiple structure alignment, the minimum RMSD (weighted at aligned positions or unweighted) for all pairs is the same as the RMSD to the average of the structures. Thus, using RMSD implies that the average is a consensus structure. We use this property to validate and ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1995