Skip to main content
Conference Proceedings

Equality testing of compressed strings

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2015) 9304 14-26
DOI: 10.1007/978-3-319-23660-5_2
4Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper gives a survey on efficient algorithms for checking equality of grammar-compressed strings, i.e., strings that are represented succinctly by so called straight-line programs.

Cite

CITATION STYLE

APA

Lohrey, M. (2015). Equality testing of compressed strings. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9304, pp. 14–26). Springer Verlag. https://doi.org/10.1007/978-3-319-23660-5_2

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free