Properties of Cover and Seed of Partial Words

We take into account the problem of identifying the repeated structure in a given ℘word v♦ of length l. We show that a ℘word v♦ is a cover of a ℘word u♦ if every letter of u♦ lies within an occurrence of v♦ in u♦ and v♦ is a border of u♦. Here, we examine string issues that are concerned with identi...

Full description

Saved in:
Bibliographic Details
Published in:IAENG international journal of applied mathematics 2023-09, Vol.53 (3), p.361-366
Main Authors: Kumari, R Krishna, Jeyanthi, L, Janaki, K, Arulprakasam, R, Madhusoodhanan, P
Format: Article
Language:English
Subjects:
Combinatorics
Data compression
Language
Molecular biology
Seeds
Strings
System theory
Text editing
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We take into account the problem of identifying the repeated structure in a given ℘word v♦ of length l. We show that a ℘word v♦ is a cover of a ℘word u♦ if every letter of u♦ lies within an occurrence of v♦ in u♦ and v♦ is a border of u♦. Here, we examine string issues that are concerned with identifying recurring patterns in a given total word x. The total word's period p, a common regularity, captures x's repetition, since x is a prefix of a string created by concatenating p. We think about a challenge developed by expanding the scope of this repetitiveness idea by permitting overlaps between the segments that are repeated. We focus on a key issue in string processing: the compact representation of a word by its most frequent factors. The frequency cover, or the longest repeating factor, is a useful and simple form of quasi-periodicity in words that is proposed in this paper.
ISSN:1992-9978
1992-9986