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

Construction of Frequency Distribution01:15

Construction of Frequency Distribution

8.2K
A frequency distribution table can be constructed using the steps given below.
First, make a table with two columns—one with the title of the data that needs to be organized, and the other column for frequency. [Draw a third column for tally marks if needed]. Then, take a look at the items given in the data set and decide if an ungrouped frequency distribution table or a grouped frequency distribution table would be more suitable. If there are large sets of different values, then it is...
8.2K
Determination of Expected Frequency01:08

Determination of Expected Frequency

2.3K
Suppose one wants to test independence between the two variables of a contingency table. The values in the table constitute the observed frequencies of the dataset. But how does one determine the expected frequency of the dataset? One of the important assumptions is that the two variables are independent, which means the variables do not influence each other. For independent variables, the statistical probability of any event involving both variables is calculated by multiplying the individual...
2.3K
Frequency-dependent Selection01:21

Frequency-dependent Selection

22.2K
When the fitness of a trait is influenced by how common it is (i.e., its frequency) relative to different traits within a population, this is referred to as frequency-dependent selection. Frequency-dependent selection may occur between species or within a single species. This type of selection can either be positive—with more common phenotypes having higher fitness—or negative, with rarer phenotypes conferring increased fitness.
22.2K
Survival Tree01:19

Survival Tree

159
Survival trees are a non-parametric method used in survival analysis to model the relationship between a set of covariates and the time until an event of interest occurs, often referred to as the "time-to-event" or "survival time." This method is particularly useful when dealing with censored data, where the event has not occurred for some individuals by the end of the study period, or when the exact time of the event is unknown.
 Building a Survival Tree
Constructing a...
159
Phylogenetic Trees03:21

Phylogenetic Trees

46.4K
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.
46.4K
Discrete-Time Fourier Series01:20

Discrete-Time Fourier Series

358
The Discrete-Time Fourier Series (DTFS) is a fundamental concept in signal processing, serving as the discrete-time counterpart to the continuous-time Fourier series. It allows for the representation and analysis of discrete-time periodic signals in terms of their frequency components. Unlike its continuous counterpart, which utilizes integrals, the calculation of DTFS expansion coefficients involves summations due to the discrete nature of the signal.
For a discrete-time periodic signal x[n]...
358

You might also read

Related Articles

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

Sort by
Same author

Response to commentary on "Paracentesis exceeding three liters increases risks of acute kidney injury even in cirrhotic patients with albumin infused refractory ascites".

Journal of the Formosan Medical Association = Taiwan yi zhi·2026
Same author

Outcome of cholecystectomy in octogenarian with concurrent cholecystitis and cholangitis receiving percutaneous cholecystostomy and subsequent interventive endoscopic retrograde cholangiopancreatography.

BMC geriatrics·2026
Same author

A Kernelization Algorithm for Finding a Perfect Phylogeny From Mixed Tumor Samples.

IEEE transactions on computational biology and bioinformatics·2025
Same author

Response to commentary on paracentesis exceeding three liters increases risks of acute kidney injury even in cirrhotic patients with albumin infused refractory ascites.

Journal of the Formosan Medical Association = Taiwan yi zhi·2025
Same author

Paracentesis exceeding three liters increases risks of acute kidney injury even in cirrhotic patients with albumin infused refractory ascites.

Journal of the Formosan Medical Association = Taiwan yi zhi·2025
Same author

Fast Algorithms for the Simplified Partial Digest Problem.

Journal of computational biology : a journal of computational molecular cell biology·2022
Same journal

A Multi-Modal Framework for Phage-Host Interaction Prediction Using Multi-View Contrastive Learning.

IEEE transactions on computational biology and bioinformatics·2026
Same journal

Decoding Gene-Disease Associations with Computational Methods: A Survey.

IEEE transactions on computational biology and bioinformatics·2026
Same journal

A Competitive Coevolution-based Cancer Driver Pathway Identification Algorithm for Maximizing Coverage, Mutual Exclusivity, and Subnet Importance.

IEEE transactions on computational biology and bioinformatics·2026
Same journal

Prediction of GO Terms Based on Partitioning PPI Networks into Highly Connected Components.

IEEE transactions on computational biology and bioinformatics·2026
Same journal

Modeling and Tracking of Heterogeneous Cell Populations via Open Multi-Agent Systems.

IEEE transactions on computational biology and bioinformatics·2026
Same journal

Parameter Efficient Deep Learning Models for Multi-Target Binding Affinity and hERG Cardiotoxicity Prediction.

IEEE transactions on computational biology and bioinformatics·2026
See all related articles

Related Experiment Video

Updated: Sep 11, 2025

Creating and Applying a Reference to Facilitate the Discussion and Classification of Proteins in a Diverse Group
07:49

Creating and Applying a Reference to Facilitate the Discussion and Classification of Proteins in a Diverse Group

Published on: August 16, 2017

7.1K

Faster Algorithms for Constructing Frequency Difference Consensus Trees.

Biing-Feng Wang, Chih-Yu Li, Wen-Horng Sheu

    IEEE Transactions on Computational Biology and Bioinformatics
    |August 14, 2025
    PubMed
    Summary
    This summary is machine-generated.

    This study refines algorithms for constructing frequency difference consensus trees, crucial for evolutionary studies. The new method achieves optimal O(kn lg n) time complexity for combining phylogenetic trees.

    More Related Videos

    Author Spotlight: Advancements in X-ray CT Tool Chain for Tree Core Analysis
    06:56

    Author Spotlight: Advancements in X-ray CT Tool Chain for Tree Core Analysis

    Published on: September 22, 2023

    1.2K
    Using Phylogenetic Analysis to Investigate Eukaryotic Gene Origin
    08:57

    Using Phylogenetic Analysis to Investigate Eukaryotic Gene Origin

    Published on: August 14, 2018

    16.0K

    Related Experiment Videos

    Last Updated: Sep 11, 2025

    Creating and Applying a Reference to Facilitate the Discussion and Classification of Proteins in a Diverse Group
    07:49

    Creating and Applying a Reference to Facilitate the Discussion and Classification of Proteins in a Diverse Group

    Published on: August 16, 2017

    7.1K
    Author Spotlight: Advancements in X-ray CT Tool Chain for Tree Core Analysis
    06:56

    Author Spotlight: Advancements in X-ray CT Tool Chain for Tree Core Analysis

    Published on: September 22, 2023

    1.2K
    Using Phylogenetic Analysis to Investigate Eukaryotic Gene Origin
    08:57

    Using Phylogenetic Analysis to Investigate Eukaryotic Gene Origin

    Published on: August 14, 2018

    16.0K

    Area of Science:

    • Computational Biology
    • Phylogenetics
    • Evolutionary Biology

    Background:

    • Consensus trees integrate phylogenetic information from multiple gene trees.
    • The frequency difference consensus tree is a widely used method in evolutionary studies.

    Purpose of the Study:

    • To improve the time complexity for constructing frequency difference consensus trees.
    • To present a faster algorithm for specific parameter ranges.

    Main Methods:

    • Algorithmic analysis and refinement.
    • Focus on reducing computational complexity for consensus tree construction.

    Main Results:

    • Achieved a new upper bound of O(kn lg n) for constructing frequency difference consensus trees.
    • Developed a simple O(k^2 n) algorithm, optimal for k = O(lg n).
    • Linear time complexity O(n) is achieved when k = O(1).

    Conclusions:

    • The study presents the most efficient algorithm to date for frequency difference consensus trees.
    • The new algorithms offer significant performance improvements for phylogenetic analysis.