A Generalization of the Suffix Tree to Square Matrices, with Applications
- 1 June 1995
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 24 (3) , 520-562
- https://doi.org/10.1137/s0097539792231982
Abstract
No abstract availableThis publication has 13 references indexed in Scilit:
- Dynamic dictionary matchingJournal of Computer and System Sciences, 1994
- An index data structure for matrices, with applications to fast two-dimensional pattern matchingPublished by Springer Nature ,1993
- Two-dimensional dictionary matchingInformation Processing Letters, 1992
- Algorithms for Finding Patterns in StringsPublished by Elsevier ,1990
- Data structures and algorithms for approximate string matchingJournal of Complexity, 1988
- Efficient and Elegant Subword-Tree ConstructionPublished by Springer Nature ,1985
- Fast Algorithms for Finding Nearest Common AncestorsSIAM Journal on Computing, 1984
- A Technique for Extending Rapid Exact-Match String Matching to Arrays of More than One DimensionSIAM Journal on Computing, 1978
- Two dimensional pattern matchingInformation Processing Letters, 1977
- Efficient string matchingCommunications of the ACM, 1975