Search
Close this search box.

Contents

Journal of Combinatorial Mathematics and Combinatorial Computing

  • Research article

Computing All Repeats of a Partial Word

K. Sasikala1, V.R. Dare2, D.G. Thomas2
1Department of Mathematics, St. Joseph’s College of Engineering Chennai – 119, India.
2Department of Mathematics, Madras Christian College Chennai – 59, India
  • Published: 30/11/2008

Abstract

In this paper, we describe two algorithms to identify the repeating subwords in a given partial word \( w_o = w_0[1,…,n] \). The first algorithm uses the suffix tree and the second algorithm uses the valency tree. Both algorithms take linear time to identify the repeating subwords of a partial word.

Information
Guidelines
CP Initiatives
Follow CP
Facebook Twitter Linkedin
1970-2024 CP (Manitoba, Canada) unless otherwise stated.
Citation
K. Sasikala, V.R. Dare, D.G. Thomas. Computing All Repeats of a Partial Word[J], Journal of Combinatorial Mathematics and Combinatorial Computing, Volume 067. 235-248. DOI: .