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

Yo Sub Han, Sang Ki Ko, Kai Salomaa

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Citations (Scopus)

Abstract

Given a context-free grammar (CFG) and a finite-state automaton (FA), we tackle the problem of computing the most similar pair of strings from two languages. We in particular consider three different gap cost models, linear, affine and concave models, that are crucial for finding a proper alignment between two bio sequences. We design efficient algorithms for computing 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
Title of host publicationImplementation and Application of Automata - 18th International Conference, CIAA 2013, Proceedings
Pages146-157
Number of pages12
DOIs
Publication statusPublished - 2013 Aug 13
Event18th International Conference on Implementation and Application of Automata, CIAA 2013 - Halifax, NS, Canada
Duration: 2013 Jul 162013 Jul 19

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume7982 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other18th International Conference on Implementation and Application of Automata, CIAA 2013
CountryCanada
CityHalifax, NS
Period13/7/1613/7/19

    Fingerprint

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Han, Y. S., Ko, S. K., & Salomaa, K. (2013). Approximate matching between a context-free grammar and a finite-state automaton. In Implementation and Application of Automata - 18th International Conference, CIAA 2013, Proceedings (pp. 146-157). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7982 LNCS). https://doi.org/10.1007/978-3-642-39274-0_14