A bioinformatics-inspired adaptation to Ukkonen's edit distance calculating algorithm

Authors:
Bruce Johnson
Affiliations:
University of Tennessee, Knoxville, TN
Venue:
Proceedings of the 46th Annual Southeast Regional Conference on XX
Year:
2008

Citing 4
Cited 0

Algorithms for approximate string matching

Information and Control
The String-to-String Correction Problem

Journal of the ACM (JACM)
On Approximate String Matching

Proceedings of the 1983 International FCT-Conference on Fundamentals of Computation Theory
Pattern Classification (2nd Edition)

Pattern Classification (2nd Edition)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Edit distance measures the similarity between two strings (as the minimum number of change, insert or delete operations that transform one string to the other). An edit sequence s is a sequence of such operations and can be used to represent the string resulting from applyings to a reference string. We present a modification to Ukkonen's edit distance calculating algorithm based upon representing strings by edit sequences. We conclude with a demonstration of how using this representation can improve mitochondrial DNA query performance.