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

Sang Ki Ko, Yo-Sub Han, Kai Salomaa

Research output: Contribution to journalArticle

5 Citations (Scopus)

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 languageEnglish
Pages (from-to)278-289
Number of pages12
JournalInformation and Computation
Volume247
DOIs
Publication statusPublished - 2016 Apr 1

Fingerprint

Context free grammars
Finite State Automata
Edit Distance
Context-free Grammar
Finite automata
Cost Model
Time Complexity
Computing
Costs
Alignment
Efficient Algorithms
Strings
Polynomials
Polynomial
Model

All Science Journal Classification (ASJC) codes

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

Cite this

@article{e9b49832f556431693498145a66db2e6,
title = "Approximate matching between a context-free grammar and a finite-state automaton",
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.",
author = "Ko, {Sang Ki} and Yo-Sub Han and Kai Salomaa",
year = "2016",
month = "4",
day = "1",
doi = "10.1016/j.ic.2016.02.001",
language = "English",
volume = "247",
pages = "278--289",
journal = "Information and Computation",
issn = "0890-5401",
publisher = "Elsevier Inc.",

}

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

In: Information and Computation, Vol. 247, 01.04.2016, p. 278-289.

Research output: Contribution to journalArticle

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

VL - 247

SP - 278

EP - 289

JO - Information and Computation

JF - Information and Computation

SN - 0890-5401

ER -