IsoRankN statistics

To access cutting-edge analytics on consensus tools, life science contexts and associated fields, you will need to subscribe to our premium service.

Subscribe
info

Citations per year

Citations chart
info

Popular tool citations

chevron_left Global network alignment chevron_right
Popular tools chart
info

Tool usage distribution map

Tool usage distribution map
info

Associated diseases

Associated diseases

IsoRankN specifications

Information


Unique identifier OMICS_04888
Name IsoRankN
Alternative name IsoRank-Nibble
Software type Package/Module
Interface Command line interface
Restrictions to use Academic or non-commercial use
Operating system Unix/Linux
Computer skills Advanced
Stability Stable
Maintained Yes

Versioning


Add your version

Publication for IsoRank-Nibble

IsoRankN in publications

 (12)
PMCID: 4460690
PMID: 26060505
DOI: 10.1186/s13015-015-0050-8

[…] use both different ncfs and different ass. thus, it is unclear whether the superiority of a method comes from its ncf, its as, or both. we already showed on state-of-the-art methods, mi-graal and isorankn, that combining ncf of one method and as of another method can give a new superior method. here, we evaluate mi-graal against a newer approach, ghost, by mixing-and-matching the methods’ […]

PMCID: 5270500
PMID: 28194172
DOI: 10.1186/s13637-015-0022-9

[…] in each of the two isorank versions, the alignment strategy aligns in one-to-one fashion nodes between different networks greedily with respect to the cost function. isorank has further evolved into isorankn [], a different multiple network aligner that uses the same cost function as isorank, but that uses a different, spectral graph theoretic alignment strategy to produce a many-to-many […]

PMCID: 4426770
PMID: 26000284
DOI: 10.1155/2015/253854

[…] []. in 2007, singh et al. proposed the isorank algorithm, which converted the problem to a constraint-based optimization objective function problem. then they also introduced an algorithm called isorankn, which was an approach similar to the pagerank-nibble algorithm, to align multiple ppi network []. the match-and-split algorithm proposed by narayanan and karp, 2007, with the idea […]

PMCID: 4331682
PMID: 25707987
DOI: 10.1186/1752-0509-9-S1-S7

[…] [] by allowing the random walker to restart at a new position at each time step with a fixed restart probability λ. note that a similar "random walk with restart" approach was used by isorank [] and isorankn [], although these algorithms do not utilize the csrw adopted in our method. we allow the random walker to select its restart position according to the pairwise node similarity, […]

PMCID: 3996886
PMID: 24800226
DOI: 10.1155/2014/439476

[…] mappings between networks are extracted from the functional similarity scores. to align multiple networks, the above processes are repeated for each pair of networks. an improved version of isorank, isorankn [], was developed to perform more efficient and highly accurate global alignments over multiple networks. through the use of spectral partitioning algorithm, isorankn can find dense, […]


To access a full list of publications, you will need to upgrade to our premium service.

IsoRankN institution(s)
Department of Computer Science and Information Engineering, National Taiwan University, Taipei, Taiwan

IsoRankN reviews

star_border star_border star_border star_border star_border
star star star star star

Be the first to review IsoRankN