Space-Efficient Merging of Succinct de Bruijn Graphs.

Lavinia Egidi|Felipe A. Louza|Giovanni Manzini


Anthology ID:DBLP:conf/spire/EgidiLM19
Volume:String Processing and Information Retrieval - 26th International Symposium, SPIRE 2019, Segovia, Spain, October 7-9, 2019, Proceedings
Year:2019
Venue:Symposium on String Processing and Information Retrieval (SPIRE)
Publisher:Springer
Pages:337-351
URL:https://doi.org/10.1007/978-3-030-32686-9_24
DOI:https://doi.org/10.1007/978-3-030-32686-9_24
DBLP:conf/spire/EgidiLM19
BibTeX:
@inproceedings{egidi-2019-spaceefficient, author = {Lavinia Egidi and Felipe A. Louza and Giovanni Manzini}, editor = {Nieves R. Brisaboa and Simon J. Puglisi}, title = {{Space-Efficient Merging of Succinct de Bruijn Graphs}}, booktitle = {{String Processing and Information Retrieval - 26th International Symposium, SPIRE 2019, Segovia, Spain, October 7-9, 2019, Proceedings}}, series = {Lecture Notes in Computer Science}, volume = {11811}, pages = {337--351}, publisher = {Springer}, year = {2019}, url = {https://doi.org/10.1007/978-3-030-32686-9_24}, doi = {https://doi.org/10.1007/978-3-030-32686-9_24} }