Near Real-Time Suffix Tree Construction via the Fringe Marked Ancestor Problem.
Dany Breslauer|Giuseppe F. Italiano
| Anthology ID: | DBLP:conf/spire/BreslauerI11 |
|---|---|
| Volume: | String Processing and Information Retrieval, 18th International Symposium, SPIRE 2011, Pisa, Italy, October 17-21, 2011. Proceedings |
| Year: | 2011 |
| Venue: | Symposium on String Processing and Information Retrieval (SPIRE) |
| Publisher: | Springer |
| Pages: | 156-167 |
| URL: | https://doi.org/10.1007/978-3-642-24583-1_16 |
| DOI: | https://doi.org/10.1007/978-3-642-24583-1_16 |
| DBLP: | conf/spire/BreslauerI11 |
| BibTeX: |
@inproceedings{breslauer-2011-near,
author = {Dany Breslauer and
Giuseppe F. Italiano},
editor = {Roberto Grossi and
Fabrizio Sebastiani and
Fabrizio Silvestri},
title = {{Near Real-Time Suffix Tree Construction via the Fringe Marked Ancestor Problem}},
booktitle = {{String Processing and Information Retrieval, 18th International Symposium, SPIRE 2011, Pisa, Italy, October 17-21, 2011. Proceedings}},
series = {Lecture Notes in Computer Science},
volume = {7024},
pages = {156--167},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-24583-1_16},
doi = {https://doi.org/10.1007/978-3-642-24583-1_16}
}