Comparative genomics with succinct colored de Bruijn graphs

DOI10.1007/S00236-024-00467-7MaRDI QIDQ6658084zbMATH OpenFDO

Authors Lucas P. Ramos, Felipe A. Louza, Guilherme P. Telles

Publication date 8 January 2025

Published in Acta Informatica (Search for Journal in Brave)

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• Alignment- and reference-free phylogenomics with colored de Bruijn graphs
• Succinct de Bruijn graphs
• Rainbowfish: a succinct colored de Bruijn graph representation
• An index for sequencing reads based on the colored de Bruijn graph

Cites work

• scientific article; zbMATH DE number 3095523 (Why is no real title available?)
• A theoretical and experimental analysis of BWT variants for string collections
• Algorithms to compute the Burrows-Wheeler similarity distribution
• An extension of the Burrows-Wheeler transform
• Bioinformatics algorithms. Sequence analysis, genome rearrangements, and phylogenetic reconstruction
• Clustering by Compression
• Comparison of phylogenetic trees
• Compressed text indexes, from theory to practice
• Distance measures for biological sequences: some recent approaches
• Fully functional suffix trees and optimal text searching in BWT-runs bounded space
• Inducing enhanced suffix arrays for string collections
• Space-efficient construction of compressed suffix trees
• Succinct de Bruijn graphs
• Suffix Arrays: A New Method for On-Line String Searches
• Synteny paths for assembly graphs comparison
• Tables
• The Burrows-Wheeler similarity distribution between biological sequences based on Burrows-Wheeler transform

This page was built for publication: Comparative genomics with succinct colored de Bruijn graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6658084)