Introduction to Protein Structure Prediction 2010
DOI: 10.1002/9780470882207.ch8
|View full text |Cite
|
Sign up to set email alerts
|

A Survey of Remote Homology Detection and Fold Recognition Methods

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
3
0

Year Published

2015
2015
2020
2020

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(3 citation statements)
references
References 78 publications
0
3
0
Order By: Relevance
“…Knowledge based methods for protein and peptide modeling use comparative statistical analysis to predict the structure of the amino acid sequence of the target protein from (i) the sequence of homologous proteins of known structure; or (ii) a database of protein structures (Rangwala 2010). The accuracy of this approach relies on the current knowledge of protein structures and evolutionary relationships.…”
Section: Knowledge Based Methodsmentioning
confidence: 99%
“…Knowledge based methods for protein and peptide modeling use comparative statistical analysis to predict the structure of the amino acid sequence of the target protein from (i) the sequence of homologous proteins of known structure; or (ii) a database of protein structures (Rangwala 2010). The accuracy of this approach relies on the current knowledge of protein structures and evolutionary relationships.…”
Section: Knowledge Based Methodsmentioning
confidence: 99%
“…However, bijective functions allow only 1-1 matching and, in some cases, this may be not enough. For example, in the study of remote homologous proteins [9] (i.e., proteins having a pairwise sequence identity lower than 25%), it may be necessary to study protein similarities based on different kinds of amino acid property, such as chemical behavior or protein profiles, thus resulting in the necessity to allow many-to-many matches among amino acids. As a further example, bijective matching functions between words may miss common situations while comparing bilingual text corpora, where different words share the same meaning; for instance, English words Hello and Goodbye can be both interchangeably matched with Italian words Ciao, Salve, and Addio.…”
Section: Introductionmentioning
confidence: 99%
“…1 ≤ | 1 | and 0 < π 2 ≤ | 2 |; the Multi-Parameterized Edit Distance between s 1 and s 2 (L π 1 ,π 2 ,χ (s 1 , s 2 ), for short)is the minimum distance that can be obtained with any π 1 , π 2 , χ -constrained matching schema and any alignment s 1 ,s 2 . Formally:A L = 1 , 2 , π 1 , π 2 , χ , M, L M (•, •)(8)andF L (s 1 , s 2 ) = L π 1 ,π 2 ,χ (s 1 , s 2 ) = min M π 1 ,π 2 ,χ ∈M {L M (s 1 , s 2 )}(9) …”
mentioning
confidence: 99%