Real-time pattern matching and quiwi-real-time construction of suffix trees preliminary version

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn Part F129502, Issue , 1994, Pages 310-316

  Kosaraju, S Rao ^a  

^a JOHNS HOPKINS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; FORESTRY; PATTERN MATCHING; QUERY PROCESSING; ALGORITHMS; COMPUTATIONAL LINGUISTICS; DATA STRUCTURES; MATHEMATICAL MODELS; REAL TIME SYSTEMS; TERMINOLOGY;

FOLLOWING PROBLEM; PATTERN STRINGS; REAL TIME; REAL TIME ALGORITHMS; REAL-TIME CONSTRUCTION; SUBSTRING; SUFFIX-TREES; TEXT STRING;

TREES (MATHEMATICS);

LINEAR TIME ALGORITHM; QUASI REAL TIME CONSTRUCTION; REAL TIME PATTERN MATCHING; SUFFIX TREES; TEXT STRING; TOP DOWN SUFFIX TREE CONSTRUCTION ALGORITHM;

EID: 0028076575     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/195058.195170     Document Type: Conference Paper

References (5)

1. [CL90] W. L. Chang and E. L. Lawler. Approximate string matching in sublinear expected time. In Proc.. of 31st Annual IEEE Symp. on Foundations of Computer Science, pages 116-124, 1990.
2. [CS85] M. T. Chen and J. Seiferas. Efficient and elegant subword tree construction. In A. Apos-Tolico and Z. Galil, editors, Combinatorial Algorithms on Words, pages 97-107. Springer-Verlag, 1985.
3. [McC76] E. M. McCreight. A space-economical suffix tree construction algorithm. J. of ACM, pages 262-272, 1976.
4. [Sei77] J. Seiferas. Subword trees, February 1977. Class Notes.
5. [Wei73] P. Weiner. Linear pattern matching algorithms. In Proc. of 14th Annual IEEE Symp. on Switching & Automata Theory, pages 111, 1973.