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

Chromatin Position Affects Gene Expression02:35

Chromatin Position Affects Gene Expression

24.9K
Chromatin is the massive complex of DNA and proteins packaged inside the nucleus. The complexity of chromatin folding and how it is packaged inside the nucleus greatly influences  access to genetic information. Generally, the nucleus' periphery is considered transcriptionally repressive, while the cell's interior is considered a transcriptionally active area. 
Topologically Associated Domains (TADs)
The 3-dimensional positioning of chromatin in the nucleus influences the...
24.9K
Cluster Sampling Method01:20

Cluster Sampling Method

14.8K
Appropriate sampling methods ensure that samples are drawn without bias and accurately represent the population. Because measuring the entire population in a study is not practical, researchers use samples to represent the population of interest.
To choose a cluster sample, divide the population into clusters (groups) and then randomly select some of the clusters. All the members from these clusters are in the cluster sample. For example, if you randomly sample four departments from your...
14.8K
Velocity and Position by Integral Method01:13

Velocity and Position by Integral Method

8.2K
If acceleration as a function of time is known, then velocity and position functions can be derived using integral calculus. For constant acceleration, the integral equations refer to the first and second kinematic equations for velocity and position functions, respectively.
Consider an example to calculate the velocity and position from the acceleration function. A motorboat is traveling at a constant velocity of 5.0 m/s when it starts to decelerate to arrive at the dock. Its acceleration is...
8.2K
Velocity and Position by Graphical Method01:34

Velocity and Position by Graphical Method

10.4K
Velocity and position can be calculated from the known function of acceleration as a function of time. The total area under the acceleration-time graph and the velocity-time graph gives the change in velocity and position, respectively. In the case of an airplane, its acceleration is tracked using the inertial navigation system. The pilot provides the input of the airplane's initial position and velocity before takeoff. The inertial navigation system then uses the acceleration data to...
10.4K
Position-effect Variegation02:32

Position-effect Variegation

7.1K
In 1928, a German botanist Emil Heitz observed the moss nuclei with a DNA binding dye. He observed that while some chromatin regions decondense and spread out in the interphase nucleus, others do not. He termed them euchromatin and heterochromatin, respectively. He proposed that the heterochromatin regions reflect a functionally inactive state of the genome. It was later confirmed that heterochromatin is transcriptionally repressed, and euchromatin is transcriptionally active chromatin.
7.1K
Position of Equilibrium in Acid-Base Reactions02:05

Position of Equilibrium in Acid-Base Reactions

15.1K
In any solution, the value of pKa indicates whether an acid is completely dissociated or not. A negative pKa corresponds to a stronger acid, whereas a positive pKa corresponds to a weaker acid. Consider the reaction between ammonia and an ethoxide ion. In this reaction, ethanol with a pKa of 15.9 is a stronger acid than ammonia with a pKa of 38. Recall that the strong acid forms a weak conjugate base, and a weak acid forms a strong conjugate base. Hence, the ethoxide ion is a weak base.
15.1K

You might also read

Related Articles

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

Sort by
Same author

Comparison of the Effects of Norepinephrine and Phenylephrine Infusion in Preventing Hypotension during Spinal Anesthesia for Cesarean Delivery: A Randomized, Double-Blind Clinical Trial.

Archives of Iranian medicine·2025
Same author

Disease candidate genes prediction using positive labeled and unlabeled instances.

BMC medical genomics·2025
Same author

SEGCECO: Subgraph Embedding of Gene expression matrix for prediction of CEll-cell COmmunication.

Briefings in bioinformatics·2024
Same author

Cell Type Annotation Model Selection: General-Purpose vs. Pattern-Aware Feature Gene Selection in Single-Cell RNA-Seq Data.

Genes·2023
Same author

Discovering cell types using manifold learning and enhanced visualization of single-cell RNA-Seq data.

Scientific reports·2022
Same author

Identification of Enriched Regions in ChIP-Seq Data via a Linear-Time Multi-Level Thresholding Algorithm.

IEEE/ACM transactions on computational biology and bioinformatics·2021

Related Experiment Video

Updated: Feb 9, 2026

Using Human Differentially Expressed Gene Lists to Perform Downstream Pathway Enrichment Analysis and Target Prioritization
03:08

Using Human Differentially Expressed Gene Lists to Perform Downstream Pathway Enrichment Analysis and Target Prioritization

Published on: October 3, 2025

996

C-PUGP: A cluster-based positive unlabeled learning method for disease gene prediction and prioritization.

Akram Vasighizaker1, Saeed Jalili1

  • 1Computer Engineering Department, Tarbiat Modares University, Tehran, Iran.

Computational Biology and Chemistry
|June 12, 2018
PubMed
Summary

This study introduces a novel machine learning approach for identifying disease genes using clustering and One-Class classification. The method improves candidate gene prioritization by creating a reliable negative dataset, achieving high precision and recall.

Keywords:
Candidate disease genesClassificationClusteringIdentificationPulSemi-supervised learning

More Related Videos

A Protocol for Computer-Based Protein Structure and Function Prediction
16:41

A Protocol for Computer-Based Protein Structure and Function Prediction

Published on: November 3, 2011

69.8K
CRISPR Gene Editing Tool for MicroRNA Cluster Network Analysis
10:40

CRISPR Gene Editing Tool for MicroRNA Cluster Network Analysis

Published on: April 25, 2022

2.9K

Related Experiment Videos

Last Updated: Feb 9, 2026

Using Human Differentially Expressed Gene Lists to Perform Downstream Pathway Enrichment Analysis and Target Prioritization
03:08

Using Human Differentially Expressed Gene Lists to Perform Downstream Pathway Enrichment Analysis and Target Prioritization

Published on: October 3, 2025

996
A Protocol for Computer-Based Protein Structure and Function Prediction
16:41

A Protocol for Computer-Based Protein Structure and Function Prediction

Published on: November 3, 2011

69.8K
CRISPR Gene Editing Tool for MicroRNA Cluster Network Analysis
10:40

CRISPR Gene Editing Tool for MicroRNA Cluster Network Analysis

Published on: April 25, 2022

2.9K

Area of Science:

  • Computational biology
  • Bioinformatics
  • Machine learning in genomics

Background:

  • Accurate disease gene detection is crucial for understanding disease mechanisms and developing treatments.
  • Machine learning methods are widely used for identifying candidate disease genes, but often face challenges with insufficient negative data.
  • Semi-supervised learning on positive and unlabeled data has shown promise but can be improved.

Purpose of the Study:

  • To propose a novel Positive Unlabeled (PU) learning technique for more reliable disease gene identification.
  • To address the challenge of limited negative data in candidate gene detection.
  • To enhance the accuracy and performance of disease gene prioritization.

Main Methods:

  • A new PU learning technique combining clustering and One-Class classification is proposed.
  • A three-step process is used to generate a Reliable Negative (RN) set: clustering positive data, learning One-Class classifiers, and selecting the intersection of negative data.
  • A Support Vector Machine (SVM) binary classifier is employed for candidate disease gene identification and ranking.

Main Results:

  • The proposed method achieved high performance metrics: 92.8% precision, 93.6% recall, and 93.1% F-measure.
  • Performance, particularly in F-measure, showed an 11.7% improvement compared to existing methods.
  • A notable 6% increase in prioritization results was observed.

Conclusions:

  • The novel PU learning technique effectively addresses the challenge of limited negative data in disease gene detection.
  • The proposed method significantly outperforms existing approaches in identifying and ranking candidate disease genes.
  • This approach offers a more accurate and reliable tool for genomic research in disease understanding.