Linear Time Algorithm for the Longest Common Repeat Problem.

Inbok Lee|Costas S. Iliopoulos|Kunsoo Park


Anthology ID:DBLP:conf/spire/LeeIP04
Volume:String Processing and Information Retrieval, 11th International Conference, SPIRE 2004, Padova, Italy, October 5-8, 2004, Proceedings
Year:2004
Venue:Symposium on String Processing and Information Retrieval (SPIRE)
Publisher:Springer
Pages:10-17
URL:https://doi.org/10.1007/978-3-540-30213-1_2
DOI:https://doi.org/10.1007/978-3-540-30213-1_2
DBLP:conf/spire/LeeIP04
BibTeX:
@inproceedings{lee-2004-linear, author = {Inbok Lee and Costas S. Iliopoulos and Kunsoo Park}, editor = {Alberto Apostolico and Massimo Melucci}, title = {{Linear Time Algorithm for the Longest Common Repeat Problem}}, booktitle = {{String Processing and Information Retrieval, 11th International Conference, SPIRE 2004, Padova, Italy, October 5-8, 2004, Proceedings}}, series = {Lecture Notes in Computer Science}, volume = {3246}, pages = {10--17}, publisher = {Springer}, year = {2004}, url = {https://doi.org/10.1007/978-3-540-30213-1_2}, doi = {https://doi.org/10.1007/978-3-540-30213-1_2} }