2005
DOI: 10.1186/1471-2105-6-82
|View full text |Cite
|
Sign up to set email alerts
|

Super paramagnetic clustering of protein sequences

Abstract: Background: Detection of sequence homologues represents a challenging task that is important for the discovery of protein families and the reliable application of automatic annotation methods. The presence of domains in protein families of diverse function, inhomogeneity and different sizes of protein families create considerable difficulties for the application of published clustering methods.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
13
0

Year Published

2008
2008
2018
2018

Publication Types

Select...
5
2
2

Relationship

0
9

Authors

Journals

citations
Cited by 35 publications
(13 citation statements)
references
References 32 publications
0
13
0
Order By: Relevance
“…SPC is based on computing the K -nearest neighborhood to produce a cluster relationship matrix and a hierarchical tree of clusters. Specifically, SPC is implemented as Sorting Points Into Neighborhood (SPIN) [ 69 , 70 ], which employs the Potts Hamiltonian model [ 71 ] to identify the number and size of clusters, known as cluster stability. The problem with SPC is how to specify the number of the nearest neighborhood an individual can have.…”
Section: Nonparametric Approachesmentioning
confidence: 99%
“…SPC is based on computing the K -nearest neighborhood to produce a cluster relationship matrix and a hierarchical tree of clusters. Specifically, SPC is implemented as Sorting Points Into Neighborhood (SPIN) [ 69 , 70 ], which employs the Potts Hamiltonian model [ 71 ] to identify the number and size of clusters, known as cluster stability. The problem with SPC is how to specify the number of the nearest neighborhood an individual can have.…”
Section: Nonparametric Approachesmentioning
confidence: 99%
“…To determine the uppermost hierarchical population structure, we applied an unsupervised network-based clustering algorithm called super paramagnetic clustering (SPC, Blatt et al, 1996;Tetko et al, 2005). The input to SPC is a dissimilarity matrix D (n × n) with pairwise genetic distances between all individuals calculated using allele sharing distance (ASD; one minus IBS).…”
Section: Hierarchical Population Structurementioning
confidence: 99%
“…To this end, we used a modified version of a two-way clustering approach [4][6]. In the first step, the algorithm processed all mRNA signals within one organ to define a number of tissue clusters.…”
Section: Introductionmentioning
confidence: 99%