Image de couverture de livre

Bounding the SNPR distance between two tree-child networks using generalised agreement forests

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Kelk, Steven, Linz, Simone, Semple, Charles
Format:	Preprint
Publié:	2025
Sujets:	Combinatorics Populations and Evolution
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Characterising rooted and unrooted tree-child networks
par: Döcker, Janosch, et autres
Publié: (2024)

A kernel for the maximum agreement forest problem on multiple binary phylogenetic trees
par: Kelk, Steven, et autres
Publié: (2026)

A sharp lower bound for the number of phylogenetic trees displayed by a tree-child network
par: Semple, Charles, et autres
Publié: (2025)

Cherry picking in forests: A new characterization for the unrooted hybrid number of two phylogenetic trees
par: Huber, Katharina T., et autres
Publié: (2022)

Order-Dependent Dissimilarity Measures on Phylogenetic Trees
par: Linz, Simone, et autres
Publié: (2025)

Bounding the softwired parsimony score of a phylogenetic network
par: Döcker, Janosch, et autres
Publié: (2024)

A strengthened bound on the number of states required to characterize maximum parsimony distance
par: Fischer, Mareike, et autres
Publié: (2025)

Binary normal networks without near reticulations can be reconstructed from their rooted triples
par: Francis, Andrew, et autres
Publié: (2025)

Bounds on the sequence length sufficient to reconstruct binary level-$1$ phylogenetic networks under the CFN model
par: Frohn, Martin, et autres
Publié: (2025)

Coconvex characters on collections of phylogenetic trees
par: Czabarka, Eva, et autres
Publié: (2025)

A 2-approximation algorithm for the softwired parsimony problem on binary, tree-child phylogenetic networks
par: Frohn, Martin, et autres
Publié: (2024)

Reconstructing semi-directed level-1 networks using few quarnets
par: Frohn, Martin, et autres
Publié: (2024)

Split-or-decompose: Improved FPT branching algorithms for maximum agreement forests
par: Mestel, David, et autres
Publié: (2024)

A $μ$-distance for semidirected orchard phylogenetic networks
par: Ribas, Gerard, et autres
Publié: (2026)

Snakes and Ladders: a Treewidth Story
par: Chaplick, Steven, et autres
Publié: (2023)

A branch-&-price approach to the unrooted maximum agreement forest problem
par: Frohn, Martin, et autres
Publié: (2024)

0-1 laws for pattern occurrences in phylogenetic trees and networks
par: Bienvenu, François, et autres
Publié: (2024)

A Class of Unrooted Phylogenetic Networks Inspired by the Properties of Rooted Tree-Child Networks
par: van Iersel, Leo, et autres
Publié: (2026)

Combinatorial comparison of general galled trees, time-consistent galled trees, and simplex time-consistent galled trees
par: Agranat-Tamir, Lily, et autres
Publié: (2026)

Metrics for classes of semi-binary phylogenetic networks using $μ$-representations
par: Reichling, Christopher, et autres
Publié: (2024)

Metaconcepts of rooted tree balance
par: Fischer, Mareike, et autres
Publié: (2025)

Bounds on the Treewidth of Level-k Rooted Phylogenetic Networks
par: Markin, Alexey, et autres
Publié: (2024)

Generalizing matrix representations to fully heterochronous ranked tree shapes
par: Jennings-Shaffer, Chris, et autres
Publié: (2025)

Enumerative combinatorics of unlabeled and labeled time-consistent galled trees
par: Agranat-Tamir, Lily, et autres
Publié: (2025)

Defining a phylogenetic tree with the minimum number of small-state characters
par: Long, Yangjing, et autres
Publié: (2025)

Revealing the building blocks of tree balance: fundamental units of the Sackin and Colless Indices
par: Knüver, Linda, et autres
Publié: (2025)

A dissimilarity measure for semidirected networks
par: Maxfield, Michael, et autres
Publié: (2024)

A complete characterization of pairs of binary phylogenetic trees with identical $A_k$-alignments
par: Wilde, Mirko, et autres
Publié: (2024)

A height-based metaconcept for rooted tree balance and its implications for the $B_1$ index
par: Fischer, Mareike, et autres
Publié: (2026)

Phylogenetic network classes through the lens of expanding covers
par: Francis, Andrew, et autres
Publié: (2023)

Characterizing semi-directed phylogenetic networks and their multi-rootable variants
par: Holtgrefe, Niels, et autres
Publié: (2025)

The weighted total cophenetic index: A novel balance index for phylogenetic networks
par: Knüver, Linda, et autres
Publié: (2023)

Counting rankings of tree-child networks
par: Zhang, Qiang, et autres
Publié: (2025)

Closing the complexity gap of the double distance problem
par: Cunha, Luís, et autres
Publié: (2024)

Bounding the number of reticulation events for displaying multiple trees in a phylogenetic network
par: Wu, Yufeng, et autres
Publié: (2024)

The space of multifurcating ranked tree shapes: enumeration, lattice structure, and Markov chains
par: Zhang, Julie, et autres
Publié: (2025)

Computational support for case-heavy proofs in mathematical phylogenetics
par: Forte, Luca, et autres
Publié: (2025)

Covariance Decomposition for Distance Based Species Tree Estimation
par: Aliatimis, Georgios, et autres
Publié: (2025)

Distinguishing Phylogenetic Level-2 Networks with Quartets and Inter-Taxon Quartet Distances
par: Holtgrefe, Niels, et autres
Publié: (2025)

Projected Gradient Descent Method for Tropical Principal Component Analysis over Tree Space
par: Yoshida, Ruriko
Publié: (2025)