Galled Perfect Transfer Networks
Fuente:
arXiv
Saved in:
| Main Authors: | Sánchez, Alitzel López, Lafond, Manuel |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
When is local search both effective and efficient?
by: Kaznatcheev, Artem, et al.
Published: (2024)
by: Kaznatcheev, Artem, et al.
Published: (2024)
Exponential Steepest Ascent from Valued Constraint Graphs of Pathwidth Four
by: Kaznatcheev, Artem, et al.
Published: (2024)
by: Kaznatcheev, Artem, et al.
Published: (2024)
The Path-Label Reconciliation (PLR) Dissimilarity Measure for Gene Trees
by: Sánchez, Alitzel López, et al.
Published: (2024)
by: Sánchez, Alitzel López, et al.
Published: (2024)
Local search for valued constraint satisfaction parameterized by treedepth
by: Kaznatcheev, Artem
Published: (2024)
by: Kaznatcheev, Artem
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)
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)
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)
by: Mestel, David, et al.
Published: (2024)
Graph-based method for constructing consensus trees
by: Torquet, Elio, et al.
Published: (2025)
by: Torquet, Elio, et al.
Published: (2025)
phylo2vec: a library for vector-based phylogenetic tree manipulation
by: Scheidwasser, Neil, et al.
Published: (2025)
by: Scheidwasser, Neil, et al.
Published: (2025)
Meeting times on graphs in near-cubic time
by: McAvoy, Alex
Published: (2026)
by: McAvoy, Alex
Published: (2026)
LvD: A New Algorithm for Computing the Likelihood of a Phylogeny
by: Bryant, David, et al.
Published: (2026)
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)
by: Klawitter, Jonathan, et al.
Published: (2025)
Inferring Phylogenetic Networks from Required and Forbidden LCA-Constraints
by: Ebert, Patricia A., et al.
Published: (2026)
by: Ebert, Patricia A., et al.
Published: (2026)
Reconstructing semi-directed level-1 networks using few quarnets
by: Frohn, Martin, et al.
Published: (2024)
by: Frohn, Martin, et al.
Published: (2024)
Taxonomic classification with maximal exact matches in KATKA kernels and minimizer digests
by: Draesslerová, Dominika, et al.
Published: (2024)
by: Draesslerová, Dominika, et al.
Published: (2024)
When are quarnets sufficient to reconstruct semi-directed phylogenetic networks?
by: Huber, Katharina T., et al.
Published: (2024)
by: Huber, Katharina T., et al.
Published: (2024)
Snakes and Ladders: a Treewidth Story
by: Chaplick, Steven, et al.
Published: (2023)
by: Chaplick, Steven, et al.
Published: (2023)
A Near-Linear-Time Algorithm for Finding a Well-Spread Perfect Matching in Bridgeless Cubic Graphs
by: Ghanbari, Babak, et al.
Published: (2026)
by: Ghanbari, Babak, et al.
Published: (2026)
Depth-13 Sorting Networks for 28 Channels
by: Wang, Chengu
Published: (2025)
by: Wang, Chengu
Published: (2025)
Spaces of ranked tree-child networks
by: Moulton, Vincent, et al.
Published: (2024)
by: Moulton, Vincent, et al.
Published: (2024)
Minsum Problem for Discrete and Weighted Set Flow on Dynamic Path Network
by: Manna, Bubai, et al.
Published: (2024)
by: Manna, Bubai, et al.
Published: (2024)
Embedding phylogenetic trees in networks of low treewidth
by: van Iersel, Leo, et al.
Published: (2022)
by: van Iersel, Leo, et al.
Published: (2022)
Weighted Food Webs Make Computing Phylogenetic Diversity So Much Harder
by: Schestag, Jannik
Published: (2025)
by: Schestag, Jannik
Published: (2025)
Orthology and Near-Cographs in the Context of Phylogenetic Networks
by: Lindeberg, Anna, et al.
Published: (2025)
by: Lindeberg, Anna, et al.
Published: (2025)
Simplifying and Characterizing DAGs and Phylogenetic Networks via Least Common Ancestor Constraints
by: Lindeberg, Anna, et al.
Published: (2024)
by: Lindeberg, Anna, et al.
Published: (2024)
A branch-&-price approach to the unrooted maximum agreement forest problem
by: Frohn, Martin, et al.
Published: (2024)
by: Frohn, Martin, et al.
Published: (2024)
On the existence of funneled orientations for classes of rooted phylogenetic networks
by: Döcker, Janosch, et al.
Published: (2024)
by: Döcker, Janosch, et al.
Published: (2024)
Phylogenetic Inference under the Balanced Minimum Evolution Criterion via Semidefinite Programming
by: Skums, P.
Published: (2026)
by: Skums, P.
Published: (2026)
Streaming algorithm for balance gain and cost with cardinality constraint on the integer lattice
by: Tan, Jingjing
Published: (2024)
by: Tan, Jingjing
Published: (2024)
A Lower Bound on the Competitive Ratio of the Permutation Algorithm for Online Facility Assignment on a Line
by: Harada, Tsubasa
Published: (2024)
by: Harada, Tsubasa
Published: (2024)
Exponential Time Approximation for Coloring 3-Colorable Graphs
by: Guruswami, Venkatesan, et al.
Published: (2024)
by: Guruswami, Venkatesan, et al.
Published: (2024)
Generation of weighted trees, block trees and block graphs
by: Ekim, Tınaz, et al.
Published: (2024)
by: Ekim, Tınaz, et al.
Published: (2024)
Circular-arc graphs and the Helly property
by: Derbisz, Jan, et al.
Published: (2024)
by: Derbisz, Jan, et al.
Published: (2024)
Parameterized Saga of First-Fit and Last-Fit Coloring
by: Agrawal, Akanksha, et al.
Published: (2024)
by: Agrawal, Akanksha, et al.
Published: (2024)
Detecting Disjoint Shortest Paths in Linear Time and More
by: Akmal, Shyan, et al.
Published: (2024)
by: Akmal, Shyan, et al.
Published: (2024)
Approximation Algorithm of Minimum All-Ones Problem for Arbitrary Graphs
by: Wang, Chen, et al.
Published: (2024)
by: Wang, Chen, et al.
Published: (2024)
A Nearly Optimal Deterministic Algorithm for Online Transportation Problem
by: Harada, Tsubasa, et al.
Published: (2024)
by: Harada, Tsubasa, et al.
Published: (2024)
Deterministic counting from coupling independence
by: Chen, Xiaoyu, et al.
Published: (2024)
by: Chen, Xiaoyu, et al.
Published: (2024)
Stability in Graphs with Matroid Constraints
by: Fomin, Fedor V., et al.
Published: (2024)
by: Fomin, Fedor V., et al.
Published: (2024)
Generalizing Roberts' characterization of unit interval graphs
by: Martínez, Virginia Ardévol, et al.
Published: (2024)
by: Martínez, Virginia Ardévol, et al.
Published: (2024)
Similar Items
-
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) -
The Path-Label Reconciliation (PLR) Dissimilarity Measure for Gene Trees
by: Sánchez, Alitzel López, et al.
Published: (2024) -
Local search for valued constraint satisfaction parameterized by treedepth
by: Kaznatcheev, Artem
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)