On the size distribution of Levenshtein balls with radius one

04/05/2022
by   Geyang Wang, et al.
0

The fixed length Levenshtein (FLL) distance between two words 𝐱,𝐲∈ℤ_m^n is the smallest integer t such that 𝐱 can be transformed to 𝐲 by t insertions and t deletions. The size of a ball in FLL metric is a fundamental but challenging problem. Very recently, Bar-Lev, Etzion, and Yaakobi explicitly determined the minimum, maximum and average sizes of the FLL balls with radius one. In this paper, based on these results, we further prove that the size of the FLL balls with radius one is highly concentrated around its mean by Azuma's inequality.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/16/2022

On the Size of Balls and Anticodes of Small Diameter under the Fixed-Length Levenshtein Metric

The rapid development of DNA storage has brought the deletion and insert...
research
09/26/2021

Expected value of the smallest denominator in a random interval of fixed radius

We compute the probability mass function of the random variable which re...
research
04/09/2021

Stagnation Detection in Highly Multimodal Fitness Landscapes

Stagnation detection has been proposed as a mechanism for randomized sea...
research
03/02/2021

On the Size of Levenshtein Balls

The rapid development of DNA storage has brought the deletion and insert...
research
07/17/2023

Robust Preconditioning of mixed-dimensional PDEs on 3d-1d domains coupled with Lagrange multipliers

In the context of micro-circulation, the coexistence of two distinct len...
research
04/15/2020

The Maximum Distance Problem and Minimal Spanning Trees

Given a compact E ⊂ℝ^n and s > 0, the maximum distance problem seeks a c...
research
08/09/2018

Optimal conditions for connectedness of discretized sets

Constructing a discretization of a given set is a major problem in vario...

Please sign up or login with your details

Forgot password? Click here to reset