Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
426733 | Information and Computation | 2016 | 12 Pages |
Abstract
For a given context-free grammar (CFG) and a finite-state automaton (FA), we tackle the edit-distance problem—the problem of computing the most similar pair of strings in the two respective languages. In particular, we consider three different gap cost models for the edit-distance that are crucial for finding a proper alignment between two bio sequences: the linear, affine and concave models. We design efficient algorithms for the edit-distance between a CFG and an FA under these gap cost models. The time complexity of our algorithm for computing the linear or affine gap distance is polynomial and the time complexity for the concave gap distance is exponential.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Sang-Ki Ko, Yo-Sub Han, Kai Salomaa,