Script for calculating the edit distance between two strings. We compare two approaches in terms of computational time: linear storage and quadratic storage. Python scripts used to calculate 3 basic ...

Graph matching and edit distance algorithms form a cornerstone of modern computational techniques used to quantify the similarity between structured data. These methods underpin a wide array of ...

Abstract: In this paper, we present the first dynamic algorithms for Dyck edit distance and tree edit distance that achieve subpolynomial update times. Dyck edit distance measures how far a ...

Abstract: In this paper, we present a revised method to compute the similarity of traditional string edit distance. Given two strings X and Y over a finite alphabet, an edit distance between X and Y ...

These days genomic sequence analysis provides a key way of understanding the biology of an organism. However, since these sequences contain much private information, it can be very dangerous to reveal ...

A major advance reveals deep connections between the classes of problems that computers can — and can’t — possibly do. At first glance, the big news coming out of this summer’s conference on the ...

This repo contains different university projects made by me, Alessio Mana and Fabrizio Sanino for our Algorithm and Data Structure Exam done in Turin in June 2021.