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]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