All Instantiations of the Greedy Algorithm for the Shortest Common Superstring Problem are Equivalent
- Anthology ID:
- DBLP:conf/spire/Nikolaev21
- Volume:
- String Processing and Information Retrieval - 28th International Symposium, SPIRE 2021, Lille, France, October 4-6, 2021, Proceedings
- Year:
- 2021
- Venue:
- spire_conference
- Publisher:
- Springer
- Pages:
- 61–67
- URL:
- https://doi.org/10.1007/978-3-030-86692-1_6
- DOI:
- 10.1007/978-3-030-86692-1_6
- DBLP:
- conf/spire/Nikolaev21
