Weighted Shortest Common Supersequence Problem Revisited.

Panagiotis Charalampopoulos|Tomasz Kociumaka|Solon P. Pissis|Jakub Radoszewski|Wojciech Rytter|Juliusz Straszynski|Tomasz Walen|Wiktor Zuba


Anthology ID:DBLP:conf/spire/Charalampopoulos19
Volume:String Processing and Information Retrieval - 26th International Symposium, SPIRE 2019, Segovia, Spain, October 7-9, 2019, Proceedings
Year:2019
Venue:Symposium on String Processing and Information Retrieval (SPIRE)
Publisher:Springer
Pages:221-238
URL:https://doi.org/10.1007/978-3-030-32686-9_16
DOI:https://doi.org/10.1007/978-3-030-32686-9_16
DBLP:conf/spire/Charalampopoulos19
BibTeX:
@inproceedings{charalampopoulos-2019-weighted, author = {Panagiotis Charalampopoulos and Tomasz Kociumaka and Solon P. Pissis and Jakub Radoszewski and Wojciech Rytter and Juliusz Straszynski and Tomasz Walen and Wiktor Zuba}, editor = {Nieves R. Brisaboa and Simon J. Puglisi}, title = {{Weighted Shortest Common Supersequence Problem Revisited}}, booktitle = {{String Processing and Information Retrieval - 26th International Symposium, SPIRE 2019, Segovia, Spain, October 7-9, 2019, Proceedings}}, series = {Lecture Notes in Computer Science}, volume = {11811}, pages = {221--238}, publisher = {Springer}, year = {2019}, url = {https://doi.org/10.1007/978-3-030-32686-9_16}, doi = {https://doi.org/10.1007/978-3-030-32686-9_16} }