An Efficient Algorithm for the Longest Tandem Scattered Subsequence Problem.
| Anthology ID: | DBLP:conf/spire/Kosowski04 |
|---|---|
| Volume: | String Processing and Information Retrieval, 11th International Conference, SPIRE 2004, Padova, Italy, October 5-8, 2004, Proceedings |
| Year: | 2004 |
| Venue: | Symposium on String Processing and Information Retrieval (SPIRE) |
| Publisher: | Springer |
| Pages: | 93-100 |
| URL: | https://doi.org/10.1007/978-3-540-30213-1_13 |
| DOI: | https://doi.org/10.1007/978-3-540-30213-1_13 |
| DBLP: | conf/spire/Kosowski04 |
| BibTeX: |
@inproceedings{kosowski-2004-efficient,
author = {Adrian Kosowski},
editor = {Alberto Apostolico and
Massimo Melucci},
title = {{An Efficient Algorithm for the Longest Tandem Scattered Subsequence Problem}},
booktitle = {{String Processing and Information Retrieval, 11th International Conference, SPIRE 2004, Padova, Italy, October 5-8, 2004, Proceedings}},
series = {Lecture Notes in Computer Science},
volume = {3246},
pages = {93--100},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-30213-1_13},
doi = {https://doi.org/10.1007/978-3-540-30213-1_13}
}