Computing the Minimum Approximate lambda-Cover of a String.

Qing Guo|Hui Zhang|Costas S. Iliopoulos


Anthology ID:DBLP:conf/spire/GuoZI06
Volume:String Processing and Information Retrieval, 13th International Conference, SPIRE 2006, Glasgow, UK, October 11-13, 2006, Proceedings
Year:2006
Venue:Symposium on String Processing and Information Retrieval (SPIRE)
Publisher:Springer
Pages:49-60
URL:https://doi.org/10.1007/11880561_5
DOI:https://doi.org/10.1007/11880561_5
DBLP:conf/spire/GuoZI06
BibTeX:
@inproceedings{guo-2006-computing, author = {Qing Guo and Hui Zhang and Costas S. Iliopoulos}, editor = {Fabio Crestani and Paolo Ferragina and Mark Sanderson}, title = {{Computing the Minimum Approximate lambda-Cover of a String}}, booktitle = {{String Processing and Information Retrieval, 13th International Conference, SPIRE 2006, Glasgow, UK, October 11-13, 2006, Proceedings}}, series = {Lecture Notes in Computer Science}, volume = {4209}, pages = {49--60}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11880561_5}, doi = {https://doi.org/10.1007/11880561_5} }