Paolo Barone, Paola Bonizzoni, Gianluca Della Vedova, Giancarlo Mauri. An approximation algorithm for the shortest common supersequence problem: an experimental analysis. In Proceedings of the 2001 ACM Symposium on Applied Computing (SAC), March 11-14, 2001, Las Vegas, NV, USA. pages 56-60, ACM, 2001. [doi]
@inproceedings{BaroneBVM01,
title = {An approximation algorithm for the shortest common supersequence problem: an experimental analysis},
author = {Paolo Barone and Paola Bonizzoni and Gianluca Della Vedova and Giancarlo Mauri},
year = {2001},
doi = {10.1145/372202.372275},
url = {http://doi.acm.org/10.1145/372202.372275},
tags = {analysis},
researchr = {https://researchr.org/publication/BaroneBVM01},
cites = {0},
citedby = {0},
pages = {56-60},
booktitle = {Proceedings of the 2001 ACM Symposium on Applied Computing (SAC), March 11-14, 2001, Las Vegas, NV, USA},
publisher = {ACM},
}