π
π
The Cartographer
Locating a Tree in a Phylogenetic Network in Quadratic Time
February 11, 2015 Β· Declared Dead Β· π Annual International Conference on Research in Computational Molecular Biology
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Philippe Gambette, Andreas D. M. Gunawan, Anthony Labarre, StΓ©phane Vialette, Louxin Zhang
arXiv ID
1502.03379
Category
cs.DS: Data Structures & Algorithms
Cross-listed
cs.CE,
q-bio.PE
Citations
34
Venue
Annual International Conference on Research in Computational Molecular Biology
Last Checked
3 months ago
Abstract
A fundamental problem in the study of phylogenetic networks is to determine whether or not a given phylogenetic network contains a given phylogenetic tree. We develop a quadratic-time algorithm for this problem for binary nearly-stable phylogenetic networks. We also show that the number of reticulations in a reticulation visible or nearly stable phylogenetic network is bounded from above by a function linear in the number of taxa.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
π Similar Papers
In the same crypt β Data Structures & Algorithms
R.I.P.
π»
Ghosted
Route Planning in Transportation Networks
R.I.P.
π»
Ghosted
Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration
R.I.P.
π»
Ghosted
Hierarchical Clustering: Objective Functions and Algorithms
R.I.P.
π»
Ghosted
Graph Isomorphism in Quasipolynomial Time
π
π
The Cartographer
Simulation optimization: A review of algorithms and applications
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