Efficient Algorithms for Longest Closed Factor Array.

Hideo Bannai|Shunsuke Inenaga|Tomasz Kociumaka|Arnaud Lefebvre|Jakub Radoszewski|Wojciech Rytter|Shiho Sugimoto|Tomasz Walen


Anthology ID:DBLP:conf/spire/BannaiIKLRRSW15
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:95-102
URL:https://doi.org/10.1007/978-3-319-23826-5_10
DOI:https://doi.org/10.1007/978-3-319-23826-5_10
DBLP:conf/spire/BannaiIKLRRSW15
BibTeX:
@inproceedings{bannai-2015-efficient, author = {Hideo Bannai and Shunsuke Inenaga and Tomasz Kociumaka and Arnaud Lefebvre and Jakub Radoszewski and Wojciech Rytter and Shiho Sugimoto and Tomasz Walen}, editor = {Costas S. Iliopoulos and Simon J. Puglisi and Emine Yilmaz}, title = {{Efficient Algorithms for Longest Closed Factor Array}}, 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 = {95--102}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-319-23826-5_10}, doi = {https://doi.org/10.1007/978-3-319-23826-5_10} }