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

Celý popis

Podrobná bibliografia

Vydané v:	Journal of discrete algorithms (Amsterdam, Netherlands) Ročník 5; číslo 2; s. 330 - 340
Hlavní autori:	Didier, Gilles, Schmidt, Thomas, Stoye, Jens, Tsur, Dekel
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 01.06.2007 Elsevier
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!