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 Experiment Videos

Computing phylogenetic diversity for split systems.

Andreas Spillner1, Binh T Nguyen, Vincent Moulton

  • 1School of Computer Sciences, University of East Anglia, Norwich, Uk. aspillner@cmp.uea.ac.uk

IEEE/ACM Transactions on Computational Biology and Bioinformatics
|May 3, 2008
PubMed
Summary
This summary is machine-generated.

Related Concept Videos

You might also read

Related Articles

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

Sort by
Same author

Regional Anesthesia Approaches for Transcatheter Aortic Valve Implantation: When and Where Does It Add Value? A Narrative Review of Techniques by Access Route.

Journal of cardiothoracic and vascular anesthesia·2026
Same author

Understanding <i>Eimeria</i> infection for the treatment and prevention of chicken coccidian parasites.

Frontiers in cellular and infection microbiology·2026
Same author

High-dimensional Many-to-many-to-many Mediation Analysis.

ArXiv·2026
Same author

Postoperative Analgesia Using Multiple Erector Spinae Plane Catheters in a Single-Stage Surgery for Synchronous Breast and Colon Cancer: A Case Report.

A&A practice·2025
Same author

Characterizing semi-directed phylogenetic networks and their multi-rootable variants.

Theory in biosciences = Theorie in den Biowissenschaften·2025
Same author

Distinguishing Phylogenetic Level-2 Networks with Quartets and Inter-Taxon Quartet Distances.

Bulletin of mathematical biology·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

Measuring biodiversity is crucial for conservation. This study explores phylogenetic diversity using networks, proving it

Area of Science:

  • Conservation Biology
  • Computational Biology
  • Phylogenetics

Background:

  • Measuring and preserving biodiversity is a key challenge in conservation biology due to species extinction.
  • Phylogenetic diversity, proposed by Faith in 1992, uses species relationships on a phylogenetic tree to assess collection diversity.
  • Evolutionary relationships can be more accurately represented by networks than trees.

Purpose of the Study:

  • To investigate variants of the phylogenetic diversity optimization problem when evolutionary relationships are modeled as networks (split systems) instead of trees.
  • To determine the computational complexity of phylogenetic diversity for general split systems.
  • To develop efficient algorithms for computing phylogenetic diversity in specific network structures.

Main Methods:

Related Experiment Videos

  • Formulating the problem of computing phylogenetic diversity relative to a split system.
  • Employing computational complexity theory to analyze the problem's hardness.
  • Designing and analyzing algorithms for specific classes of split systems, including phylogenetic trees and circular split systems.

Main Results:

  • The problem of computing phylogenetic diversity relative to general split systems is NP-hard.
  • An optimal O(n) time algorithm is presented for phylogenetic trees.
  • An O(n log n + nk) time algorithm is developed for selecting an optimal subset of size k in circular split systems.

Conclusions:

  • Phylogenetic diversity calculations are computationally challenging for network-based evolutionary models.
  • Efficient algorithms exist for specific network structures, offering practical tools for biodiversity assessment.
  • This research extends biodiversity measurement beyond traditional tree-based phylogenies to more complex evolutionary networks.