Cover Image

On the existence of funneled orientations for classes of rooted phylogenetic networks

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Döcker, Janosch, Linz, Simone
Format:	Preprint
Published:	2024
Subjects:	Populations and Evolution Computational Complexity Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Characterising rooted and unrooted tree-child networks
by: Döcker, Janosch, et al.
Published: (2024)

Bounding the softwired parsimony score of a phylogenetic network
by: Döcker, Janosch, et al.
Published: (2024)

A Class of Unrooted Phylogenetic Networks Inspired by the Properties of Rooted Tree-Child Networks
by: van Iersel, Leo, et al.
Published: (2026)

When are quarnets sufficient to reconstruct semi-directed phylogenetic networks?
by: Huber, Katharina T., et al.
Published: (2024)

Seed Selection in the Heterogeneous Moran Process
by: Petsinis, Petros, et al.
Published: (2024)

phylo2vec: a library for vector-based phylogenetic tree manipulation
by: Scheidwasser, Neil, et al.
Published: (2025)

Reconstructing semi-directed level-1 networks using few quarnets
by: Frohn, Martin, et al.
Published: (2024)

Tree Containment Parameterized by Scanwidth
by: van Iersel, Leo, et al.
Published: (2026)

Analysis of Phylogeny Tracking Algorithms for Serial and Multiprocess Applications
by: Moreno, Matthew Andres, et al.
Published: (2024)

Split-or-decompose: Improved FPT branching algorithms for maximum agreement forests
by: Mestel, David, et al.
Published: (2024)

Graph-based method for constructing consensus trees
by: Torquet, Elio, et al.
Published: (2025)

Meeting times on graphs in near-cubic time
by: McAvoy, Alex
Published: (2026)

LvD: A New Algorithm for Computing the Likelihood of a Phylogeny
by: Bryant, David, et al.
Published: (2026)

Bayesian Credible Sets for Phylogenetic Tree Topologies with Applications to Coverage Analysis and Cross-Model Comparison
by: Klawitter, Jonathan, et al.
Published: (2025)

Taxonomic classification with maximal exact matches in KATKA kernels and minimizer digests
by: Draesslerová, Dominika, et al.
Published: (2024)

Snakes and Ladders: a Treewidth Story
by: Chaplick, Steven, et al.
Published: (2023)

Galled Perfect Transfer Networks
by: Sánchez, Alitzel López, et al.
Published: (2024)

A branch-&-price approach to the unrooted maximum agreement forest problem
by: Frohn, Martin, et al.
Published: (2024)

When is local search both effective and efficient?
by: Kaznatcheev, Artem, et al.
Published: (2024)

Exponential Steepest Ascent from Valued Constraint Graphs of Pathwidth Four
by: Kaznatcheev, Artem, et al.
Published: (2024)

Phylogenetic Inference under the Balanced Minimum Evolution Criterion via Semidefinite Programming
by: Skums, P.
Published: (2026)

Polynomial-time completion of phylogenetic tree sets
by: Koshkarov, Aleksandr, et al.
Published: (2026)

Local search for valued constraint satisfaction parameterized by treedepth
by: Kaznatcheev, Artem
Published: (2024)

Self-referential instances of the dominating set problem are irreducible
by: Zhou, Guangyan
Published: (2026)

A general framework for finding diverse solutions via network flow and its applications
by: Iwamasa, Yuni, et al.
Published: (2025)

Cherry picking in forests: A new characterization for the unrooted hybrid number of two phylogenetic trees
by: Huber, Katharina T., et al.
Published: (2022)

Can You Link Up With Treewidth?
by: Curticapean, Radu, et al.
Published: (2024)

Tight Streaming Lower Bounds for Deterministic Approximate Counting
by: Wang, Yichuan
Published: (2024)

Simple approximation algorithms for Polyamorous Scheduling
by: Biktairov, Yuriy, et al.
Published: (2024)

Size Minimization For Multi-Output AND-Functions
by: Armbruster, Susanne
Published: (2024)

TSP Escapes the $O(2^n n^2)$ Curse
by: Stoian, Mihail
Published: (2024)

Cluster Editing on Cographs and Related Classes
by: Lafond, Manuel, et al.
Published: (2024)

Improved Hardness-of-Approximation for Token Swapping
by: Hiken, Sam, et al.
Published: (2024)

Near-Optimal Averaging Samplers and Matrix Samplers
by: Xun, Zhiyang, et al.
Published: (2024)

On the complexity and approximability of Bounded access Lempel Ziv coding
by: Cicalese, Ferdinando, et al.
Published: (2024)

Parameterized Vertex Integrity Revisited
by: Hanaka, Tesshu, et al.
Published: (2024)

On approximability of the Permanent of PSD matrices
by: Ebrahimnejad, Farzam, et al.
Published: (2024)

Further Explanations on "SAT Requires Exhaustive Search"
by: Dong, Qingxiu, et al.
Published: (2024)

PCF Learned Sort: a Learning Augmented Sort Algorithm with $O(n \log\log n)$ Expected Complexity
by: Sato, Atsuki, et al.
Published: (2024)

Randomized query composition and product distributions
by: Sanyal, Swagato
Published: (2024)