Convex Characters, Algorithms, and Matchings

DOI10.1137/21m1463999arXiv2111.12632OpenAlexW3216418330MaRDI QIDQ6141866

No author found.

Publication date: 23 January 2024

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2111.12632

zbMATH Keywords

combinatoricsenumerationmatchingsphylogeneticsexponential-time algorithmsagreement forests

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Taxonomy, cladistics, statistics in mathematical biology (92B10) Combinatorics in computer science (68R05) Enumeration in graph theory (05C30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the maximum parsimony distance between phylogenetic trees
• Parameterized and approximation algorithms for maximum agreement forest in multifurcating trees
• On the number of independent subsets in trees with restricted degrees
• Exact exponential algorithms.
• Maxima and minima of the Hosoya index and the Merrifield-Simmons index
• A note on convex characters, Fibonacci numbers and exponential-time algorithms
• The complexity of reconstructing trees from qualitative characters and subtrees
• On the complexity of computing MP distance between binary phylogenetic trees
• Reflections on kernelizing and computing unrooted agreement forests
• Sharp upper and lower bounds on a restricted class of convex characters
• Maximum parsimony distance on phylogenetic trees: a linear kernel and constant factor approximation algorithm
• A parsimony-based metric for phylogenetic trees
• Phylogenetic incongruence through the lens of Monadic Second Order logic
• Fixed-Parameter Algorithms for Maximum Agreement Forests
• Basic Phylogenetic Combinatorics
• Kernelization
• The Maximum Number of Minimal Dominating Sets in a Tree
• Elements of Information Theory
• Parameterized Algorithms
• Subtree transfer operations and their induced metrics on evolutionary trees
• On the complexity of comparing evolutionary trees
• A near-linear kernel for bounded-state parsimony distance

This page was built for publication: Convex Characters, Algorithms, and Matchings