Efficient Construction of Hierarchical Overlap Graphs.
Sung Gwan Park|Bastien Cazaux|Kunsoo Park|Eric Rivals
| Anthology ID: | DBLP:conf/spire/ParkCPR20 |
|---|---|
| Volume: | String Processing and Information Retrieval - 27th International Symposium, SPIRE 2020, Orlando, FL, USA, October 13-15, 2020, Proceedings |
| Year: | 2020 |
| Venue: | Symposium on String Processing and Information Retrieval (SPIRE) |
| Publisher: | Springer |
| Pages: | 277-290 |
| URL: | https://doi.org/10.1007/978-3-030-59212-7_20 |
| DOI: | https://doi.org/10.1007/978-3-030-59212-7_20 |
| DBLP: | conf/spire/ParkCPR20 |
| BibTeX: |
@inproceedings{park-2020-efficient,
author = {Sung Gwan Park and
Bastien Cazaux and
Kunsoo Park and
Eric Rivals},
editor = {Christina Boucher and
Sharma V. Thankachan},
title = {{Efficient Construction of Hierarchical Overlap Graphs}},
booktitle = {{String Processing and Information Retrieval - 27th International Symposium, SPIRE 2020, Orlando, FL, USA, October 13-15, 2020, Proceedings}},
series = {Lecture Notes in Computer Science},
volume = {12303},
pages = {277--290},
publisher = {Springer},
year = {2020},
url = {https://doi.org/10.1007/978-3-030-59212-7_20},
doi = {https://doi.org/10.1007/978-3-030-59212-7_20}
}