DeepAI AI Chat
Log In Sign Up

Enhanced string factoring from alphabet orderings

06/15/2018
by   Amanda Clare, et al.
Aberystwyth University
King's College London
0

In this note we consider the concept of alphabet ordering in the context of string factoring. We propose a greedy-type algorithm which produces Lyndon factorizations with small numbers of factors along with a modification for large numbers of factors. For the technique we introduce the Exponent Parikh vector. Applications and research directions derived from circ-UMFFs are discussed.

READ FULL TEXT

page 1

page 2

page 3

page 4

08/11/2021

Practical evaluation of Lyndon factors via alphabet reordering

We evaluate the influence of different alphabet orderings on the Lyndon ...
10/04/2001

ENUM: The Collision of Telephony and DNS Policy

ENUM marks either the convergence or collision of the public telephone n...
01/08/2021

Cantor Mapping Technique

A new technique specific to String ordering utilizing a method called "C...
09/01/2022

Maximal Closed Substrings

A string is closed if it has length 1 or has a nonempty border without i...
11/21/2022

String Covering: A Survey

The study of strings is an important combinatorial field that precedes t...
02/10/2020

Palindromic k-Factorization in Pure Linear Time

Given a string s of length n over a general alphabet and an integer k, t...
09/23/2022

From String Detection to Orthogonal Vector Problem

Considering Grover's Search Algorithm (GSA) with the standard diffuser s...