Algorithms for Jumbled Indexing, Jumbled Border and Jumbled Square on run-length encoded strings

No Thumbnail Available
File version
Author(s)
Amir, Amihood
Apostolico, Alberto
Hirst, Tirza
Landau, Gad M
Lewenstein, Noa
Rozenberg, Liat
Griffith University Author(s)
Primary Supervisor
Other Supervisors
Editor(s)
Date
2016
Size
File type(s)
Location
License
Abstract

In this paper we investigate jumbled (Abelian) versions of three classical strings problems. In all these problems we assume the input string S[1..n]is given in its run-length format S′[1..r].

Journal Title
Theoretical Computer Science
Conference Title
Book Title
Edition
Volume
Issue
Thesis Type
Degree Program
School
Publisher link
Patent number
Funder(s)
Grant identifier(s)
Rights Statement
Rights Statement
Item Access Status
Note
Access the data
Related item(s)
Subject
Mathematical sciences
Persistent link to this record
Citation
Amir, A; Apostolico, A; Hirst, T; Landau, GM; Lewenstein, N; Rozenberg, L, Algorithms for Jumbled Indexing, Jumbled Border and Jumbled Square on run-length encoded strings, Theoretical Computer Science, 2016, 656 (Pt B), pp. 146-159
Collections