Alignment- and reference-free phylogenomics with colored de-Bruijn graphs

May 10, 2019 ยท Declared Dead ยท ๐Ÿ› Algorithms for Molecular Biology

๐Ÿ‘ป CAUSE OF DEATH: Ghosted
No code link whatsoever

"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 1 month 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 shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

๐Ÿ“œ Similar Papers

In the same crypt โ€” q-bio.PE

Died the same way โ€” ๐Ÿ‘ป Ghosted