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

Polynomial-time algorithms for building a consensus MUL-tree.

Yun Cui1, Jesper Jansson, Wing-Kin Sung

  • 1School of Computing, National University of Singapore, Singapore.

Journal of Computational Biology : a Journal of Computational Molecular Cell Biology
|September 12, 2012
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

Primary intracranial RAF1-rearranged spindle cell neoplasm: a case report of a rare entity.

Acta neurologica Belgica·2026
Same author

Analysis of clinical characteristics and risk factors for severe EBV infection in children-a single-center retrospective cohort study.

BMC pediatrics·2026
Same author

Case Report: Extranodal marginal zone B-cell lymphoma in the lateral ventricle: literature review.

Frontiers in oncology·2026
Same author

The Changing Trends of T Stage and Size of Early Gastric Cancer.

Journal of digestive diseases·2026
Same author

Psychomotor Rehabilitation for Pediatric Delirium: A Study Protocol for a Randomized Controlled Trial Investigating Efficacy and Brain Electrophysiological Mechanisms.

Neuropsychiatric disease and treatment·2026
Same author

Population pharmacokinetics and probability of target attainment of tigecycline in critically ill children.

The Journal of antimicrobial chemotherapy·2026
Same journal

GMSA: A Graph Matching and Point Cloud Registration-Based Method for Spatial Transcriptomics Data Alignment.

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

Investigations on Multiple Protein Scaffold Filling.

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

Cell Type Prediction for Single-Cell RNA Sequencing Utilizing Unsupervised Domain Adaptation and Semi-Supervised Learning.

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

PPIGAN: Prediction of Protein-Protein Interactions Using Generative Adversarial Networks.

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

Deep Structure-Enhanced Cell Clustering Model for Single-Cell RNA Sequencing Data.

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

Asymmetric Drug-Drug Interaction Prediction Based on Generative Adversarial Networks and Knowledge Graph.

Journal of computational biology : a journal of computational molecular cell biology·2026
See all related articles

This study introduces efficient algorithms for constructing consensus multi-labeled phylogenetic trees (MUL-trees). These methods help summarize conflicting evolutionary or data structures represented by MUL-trees.

Area of Science:

  • Computational Biology
  • Phylogenetics
  • Computer Science

Background:

  • Multi-labeled phylogenetic trees (MUL-trees) generalize traditional phylogenetic trees, allowing repeated leaf labels.
  • MUL-trees have diverse applications in fields such as biogeography, cospeciation, gene evolution, and computer science.

Purpose of the Study:

  • To address the problem of inferring a consensus MUL-tree from a set of conflicting MUL-trees.
  • To develop the first polynomial-time algorithms for constructing consensus MUL-trees.

Main Methods:

  • Developed a straightforward, fast algorithm for strict consensus MUL-tree construction with identical leaf label multisets.
  • Designed a polynomial-time algorithm for majority rule consensus MUL-tree construction when leaf labels appear at most twice.

Related Experiment Videos

  • Investigated the computational complexity of consensus MUL-tree inference, including NP-hardness for general majority rule consensus.

    • Main Results:

    • Presented efficient algorithms for specific consensus MUL-tree problems.
    • Demonstrated the feasibility of constructing singular majority rule consensus MUL-trees efficiently.
    • Established the computational complexity landscape for consensus MUL-tree inference.

    Conclusions:

    • The study provides novel algorithmic solutions for summarizing conflicting MUL-tree data.
    • Efficient methods are now available for certain types of consensus MUL-tree construction.
    • Further research into consensus MUL-tree inference can leverage these findings for broader applications.