A Faster Algorithm for Computing Maximal \alpha -gapped Repeats in a String.

Yuka Tanimura|Yuta Fujishige|Tomohiro I|Shunsuke Inenaga|Hideo Bannai|Masayuki Takeda


Anthology ID:DBLP:conf/spire/TanimuraFIIBT15
Volume:String Processing and Information Retrieval - 22nd International Symposium, SPIRE 2015, London, UK, September 1-4, 2015, Proceedings
Year:2015
Venue:Symposium on String Processing and Information Retrieval (SPIRE)
Publisher:Springer
Pages:124-136
URL:https://doi.org/10.1007/978-3-319-23826-5_13
DOI:https://doi.org/10.1007/978-3-319-23826-5_13
DBLP:conf/spire/TanimuraFIIBT15
BibTeX:
@inproceedings{tanimura-2015-faster, author = {Yuka Tanimura and Yuta Fujishige and Tomohiro I and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda}, editor = {Costas S. Iliopoulos and Simon J. Puglisi and Emine Yilmaz}, title = {{A Faster Algorithm for Computing Maximal \alpha -gapped Repeats in a String}}, booktitle = {{String Processing and Information Retrieval - 22nd International Symposium, SPIRE 2015, London, UK, September 1-4, 2015, Proceedings}}, series = {Lecture Notes in Computer Science}, volume = {9309}, pages = {124--136}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-319-23826-5_13}, doi = {https://doi.org/10.1007/978-3-319-23826-5_13} }