An efficient, scalable, and exact representation of high-dimensional color information enabled using de Bruijn graph search

F Almodaresi, P Pandey, M Ferdman… - Journal of …, 2020 - liebertpub.com
The colored de Bruijn graph (cdbg) and its variants have become an important combinatorial
structure used in numerous areas in genomics, such as population-level variation detection …

Sparse binary relation representations for genome graph annotation

M Karasikov, H Mustafa, A Joudaki… - Journal of …, 2020 - liebertpub.com
High-throughput DNA sequencing data are accumulating in public repositories, and efficient
approaches for storing and indexing such data are in high demand. In recent research …

Relative suffix trees

A Farruggia, T Gagie, G Navarro… - The Computer …, 2018 - academic.oup.com
Suffix trees are one of the most versatile data structures in stringology, with many
applications in bioinformatics. Their main drawback is their size, which can be tens of times …

Recoloring the colored de Bruijn graph

B Alipanahi, A Kuhnle, C Boucher - International Symposium on String …, 2018 - Springer
The colored de Bruijn graph, an extension of the de Bruijn graph, is routinely applied for
variant calling, genoty**, genome assembly, and various other applications 11. In this …

Efficient Colored de Bruijn Graph for Indexing Reads

N Hasegawa, K Shimizu - Journal of Computational Biology, 2023 - liebertpub.com
The colored de Bruijn graph is a variation of the de Bruijn graph that has recently been
utilized for indexing sequencing reads. Although state-of-the-art methods have achieved …

Scalable Annotated Genome Graphs for Representing Sequence Data

M Karasikov - 2023 - research-collection.ethz.ch
Technological advances made over the last decades in sequencing technologies have led
to continuous improvements of quality and ever-decreasing costs of sequencing. All this …

[PDF][PDF] Sparse Binary Relation Representations for Genome Graph

M Karasikov, H Mustafa, A Joudaki, S Javadzadeh-No… - scholar.archive.org
High-throughput DNA sequencing data is accumulating in public repositories, and efficient
approaches for storing and indexing such data are in high demand. In recent research …

Sparse Binary Relation Representations for Genome Graph Annotation

S Javadzadeh-No, G Rätsch, A Kahles - Research in Computational Molecular … - Springer
High-throughput DNA sequencing data is accumulating in public repositories, and efficient
approaches for storing and indexing such data are in high demand. In recent research …