[Lecture Notes in Computer Science] String Processing and Information Retrieval Volume 4209 || Computing the Minimum Approximate λ-Cover of a String
✍ Scribed by Crestani, Fabio; Ferragina, Paolo; Sanderson, Mark
- Book ID
- 115477967
- Publisher
- Springer Berlin Heidelberg
- Year
- 2006
- Weight
- 434 KB
- Category
- Article
- ISBN
- 3540457755
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
This book constitutes the refereed proceedings of the 19th International Symposium on String Processing and Information Retrieval, SPIRE 2012, held in Cartagena de Indias, Colombia, in October 2012. The 26 full papers, 13 short papers, and 3 keynote speeches were carefully reviewed and selected from
This book constitutes the refereed proceedings of the 19th International Symposium on String Processing and Information Retrieval, SPIRE 2012, held in Cartagena de Indias, Colombia, in October 2012. The 26 full papers, 13 short papers, and 3 keynote speeches were carefully reviewed and selected from
This book constitutes the refereed proceedings of the 19th International Symposium on String Processing and Information Retrieval, SPIRE 2012, held in Cartagena de Indias, Colombia, in October 2012. The 26 full papers, 13 short papers, and 3 keynote speeches were carefully reviewed and selected from