Some Approximations for Shortest Common Nonsubsequences and Supersequences.

Vadim G. Timkovsky


Anthology ID:DBLP:conf/spire/Timkovsky08
Volume:String Processing and Information Retrieval, 15th International Symposium, SPIRE 2008, Melbourne, Australia, November 10-12, 2008. Proceedings
Year:2008
Venue:Symposium on String Processing and Information Retrieval (SPIRE)
Publisher:Springer
Pages:257-268
URL:https://doi.org/10.1007/978-3-540-89097-3_25
DOI:https://doi.org/10.1007/978-3-540-89097-3_25
DBLP:conf/spire/Timkovsky08
BibTeX:
@inproceedings{timkovsky-2008-approximations, author = {Vadim G. Timkovsky}, editor = {Amihood Amir and Andrew Turpin and Alistair Moffat}, title = {{Some Approximations for Shortest Common Nonsubsequences and Supersequences}}, booktitle = {{String Processing and Information Retrieval, 15th International Symposium, SPIRE 2008, Melbourne, Australia, November 10-12, 2008. Proceedings}}, series = {Lecture Notes in Computer Science}, volume = {5280}, pages = {257--268}, publisher = {Springer}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-89097-3_25}, doi = {https://doi.org/10.1007/978-3-540-89097-3_25} }