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

Reconstructing recombination network from sequence data: the small parsimony problem.

C Thach Nguyen, Nguyen Bao Nguyen, Wing-Kin Sung

    IEEE/ACM Transactions on Computational Biology and Bioinformatics
    |August 2, 2007
    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

    Mixing Is Dispensable for Optical Density-Based High-Throughput Growth Screening Assay in Fission Yeast.

    International journal of molecular sciences·2026
    Same author

    Exact and Asymptotic Counts of Binary Phylogenetic Networks with a Few Reticulation Events.

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

    On the Size of the Neighborhoods of a Word.

    IEEE transactions on computational biology and bioinformatics·2025
    Same author

    DSA-DeepFM: a dual-stage attention-enhanced DeepFM model for predicting anticancer synergistic drug combinations.

    Bioinformatics advances·2025
    Same author

    Simple k-RF Metrics for Comparison of Labeled DAGs.

    IEEE transactions on computational biology and bioinformatics·2025
    Same author

    PhyloFusion-Fast and Easy Fusion of Rooted Phylogenetic Trees into Rooted Phylogenetic Networks.

    Systematic 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

    The small parsimony problem is NP-hard for recombination networks, unlike phylogenetic trees. A dynamic programming algorithm offers a solution for reconstructing these networks from sequence data.

    Area of Science:

    • Computational Biology
    • Bioinformatics
    • Evolutionary Genetics

    Background:

    • Phylogenetic trees are commonly used to represent evolutionary relationships.
    • Reconstruction of evolutionary history from sequence data is crucial.
    • The small parsimony problem is a key computational challenge in phylogenetics.

    Purpose of the Study:

    • To investigate the computational complexity of the small parsimony problem for recombination networks.
    • To develop an efficient algorithm for reconstructing recombination networks.

    Main Methods:

    • Theoretical analysis of computational complexity.
    • Development of a dynamic programming algorithm.

    Main Results:

    Related Experiment Videos

  • The small parsimony problem is NP-hard for galled recombination networks.
  • A dynamic programming algorithm with a time complexity of O(dn2(3h)) was developed.

    • Conclusions:

    • Reconstructing recombination networks is computationally more challenging than phylogenetic trees.
    • The developed algorithm provides a method for solving the small parsimony problem on recombination networks.