Martin Senft. Suffix Tree Based Data Compression. In Peter Vojtás, Mária Bieliková, Bernadette Charron-Bost, Ondrej Sýkora, editors, SOFSEM 2005: Theory and Practice of Computer Science, 31st Conference on Current Trends in Theory and Practice of Computer Science, Liptovský Ján, Slovakia, January 22-28, 2005, Proceedings. Volume 3381 of Lecture Notes in Computer Science, pages 350-359, Springer, 2005. [doi]
@inproceedings{Senft05,
title = {Suffix Tree Based Data Compression},
author = {Martin Senft},
year = {2005},
url = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=3381&spage=350},
tags = {rule-based, data-flow},
researchr = {https://researchr.org/publication/Senft05},
cites = {0},
citedby = {0},
pages = {350-359},
booktitle = {SOFSEM 2005: Theory and Practice of Computer Science, 31st Conference on Current Trends in Theory and Practice of Computer Science, Liptovský Ján, Slovakia, January 22-28, 2005, Proceedings},
editor = {Peter Vojtás and Mária Bieliková and Bernadette Charron-Bost and Ondrej Sýkora},
volume = {3381},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-24302-X},
}