An Efficient Algorithm for the Longest Tandem Scattered Subsequence Problem. Kosowski, A. In Proceedings of String Processing and Information Retrieval (SPIRE), pages 93-100, 2004. ![An Efficient Algorithm for the Longest Tandem Scattered Subsequence Problem [link]](https://bibbase.org/img/filetypes/link.svg "link")
Paper bibtex @inproceedings{ dblp3490851,
title = {An Efficient Algorithm for the Longest Tandem Scattered Subsequence Problem},
author = {Adrian Kosowski},
author_short = {Kosowski, A.},
bibtype = {inproceedings},
type = {inproceedings},
year = {2004},
key = {dblp3490851},
id = {dblp3490851},
biburl = {http://www.dblp.org/rec/bibtex/conf/spire/Kosowski04},
url = {http://dx.doi.org/10.1007/978-3-540-30213-1_13},
conference = {SPIRE},
pages = {93-100},
text = {SPIRE 2004:93-100},
booktitle = {Proceedings of String Processing and Information Retrieval (SPIRE)}
}
Downloads: 0
{"_id":"ubeW6RbRhfgJ4oPR8","authorIDs":["5490499d0039fe866f000ad8"],"author_short":["Kosowski, A."],"bibbaseid":"kosowski-anefficientalgorithmforthelongesttandemscatteredsubsequenceproblem-2004","bibdata":{"title":"An Efficient Algorithm for the Longest Tandem Scattered Subsequence Problem","author":["Adrian Kosowski"],"author_short":["Kosowski, A."],"bibtype":"inproceedings","type":"inproceedings","year":"2004","key":"dblp3490851","id":"dblp3490851","biburl":"http://www.dblp.org/rec/bibtex/conf/spire/Kosowski04","url":"http://dx.doi.org/10.1007/978-3-540-30213-1_13","conference":"SPIRE","pages":"93-100","text":"SPIRE 2004:93-100","booktitle":"Proceedings of String Processing and Information Retrieval (SPIRE)","bibtex":"@inproceedings{ dblp3490851,\n title = {An Efficient Algorithm for the Longest Tandem Scattered Subsequence Problem},\n author = {Adrian Kosowski},\n author_short = {Kosowski, A.},\n bibtype = {inproceedings},\n type = {inproceedings},\n year = {2004},\n key = {dblp3490851},\n id = {dblp3490851},\n biburl = {http://www.dblp.org/rec/bibtex/conf/spire/Kosowski04},\n url = {http://dx.doi.org/10.1007/978-3-540-30213-1_13},\n conference = {SPIRE},\n pages = {93-100},\n text = {SPIRE 2004:93-100},\n booktitle = {Proceedings of String Processing and Information Retrieval (SPIRE)}\n}","bibbaseid":"kosowski-anefficientalgorithmforthelongesttandemscatteredsubsequenceproblem-2004","role":"author","urls":{"Paper":"http://dx.doi.org/10.1007/978-3-540-30213-1_13"},"downloads":0,"html":""},"bibtype":"inproceedings","biburl":"http://www.dblp.org/rec/bibtex/conf/spire/Kosowski04","creationDate":"2014-12-16T15:02:53.210Z","downloads":0,"keywords":[],"search_terms":["efficient","algorithm","longest","tandem","scattered","subsequence","problem","kosowski"],"title":"An Efficient Algorithm for the Longest Tandem Scattered Subsequence Problem","year":2004,"dataSources":["PNCp2ReqxiDtsri9K"]}