On the complexity of determining the period of a string

Document Type

Conference Proceeding

Publication Date

1-1-2000

Abstract

We study the complexity of a classical combinatorial problem of computing the period of a string.We investigate both the average- and the worst-case complexity of the problem. We deliver almost tight bounds for the average-case. We show that every algorithm computing the period must examine (formula presented) symbols of an input string of lengthm. On the other hand we present an algorithm that computes the period by examining on average (formula presented) symbols, where |Σ| ³ 2 stands for the input alphabet. We also present a deterministic algorithm that computes the period of a string usingm+O(m3/4) comparisons. This is the first algorithm that have the worstcase complexity m + o(m)

Identifier

84937432920 (Scopus)

ISBN

[3540676333, 9783540676331]

Publication Title

Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics

External Full Text Location

https://doi.org/10.1007/3-540-45123-4_34

e-ISSN

16113349

ISSN

03029743

First Page

412

Last Page

422

Volume

1848

This document is currently not available here.

Share

COinS