Structural properties of the string statistics problem
- 31 December 1985
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 31 (3) , 394-411
- https://doi.org/10.1016/0022-0000(85)90060-1
Abstract
No abstract availableKeywords
Funding Information
- Ministero dell’Istruzione, dell’Università e della Ricerca
- North Atlantic Treaty Organization (039.82)
This publication has 13 references indexed in Scilit:
- The Boyer–Moore–Galil String Searching Strategies RevisitedSIAM Journal on Computing, 1986
- The Myriad Virtues of Subword TreesPublished by Springer Nature ,1985
- An O(n log n) algorithm for finding all repetitions in a stringJournal of Algorithms, 1984
- Optimal off-line detection of repetitions in a stringTheoretical Computer Science, 1983
- An optimal algorithm for computing the repetitions in a wordInformation Processing Letters, 1981
- Efficient On-Line Construction and Correction of Position TreesSIAM Journal on Computing, 1980
- A fast string searching algorithmCommunications of the ACM, 1977
- Fast Pattern Matching in StringsSIAM Journal on Computing, 1977
- A Space-Economical Suffix Tree Construction AlgorithmJournal of the ACM, 1976
- The equation $a^M=b^Nc^P$ in a free group.The Michigan Mathematical Journal, 1962