Alignment- and reference-free phylogenomics with colored de-Bruijn graphs
May 10, 2019 Β· Declared Dead Β· π Algorithms for Molecular Biology
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Roland Wittler
arXiv ID
1905.04165
Category
q-bio.PE
Cross-listed
cs.DS
Citations
26
Venue
Algorithms for Molecular Biology
Last Checked
3 months ago
Abstract
We present a new whole-genome based approach to infer large-scale phylogenies that is alignment- and reference-free. In contrast to other methods, it does not rely on pairwise comparisons to determine distances to infer edges in a tree. Instead, a colored de-Bruijn graph is constructed, and information on common subsequences is extracted to infer phylogenetic splits. Application to different datasets confirms robustness of the approach. A comparison to other state-of-the-art whole-genome based methods indicates comparable or higher accuracy and efficiency.
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
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