Brides: a new fast algorithm and software for characterizing evolving similarity networks using breakthroughs, roadblocks, impasses, detours, equals and shortcuts

HIGHLIGHTS

  • who: Etienne Lord and colleagues from the Universités, UPMC Université Paris, Institut de Biologie Paris-Seine, Paris, France, CNRS, have published the article: BRIDES: A New Fast Algorithm and Software for Characterizing Evolving Similarity Networks Using Breakthroughs, Roadblocks, Impasses, Detours, Equals and Shortcuts, in the Journal: PLOS ONE | DOI:10.1371/journal.pone [0161474]. August 31, 2016 of April/27,/2016
  • what: The authors present a number of novel features, which characterize evolving networks. The difference with the original BRIDES algorithm is in Step 4, where the authors examine all the nodes k of . . .

     

    Logo ScioWire Beta black

    If you want to have access to all the content you need to log in!

    Thanks :)

    If you don't have an account, you can create one here.

     

Scroll to Top

Add A Knowledge Base Question !

+ = Verify Human or Spambot ?