A modified two-stage markov clustering algorithm for large and sparse networks

A modified two-stage markov clustering algorithm for large and sparse networks

Highlights • A fast and memory efficient, two-stage Markov clustering algorithm is proposed. • The algorithm is designed for the analysis of large and sparse graphs. • The algorithm was validated using real and synthetic protein sequence data. • It can accurately process a million-node BLAST similar...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Computer methods and programs in biomedicine 2016-10, Vol.135, p.15-26
Hauptverfasser: Szilágyi, László, Szilágyi, Sándor M
Format: Artikel
Sprache:eng
Schlagworte:
Algorithms
Cluster Analysis
Efficient computing
Hierarchical clustering
Internal Medicine
Markov Chains
Markov clustering
Other
Protein sequence networks
Sparse matrix
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Highlights • A fast and memory efficient, two-stage Markov clustering algorithm is proposed. • The algorithm is designed for the analysis of large and sparse graphs. • The algorithm was validated using real and synthetic protein sequence data. • It can accurately process a million-node BLAST similarity network in 100 minutes.
ISSN:0169-2607
1872-7565
DOI:10.1016/j.cmpb.2016.07.007