2005
DOI: 10.1016/j.sbi.2005.05.005
|View full text |Cite
|
Sign up to set email alerts
|

The limits of protein sequence comparison?

Abstract: Modern sequence alignment algorithms are used routinely to identify homologous proteins, proteins that share a common ancestor. Homologous proteins always share similar structures and often have similar functions. Over the past 20 years, sequence comparison has become both more sensitive, largely because of profile-based methods, and more reliable, because of more accurate statistical estimates. As sequence and structure databases become larger, and comparison methods become more powerful, reliable statistical… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
59
0

Year Published

2006
2006
2020
2020

Publication Types

Select...
7
2

Relationship

0
9

Authors

Journals

citations
Cited by 74 publications
(60 citation statements)
references
References 57 publications
(55 reference statements)
1
59
0
Order By: Relevance
“…Furthermore, we aim to improve protein structure prediction approaches on the basis of nonsequential structural relations. In this context, multiple structure alignments with GANGSTA+ that can be used to define new sequence similarity measures for sequence alignment methods could be a promising direction (Schwartz and Dayhoff 1978;Pearson and Lipman 1988;Henikoff and Henikoff 1992;Altschul et al 1997;Pearson and Sierk 2005).…”
Section: Discussionmentioning
confidence: 99%
“…Furthermore, we aim to improve protein structure prediction approaches on the basis of nonsequential structural relations. In this context, multiple structure alignments with GANGSTA+ that can be used to define new sequence similarity measures for sequence alignment methods could be a promising direction (Schwartz and Dayhoff 1978;Pearson and Lipman 1988;Henikoff and Henikoff 1992;Altschul et al 1997;Pearson and Sierk 2005).…”
Section: Discussionmentioning
confidence: 99%
“…Specifically, BLAST was not designed to calculate protein homology but uses a heuristic method to produce an e-value and bitscore; what can be derived from BLAST output has been usefully discussed by Pearson and Sierk (2005): "if a similarity score is not random, then the sequences must be not unrelated." In other terms, every alignment that passes a reasonable e-value test denotes statistically significant sequence similarity, suggesting the sequences are related.…”
Section: Annotationmentioning
confidence: 99%
“…Hits with similar bitscores do not necessarily align to the same part of the protein or have similar alignment length, underlining the risk in considering them as "similar." We believe this apparent pitfall, sometimes made due to a misconception regarding the nature of bitscore in BLAST output (Pertsemlidis and Fondon, 2001;Pearson and Sierk, 2005), could be avoided by considering an optimal bitscore, representing the highest possible bitscore generated by a given alignment. Simply aligning the part of the protein involved in the alignment with itself gives the optimal bitscore (previous scoring parameters are maintained).…”
Section: Percentage Optimal Bitscorementioning
confidence: 99%
“…The objective when using a sequence alignment for database searching [objective (iii)] is to maximise the distinction between homologous and non-homologous sequences (reviewed by Pearson and Sierk 2005). That is, we want the high-scoring database matches to be sequences that are homologous to our query sequence, and nonhomologous sequences to be low-scoring matches.…”
Section: Tpchtsghicyfvsk-pggseppavftgdtlf Structure ----------Ssss---mentioning
confidence: 99%