Faster query algorithms for the text fingerprinting problem

Let S be a string over a finite, ordered alphabet Σ. For any substring S ′ of S, the set of distinct characters contained in S ′ is called its fingerprint. The text fingerprinting indexing problem is to construct a data structure for the string S in advance, so that on given any input subset C of Σ,...

Full description

Saved in:

Bibliographic Details
Published in:	Information and computation Vol. 209; no. 7; pp. 1057 - 1069
Main Authors:	Chan, Chi-Yuan, Yu, Hung-I, Hon, Wing-Kai, Wang, Biing-Feng
Format:	Journal Article
Language:	English
Published:	Amsterdam Elsevier Inc 01.07.2011 Elsevier
Subjects:	Algorithmics. Computability. Computer arithmetics Applied sciences Combinatorial algorithms on words Computer science; control theory; systems Data processing. List processing. Character string processing Exact sciences and technology Fingerprints Memory organisation. Data processing Miscellaneous Patricia trie Software Text indexing Theoretical computing Text indexing Patricia trie Fingerprints Combinatorial algorithms on words Input Word Computer theory Query Combinatorial algorithm Data structure Time complexity Indexing
ISSN:	0890-5401, 1090-2651
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!