### 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.

Original language | English |
---|---|

Pages (from-to) | 278-289 |

Number of pages | 12 |

Journal | Information and Computation |

Volume | 247 |

DOIs | |

Publication status | Published - 2016 Apr 1 |

### Fingerprint

### All Science Journal Classification (ASJC) codes

- Theoretical Computer Science
- Information Systems
- Computer Science Applications
- Computational Theory and Mathematics

### Cite this

*Information and Computation*,

*247*, 278-289. https://doi.org/10.1016/j.ic.2016.02.001

}

*Information and Computation*, vol. 247, pp. 278-289. https://doi.org/10.1016/j.ic.2016.02.001

**Approximate matching between a context-free grammar and a finite-state automaton.** / Ko, Sang Ki; Han, Yo-Sub; Salomaa, Kai.

Research output: Contribution to journal › Article

TY - JOUR

T1 - Approximate matching between a context-free grammar and a finite-state automaton

AU - Ko, Sang Ki

AU - Han, Yo-Sub

AU - Salomaa, Kai

PY - 2016/4/1

Y1 - 2016/4/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84959387678&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84959387678&partnerID=8YFLogxK

U2 - 10.1016/j.ic.2016.02.001

DO - 10.1016/j.ic.2016.02.001

M3 - Article

AN - SCOPUS:84959387678

VL - 247

SP - 278

EP - 289

JO - Information and Computation

JF - Information and Computation

SN - 0890-5401

ER -