Main » SPIRE » 2004 » String Processing and Information Retrieval, 11th International Conference, SPIRE 2004, Padova, Italy, October 5-8, 2004, Proceedings »

An Efficient Algorithm for the Longest Tandem Scattered Subsequence Problem

Adrian Kosowski


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:
spire_conference
Publisher:
Springer
Pages:
93–100
URL:
https://doi.org/10.1007/978-3-540-30213-1_13
DOI:
10.1007/978-3-540-30213-1_13
DBLP:
conf/spire/Kosowski04
BibTeX:
Download