R.I.P.
π»
Ghosted
On Determining if Tree-based Networks Contain Fixed Trees
February 08, 2016 Β· Declared Dead Β· π Bulletin of Mathematical Biology
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Maria Anaya, Olga Anipchenko-Ulaj, Aisha Ashfaq, Joyce Chiu, Mahedi Kaiser, Max Shoji Ohsawa, Megan Owen, Ella Pavlechko, Katherine St. John, Shivam Suleria, Keith Thompson, Corrine Yap
arXiv ID
1602.02739
Category
q-bio.PE
Cross-listed
cs.DS
Citations
20
Venue
Bulletin of Mathematical Biology
Last Checked
3 months ago
Abstract
We address an open question of Francis and Steel about phylogenetic networks and trees. They give a polynomial time algorithm to decide if a phylogenetic network, N, is tree-based and pose the problem: given a fixed tree T and network N, is N based on T? We show that it is NP-hard to decide, by reduction from 3-Dimensional Matching (3DM), and further, that the problem is fixed parameter tractable.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
π Similar Papers
In the same crypt β q-bio.PE
R.I.P.
π»
Ghosted
Simulating COVID-19 in a University Environment
R.I.P.
π»
Ghosted
How morphological development can guide evolution
R.I.P.
π»
Ghosted
Evolutionary forces in language change
R.I.P.
π»
Ghosted
Entropy and Diversity: The Axiomatic Approach
R.I.P.
π»
Ghosted
The evolution of conditional moral assessment in indirect reciprocity
Died the same way β π» Ghosted
R.I.P.
π»
Ghosted
Federated Learning: Strategies for Improving Communication Efficiency
R.I.P.
π»
Ghosted
In-Datacenter Performance Analysis of a Tensor Processing Unit
R.I.P.
π»
Ghosted
Deep Convolutional Neural Networks for Computer-Aided Detection: CNN Architectures, Dataset Characteristics and Transfer Learning
R.I.P.
π»
Ghosted