IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v458y2023ics0096300323003715.html
   My bibliography  Save this article

Volume formula and growth rates of the balls of strings under the edit distances

Author

Listed:
  • Koyano, Hitoshi
  • Hayashida, Morihiro

Abstract

Analogs of balls in n-dimensional Euclidean space are defined in the monoid of strings composed of letters of an alphabet if a metric is defined on the monoid. These analogs are not only balls in the monoid of strings but also regular languages. Since the Levenshtein distance, a reasonable metric between strings, was introduced in 1965, researchers have aimed to determine a formula for computing the volumes of balls of strings under this distance and their growth rate. However, this problem remains open. In this paper, we first derive a formula for the volumes of balls of strings under a metric obtained by extending the Hamming distance as a metric on the whole monoid and subsequently reveal the growth rate of balls of strings under the Levenshtein distance using this formula. Furthermore, we describe a conjecture on the formula for the volumes of spheres of strings under the Levenshtein distance. Next, we construct an efficient randomized algorithm that computes estimates of the volumes of the balls whose estimation errors are less than a given value with a probability greater than a specified value. Finally, we examine the validity of the proposed conjecture, using the (true) volumes obtained by exhaustive searches for small spheres and estimates of the volumes obtained by this algorithm for large ones.

Suggested Citation

  • Koyano, Hitoshi & Hayashida, Morihiro, 2023. "Volume formula and growth rates of the balls of strings under the edit distances," Applied Mathematics and Computation, Elsevier, vol. 458(C).
    • Handle: RePEc:eee:apmaco:v:458:y:2023:i:c:s0096300323003715
    DOI: 10.1016/j.amc.2023.128202
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300323003715
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2023.128202?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:apmaco:v:458:y:2023:i:c:s0096300323003715. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.