Efficient q-Gram Filters for Finding All epsilon-Matches over a Given Length

Kim R. Rasmussen, Jens Stoye, Eugene W. Myers. Efficient q-Gram Filters for Finding All epsilon-Matches over a Given Length. In Satoru Miyano, Jill P. Mesirov, Simon Kasif, Sorin Istrail, Pavel A. Pevzner, Michael S. Waterman, editors, Research in Computational Molecular Biology, 9th Annual International Conference, RECOMB 2005, Cambridge, MA, USA, May 14-18, 2005, Proceedings. Volume 3500 of Lecture Notes in Computer Science, pages 189-203, Springer, 2005. [doi]

@inproceedings{RasmussenSM05,
  title = {Efficient q-Gram Filters for Finding All epsilon-Matches over a Given Length},
  author = {Kim R. Rasmussen and Jens Stoye and Eugene W. Myers},
  year = {2005},
  doi = {10.1007/11415770_15},
  url = {http://dx.doi.org/10.1007/11415770_15},
  tags = {Epsilon},
  researchr = {https://researchr.org/publication/RasmussenSM05},
  cites = {0},
  citedby = {0},
  pages = {189-203},
  booktitle = {Research in Computational Molecular Biology, 9th Annual International Conference, RECOMB 2005, Cambridge, MA, USA, May 14-18, 2005, Proceedings},
  editor = {Satoru Miyano and Jill P. Mesirov and Simon Kasif and Sorin Istrail and Pavel A. Pevzner and Michael S. Waterman},
  volume = {3500},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-25866-3},
}