BRIDES: A New Fast Algorithm and Software for Characterizing Evolving Similarity Networks Using Breakthroughs, Roadblocks, Impasses, Detours, Equals and Shortcuts

PLoS ONE - United States
doi 10.1371/journal.pone.0161474
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Public Library of Science (PLoS)

Related search

PSimScan: Algorithm and Utility for Fast Protein Similarity Search

PLoS ONE
Multidisciplinary
2013English

Detours, Roadblocks, Jams: The Rough Road to US Car Regulation

Nature
Multidisciplinary
2019English

FctClus: A Fast Clustering Algorithm for Heterogeneous Information Networks

PLoS ONE
Multidisciplinary
2015English

A Fast Topological Analysis Algorithm for Large-Scale Similarity Evaluations of Ligands and Binding Pockets

Journal of Cheminformatics
Computer GraphicsInformation SciencesLibraryTheoretical ChemistryComputer Science ApplicationsComputer-Aided DesignPhysical
2015English

A New Fast Algorithm for Image Denoising

2013English

A Fast and Verified Algorithm for Proving Store-And-Forward Networks Deadlock-Free

2011English

A New Unsupervised Feature Selection Algorithm Using Similarity-Based Feature Clustering

Computational Intelligence
Computational MathematicsArtificial Intelligence
2019English

Exploratory Study of a New Model for Evolving Networks

English

Fast Power Allocation Algorithm for Cognitive Radio Networks

IEEE Communications Letters
Electronic EngineeringSimulationComputer Science ApplicationsElectricalModeling
2011English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy