The current version of ArchDB (ArchDB14) includes two different methods of loop clustering. This is intended to provide the ArchDB user with as much usability as possible.
(Learn more...)
The
Density Search (DS) algorithm detects regions with a high density of loops in a features space defined by the length, bracing secondary structures, conformation and geometry of the loops.
(Learn more...)
The
Markov CLustering (MCL) algorithm is a graph-based clustering algorithm that simulates a flow of information within the graph, enhancing the flow where the current is strong and hindering where the current is weak.
(Learn more...)
Radar plot showing the proportion of different types of loops extracted from known protein structures that have been classified by each clustering method.
The colors of the polygons represent the clustering methods:
- In blue, loops only classified by Density Search;
- In yellow, loops only classified by Markov CLustering;
- In green, loops classified by both methods.