IsoRankN: We describe IsoRankN (IsoRank-Nibble), a global multiple-network alignment tool based on spectral clustering on the induced graph of pairwise alignment scores. IsoRankN outperforms existing algorithms for global network alignment in coverage and consistency on multiple alignments of the five available eukaryotic networks. Being based on spectral methods, IsoRankN is both error-tolerant and computationally efficient.
Keywords for this software
References in zbMATH (referenced in 6 articles )
Showing results 1 to 6 of 6.
- Daskin, Anmer; Grama, Ananth; Kais, Sabre: Multiple network alignment on quantum computers (2014)
- Ibragimov, Rashid; Malek, Maximilian; Guo, Jiong; Baumbach, Jan: GEDEVO: an evolutionary graph edit distance algorithm for biological network alignment (2013)
- Li, Angsheng; Peng, Pan: Detecting and characterizing small dense bipartite-like subgraphs by the bipartiteness ratio measure (2013)
- Liu, Sijia; Matzavinos, Anastasios; Sethuraman, Sunder: Random walk distances in data clustering and applications (2013)
- Peng, Pan: The small community phenomenon in networks: models, algorithms and applications (2012)
- Liao, Chung-Shou; Lu, Kanghao; Baym, Michael; Singh, Rohit; Berger, Bonnie: Isorankn: spectral methods for global alignment of multiple protein networks (2009)