On the Right-Seed Array of a String

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21240%2F11%3A00191810" target="_blank" >RIV/68407700:21240/11:00191810 - isvavai.cz</a>

Result on the web

<a href="http://www.springerlink.com/content/k2513g07893r3123/fulltext.pdf" target="_blank" >http://www.springerlink.com/content/k2513g07893r3123/fulltext.pdf</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1007/978-3-642-22685-4" target="_blank" >10.1007/978-3-642-22685-4</a>

Result language

angličtina

Original language name

On the Right-Seed Array of a String

Original language description

We consider the problem of finding the repetitive structure of a given fixed string y. A factor u of y is a cover of y, if every letter of y falls within some occurrence of u in y. A factor v of y is a seed of y, if it is a cover of a superstring of y. There exist linear-time algorithms for solving the minimal cover problem. The minimal seed problem is of much higher algorithmic difficulty, and no linear-time algorithm is known. In this article, we solve one of its variants - computing the minimal and maximal right-seed array of a given string. A right seed of y is the shortest suffix of y that it is a cover of a superstring of y. An integer array RS is the minimal right-seed (resp. maximal right-seed) array of y, if RS [i] is the minimal (resp. maximal) length of right seeds of y[0..i]. We present an O(n log n) time algorithm that computes the minimal right-seed array of a given string, and a linear-time solution to compute the maximal right-seed array.

Czech name

—

Czech description

—

Type

J_x - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

CEP classification

IN - Informatics

OECD FORD branch

—

Project

<a href="/en/project/GA201%2F09%2F0807" target="_blank" >GA201/09/0807: String and tree analysis and processing</a><br>

Continuities

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year

2011

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Name of the periodical

Lecture Notes in Computer Science

ISSN

0302-9743

e-ISSN

—

Volume of the periodical

6842

Issue of the periodical within the volume

—

Country of publishing house

DE - GERMANY

Number of pages

11

Pages from-to

492-502

UT code for WoS article

—

EID of the result in the Scopus database

—