Matteo Canella

Learn More
String comparison is a critical issue in many application domains, including speech recognition, contents search, and bioinformatics. The similarity between two strings of lengths N and M can be computed in O(N × M) steps by means of a dynamic programming algorithm developed by Needleman and Wunsh. The algorithm can be effectively mapped onto a systolic(More)
  • 1