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...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Journal of discrete algorithms (Amsterdam, Netherlands) Jg. 5; H. 2; S. 330 - 340
Hauptverfasser:	Didier, Gilles, Schmidt, Thomas, Stoye, Jens, Tsur, Dekel
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier B.V 01.06.2007 Elsevier
Schlagworte:	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-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!