All Instantiations of the Greedy Algorithm for the Shortest Common Superstring Problem are Equivalent.

@inproceedings{nikolaev-2021-instantiations, author = {Maksim S. Nikolaev}, editor = {Thierry Lecroq and H\'{e}l\`{e}ne Touzet}, title = {{All Instantiations of the Greedy Algorithm for the Shortest Common Superstring Problem are Equivalent}}, booktitle = {{String Processing and Information Retrieval - 28th International Symposium, SPIRE 2021, Lille, France, October 4-6, 2021, Proceedings}}, series = {Lecture Notes in Computer Science}, volume = {12944}, pages = {61--67}, publisher = {Springer}, year = {2021}, url = {https://doi.org/10.1007/978-3-030-86692-1_6}, doi = {https://doi.org/10.1007/978-3-030-86692-1_6} }