Faster algorithms for the construction of parameterized suffix trees

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 1995, Pages 631-637

  Kosaraju, S Rao ^a  

^a JOHNS HOPKINS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BLOCK CODES; COMPUTATION THEORY; COMPUTATIONAL COMPLEXITY; COMPUTER SOFTWARE; DATA STRUCTURES; PROBLEM SOLVING;

CODE DUPLICATION PROBLEM; CODE IDENTITY; PARAMETERIZED STRINGS; PARAMETERIZED SUFFIX TREES;

ALGORITHMS;

EID: 0029541040     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (15)