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

Full description

Bibliographic Details

Published in:	Discrete Applied Mathematics Vol. 161; no. 10-11; pp. 1556 - 1575
Main Authors:	Nakamura, Atsuyoshi, Saito, Tomoya, Takigawa, Ichigaku, Kudo, Mineichi, Mamitsuka, Hiroshi
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 01.07.2013
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!