A strengthened bound on the number of states required to characterize maximum parsimony distance
Fuente:
arXiv
Saved in:
| Main Authors: | Fischer, Mareike, Kelk, Steven, Alferez, Sofia Vazquez |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
A kernel for the maximum agreement forest problem on multiple binary phylogenetic trees
by: Kelk, Steven, et al.
Published: (2026)
by: Kelk, Steven, et al.
Published: (2026)
Bounding the SNPR distance between two tree-child networks using generalised agreement forests
by: Kelk, Steven, et al.
Published: (2025)
by: Kelk, Steven, et al.
Published: (2025)
A complete characterization of pairs of binary phylogenetic trees with identical $A_k$-alignments
by: Wilde, Mirko, et al.
Published: (2024)
by: Wilde, Mirko, et al.
Published: (2024)
A 2-approximation algorithm for the softwired parsimony problem on binary, tree-child phylogenetic networks
by: Frohn, Martin, et al.
Published: (2024)
by: Frohn, Martin, et al.
Published: (2024)
Coconvex characters on collections of phylogenetic trees
by: Czabarka, Eva, et al.
Published: (2025)
by: Czabarka, Eva, et al.
Published: (2025)
Bounding the softwired parsimony score of a phylogenetic network
by: Döcker, Janosch, et al.
Published: (2024)
by: Döcker, Janosch, et al.
Published: (2024)
Revealing the building blocks of tree balance: fundamental units of the Sackin and Colless Indices
by: Knüver, Linda, et al.
Published: (2025)
by: Knüver, Linda, et al.
Published: (2025)
Perfect taxon sampling and fixing taxon traceability: Introducing a class of phylogenetically decisive collections of taxon sets
by: Fischer, Mareike, et al.
Published: (2012)
by: Fischer, Mareike, et al.
Published: (2012)
Bounds on the sequence length sufficient to reconstruct binary level-$1$ phylogenetic networks under the CFN model
by: Frohn, Martin, et al.
Published: (2025)
by: Frohn, Martin, et al.
Published: (2025)
A height-based metaconcept for rooted tree balance and its implications for the $B_1$ index
by: Fischer, Mareike, et al.
Published: (2026)
by: Fischer, Mareike, et al.
Published: (2026)
The weighted total cophenetic index: A novel balance index for phylogenetic networks
by: Knüver, Linda, et al.
Published: (2023)
by: Knüver, Linda, et al.
Published: (2023)
Metaconcepts of rooted tree balance
by: Fischer, Mareike, et al.
Published: (2025)
by: Fischer, Mareike, et al.
Published: (2025)
The GFB Tree and Tree Imbalance Indices
by: Cleary, Sean, et al.
Published: (2025)
by: Cleary, Sean, et al.
Published: (2025)
Snakes and Ladders: a Treewidth Story
by: Chaplick, Steven, et al.
Published: (2023)
by: Chaplick, Steven, et al.
Published: (2023)
Cherry picking in forests: A new characterization for the unrooted hybrid number of two phylogenetic trees
by: Huber, Katharina T., et al.
Published: (2022)
by: Huber, Katharina T., et al.
Published: (2022)
A sharp lower bound for the number of phylogenetic trees displayed by a tree-child network
by: Semple, Charles, et al.
Published: (2025)
by: Semple, Charles, et al.
Published: (2025)
Defining a phylogenetic tree with the minimum number of small-state characters
by: Long, Yangjing, et al.
Published: (2025)
by: Long, Yangjing, et al.
Published: (2025)
Reconstructing semi-directed level-1 networks using few quarnets
by: Frohn, Martin, et al.
Published: (2024)
by: Frohn, Martin, et al.
Published: (2024)
A $μ$-distance for semidirected orchard phylogenetic networks
by: Ribas, Gerard, et al.
Published: (2026)
by: Ribas, Gerard, et al.
Published: (2026)
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)
The structure of deviations from maximum parsimony for densely-sampled data and applications for clade support estimation
by: Howard-Snyder, William, et al.
Published: (2023)
by: Howard-Snyder, William, et al.
Published: (2023)
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)
Closing the complexity gap of the double distance problem
by: Cunha, Luís, et al.
Published: (2024)
by: Cunha, Luís, et al.
Published: (2024)
A survey of the monotonicity and non-contradiction of consensus methods and supertree methods
by: Fischer, Mareike, et al.
Published: (2021)
by: Fischer, Mareike, et al.
Published: (2021)
Inconsistency of parsimony under the multispecies coalescent
by: Rickert, Daniel, et al.
Published: (2024)
by: Rickert, Daniel, et al.
Published: (2024)
When is local search both effective and efficient?
by: Kaznatcheev, Artem, et al.
Published: (2024)
by: Kaznatcheev, Artem, et al.
Published: (2024)
Computational support for case-heavy proofs in mathematical phylogenetics
by: Forte, Luca, et al.
Published: (2025)
by: Forte, Luca, et al.
Published: (2025)
A dissimilarity measure for semidirected networks
by: Maxfield, Michael, et al.
Published: (2024)
by: Maxfield, Michael, et al.
Published: (2024)
On the correctness of Maximum Parsimony for data with few substitutions in the NNI neighborhood of phylogenetic trees
by: Fischer, Mareike
Published: (2024)
by: Fischer, Mareike
Published: (2024)
Colorings of unrooted tree-based networks and related graphs
by: Wilde, Mirko, et al.
Published: (2025)
by: Wilde, Mirko, et al.
Published: (2025)
Covariance Decomposition for Distance Based Species Tree Estimation
by: Aliatimis, Georgios, et al.
Published: (2025)
by: Aliatimis, Georgios, et al.
Published: (2025)
Distinguishing Phylogenetic Level-2 Networks with Quartets and Inter-Taxon Quartet Distances
by: Holtgrefe, Niels, et al.
Published: (2025)
by: Holtgrefe, Niels, et al.
Published: (2025)
Order-Dependent Dissimilarity Measures on Phylogenetic Trees
by: Linz, Simone, et al.
Published: (2025)
by: Linz, Simone, et al.
Published: (2025)
Projected Gradient Descent Method for Tropical Principal Component Analysis over Tree Space
by: Yoshida, Ruriko
Published: (2025)
by: Yoshida, Ruriko
Published: (2025)
Characterizing semi-directed phylogenetic networks and their multi-rootable variants
by: Holtgrefe, Niels, et al.
Published: (2025)
by: Holtgrefe, Niels, et al.
Published: (2025)
Generalizing matrix representations to fully heterochronous ranked tree shapes
by: Jennings-Shaffer, Chris, et al.
Published: (2025)
by: Jennings-Shaffer, Chris, et al.
Published: (2025)
Binary normal networks without near reticulations can be reconstructed from their rooted triples
by: Francis, Andrew, et al.
Published: (2025)
by: Francis, Andrew, et al.
Published: (2025)
Tropical Fermat-Weber Points over Spaces of $M$-Ultrametrics
by: Cox, Shelby, et al.
Published: (2025)
by: Cox, Shelby, et al.
Published: (2025)
Enumerative combinatorics of unlabeled and labeled time-consistent galled trees
by: Agranat-Tamir, Lily, et al.
Published: (2025)
by: Agranat-Tamir, Lily, et al.
Published: (2025)
Metrics for classes of semi-binary phylogenetic networks using $μ$-representations
by: Reichling, Christopher, et al.
Published: (2024)
by: Reichling, Christopher, et al.
Published: (2024)
Similar Items
-
A kernel for the maximum agreement forest problem on multiple binary phylogenetic trees
by: Kelk, Steven, et al.
Published: (2026) -
Bounding the SNPR distance between two tree-child networks using generalised agreement forests
by: Kelk, Steven, et al.
Published: (2025) -
A complete characterization of pairs of binary phylogenetic trees with identical $A_k$-alignments
by: Wilde, Mirko, et al.
Published: (2024) -
A 2-approximation algorithm for the softwired parsimony problem on binary, tree-child phylogenetic networks
by: Frohn, Martin, et al.
Published: (2024) -
Coconvex characters on collections of phylogenetic trees
by: Czabarka, Eva, et al.
Published: (2025)