On the public citation graph

Fixed-Parameter Algorithms for Maximum Agreement Forests

https://doi.org/10.1137/110845045
0 signed · 109 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/11533719_11openalex-snapshot
RIATA-HGT: A Fast and Accurate Heuristic for Reconstructing Horizontal Gene Transfer
inferredcites →https://doi.org/10.1007/978-3-642-02777-2_3openalex-snapshot
Efficiently Calculating Evolutionary Tree Measures Using SAT
inferredcites →https://doi.org/10.1007/978-3-642-04241-6_32openalex-snapshot
A Unifying View on Approximation and FPT of Agreement Forests
inferredcites →https://doi.org/10.1007/978-3-642-13078-6_23openalex-snapshot
Fast Computation of the Exact Hybridization Number of Two Phylogenetic Trees
inferredcites →https://doi.org/10.1007/978-3-642-13193-6_13openalex-snapshot
Fast FPT Algorithms for Computing Rooted Agreement Forests: Theory and Experiments
inferredcites →https://doi.org/10.1007/bf01908061openalex-snapshot
Optimal algorithms for comparing trees with labeled leaves
inferredcites →https://doi.org/10.1007/s00026-001-8006-8openalex-snapshot
Subtree Transfer Operations and Their Induced Metrics on Evolutionary Trees
inferredcites →https://doi.org/10.1007/s00026-004-0229-zopenalex-snapshot
On the Computational Complexity of the Rooted Subtree Prune and Regraft Distance
inferredcites →https://doi.org/10.1007/s00224-007-1329-zopenalex-snapshot
A Faster FPT Algorithm for the Maximum Agreement Forest Problem
inferredcites →https://doi.org/10.1007/s00285-005-0315-9openalex-snapshot
Bounding the Number of Hybridisation Events for a Consistent Evolutionary History
inferredcites →https://doi.org/10.1016/0025-5564(81)90043-2openalex-snapshot
Comparison of phylogenetic trees
inferredcites →https://doi.org/10.1016/j.dam.2006.08.008openalex-snapshot
Computing the minimum number of hybridization events for a consistent evolutionary history
inferredcites →https://doi.org/10.1016/j.ipl.2004.11.004openalex-snapshot
Approximating the Maximum Agreement Forest on k trees
inferredcites →https://doi.org/10.1016/j.jda.2007.10.002openalex-snapshot
A 3-approximation algorithm for the subtree distance between phylogenies
inferredcites →https://doi.org/10.1016/j.tcs.2006.12.011openalex-snapshot
The maximum agreement forest problem: Approximation algorithms and computational experiments
inferredcites →https://doi.org/10.1016/s0166-218x(96)00062-5openalex-snapshot
On the complexity of comparing evolutionary trees
inferredcites →https://doi.org/10.1089/cmb.2005.12.796openalex-snapshot
Reconstructing Reticulate Evolution in Species—Theory and Practice
inferredcites →https://doi.org/10.1089/cmb.2006.13.1419openalex-snapshot
Approximating Subtree Distances Between Phylogenies
inferredcites →https://doi.org/10.1093/bioinformatics/btn606openalex-snapshot
A practical method for exact computation of subtree prune and regraft distance
inferredcites →https://doi.org/10.1093/molbev/msj120openalex-snapshot
Horizontal Transfer of a Virulence Operon to the Ancestor of Mycobacterium tuberculosis
inferredcites →https://doi.org/10.1093/sysbio/46.3.523openalex-snapshot
Gene Trees in Species Trees
inferredcites →https://doi.org/10.1109/tcbb.2007.1019openalex-snapshot
Computing the Hybridization Number of Two Phylogenetic Trees Is Fixed-Parameter Tractable
inferredcites →https://doi.org/10.1109/tcbb.2008.132openalex-snapshot
On the Complexity of uSPR Distance
inferredcites →https://doi.org/10.1109/tcbb.2008.86openalex-snapshot
Hybridization in Nonbinary Trees
inferredcites →https://doi.org/10.1109/tcbb.2011.137openalex-snapshot
Algorithms for Reticulate Networks of Multiple Phylogenetic Trees
inferredcites →https://doi.org/10.1137/120864350openalex-snapshot
Cycle Killer...Qu'est-ce que c'est? On the Comparative Approximability of Hybridization Number and Directed Feedback Vertex Set
inferredcites →https://doi.org/10.1145/369133.369188openalex-snapshot
Efficient algorithms for lateral gene transfer problems
inferredcites →https://doi.org/10.1186/1471-2148-5-27openalex-snapshot
Deduction of probable events of lateral gene transfer through comparison of phylogenetic trees by recursive consolidation and rearrangement
inferredcites →https://doi.org/10.1186/1471-2148-6-15openalex-snapshot
Phylogenetic identification of lateral genetic transfer events
inferredcites →https://doi.org/10.4137/ebo.s419openalex-snapshot
SPR Distance Computation for Unrooted Trees
inferredcites →https://doi.org/10.48550/arxiv.1108.2664openalex-snapshot
Fixed-Parameter and Approximation Algorithms for Maximum Agreement Forests

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.11646/phytotaxa.399.3.5zenodo-depositor-declared
Towards a phylogenetic classification of the Myxomycetes
inferred← citeshttps://doi.org/10.1002/ece3.4219openalex-snapshot
PMERGE : Computational filtering of paralogous sequences from RAD ‐seq data
inferred← citeshttps://doi.org/10.1007/978-1-4614-6624-6_52-1openalex-snapshot
Computing Distances Between Evolutionary Trees
inferred← citeshttps://doi.org/10.1007/978-1-4939-6622-6_16openalex-snapshot
Scaling Up the Phylogenetic Detection of Lateral Gene Transfer Events
inferred← citeshttps://doi.org/10.1007/978-3-030-38919-2_42openalex-snapshot
Scanning Phylogenetic Networks Is NP-hard
inferred← citeshttps://doi.org/10.1007/978-3-030-42266-0_7openalex-snapshot
Combining Networks Using Cherry Picking Sequences
inferred← citeshttps://doi.org/10.1007/978-3-319-12340-0_25openalex-snapshot
Kernelizations for the Hybridization Number Problem on Multiple Nonbinary Trees
inferred← citeshttps://doi.org/10.1007/s00026-015-0298-1openalex-snapshot
On the Maximum Parsimony Distance Between Phylogenetic Trees
inferred← citeshttps://doi.org/10.1007/s00026-020-00502-7openalex-snapshot
New Reduction Rules for the Tree Bisection and Reconnection Distance
inferred← citeshttps://doi.org/10.1007/s00285-016-1023-3openalex-snapshot
On the fixed parameter tractability of agreement-based phylogenetic distances
inferred← citeshttps://doi.org/10.1007/s00285-019-01405-9openalex-snapshot
Not all phylogenetic networks are leaf-reconstructible
inferred← citeshttps://doi.org/10.1007/s00453-015-0087-6openalex-snapshot
Approximating Maximum Agreement Forest on Multiple Binary Trees
inferred← citeshttps://doi.org/10.1007/s00453-015-9983-zopenalex-snapshot
Fixed-Parameter and Approximation Algorithms for Maximum Agreement Forests of Multifurcating Trees
inferred← citeshttps://doi.org/10.1007/s00453-017-0366-5openalex-snapshot
On Unrooted and Root-Uncertain Variants of Several Well-Known Phylogenetic Network Problems
inferred← citeshttps://doi.org/10.1007/s00453-021-00914-8openalex-snapshot
A Practical Fixed-Parameter Algorithm for Constructing Tree-Child Networks from Multiple Binary Trees
inferred← citeshttps://doi.org/10.1007/s10107-022-01790-yopenalex-snapshot
A duality based 2-approximation algorithm for maximum agreement forest
inferred← citeshttps://doi.org/10.1007/s10479-021-04352-1openalex-snapshot
Reflections on kernelizing and computing unrooted agreement forests
inferred← citeshttps://doi.org/10.1007/s10878-015-9921-7openalex-snapshot
Improved approximation algorithm for maximum agreement forest of two rooted binary phylogenetic trees
inferred← citeshttps://doi.org/10.1007/s11538-013-9874-xopenalex-snapshot
Cherry Picking: A Characterization of the Temporal Hybridization Number for a Set of Phylogenies
inferred← citeshttps://doi.org/10.1007/s11538-023-01244-2openalex-snapshot
Ranked Subtree Prune and Regraft
inferred← citeshttps://doi.org/10.1007/s11538-026-01611-9openalex-snapshot
Vector Encoding of Phylogenetic Trees by Ordered Leaf Attachment
inferred← citeshttps://doi.org/10.1016/j.dam.2019.01.031openalex-snapshot
Deciding the existence of a cherry-picking sequence is hard on two trees
inferred← citeshttps://doi.org/10.1016/j.ipl.2022.106336openalex-snapshot
Cyclic generators and an improved linear kernel for the rooted subtree prune and regraft distance
inferred← citeshttps://doi.org/10.1016/j.ipl.2025.106572openalex-snapshot
A simple 4-approximation algorithm for maximum agreement forests on multiple unrooted binary trees
inferred← citeshttps://doi.org/10.1016/j.jcss.2016.03.006openalex-snapshot
Kernelizations for the hybridization number problem on multiple nonbinary trees
inferred← citeshttps://doi.org/10.1016/j.jcss.2018.03.002openalex-snapshot
A parameterized algorithm for the Maximum Agreement Forest problem on multiple rooted multifurcating trees
inferred← citeshttps://doi.org/10.1016/j.jcss.2020.10.003openalex-snapshot
Maximum parsimony distance on phylogenetic trees: A linear kernel and constant factor approximation algorithm
inferred← citeshttps://doi.org/10.1016/j.jcss.2024.103519openalex-snapshot
Deep kernelization for the Tree Bisection and Reconnection (TBR) distance in phylogenetics
inferred← citeshttps://doi.org/10.1016/j.jcss.2025.103657openalex-snapshot
Bounding the number of reticulation events for displaying multiple trees in a phylogenetic network
inferred← citeshttps://doi.org/10.1016/j.jcss.2026.103800openalex-snapshot
Split-or-decompose: Improved FPT branching algorithms for maximum agreement forests
inferred← citeshttps://doi.org/10.1016/j.jtbi.2019.04.001openalex-snapshot
Reconciliation of a gene network and species tree
inferred← citeshttps://doi.org/10.1016/j.orl.2025.107364openalex-snapshot
A branch-&-price approach to the unrooted maximum agreement forest problem
inferred← citeshttps://doi.org/10.1016/j.tcs.2013.12.025openalex-snapshot
Algorithms for parameterized maximum agreement forest problem on multiple trees
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.10.031openalex-snapshot
Parameterized and approximation algorithms for maximum agreement forest in multifurcating trees
inferred← citeshttps://doi.org/10.1016/j.tcs.2017.02.006openalex-snapshot
Ricci-Ollivier Curvature of the Rooted Phylogenetic Subtree-Prune-Regraft Graph
inferred← citeshttps://doi.org/10.1016/j.tcs.2024.114608openalex-snapshot
Agreement forests of caterpillar trees: Complexity, kernelization and branching
inferred← citeshttps://doi.org/10.1038/srep45258openalex-snapshot
Genomic characterization of Nontuberculous Mycobacteria
inferred← citeshttps://doi.org/10.1073/pnas.2510938123openalex-snapshot
Biological causes and impacts of rugged tree landscapes in phylodynamic inference
inferred← citeshttps://doi.org/10.1089/cmb.2019.0432openalex-snapshot
Improved Practical Algorithms for Rooted Subtree Prune and Regraft (rSPR) Distance and Hybridization Number
inferred← citeshttps://doi.org/10.1093/bioinformatics/btac075openalex-snapshot
RF-Net 2: fast inference of virus reassortment and hybridization networks
inferred← citeshttps://doi.org/10.1093/bioinformatics/btae514openalex-snapshot
Estimating the mean in the space of ranked phylogenetic trees
inferred← citeshttps://doi.org/10.1093/bioinformatics/btu815openalex-snapshot
andi: Fast and accurate estimation of evolutionary distances between closely related genomes
inferred← citeshttps://doi.org/10.1093/molbev/msw038openalex-snapshot
Clustering Genes of Common Evolutionary History
inferred← citeshttps://doi.org/10.1093/sysbio/syaa002openalex-snapshot
Using Parsimony-Guided Tree Proposals to Accelerate Convergence in Bayesian Phylogenetic Inference
inferred← citeshttps://doi.org/10.1093/sysbio/syu023openalex-snapshot
Supertrees Based on the Subtree Prune-and-Regraft Distance
inferred← citeshttps://doi.org/10.1093/sysbio/syv006openalex-snapshot
Quantifying MCMC Exploration of Phylogenetic Tree Space
inferred← citeshttps://doi.org/10.1093/sysbio/syw025openalex-snapshot
Review Paper: The Shape of Phylogenetic Treespace
inferred← citeshttps://doi.org/10.1093/ve/veae081openalex-snapshot
On the importance of assessing topological convergence in Bayesian phylogenetic inference
inferred← citeshttps://doi.org/10.1101/gr.277669.123openalex-snapshot
A fast and scalable method for inferring phylogenetic networks from trees by aligning lineage taxon strings
inferred← citeshttps://doi.org/10.1109/tcbb.2015.2462336openalex-snapshot
Fast Construction of Near Parsimonious Hybridization Networks for Multiple Phylogenetic Trees
inferred← citeshttps://doi.org/10.1109/tcbb.2016.2537326openalex-snapshot
Autumn Algorithm—Computation of Hybridization Networks for Realistic Phylogenetic Trees
inferred← citeshttps://doi.org/10.1109/tcbb.2016.2543727openalex-snapshot
A Linear Bound on the Number of States in Optimal Convex Characters for Maximum Parsimony Distance
inferred← citeshttps://doi.org/10.1109/tcbb.2016.2613040openalex-snapshot
Tanglegrams: A Reduction Tool for Mathematical Phylogenetics
inferred← citeshttps://doi.org/10.1109/tcbb.2018.2802911openalex-snapshot
Calculating the Unrooted Subtree Prune-and-Regraft Distance
inferred← citeshttps://doi.org/10.1111/cla.12111openalex-snapshot
Problems with supertrees based on the subtree prune‐and‐regraft distance, with comments on majority rule supertrees
inferred← citeshttps://doi.org/10.1137/1.9781611975062.8openalex-snapshot
Efficiently Inferring Pairwise Subtree Prune-and-Regraft Adjacencies between Phylogenetic Trees
inferred← citeshttps://doi.org/10.1137/120903567openalex-snapshot
Approximation Algorithms for Nonbinary Agreement Forests
inferred← citeshttps://doi.org/10.1137/15m1036579openalex-snapshot
Hybridization Number on Three Rooted Binary Trees is EPT
inferred← citeshttps://doi.org/10.1137/18m122724xopenalex-snapshot
A Tight Kernel for Computing the Tree Bisection and Reconnection Distance between Two Phylogenetic Trees
inferred← citeshttps://doi.org/10.1137/21m1463999openalex-snapshot
Convex Characters, Algorithms, and Matchings
inferred← citeshttps://doi.org/10.1142/s0219720021400126openalex-snapshot
Comparing the topology of phylogenetic network generators
inferred← citeshttps://doi.org/10.1145/3307339.3342151openalex-snapshot
Robinson-Foulds Reticulation Networks
inferred← citeshttps://doi.org/10.1186/1471-2105-15-127openalex-snapshot
A practical approximation algorithm for solving massive instances of hybridization number for binary and nonbinary trees
inferred← citeshttps://doi.org/10.1186/s13015-023-00233-3openalex-snapshot
Constructing phylogenetic networks via cherry picking and machine learning
inferred← citeshttps://doi.org/10.23638/dmtcs-21-3-19openalex-snapshot
The agreement distance of rooted phylogenetic networks
inferred← citeshttps://doi.org/10.23638/dmtcs-22-1-22openalex-snapshot
The agreement distance of unrooted phylogenetic networks
inferred← citeshttps://doi.org/10.3390/a12120256openalex-snapshot
Parameterized Algorithms in Bioinformatics: An Overview
inferred← citeshttps://doi.org/10.48550/arxiv.1205.3417openalex-snapshot
A practical approximation algorithm for solving massive instances of hybridization number for binary and nonbinary trees
inferred← citeshttps://doi.org/10.48550/arxiv.1311.4045openalex-snapshot
Kernelizations for the hybridization number problem on multiple nonbinary trees
inferred← citeshttps://doi.org/10.48550/arxiv.1312.1255openalex-snapshot
A short note on exponential-time algorithms for hybridization number
inferred← citeshttps://doi.org/10.48550/arxiv.1403.1094openalex-snapshot
Reassortment between influenza B lineages and the emergence of a co-adapted PB1-PB2-HA gene complex
inferred← citeshttps://doi.org/10.48550/arxiv.1405.2120openalex-snapshot
Quantifying MCMC Exploration of Phylogenetic Tree Space
inferred← citeshttps://doi.org/10.48550/arxiv.1411.0062openalex-snapshot
Algorithms for Maximum Agreement Forest of Multiple General Trees
inferred← citeshttps://doi.org/10.48550/arxiv.1608.02709openalex-snapshot
Parameterized Algorithms for the Maximum Agreement Forest Problem on Multiple Rooted Multifurcating Trees
inferred← citeshttps://doi.org/10.48550/arxiv.1609.00544openalex-snapshot
On unrooted and root-uncertain variants of several well-known phylogenetic network problems
inferred← citeshttps://doi.org/10.48550/arxiv.1611.02351openalex-snapshot
Chain Reduction Preserves the Unrooted Subtree Prune-and-Regraft Distance
inferred← citeshttps://doi.org/10.70675/1808f4daz3a7dz4e8czaa5cz3c9b8246ba76openalex-snapshot
Algorithmic investigations of the dynamics of species interactions
inferred← citeshttps://doi.org/10.7155/jgaa.00390openalex-snapshot
Phylogenetic incongruence through the lens of Monadic Second Order logic
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.