.png){kind=icon}
.png){kind=icon}
Return
Very efficient search for protein alignment-VESPA
.png){kind=icon}
PRE
AI
DOI：10.1002/jcc.22903.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
A novel approach to the problem of protein alignments is described, which in comparison with existing approaches is visibly more efficient. This approach is based on superposition of amino acid adjacency matrices of a pair of proteins, which have been modified to record the sequential order of amino acids. As a result, one obtains simultaneously all segments of the two proteins which are shifted relative to one another by one or more positions in either directions, without need of a prior exhaustive search for an alignment that included unproductive directions and unknown displacement steps. (C) 2011 Wiley Periodicals, Inc. J Comput Chem, 2012
Keywords:
protein alignment
amino acid adjacency matrix
AH matrix
VESPA
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4.8
Papers:
7.1K
Citations:
6.1W
Organization
No organization information available