Bounds and estimates on the average edit distance

DOI10.1007/978-3-030-32686-9_7zbMATH Open1539.68384MaRDI QIDQ6536246

Gianfranco Bilardi, Michele Schimd

Publication date: 19 April 2024

zbMATH Keywords

upper and lower boundsedit distancestatistical estimatesaverage analysis

Mathematics Subject Classification ID

Parametric tolerance and confidence regions (62F25) Algorithms on strings (68W32)

Cites Work

• Title not available (Why is that?)
• A faster algorithm computing string edit distances
• Bounding the expected length of longest common subsequences and forests
• Edit Distance Cannot Be Computed in Strongly Subquadratic Time (unless SETH is false)
• Improved bounds on the average length of longest common subsequences
• Longest common subsequences of two random sequences
• Computing the Expected Edit Distance from a String to a Probabilistic Finite-State Automaton
• Hardness of approximate nearest neighbor search

This page was built for publication: Bounds and estimates on the average edit distance

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6536246)