Alphabet-Independent Algorithms for Finding Context-Sensitive Repeats in Linear Time

Enno Ohlebusch, Timo Beller. Alphabet-Independent Algorithms for Finding Context-Sensitive Repeats in Linear Time. In Edleno Silva de Moura, Maxime Crochemore, editors, String Processing and Information Retrieval - 21st International Symposium, SPIRE 2014, Ouro Preto, Brazil, October 20-22, 2014. Proceedings. Volume 8799 of Lecture Notes in Computer Science, pages 117-128, Springer, 2014. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.