Faster algorithms for the construction of parameterized suffix trees

Parameterized strings were introduced by Baker to solve the problem of identifying blocks of code that get duplicated in a large software system. Parameter symbols capture the notion of code identity while permitting renaming of variables. The code duplication problem was solved by first constructing a generalized suffix tree for the corresponding parameterized strings. The fastest known generalized suffix tree algorithm has an O(n(|II|+log|Σ|)) speed, where n is the length of the input, II is the set of parameters, and C is the set of fixed symbols. Here an algorithm that has a running time of O(n log|II| log|Σ|) is constructed. The algorithm is then improved to another that has a running time of O(n(log|II|+log|Σ|))