Improved Approximation Results on the Shortest Common Supersequence Problem.

Zvi Gotthilf|Moshe Lewenstein


Anthology ID:DBLP:conf/spire/GotthilfL09
Volume:String Processing and Information Retrieval, 16th International Symposium, SPIRE 2009, Saariselkä, Finland, August 25-27, 2009, Proceedings
Year:2009
Venue:Symposium on String Processing and Information Retrieval (SPIRE)
Publisher:Springer
Pages:277-284
URL:https://doi.org/10.1007/978-3-642-03784-9_27
DOI:https://doi.org/10.1007/978-3-642-03784-9_27
DBLP:conf/spire/GotthilfL09
BibTeX:
@inproceedings{gotthilf-2009-improved, author = {Zvi Gotthilf and Moshe Lewenstein}, editor = {Jussi Karlgren and Jorma Tarhio and Heikki Hyyr\"{o}}, title = {{Improved Approximation Results on the Shortest Common Supersequence Problem}}, booktitle = {{String Processing and Information Retrieval, 16th International Symposium, SPIRE 2009, Saariselk\"{a}, Finland, August 25-27, 2009, Proceedings}}, series = {Lecture Notes in Computer Science}, volume = {5721}, pages = {277--284}, publisher = {Springer}, year = {2009}, url = {https://doi.org/10.1007/978-3-642-03784-9_27}, doi = {https://doi.org/10.1007/978-3-642-03784-9_27} }