2010
DOI: 10.1016/j.patrec.2010.04.010
|View full text |Cite
|
Sign up to set email alerts
|

An algorithm to find distant repeats in a pair of protein sequences

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2011
2011
2011
2011

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 17 publications
0
1
0
Order By: Relevance
“…A PAM 250 matrix (Dayhoff et al, 1978) works well for weighting purposes, because at this evolutionary distance, only one in five amino acid residues remains unchanged (250 mutation events for every 100 amino acids). The two recently developed algorithms for finding distant repeats in protein sequences (Banerjee, Sarani et al, 2008;Sabarinathan et al, 2010) are implemented in the web server.…”
Section: Computing Server To Find Distant Repeatsmentioning
confidence: 99%
“…A PAM 250 matrix (Dayhoff et al, 1978) works well for weighting purposes, because at this evolutionary distance, only one in five amino acid residues remains unchanged (250 mutation events for every 100 amino acids). The two recently developed algorithms for finding distant repeats in protein sequences (Banerjee, Sarani et al, 2008;Sabarinathan et al, 2010) are implemented in the web server.…”
Section: Computing Server To Find Distant Repeatsmentioning
confidence: 99%