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

Survival Tree01:19

Survival Tree

451
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...
451
Distance Problem01:29

Distance Problem

101
When an object's velocity changes over time, the total distance traveled can be determined by summing small displacement intervals over short increments. This approach approximates the true distance through numerical summation and the use of integral calculus. An estimate of the total displacement can be obtained by measuring velocity at regular intervals and multiplying each value by the corresponding time step.If a runner accelerates over the first three seconds of a race, speed measurements...
101
Area Between Curves: Problem Solving01:27

Area Between Curves: Problem Solving

89
A region can be enclosed by three curves: a square root function, a reflected cube root function, and a linear function. The linear function intersects each of the other two curves, and these intersection points determine where the boundary of the enclosed region changes. Because different curves serve as the upper and lower boundaries in different parts of the graph, the area cannot be found using a single setup over the entire interval.To compute the area, the region is first divided into two...
89
Sign Test for Median of Single Population01:20

Sign Test for Median of Single Population

388
In general, the sign test serves as a nonparametric method to test hypotheses about the median of a single population when the data does not follow a known distribution. This simplicity makes it particularly useful for small sample sizes or when the assumptions of parametric tests cannot be met. The process begins with identifying a null hypothesis, typically stating that the population median equals a specific value. The alternative hypothesis could be that the median is either not equal to,...
388
Median01:08

Median

30.6K
Besides mean, the median is a widely used measure of central tendency. Typically, median is defined as the central or middle value of a data set, measured by arranging the data elements in an increasing or decreasing order. Since this middle value is not affected by the precise numerical values of the outliers or fluctuations, it is insensitive to them. Hence, in cases where a data set may have outliers or the extreme values are not known, the median is a better measure of the central tendency...
30.6K
Normal and Tangetial Components: Problem Solving01:24

Normal and Tangetial Components: Problem Solving

640
Consider a man with a mass of 70 kg seated in a chair connected to a pin support through a member BC. If the man maintains an upright position, the task is to determine the horizontal and vertical reactions of the chair on the man when the member makes a 45° angle with the horizontal. At this moment, the man has a speed of 5 m/s, increasing at a rate of 1 m/s².
640

You might also read

Related Articles

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

Sort by
Same author

A PLUM Job: Peptide modeLs for Understanding and engineering antiMicrobial therapeutics.

bioRxiv : the preprint server for biology·2026
Same author

Pathogenesis and Transmission of a Reassorted H1 Influenza A Virus Detected in North American Swine.

Influenza and other respiratory viruses·2026
Same author

Active surveillance for influenza A virus in swine reveals within-farm reassortment and cocirculation of distinct subtypes and genetic clades.

Veterinary microbiology·2025
Same author

Revealing Reassortment in Influenza A Viruses with TreeSort.

Molecular biology and evolution·2025
Same author

Phylo-rs: an extensible phylogenetic analysis library in rust.

BMC bioinformatics·2025
Same author

Transmission and Pathologic Findings of Divergent Human Seasonal H1N1pdm09 Influenza A Viruses Following Spillover Into Pigs in the United States.

Influenza and other respiratory viruses·2025
Same journal

circ2DGNN: circRNA-Disease Association Prediction via Transformer-Based Graph Neural Network.

IEEE/ACM transactions on computational biology and bioinformatics·2024
Same journal

Hierarchical Hypergraph Learning in Association- Weighted Heterogeneous Network for miRNA- Disease Association Identification.

IEEE/ACM transactions on computational biology and bioinformatics·2024
Same journal

Discriminative Domain Adaption Network for Simultaneously Removing Batch Effects and Annotating Cell Types in Single-Cell RNA-Seq.

IEEE/ACM transactions on computational biology and bioinformatics·2024
Same journal

MLW-BFECF: A Multi-Weighted Dynamic Cascade Forest Based on Bilinear Feature Extraction for Predicting the Stage of Kidney Renal Clear Cell Carcinoma on Multi-Modal Gene Data.

IEEE/ACM transactions on computational biology and bioinformatics·2024
Same journal

An End-to-End Knowledge Graph Fused Graph Neural Network for Accurate Protein-Protein Interactions Prediction.

IEEE/ACM transactions on computational biology and bioinformatics·2024
Same journal

Generative Biomedical Event Extraction With Constrained Decoding Strategy.

IEEE/ACM transactions on computational biology and bioinformatics·2024
See all related articles

Related Experiment Video

Updated: Feb 27, 2026

Collecting and Processing Drone-based Remotely Sensed Data for Use in Forest Recovery Monitoring
08:16

Collecting and Processing Drone-based Remotely Sensed Data for Use in Forest Recovery Monitoring

Published on: October 24, 2025

739

Computing Manhattan Path-Difference Median Trees: A Practical Local Search Approach.

Alexey Markin, Oliver Eulenstein

    IEEE/ACM Transactions on Computational Biology and Bioinformatics
    |June 27, 2017
    PubMed
    Summary
    This summary is machine-generated.

    This study introduces a new median tree problem using Manhattan path-difference distance for phylogenetic tree inference. An efficient heuristic was developed, significantly improving upon existing methods for large datasets.

    More Related Videos

    A Machine Learning Approach to Design an Efficient Selective Screening of Mild Cognitive Impairment
    12:18

    A Machine Learning Approach to Design an Efficient Selective Screening of Mild Cognitive Impairment

    Published on: January 11, 2020

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

    A Practical Guide to Phylogenetics for Nonexperts

    Published on: February 5, 2014

    36.2K

    Related Experiment Videos

    Last Updated: Feb 27, 2026

    Collecting and Processing Drone-based Remotely Sensed Data for Use in Forest Recovery Monitoring
    08:16

    Collecting and Processing Drone-based Remotely Sensed Data for Use in Forest Recovery Monitoring

    Published on: October 24, 2025

    739
    A Machine Learning Approach to Design an Efficient Selective Screening of Mild Cognitive Impairment
    12:18

    A Machine Learning Approach to Design an Efficient Selective Screening of Mild Cognitive Impairment

    Published on: January 11, 2020

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

    A Practical Guide to Phylogenetics for Nonexperts

    Published on: February 5, 2014

    36.2K

    Area of Science:

    • Computational Biology
    • Phylogenetics
    • Algorithm Design

    Background:

    • Median tree problems are crucial for inferring large-scale phylogenetic trees.
    • Existing methods lack efficient solutions for specific distance metrics.

    Purpose of the Study:

    • Introduce a novel median tree problem using the Manhattan path-difference distance.
    • Develop an efficient algorithm for phylogenetic tree inference.

    Main Methods:

    • Formulated the median tree problem as an Integer Linear Program (ILP).
    • Developed an exact local search heuristic for the problem.
    • Algorithm improves asymptotic performance by a factor of n.

    Main Results:

    • The introduced median tree problem is NP-hard.
    • The novel heuristic demonstrates significant performance improvements.
    • Empirical studies validate the heuristic's accuracy and scalability.

    Conclusions:

    • The proposed method offers an effective and scalable approach to phylogenetic tree inference.
    • The heuristic provides a powerful tool for comparative phylogenetic studies.
    • This work advances the field of computational phylogenetics.