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

Cluster Sampling Method01:20

Cluster Sampling Method

14.7K
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.7K
Vesicular Tubular Clusters01:45

Vesicular Tubular Clusters

3.2K
After budding out from the ER membrane, some COPII vesicles lose their coat and fuse with one another to form larger vesicles and interconnected tubules called vesicular tubular clusters or VTCs. These clusters constitute a compartment at the ER-Golgi interface known as ERGIC (Endoplasmic Reticulum Golgi Intermediate Compartment). The ERGIC is a mobile membrane-bound cargo transport system that sorts proteins secreted from ER and delivers them to the Golgi.
With the help of motor proteins such...
3.2K
Phylogenetic Trees03:21

Phylogenetic Trees

49.7K
Phylogenetic trees come in many forms. It matters in which sequence the organisms are arranged from the bottom to the top of the tree, but the branches can rotate at their nodes without altering the information. The lines connecting individual nodes can be straight, angled, or even curved.
49.7K
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
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
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

You might also read

Related Articles

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

Sort by
Same author

Theoretical Model and Experimental Validation of Coalbed Methane Adsorption/Desorption Dynamics in Cylindrical and Spherical Coal Particles.

ACS omega·2026
Same author

Spacing effect improves generalization in biological and artificial systems.

Patterns (New York, N.Y.)·2026
Same author

Effects of Light Spectrum on Growth, Retinal Morphology, and Clock Gene Expression Patterns in <i>Takifugu rubripes</i> Larvae.

Biology·2026
Same author

Life Kinetics Training as a Multimodal Neurocognitive Intervention: Enhances Cognitive and Motor Performance in Badminton Athletes.

Life (Basel, Switzerland)·2026
Same author

Correction: Efficacy and safety of biologics in erythrodermic psoriasis: a systematic review and single-arm meta-analysis.

Frontiers in immunology·2026
Same author

Exploring the mechanism of plastic additives on reproductive disorders based on network toxicology and molecular docking.

Journal of environmental science and health. Part. B, Pesticides, food contaminants, and agricultural wastes·2026

Related Experiment Video

Updated: Feb 2, 2026

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

S-Cluster++: a fast program for solving the cluster containment problem for phylogenetic networks.

Hongwei Yan1, Andreas D M Gunawan1, Louxin Zhang1,2

  • 1Department of Mathematics, National University of Singapore, Singapore.

Bioinformatics (Oxford, England)
|November 14, 2018
PubMed
Summary
This summary is machine-generated.

Researchers developed a fast computer program to solve the cluster containment problem (CCP) in phylogenetic networks. This program aids in understanding genome evolution by efficiently analyzing reticulate evolution and genomic data transfers.

More Related Videos

JUMPn: A Streamlined Application for Protein Co-Expression Clustering and Network Analysis in Proteomics
07:28

JUMPn: A Streamlined Application for Protein Co-Expression Clustering and Network Analysis in Proteomics

Published on: October 19, 2021

3.6K
A Practical Guide to Phylogenetics for Nonexperts
12:00

A Practical Guide to Phylogenetics for Nonexperts

Published on: February 5, 2014

36.1K

Related Experiment Videos

Last Updated: Feb 2, 2026

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
JUMPn: A Streamlined Application for Protein Co-Expression Clustering and Network Analysis in Proteomics
07:28

JUMPn: A Streamlined Application for Protein Co-Expression Clustering and Network Analysis in Proteomics

Published on: October 19, 2021

3.6K
A Practical Guide to Phylogenetics for Nonexperts
12:00

A Practical Guide to Phylogenetics for Nonexperts

Published on: February 5, 2014

36.1K

Area of Science:

  • Computational Biology
  • Phylogenetics
  • Genomics

Background:

  • Genome evolution is shaped by both vertical evolution (mutations) and reticulate transfer (gene flow between lineages).
  • Phylogenetic networks are models used to study complex genome evolution, moving beyond simple tree structures.
  • Algorithmic problems like tree and cluster containment are crucial for verifying phylogenetic networks but are computationally challenging (NP-complete).

Purpose of the Study:

  • To address the computational difficulty of the cluster containment problem (CCP) in phylogenetic networks.
  • To develop a fast and efficient computational tool for solving the CCP.
  • To facilitate the analysis of reticulate evolution and related biological questions.

Main Methods:

  • Developed a novel computer program to solve the cluster containment problem (CCP).
  • Employed a linear-time transformation technique to convert the small version of the CCP into a SAT (Satisfiability) problem.
  • The program package is publicly available for download.

Main Results:

  • Successfully created a fast computer program for solving the cluster containment problem (CCP) on arbitrary phylogenetic networks.
  • The program's efficiency stems from its reduction of the CCP to a SAT problem.
  • This provides a significant advancement in the computational analysis of phylogenetic networks.

Conclusions:

  • The developed program offers a practical solution for the long-standing cluster containment problem in phylogenetics.
  • This tool can accelerate research in comparative genomics and the study of reticulate evolution.
  • Availability of the software package promotes wider use and further development in the field.