☆ 4.0 Article

Constructing phylogenetic networks via cherry picking and machine learning

ALGORITHMS FOR MOLECULAR BIOLOGY (2023)

Related references

Note: Only part of the references are listed.

Article Computer Science, Software Engineering

A Practical Fixed-Parameter Algorithm for Constructing Tree-Child Networks from Multiple Binary Trees

Leo van Iersel et al.

Summary: The algorithm utilizes the cherry picking sequences framework to construct a tree-child phylogenetic network efficiently. Additionally, an efficient parallel implementation is provided, demonstrating its capability to handle up to 100 input trees on a standard desktop computer, marking a significant improvement over previous construction methods.

ALGORITHMICA (2022)

Add to Collection

Article Computer Science, Software Engineering

New FPT Algorithms for Finding the Temporal Hybridization Number for Sets of Phylogenetic Trees

Sander Borst et al.

Summary: This study addresses the problem of calculating temporal hybridization networks with certain conditions for a set of phylogenetic trees, and proposes corresponding algorithms and measurement methods.

ALGORITHMICA (2022)

Add to Collection

Article Biology

Orchard Networks are Trees with Additional Horizontal Arcs

Leo van Iersel et al.

Summary: Orchard phylogenetic networks were introduced for computational benefits and can be interpreted as trees with additional horizontal arcs, closely related to tree-based networks.

BULLETIN OF MATHEMATICAL BIOLOGY (2022)

Add to Collection

Article Computer Science, Theory & Methods

On cherry-picking and network containment

Remie Janssen et al.

Summary: This paper introduces cherry-picking networks, a type of network that can be simplified by cherry-picking sequences. It demonstrates how to compare and distinguish these networks using their sequences. Additionally, it characterizes reconstructible cherry-picking networks and shows that the problem of checking network containment can be solved by computing cherry picking sequences in linear time.

THEORETICAL COMPUTER SCIENCE (2021)

Add to Collection

Article Biochemical Research Methods

Comparing the topology of phylogenetic network generators

Remie Janssen et al.

Summary: Phylogenetic networks provide a more comprehensive representation of evolutionary history compared to phylogenetic trees, capturing natural reticulate evolutionary processes such as horizontal gene transfer and gene recombination. Stochastic processes for generating random trees or networks are essential tools in evolutionary analysis, particularly in phylogeny reconstruction.

JOURNAL OF BIOINFORMATICS AND COMPUTATIONAL BIOLOGY (2021)

Add to Collection

Article Multidisciplinary Sciences

Harnessing machine learning to guide phylogenetic-tree search algorithms

Dana Azouri et al.

Summary: This study utilizes a machine learning algorithm to predict neighboring trees that increase likelihood, aiming to accelerate heuristic tree searches. Results suggest that machine learning can guide tree-search methodologies towards the most promising candidate trees.

NATURE COMMUNICATIONS (2021)

Add to Collection

Article Mathematics, Applied

A unifying characterization of tree-based networks and orchard networks using cherry covers

Leo van Iersel et al.

Summary: Phylogenetic networks are used to depict evolutionary relationships among species, categorized by topological features. This paper focuses on tree-based networks and orchard networks, introducing cherry covers as a unifying characterization for both classes and generalizing the results to non-binary networks.

ADVANCES IN APPLIED MATHEMATICS (2021)

Add to Collection

Article Biology

Trinets encode orchard phylogenetic networks

Charles Semple et al.

Summary: This paper examines the relationship between rooted triples and rooted binary trees, demonstrating that trinets are sufficient to encode rooted binary orchard networks and proposing a polynomial-time algorithm for building such networks.

JOURNAL OF MATHEMATICAL BIOLOGY (2021)

Add to Collection

Article Biochemistry & Molecular Biology

Evolutionary Sparse Learning for Phylogenomics

Sudhir Kumar et al.

Summary: Evolutionary Sparse Learning (ESL) is a supervised machine learning approach with sparsity constraints that builds models using only the most important genomic loci to explain phylogenetic hypotheses or trait presence/absence. ESL does not involve traditional parameters, but directly utilizes sequence variation concordance. ESL offers a natural way to combine different data types and has the potential to drive the development of new computational methods.

MOLECULAR BIOLOGY AND EVOLUTION (2021)

Add to Collection

Article Mathematics, Applied

Attaching leaves and picking cherries to characterise the hybridisation number for a set of phylogenies

Simone Linz et al.

ADVANCES IN APPLIED MATHEMATICS (2019)

Add to Collection

Article Biochemistry & Molecular Biology

Bayesian Inference of Species Networks from Multilocus Sequence Data

Chi Zhang et al.

MOLECULAR BIOLOGY AND EVOLUTION (2018)

Add to Collection

Article Evolutionary Biology

Inferring Phylogenetic Networks Using PhyloNet

Dingqiao Wen et al.

SYSTEMATIC BIOLOGY (2018)

Add to Collection

Article Biochemistry & Molecular Biology

PhyloNetworks: A Package for Phylogenetic Networks

Claudia Solis-Lemus et al.

MOLECULAR BIOLOGY AND EVOLUTION (2017)

Add to Collection

Article Biochemical Research Methods

Fast Construction of Near Parsimonious Hybridization Networks for Multiple Phylogenetic Trees

Sajad Mirzaei et al.

IEEE-ACM TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS (2016)

Add to Collection

Article Biochemical Research Methods

Computing all hybridization networks for multiple binary phylogenetic input trees

Benjamin Albrecht

BMC BIOINFORMATICS (2015)

Add to Collection

Article Biochemical Research Methods

Reconstructible Phylogenetic Networks: Do Not Distinguish the Indistinguishable

Fabio Pardi et al.

PLOS COMPUTATIONAL BIOLOGY (2015)

Add to Collection

Article Biology

Cherry Picking: A Characterization of the Temporal Hybridization Number for a Set of Phylogenies

Peter J. Humphries et al.

BULLETIN OF MATHEMATICAL BIOLOGY (2013)

Add to Collection

Article Computer Science, Theory & Methods

FIXED-PARAMETER ALGORITHMS FOR MAXIMUM AGREEMENT FORESTS

Chris Whidden et al.

SIAM JOURNAL ON COMPUTING (2013)

Add to Collection

Article Biology

Telling the whole story in a 10,000-genome world

Robert G. Beiko

BIOLOGY DIRECT (2011)

Add to Collection

Article Biochemical Research Methods

Regular Networks Can be Uniquely Constructed from Their Trees

Stephen J. Willson

IEEE-ACM TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS (2011)

Add to Collection

Article Evolutionary Biology

Coalescent Histories on Phylogenetic Networks and Detection of Hybridization Despite Incomplete Lineage Sorting

Yun Yu et al.

SYSTEMATIC BIOLOGY (2011)

Add to Collection

Article Biochemical Research Methods

Close lower and upper bounds for the minimum reticulate network of multiple phylogenetic trees

Yufeng Wu

BIOINFORMATICS (2010)

Add to Collection

Article Mathematics, Applied

Computing the minimum number of hybridization events for a consistent evolutionary history

Magnus Bordewich et al.

DISCRETE APPLIED MATHEMATICS (2007)

Add to Collection

© Peeref 2019-2024. All rights reserved.