The Myriad Virtues of Subword Trees
- 1 January 1985
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Pattern Matching Machine implementation of a fast test for unique decipherabilityInformation Processing Letters, 1984
- Building a complete inverted file for a set of text files in linear timePublished by Association for Computing Machinery (ACM) ,1984
- Building the minimal DFA for the set of all subwords of a word on-line in linear timeLecture Notes in Computer Science, 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
- Fast Pattern Matching in StringsSIAM Journal on Computing, 1977
- A New Linear-Time ``On-Line'' Algorithm for Finding the Smallest Initial Palindrome of a StringJournal of the ACM, 1975
- Rapid identification of repeated patterns in strings, trees and arraysPublished by Association for Computing Machinery (ACM) ,1972
- The equation $a^M=b^Nc^P$ in a free group.The Michigan Mathematical Journal, 1962