Faster algorithms for the construction of parameterized suffix trees

Authors:
S. Rao Kosaraju
Affiliations:
-
Venue:
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Year:
1995

Citing 0
Cited 24

The string B-tree: a new data structure for string search in external memory and its applications

Journal of the ACM (JACM)
Parameterized diff

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Generalization of a Suffix Tree for RNA Structural Pattern Matching

SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Approximate parameterized matching

ACM Transactions on Algorithms (TALG)
Finding Clones with Dup: Analysis of an Experiment

IEEE Transactions on Software Engineering
Fast parameterized matching with q-grams

Journal of Discrete Algorithms
On the Longest Common Parameterized Subsequence

CPM '08 Proceedings of the 19th annual symposium on Combinatorial Pattern Matching
δ γ --- Parameterized Matching

SPIRE '08 Proceedings of the 15th International Symposium on String Processing and Information Retrieval
Comparison and evaluation of code clone detection techniques and tools: A qualitative approach

Science of Computer Programming
Counting Parameterized Border Arrays for a Binary Alphabet

LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
On-Line Construction of Parameterized Suffix Trees

SPIRE '09 Proceedings of the 16th International Symposium on String Processing and Information Retrieval
On the longest common parameterized subsequence

Theoretical Computer Science
Verifying a parameterized border array in O(n1.5) time

CPM'10 Proceedings of the 21st annual conference on Combinatorial pattern matching
On-line construction of parameterized suffix trees for large alphabets

Information Processing Letters
Verifying and enumerating parameterized border arrays

Theoretical Computer Science
Sublinear algorithms for parameterized matching

CPM'06 Proceedings of the 17th Annual conference on Combinatorial Pattern Matching
Two dimensional parameterized matching

CPM'05 Proceedings of the 16th annual conference on Combinatorial Pattern Matching
p-Suffix sorting as arithmetic coding

IWOCA'11 Proceedings of the 22nd international conference on Combinatorial Algorithms
Parameterized longest previous factor

Theoretical Computer Science
Variations of the parameterized longest previous factor

Journal of Discrete Algorithms
p-Suffix sorting as arithmetic coding

Journal of Discrete Algorithms
Resource requirement prediction using clone detection technique

Future Generation Computer Systems
Frequency-based similarity for parameterized sequences: Formal framework, algorithms, and applications

Information Sciences: an International Journal
The structural border array

Journal of Discrete Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.