A New Algorithm for Fast All-Against-All Substring Matching.
Marina Barsky|Ulrike Stege|Alex Thomo|Chris Upton
| Anthology ID: | DBLP:conf/spire/BarskySTU06 |
|---|---|
| Volume: | String Processing and Information Retrieval, 13th International Conference, SPIRE 2006, Glasgow, UK, October 11-13, 2006, Proceedings |
| Year: | 2006 |
| Venue: | Symposium on String Processing and Information Retrieval (SPIRE) |
| Publisher: | Springer |
| Pages: | 360-366 |
| URL: | https://doi.org/10.1007/11880561_31 |
| DOI: | https://doi.org/10.1007/11880561_31 |
| DBLP: | conf/spire/BarskySTU06 |
| BibTeX: |
@inproceedings{barsky-2006-new,
author = {Marina Barsky and
Ulrike Stege and
Alex Thomo and
Chris Upton},
editor = {Fabio Crestani and
Paolo Ferragina and
Mark Sanderson},
title = {{A New Algorithm for Fast All-Against-All Substring Matching}},
booktitle = {{String Processing and Information Retrieval, 13th International Conference, SPIRE 2006, Glasgow, UK, October 11-13, 2006, Proceedings}},
series = {Lecture Notes in Computer Science},
volume = {4209},
pages = {360--366},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11880561_31},
doi = {https://doi.org/10.1007/11880561_31}
}