Algorithms for Finding a Minimum Repetition Representation of a String.

Atsuyoshi Nakamura|Tomoya Saito|Ichigaku Takigawa|Hiroshi Mamitsuka|Mineichi Kudo


Anthology ID:DBLP:conf/spire/NakamuraSTMK10
Volume:String Processing and Information Retrieval - 17th International Symposium, SPIRE 2010, Los Cabos, Mexico, October 11-13, 2010. Proceedings
Year:2010
Venue:Symposium on String Processing and Information Retrieval (SPIRE)
Publisher:Springer
Pages:185-190
URL:https://doi.org/10.1007/978-3-642-16321-0_18
DOI:https://doi.org/10.1007/978-3-642-16321-0_18
DBLP:conf/spire/NakamuraSTMK10
BibTeX:
@inproceedings{nakamura-2010-algorithms, author = {Atsuyoshi Nakamura and Tomoya Saito and Ichigaku Takigawa and Hiroshi Mamitsuka and Mineichi Kudo}, editor = {Edgar Ch\'{a}vez and Stefano Lonardi}, title = {{Algorithms for Finding a Minimum Repetition Representation of a String}}, booktitle = {{String Processing and Information Retrieval - 17th International Symposium, SPIRE 2010, Los Cabos, Mexico, October 11-13, 2010. Proceedings}}, series = {Lecture Notes in Computer Science}, volume = {6393}, pages = {185--190}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-16321-0_18}, doi = {https://doi.org/10.1007/978-3-642-16321-0_18} }