Space Efficient Merging of de Bruijn Graphs and Wheeler Graphs

The merging of succinct data structures is a well established technique for the space efficient construction of large succinct indexes. In the first part of the paper we propose a new algorithm for merging succinct representations of de Bruijn graphs . Our algorithm has the same asymptotic cost of t...

Full description

Saved in:

Bibliographic Details
Published in:	Algorithmica Vol. 84; no. 3; pp. 639 - 669
Main Authors:	Egidi, Lavinia, Louza, Felipe A., Manzini, Giovanni
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.03.2022 Springer Nature B.V
Subjects:	Algorithm Analysis and Problem Complexity Algorithms Asymptotic properties Computer Science Computer Systems Organization and Communication Networks Data structures Data Structures and Information Theory Graph theory Graphical representations Graphs Mathematics of Computing Special Issue from London Stringology Days & London Algorithmic Workshop Theory of Computation Succinct data structures Space efficient algorithms de Bruijn graphs Wheeler graphs BWT variants
ISSN:	0178-4617, 1432-0541
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!