Efficient Construction of a Compressed de Bruijn Graph for Pan-Genome Analysis (Q2942244): Difference between revisions

@@ Property / cites work @@
+Replacing suffix trees with enhanced suffix arrays
+Normal rank
@@ Property / cites work @@
+Computing the longest common prefix array based on the Burrows-Wheeler transform
+Normal rank
@@ Property / cites work @@
+From Indexing Data Structures to de Bruijn Graphs
@@ Property / cites work: From Indexing Data Structures to de Bruijn Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Lightweight Data Indexing and Compression in External Memory
+Normal rank
@@ Property / cites work @@
+New algorithms on wavelet trees and applications to information retrieval
+Normal rank
@@ Property / cites work @@
+Q4471381
@@ Property / cites work: Q4471381 / rank @@
+Normal rank
@@ Property / cites work @@
+Fast BWT in small space by blockwise suffix sorting
+Normal rank
@@ Property / cites work @@
+Q5397902
@@ Property / cites work: Q5397902 / rank @@
+Normal rank
@@ Property / cites work @@
+Run-Length Compressed Indexes Are Superior for Highly Repetitive Sequence Collections
+Normal rank