Randomized efficient algorithms for compressed strings: the finger-print approach
- 1 January 1996
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Efficient two-dimensional compressed matchingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Pattern-matching for strings with short descriptionsPublished by Springer Nature ,1995
- Testing equivalence of morphisms on context-free languagesPublished by Springer Nature ,1994
- Optimal parallel algorithms for periods, palindromes and squaresPublished by Springer Nature ,1992
- Efficient randomized pattern-matching algorithmsIBM Journal of Research and Development, 1987
- On the Complexity of Finite SequencesIEEE Transactions on Information Theory, 1976