An Index for Sequencing Reads Based on The Colored de Bruijn Graph

Diego Diaz-Dom\'inguez

REVIEW 2 major objections 5 minor 28 references

An Index for Sequencing Reads Based on The Colored de Bruijn Graph

T0 review · 2 major / 5 minor · reviewed 2026-08-14 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read A colored de Bruijn graph index stores massive read sets in about half the plain-text space and still reconstructs more than 99% of the reads.

desk verdict A real engineering contribution on compressing colored de Bruijn graphs that is worth a serious look, but the reconstruction guarantee is asserted rather than proven and the experiments are thin. read the letter →

arxiv 1908.02211 v2 pith:SD3SXTB6 submitted 2019-08-06 cs.DS

Diego Diaz-Domínguez This is my paper · ORCID

classification cs.DS

keywords deBruijngraphsDNAsequencingcompactdatastructurescoloredgraphreadreconstructioncontigassemblygreedycoloring

verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper claims that a colored de Bruijn graph built from a set of DNA sequencing reads can be turned into a practical, compressed index that stores the read set in roughly half the plain-text space. The key move is to color only a small subset of graph nodes—starting, ending, and critical nodes—and to greedily reuse the same color across reads whose paths are judged not to conflict. On an E. coli read set, the index occupies about 440 MB versus 834 MB plain, a compression rate near 1.89, and buildSeqs recovers more than 99% of the reads, with only 176 to 1,904 ambiguous reads across k values. Two algorithms sit on top of the index: one walks the graph to reconstruct unambiguous reads, and a second assembles contigs by weighting outgoing edges according to the colors carried by active reads. If the claims hold, a standard read dataset can be stored and searched in compressed space without losing most of its sequence content.

What carries the argument

The machinery is a partial and greedy coloring scheme on a BOSS-encoded dBG, plus a succinct color matrix. A bitmap N marks the nodes that need colors; per colored node, an array stores its color list sorted and delta-encoded; concatenating the lists into $M'$ and marking boundaries with a bitmap $F$ yields the representation $C = N + F + M'$, from which getColors(v) retrieves a node's colors in $O(c)$ time. The coloring rule is the load-bearing mechanism: for each read, build the neighbor set $I_i$ of successors and predecessors touching branching nodes along the read's path, collect the colors already used there, and assign the smallest unused color. The claim is that this local conflict check suffices to keep every unambiguous read's path safe, so buildSeqs can walk deterministically at branching nodes.

What would settle it

Construct the four-string grid configuration used in the proof of Lemma 2—reads $R_i$, $R_j$, $R_x$, $R_y$ arranged so the paths cross—run greedyCol and then buildSeqs, and check whether any reported string is absent from the input; a chimeric output would disprove the local neighbor check. On the E. coli data, align every reconstructed read to the reference genome and count reads whose kmer path hits two distant loci.

Watch

Extended reading notes

Core claim

At the core of the paper is the observation that a read-colored de Bruijn graph does not need a color on every node: only starting, ending, and critical nodes—about 12.4% of the BOSS nodes in the experiments—must carry colors for paths to be safe. The greedy coloring then reuses the same color across many reads, shrinking the color set from millions of reads to a few thousand. The color information is stored as a compressed matrix C built from a bitmap of colored nodes, delta-encoded color lists, and a delimiter bitmap, giving a getColors(v) operation in time proportional to the number of colors of the node. On top of this, buildSeqs walks from each colored starting node, following the unique successor with the read's color at branching nodes, and reconstructs all unambiguous reads; a second procedure, contigAssm, assembles contigs by weighting outgoing edges according to the color overlap of active reads.

Load-bearing premise

The load-bearing assumption is that looking only at the immediate neighboring nodes of a read's path can completely rule out any later fork where two exits carry the same color; if a conflict slips past this local check, the reconstruction routine can output a wrong, chimeric sequence for a read that the paper calls unambiguous.

Editorial extensions

If this is right

An 834 MB plain-text read set becomes an index of roughly 440 MB, and the same index answers navigation and reconstruction queries without decompressing the reads.
Reconstruction is exact on unambiguous reads: the paper verifies every rebuilt sequence against an FM-index of $R'$, so the loss is confined to a small, identifiable ambiguous set.
The number of colors needed falls to a few thousand even for 8.6 million reads, so per-color operations—such as deciding which reads share a kmer—become orders of magnitude cheaper.
The same colored topology supports a contig-assembly heuristic, contigAssm, which extends a walk along successors carrying at least a threshold fraction of the active colors.
Because the neighbor sets $W_i$ and $I_i$ are built independently per read, coloring parallelizes across threads, and the measured build time of roughly 5,000 seconds on eight threads shows the index is constructible on a single workstation.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

The partial-coloring principle should transfer to any collection of overlapping strings whose dBG has few branching nodes, not just DNA reads; metagenomic or RNA-seq read sets would test whether the 12.4% colored-node fraction is typical or E. coli-specific.
The strong dependence of ambiguity on $k$ (1,904 at $k=25$ down to 176 at $k=50$) suggests $k$ can be used as a loss-versus-density dial: applications needing nearly every read should choose $k$ near 50, while assembly-oriented uses might accept smaller $k$ and denser graphs.
Because colors are shared among reads that are locally context-compatible, the color matrix doubles as a read-clustering hint: reads carrying the same color through a region are candidates for originating from the same genomic locus, which could seed overlap detection without pairwise alignment.
A natural next experiment is to align every reconstructed read to the reference genome and check that no read maps to two distant loci; the published validation verifies membership in the input set.

Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Desk Editor's Note

read the letter

This is a solid engineering paper with a genuinely new idea. The incomplete coloring—only starting, ending, and critical nodes get colors—plus the greedy color-reuse heuristic is a real departure from Alipanahi et al.'s full recoloring and from VARI. The measured results back the central claim: roughly 1.86–1.92x compression over plain reads and over 99% reconstruction on one E. coli dataset. Code is linked, so the work is reproducible, and the implementation on SDSL is a practical plus.

Now the soft spots, in proportion. The biggest one is the missing safety proof for the greedy coloring. The local conflict check over I_i and W_i is plausibly sufficient, but the paper never states or proves an invariant that no branching node on an unambiguous read's path will ever have two successors carrying that read's color. Lemma 1 gives necessary conditions, Lemma 2 is a warning example, but there is no sufficiency theorem. This matters because the 'ambiguous sequences' counts in Table 2 are measured after coloring. If a coloring-induced conflict occurs, an inherently unambiguous read gets labeled ambiguous and could even yield a chimeric reconstruction that still passes the FM-index check because the string exists in R' as a concatenation of other reads. I can't tell from the paper whether this happens, which is exactly the problem. The invariants might be provable; they just aren't proven here.

The other gaps are more minor but real. There is no baseline comparison to other colored dBG indexes, so the 1.89x compression is reported in a vacuum; the contig assembly algorithm is not evaluated at all; and only one dataset is used. The paper itself acknowledges the comparison difficulty, so this is not a fatal omission, but it limits how much we can trust the practical significance.

All that said, the core idea is sound and the experimental numbers are plausible. This is the kind of work that could become a useful tool if the safety invariant is made rigorous and the evaluation is broadened. Who is this for? People building compressed indexes for sequencing reads, especially those who care about color matrix compression. A serious referee should get it, and the recommendation would be conditional acceptance with the invariant addressed and at least one comparison baseline added. I would not cite it in my own work yet, but I'd point a student toward it as a useful starting point.

Referee Report

2 major / 5 minor

Summary. This paper presents a compressed index for a large set of DNA sequencing reads based on a colored de Bruijn graph. The index uses the BOSS representation for the graph and a compressed color matrix C. The main novelties are an incomplete coloring scheme that colors only starting, ending, and critical nodes, and a greedy algorithm that reuses colors for different reads whenever the local neighbor sets do not already contain that color. The paper also defines two algorithms on top of the index: buildSeqs, which reconstructs reads from their colored paths, and contigAssm, a heuristic for assembling contigs. Experiments on a single E. coli read set (8.6M reads after preprocessing) show that the index uses about half the space of the plain read representation (compression ratio 1.86–1.92) and that more than 99% of the reads are reconstructed, with the number of ambiguous sequences ranging from 176 to 1,904 depending on k. The paper does not provide a formal proof that the greedy coloring guarantees safe reconstruction of all unambiguous reads; Lemma 1 gives only a necessary condition, and Lemma 2 warns of a failure mode.

Significance. If the reconstruction guarantee can be established, this paper would be a valuable contribution to compact read indexing: the partial coloring and greedy color reuse achieve a substantial reduction in the color matrix, the implementation is made available, and the reported compression ratios and reconstruction rates on a real dataset are encouraging. The idea of coloring only critical nodes to save space is sensible, and the empirical evaluation, though limited to one dataset, demonstrates practicality. The main weakness is that the central correctness claim is asserted rather than proven, which limits the usefulness of the reconstruction algorithm as a building block for other analyses. The single-dataset evaluation and the absence of a comparison with existing colored dBG indexes also temper the strength of the empirical claims.

major comments (2)

[Section 4 (Safer and greedy coloring), Pseudocode 1, Algorithm 2] The central reconstruction claim relies on an unproven invariant of the greedy coloring. Lemma 1 states only necessary conditions for a safe path, and Lemma 2 gives a counterexample for a different recoloring scheme; no lemma or theorem shows that the colors assigned by greedyCol make every unambiguous path safe. The local check in Pseudocode 1 (lines 24–26) considers only the colors already present in I_i ∪ W_i when R_i is processed; a later read can, in principle, assign the same color to a successor of a branching node on R_i's path, and the paper does not prove that this successor necessarily belongs to the later read's I_j ∪ W_j. Because of this, buildSeqs may abort for an unambiguous read or reconstruct it as a different read, and the 'Ambiguous sequences' counts in Table 2 do not separate inherent ambiguity from coloring-induced conflicts. The FM-index verification checks that a reconstructed string occurs in R', not that it is the read that was walked from. A sufficiency proof (e.g., the two invariants mentioned by the reviewer) or an experimental test that distinguishes the two failure sources is needed before the central 99% reconstruction claim is established.
[Section 3 (Definitions, unambiguous sequence)] The definition of an unambiguous sequence is not formally parseable. The clause 'if no pair of colored nodes in (u,v)∈P share a predecessor node v'∈P' mixes edges and nodes and does not express a clear condition. Since Table 2 reports counts of ambiguous sequences and Algorithm 2 is designed for unambiguous ones, this definition must be stated precisely, with explicit quantifiers over the path and the graph.

minor comments (5)

[Algorithm 2, line 21] The reconstructed sequence is stored as S[2..|S|−1] rather than S'[2..|S'|−1]; as written, buildSeqs would store the prefix label rather than the full reconstructed read.
[Pseudocode 3, line 8] When indegree(G,v)>1, only the first predecessor returned by backward_r is inspected, while the surrounding text says 'one of its predecessor nodes' should be checked; this inconsistency likely makes the contig assembly fail to register new reads unless the starting node happens to be the first predecessor.
[Section 7 and 8] The contig assembly algorithm is not evaluated in the experiments; since the abstract lists it as a contribution, at least a basic experiment on the same dataset would be expected.
[Section 8] The paper does not compare the index's space or reconstruction time to existing colored dBG indexes such as VARI, Mantis, or Rainbowfish; such a comparison would help contextualize the reported compression rates.
[Introduction and Table 2] The introduction's claim that 'the percentage of nodes in BOSS that need to be colored is about 12.4%' is not directly derivable from Table 2; please state the computation or the averaging method.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the compression and reconstruction claims are measured outcomes validated against an external FM-index, not derived from fitted inputs.

full rationale

I examined the derivation chain of the paper. The central quantitative claims are the compression rate (index size relative to the plain read file) and the fraction of reads reconstructed by buildSeqs. Both are experimentally measured, and the reconstructed reads are checked against an independently built FM-index of R', so the reconstruction claim is externally grounded rather than being equivalent to the algorithm's own definitions. The space saving is a direct comparison of file sizes, not a parameter fitted to make a derivation work. The greedy coloring uses k as a user-chosen construction parameter, and the threshold x in contigAssm appears only in the assembly heuristic and does not enter the reconstruction or space claims. The paper's definition of unambiguous sequences is tied to the colored graph, and the greedy coloring's safety invariant is asserted through necessary conditions (Lemma 1) and a conflict check over I_i and W_i without a full sufficiency proof; this is a soundness gap that could affect the interpretation of the ambiguous-sequence counts, but it is not circularity because the reconstruction counts are empirical and externally validated. The paper also builds on previously published, independent work (BOSS, VARI, and Alipanahi et al.'s recoloring) rather than on a self-citation chain. No prediction reduces by construction to a fitted constant or to an input-defined quantity, so I find no significant circularity.

Assumptions & free parameters 2 free parameters · 4 assumptions · 0 invented entities

The central claims rest on standard succinct data structures (BOSS, rank/select, Elias-Fano) and on domain assumptions about the read set (DNA alphabet, no Ns, factor-free). No new physical or biological entities are introduced. The only hand-chosen parameters are the k-mer size k and the contig threshold x, neither of which is fitted to make the space claim work.

free parameters (2)

k (k-mer size) = 25, 30, 35, 40, 45, 50
Swept over six values; index size, colored node count and number of colors depend on k. Not fitted to data, but chosen by the author.
x (contig extension threshold) = not reported (example figure uses 0.5)
Introduced in contigAssm (Pseudocode 3) but never used in the reported experiments, so its value does not affect the space/reconstruction claims.

assumptions (4)

domain assumption The input reads are DNA strings over {a,c,g,t} after preprocessing removes reads containing N.
Section 7: reads with N symbols are discarded; the 2-bit encoding and BOSS rely on alphabet size 4 plus dummy.
domain assumption The read set is factor-free: no read is a substring of another.
Section 3: 'We assume that R is a factor-free set.' This underpins the starting/ending node definitions and the unambiguity characterization; real datasets may violate it.
standard math BOSS and rank/select operations have the stated space and O(1)/O(log sigma) time bounds.
Used throughout Sections 2 and 5; they cite [5], [9], [26].
domain assumption The dBG of order k built from R' (reads plus reverse complements) is the right object for read reconstruction.
Section 3: uses R' to compute reverse complements; this doubles the collection and is standard in bioinformatics.

how reviews work

0 comments

Cite this review

Pith. "Pith review of An Index for Sequencing Reads Based on The Colored de Bruijn Graph." pith.science (2026). https://pith.science/paper/SD3SXTB6

@misc{pith2026190802211,
  author       = {Pith},
  title        = {Pith review of: An Index for Sequencing Reads Based on The Colored de Bruijn Graph},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/SD3SXTB6}},
  note         = {Machine review of arXiv:1908.02211}
}

read the original abstract

In this article, we show how to transform a colored de Bruijn graph (dBG) into a practical index for processing massive sets of sequencing reads. Similar to previous works, we encode an instance of a colored dBG of the set using BOSS and a color matrix C. To reduce the space requirements, we devise an algorithm that produces a smaller and more sparse version of C. The novelties in this algorithm are (i) an incomplete coloring of the graph and (ii) a greedy coloring approach that tries to reuse the same colors for different strings when possible. We also propose two algorithms that work on top of the index; one is for reconstructing reads, and the other is for contig assembly. Experimental results show that our data structure uses about half the space of the plain representation of the set (1 Byte per DNA symbol) and that more than 99% of the reads can be reconstructed just from the index.

Figures

Figures reproduced from arXiv: 1908.02211 by the authors.

**Figure 1.** Example of unsafe paths produced by a graph recoloring. (A) The dBG generated from the unambiguous sequences Ri, Rj , Rx and Ry. Every texture represents the path of a specific string. (B) Recolored dBG. Sequences Ri and Rj are assigned the same color c (light gray) as they do not share any k − 1 substring. Similarly, sequences Rx and Ry are assigned another color c 0 (horizontal lines) as they do not share any k −… view at source ↗

**Figure 2.** Succinct colored dBG. (A) The topology of the graph. Colors and textures represent the paths that spell the input sequences of the dBG. Numbers over the nodes are their identifiers. Nodes 4,1,6 and 10 are starting nodes (darker borders). Nodes 11,13 and 12 are ending nodes and nodes 3,9,11 and 5 are critical. (B) Our greedy coloring algorithm. (C) The binary matrix C that encodes the colors of Figure B. The left sid… view at source ↗

**Figure 3.** Example of the assembly of a contig using our index. (A) Inexact overlap of four sequences. The circle to the left of every string represents its color in the dBG. Light gray symbols are mismatches in the overlap. (B) The colored dBG of the sequences. Circles with darker borders are starting and ending nodes. Light gray values over the starting nodes are their identifiers. The contig assembly begins in node 5 (denot… view at source ↗

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

28 extracted references · 27 canonical work pages

[1]

In: Proc

Alipanahi, B., Kuhnle, A., Boucher, C.: Recoloring the colored de bruijn graph. In: Proc. 25th International Symposium on String Processing and Information Retrieval (SPIRE). pp. 1–11 (2018)

work page 2018
[2]

In: Proc

Almodaresi, F., Pandey, P., Patro, R.: Rainbowﬁsh: A succinct colored de Bruijn graph representation. In: Proc. 17th International Workshop on Algorithms in Bioinformatics (WABI). p. article 18 (2017)

work page 2017
[3]

Journal of Computational Biology 19(5), 455–477 (2012)

Bankevich, A., Nurk, S., Antipov, D., Gurevich, A.A., Dvorkin, M., Kulikov, A.S., Lesin, V.M., Nikolenko, S.I., Pham, S., Prjibelski, A.D., et al.: SPAdes: A new genome assembly algorithm and its applications to single-cell sequencing. Journal of Computational Biology 19(5), 455–477 (2012)

work page 2012
[4]

In: Proc

Boucher, C., Bowe, A., Gagie, T., Puglisi, S.J., Sadakane, K.: Variable-order de Bruijn graphs. In: Proc. 25th Data Compression Conference (DCC). pp. 383–392 (2015)

work page 2015
[5]

In: Proc

Bowe, A., Onodera, T., Sadakane, K., Shibuya, T.: Succinct de Bruijn graphs. In: Proc. 12th International Workshop on Algorithms in Bioinformatics (WABI). pp. 225–235 (2012)

work page 2012
[6]

Nature Biotechnology 34(5), 525–527 (2016)

Bray, N., Pimentel, H., Melsted, P., Pachter, L.: Near-optimal probabilistic rna-seq quantiﬁcation. Nature Biotechnology 34(5), 525–527 (2016)

work page 2016
[7]

Koninklijke Nederlandse Akademie v

de Bruijn, N.G.: A combinatorial problem. Koninklijke Nederlandse Akademie v. Wetenschappen 49(49), 758–764 (1946)

work page 1946
[8]

Burrows, M., Wheeler, D.: A block sorting lossless data compression algorithm. Tech. Rep. 124, Digital Equipment Corporation (1994)

1994

Show all 28 references

[9]

Clark, D.: Compact PAT Trees. Ph.D. thesis, University of Waterloo, Canada (1996)

1996
[10]

Journal of the ACM 21(2), 246–260 (1974)

Elias, P.: Eﬃcient storage and retrieval by content and address of static ﬁles. Journal of the ACM 21(2), 246–260 (1974)

1974
[11]

Massachusetts Institute of Technology (1971)

Fano, R.M.: On the number of bits required to implement an associative memory. Massachusetts Institute of Technology (1971)

1971
[12]

In: Proc

Gog, S., Beller, T., Moﬀat, A., Petri, M.: From theory to practice: Plug and play with succinct data structures. In: Proc. 13th International Symposium on Experi- mental Algorithms (SEA). pp. 326–337 (2014)

2014
[13]

In: Proc

Holley, G., Wittler, R., Stoye, J.: Bloom ﬁlter trie – a data structure for pan-genome storage. In: Proc. 15th International Workshop on Algorithms in Bioinformatics (WABI). pp. 217–230 (2015)

2015
[14]

Jour- nal of Computational Biology 2(2), 291–306 (1995)

Idury, R.M., Waterman, M.S.: A new algorithm for DNA sequence assembly. Jour- nal of Computational Biology 2(2), 291–306 (1995)

1995
[15]

Nature Genetics 44(2), 226–232 (2012)

Iqbal, Z., Caccamo, M., Turner, I., Flicek, P., McVean, G.: De novo assembly and genotyping of variants using colored de Bruijn graphs. Nature Genetics 44(2), 226–232 (2012)

2012
[16]

Algorithmica 13(1), 7–51 (1995)

Kececioglu, J.D., Myers, E.W.: Combinatorial algorithms for DNA sequence as- sembly. Algorithmica 13(1), 7–51 (1995)

1995
[17]

Springer (2015)

Lewis, R.: A Guide to Graph Colouring. Springer (2015)

2015
[18]

Nordic Journal of Computing 12(1), 40–66 (2005)

M¨ akinen, V., Navarro, G.: Succinct suﬃx arrays based on run-length encoding. Nordic Journal of Computing 12(1), 40–66 (2005)

2005
[19]

In: Proc

Medvedev, P., Georgiou, K., Myers, G., Brudno, M.: Computability of models for sequence assembly. In: Proc. 7th International Workshop on Algorithms in Bioinformatics (WABI). pp. 289–301. Springer (2007) An Index for Sequencing Reads Based on The Colored de Bruijn Graph 15

2007
[20]

Journal of Computational Biology 18(11), 1625–1634 (2011)

Medvedev, P., Pham, S., Chaisson, M., Tesler, G., Pevzner, P.: Paired de bruijn graphs: a novel approach for incorporating mate pair information into genome assemblers. Journal of Computational Biology 18(11), 1625–1634 (2011)

2011
[21]

bioRxiv p

Mustafa, H., Kahles, A., Karasikov, M., Raetsch, G.: Metannot: A succinct data structure for compression of colors in dynamic de bruijn graphs. bioRxiv p. article 236711 (2017)

2017
[22]

Bioinformatics 35(3), 407–414 (2018)

Mustafa, H., Schilken, I., Karasikov, M., Eickhoﬀ, C., R¨ atsch, G., Kahles, A.: Dynamic compression schemes for graph coloring. Bioinformatics 35(3), 407–414 (2018)

2018
[23]

Cambridge Univer- sity Press (2016)

Navarro, G.: Compact Data Structures: A Practical Approach. Cambridge Univer- sity Press (2016)

2016
[24]

In: Proc

Okanohara, D., Sadakane, K.: Practical entropy-compressed rank/select dictionary. In: Proc. 9th Workshop on Algorithm Engineering and Experiments (ALENEX). pp. 60–70 (2007)

2007
[25]

Cell Systems 7(2), 201–207 (2018)

Pandey, P., Almodaresi, F., Bender, M.A., Ferdman, M., Johnson, R., Patro, R.: Mantis: A fast, small, and exact large-scale sequence-search index. Cell Systems 7(2), 201–207 (2018)

2018
[26]

ACM Transactions on Algorithms 3(4), article 43 (2007)

Raman, R., Raman, V., Satti, S.R.: Succinct indexable dictionaries with applica- tions to encoding k-ary trees, preﬁx sums and multisets. ACM Transactions on Algorithms 3(4), article 43 (2007)

2007
[27]

Molecular Cell 58(4), 586–597 (2015)

Reuter, J., Spacek, D., Snyder, M.: High-throughput sequencing technologies. Molecular Cell 58(4), 586–597 (2015)

2015
[28]

Bioinformatics 33(6), 799–806 (2016) 16 D

Salmela, L., Walve, R., Rivals, E., Ukkonen, E.: Accurate self-correction of errors in long reads using de bruijn graphs. Bioinformatics 33(6), 799–806 (2016) 16 D. D´ ıaz-Dom´ ınguez 10 Appendix A Pseudocodes Algorithm 1 Function greedyCol 1: procedure greedyCol(G,N,Ri,M) ⊿ G...

2016

Pith tools

Reviewed August 14, 2026 · model on record in the stance chip above.

[1] [1]

In: Proc

Alipanahi, B., Kuhnle, A., Boucher, C.: Recoloring the colored de bruijn graph. In: Proc. 25th International Symposium on String Processing and Information Retrieval (SPIRE). pp. 1–11 (2018)

work page 2018

[2] [2]

In: Proc

Almodaresi, F., Pandey, P., Patro, R.: Rainbowﬁsh: A succinct colored de Bruijn graph representation. In: Proc. 17th International Workshop on Algorithms in Bioinformatics (WABI). p. article 18 (2017)

work page 2017

[3] [3]

Journal of Computational Biology 19(5), 455–477 (2012)

Bankevich, A., Nurk, S., Antipov, D., Gurevich, A.A., Dvorkin, M., Kulikov, A.S., Lesin, V.M., Nikolenko, S.I., Pham, S., Prjibelski, A.D., et al.: SPAdes: A new genome assembly algorithm and its applications to single-cell sequencing. Journal of Computational Biology 19(5), 455–477 (2012)

work page 2012

[4] [4]

In: Proc

Boucher, C., Bowe, A., Gagie, T., Puglisi, S.J., Sadakane, K.: Variable-order de Bruijn graphs. In: Proc. 25th Data Compression Conference (DCC). pp. 383–392 (2015)

work page 2015

[5] [5]

In: Proc

Bowe, A., Onodera, T., Sadakane, K., Shibuya, T.: Succinct de Bruijn graphs. In: Proc. 12th International Workshop on Algorithms in Bioinformatics (WABI). pp. 225–235 (2012)

work page 2012

[6] [6]

Nature Biotechnology 34(5), 525–527 (2016)

Bray, N., Pimentel, H., Melsted, P., Pachter, L.: Near-optimal probabilistic rna-seq quantiﬁcation. Nature Biotechnology 34(5), 525–527 (2016)

work page 2016

[7] [7]

Koninklijke Nederlandse Akademie v

de Bruijn, N.G.: A combinatorial problem. Koninklijke Nederlandse Akademie v. Wetenschappen 49(49), 758–764 (1946)

work page 1946

[8] [8]

Burrows, M., Wheeler, D.: A block sorting lossless data compression algorithm. Tech. Rep. 124, Digital Equipment Corporation (1994)

1994