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...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Algorithmica Ročník 84; číslo 3; s. 639 - 669
Hlavní autori:	Egidi, Lavinia, Louza, Felipe A., Manzini, Giovanni
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 01.03.2022 Springer Nature B.V
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!