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

• 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.
Source: Computer Methods and Programs in Biomedicine - Category: Bioinformatics Authors: Source Type: research