Character sets of strings

Given a string S over a finite alphabet Σ, the character set (also called the fingerprint) of a substring S ′ of S is the subset C ⊆ Σ of the symbols occurring in S ′ . The study of the character sets of all the substrings of a given string (or a given collection of strings) appears in several domai...

Full description

Bibliographic Details

Published in:	Journal of discrete algorithms (Amsterdam, Netherlands) Vol. 5; no. 2; pp. 330 - 340
Main Authors:	Didier, Gilles, Schmidt, Thomas, Stoye, Jens, Tsur, Dekel
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 01.06.2007 Elsevier
Subjects:	Character sets Combinatorial algorithms on words Comparative genomics Computer Science Data Structures and Algorithms Discrete Mathematics Fingerprints Natural language processing Comparative genomics Natural language processing Fingerprints Combinatorial algorithms on words Character sets
ISSN:	1570-8667, 1570-8675
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!