Fast algorithms for finding a minimum repetition representation of strings and trees

A string with many repetitions can be represented compactly by replacing h-fold contiguous repetitions of a string r with (r)h. We present a compact representation, which we call a repetition representation (of a string) or RRS, by which a set of disjoint or nested tandem arrays can be compacted. In...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Discrete Applied Mathematics Jg. 161; H. 10-11; S. 1556 - 1575
Hauptverfasser:	Nakamura, Atsuyoshi, Saito, Tomoya, Takigawa, Ichigaku, Kudo, Mineichi, Mamitsuka, Hiroshi
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier B.V 01.07.2013
Schlagworte:	Algorithms Chromosomes Compressing Labeled ordered trees Repetition Representations String algorithm Strings Tandem repeat Trees Websites String algorithm Labeled ordered trees Tandem repeat
ISSN:	0166-218X, 1872-6771
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!