Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Concept Videos

Protein Networks02:26

Protein Networks

4.5K
An organism can have thousands of different proteins, and these proteins must cooperate to ensure the health of an organism. Proteins bind to other proteins and form complexes to carry out their functions. Many proteins interact with multiple other proteins creating a complex network of protein interactions.
These interactions can be represented through maps depicting protein-protein interaction networks, represented as nodes and edges. Nodes are circles that are representative of a protein,...
4.5K
Trial and Error and Algorithm01:12

Trial and Error and Algorithm

420
A problem-solving strategy is a plan of action used to find a solution. Different strategies have distinct action plans. Trial and error involves trying different solutions until one works. For instance, to fix a broken printer, you might check ink levels, ensure the paper tray isn't jammed, and verify the printer's connection to your laptop. This method can be time-consuming but is commonly used. Thomas Edison, for example, used trial and error to find a suitable filament for the light...
420
Network Covalent Solids02:18

Network Covalent Solids

16.2K
Network covalent solids contain a three-dimensional network of covalently bonded atoms as found in the crystal structures of nonmetals like diamond, graphite, silicon, and some covalent compounds, such as silicon dioxide (sand) and silicon carbide (carborundum, the abrasive on sandpaper). Many minerals have networks of covalent bonds.
To break or to melt a covalent network solid, covalent bonds must be broken. Because covalent bonds are relatively strong, covalent network solids are typically...
16.2K
Avoidance Learning and Learned Helplessness01:14

Avoidance Learning and Learned Helplessness

2.6K
Avoidance learning and learned helplessness are critical concepts in understanding behavioral responses to negative stimuli.
Avoidance learning occurs when an organism learns that a specific behavior can prevent an unpleasant outcome. For example, a student who receives a bad grade may start studying harder to avoid future poor grades. This behavior persists even when the negative outcome is no longer present. Avoidance learning is powerful because it maintains behavior in the absence of the...
2.6K
Fast Fourier Transform01:10

Fast Fourier Transform

944
The Fast Fourier Transform (FFT) is a computational algorithm designed to compute the Discrete Fourier Transform (DFT) efficiently. By breaking down the calculations into smaller, manageable sections, the FFT significantly reduces the computational complexity involved. Direct computation of an N-point DFT requires N2 complex multiplications, whereas the FFT algorithm needs only (N/2)log⁡2N multiplications, offering a much faster performance.
The computational efficiency of the FFT becomes...
944
Associative Learning01:27

Associative Learning

1.3K
Associative learning is a fundamental concept in behavioral psychology, wherein a connection is established between two stimuli or events, leading to a learned response. This process is critical in understanding how behaviors are acquired and modified. Conditioning, the mechanism through which associations are formed, can be divided into two main types: classical conditioning and operant conditioning, each elucidating different aspects of associative learning.
Classical conditioning, also known...
1.3K

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

Marfan Syndrome Prediction Via Graph Neural Networks on 3D Facial Cues.

IEEE journal of biomedical and health informatics·2026
Same author

MiRInter-Trans: a transformer-based framework for microRNA interaction prediction.

Bioinformatics advances·2026
Same author

On the state of protein function prediction: a report on the fourth CAFA challenge.

bioRxiv : the preprint server for biology·2026
Same author

Computational understanding of non-coding RNA pairwise interactions.

Frontiers in artificial intelligence·2026
Same author

Systematic benchmarking demonstrates large language models have not reached the diagnostic accuracy of traditional rare-disease decision support tools.

European journal of human genetics : EJHG·2026
Same author

RNA-KG v2.0: an RNA-centered Knowledge Graph with Properties.

NAR genomics and bioinformatics·2026
Same journal

OpenIMC: an open-source platform for analyzing single-cell and spatial proteomics by imaging mass cytometry.

BMC bioinformatics·2026
Same journal

NAP: an open source pipeline for cross-domain microbiome profiling using Nanopore sequencing-derived amplicon data.

BMC bioinformatics·2026
Same journal

SurvGME: an R package for survival analysis with graphical and measurement error models.

BMC bioinformatics·2026
Same journal

SimMapNet: a Bayesian framework for gene regulatory network inference using gene ontology similarities as external hint.

BMC bioinformatics·2026
Same journal

Dual channel drug-drug interactions extraction based on cross attention.

BMC bioinformatics·2026
Same journal

FeSseqdb: a curated sequence-level database and interpretable machine learning framework for identifying iron-sulfur proteins.

BMC bioinformatics·2026
See all related articles

Related Experiment Video

Updated: Feb 3, 2026

Machine Learning Algorithms for Early Detection of Bone Metastases in an Experimental Rat Model
07:15

Machine Learning Algorithms for Early Detection of Bone Metastases in an Experimental Rat Model

Published on: August 16, 2020

7.5K

A GPU-based algorithm for fast node label learning in large and unbalanced biomolecular networks.

Marco Frasca1, Giuliano Grossi2, Jessica Gliozzo3

  • 1AnacletoLab - Department of Computer Science, Università degli Studi di Milano, Via Comelico 39, Milano, 20135, Italy. frasca@di.unimi.it.

BMC Bioinformatics
|October 28, 2018
PubMed
Summary
This summary is machine-generated.

We developed a faster, GPU-accelerated method to predict protein functions in large biological networks, significantly improving accuracy for imbalanced datasets. This scalable approach enhances automated protein function prediction (AFP) and disease-gene analysis.

Keywords:
Biological networksGPU-based Hopfield netsLarge-sized networksNode label predictionProtein function prediction

More Related Videos

Divergence of Root Microbiota in Different Habitats based on Weighted Correlation Networks
09:49

Divergence of Root Microbiota in Different Habitats based on Weighted Correlation Networks

Published on: September 25, 2021

4.9K
Area-based Image Analysis Algorithm for Quantification of Macrophage-fibroblast Cocultures
07:05

Area-based Image Analysis Algorithm for Quantification of Macrophage-fibroblast Cocultures

Published on: February 15, 2022

2.9K

Related Experiment Videos

Last Updated: Feb 3, 2026

Machine Learning Algorithms for Early Detection of Bone Metastases in an Experimental Rat Model
07:15

Machine Learning Algorithms for Early Detection of Bone Metastases in an Experimental Rat Model

Published on: August 16, 2020

7.5K
Divergence of Root Microbiota in Different Habitats based on Weighted Correlation Networks
09:49

Divergence of Root Microbiota in Different Habitats based on Weighted Correlation Networks

Published on: September 25, 2021

4.9K
Area-based Image Analysis Algorithm for Quantification of Macrophage-fibroblast Cocultures
07:05

Area-based Image Analysis Algorithm for Quantification of Macrophage-fibroblast Cocultures

Published on: February 15, 2022

2.9K

Area of Science:

  • Network biology
  • Computational medicine
  • Bioinformatics

Background:

  • Biological networks often have imbalanced labels, with few entities annotated for specific functions or diseases.
  • Accurate node label inference is crucial for problems like automated protein function prediction (AFP) and disease-gene prioritization.
  • Existing methods struggle with scalability for large, multi-species networks.

Purpose of the Study:

  • To develop a scalable and efficient imbalance-aware algorithm for node label inference in large biological networks.
  • To enhance the COSNET algorithm using parallel processing for improved performance.
  • To address the challenge of highly unbalanced label distributions in network biology problems.

Main Methods:

  • Proposed a semi-supervised parallel enhancement of the COSNET algorithm, based on a Hopfield neural model.
  • Utilized an efficient graph representation and assumed sparse network topology for scalability.
  • Implemented a parallel processing strategy by partitioning nodes into independent sets for GPU acceleration.

Main Results:

  • The parallelized COSNET efficiently handles networks with millions of nodes.
  • Achieved an average speed-up of 180x in automated protein function prediction (AFP) across multiple species.
  • Demonstrated scalability on large, artificially generated sparse networks.

Conclusions:

  • The parallelized COSNET significantly reduces computation time and memory requirements for AFP.
  • The method is effective for predicting node labels in massive biomolecular networks.
  • This approach offers a scalable solution for imbalance-aware node classification in network biology.