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

Optimal algorithms for local vertex quartet cleaning.

Gianluca Della Vedova1, H Todd Wareham

  • 1Dipartimento di Statistica, Universitá degli Studi di Milano-Bicocca, via Bicocca degli Arcimboldi 8, 20126 Milano, Italy. gianluca.dellavedova@unimib.it

Bioinformatics (Oxford, England)
|October 12, 2002
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

Differential quantification of alternative splicing events on spliced pangenome graphs.

PLoS computational biology·2024
Same author

PangeBlocks: customized construction of pangenome graphs via maximal blocks.

BMC bioinformatics·2024
Same author

RecGraph: recombination-aware alignment of sequences to variation graphs.

Bioinformatics (Oxford, England)·2024
Same author

Computational graph pangenomics: a tutorial on data structures and their applications.

Natural computing·2023
Same author

Reads2Vec: Efficient Embedding of Raw High-Throughput Sequencing Reads Data.

Journal of computational biology : a journal of computational molecular cell biology·2023
Same author

Accurate and fast clade assignment via deep learning and frequency chaos game representation.

GigaScience·2022
Same journal

3DICE: Interpretable 3D Cross-Modal Learning for Drug-Target Interaction Prediction and Large-Scale Drug Discovery.

Bioinformatics (Oxford, England)·2026
Same journal

KASSPer: Kinase Active Site Structure Prediction using Protein and Ligand Language Models and Its Application to Virtual Screening.

Bioinformatics (Oxford, England)·2026
Same journal

IDR searcher: a search engine solution for public image resources.

Bioinformatics (Oxford, England)·2026
Same journal

KCFtools: Rapid alignment-free method for introgression screening and GWAS using k-mer profiles.

Bioinformatics (Oxford, England)·2026
Same journal

Meta2DB: Curated shotgun metagenomic feature sets and metadata for health state prediction.

Bioinformatics (Oxford, England)·2026
Same journal

conMItion: an R package adjusting confounding factors for associations in multi-omics.

Bioinformatics (Oxford, England)·2026
See all related articles

This study introduces new quartet cleaning algorithms for reconstructing evolutionary trees. These methods improve accuracy and efficiency in inferring evolutionary relationships from biological data.

Area of Science:

  • Computational Biology
  • Phylogenetics
  • Evolutionary Biology

Background:

  • Reconstructing evolutionary trees is crucial in biology but computationally challenging.
  • Traditional methods often struggle with accuracy due to sensitivity to errors.
  • Quartet-based methods offer an alternative but require robust error correction.

Purpose of the Study:

  • To develop novel algorithms for quartet cleaning in phylogenetic inference.
  • To address the sensitivity of quartet-based methods to reconstruction errors.
  • To enhance the accuracy and efficiency of evolutionary tree reconstruction.

Main Methods:

  • Development of two new local vertex quartet cleaning algorithms.
  • Focus on optimizing time complexity and error-correction bounds.

Related Experiment Videos

  • Utilizing redundant information from quartet topologies for error correction.

    • Main Results:

    • Introduction of algorithms with optimal time complexity.
    • Presentation of algorithms with optimal error-correction bounds.
    • These are the first local vertex quartet cleaning algorithms to achieve optimality in either attribute.

    Conclusions:

    • The new algorithms offer significant improvements in phylogenetic reconstruction.
    • Optimized quartet cleaning enhances the reliability of evolutionary trees.
    • These advancements contribute to more accurate evolutionary biology studies.