TY - GEN

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

AU - Han, Yo Sub

AU - Ko, Sang Ki

AU - Salomaa, Kai

PY - 2013

Y1 - 2013

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

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

KW - approximate matching

KW - context-free grammars

KW - edit-distance

KW - finite-state automata

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

U2 - 10.1007/978-3-642-39274-0_14

DO - 10.1007/978-3-642-39274-0_14

M3 - Conference contribution

AN - SCOPUS:84881258883

SN - 9783642392733

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 146

EP - 157

BT - Implementation and Application of Automata - 18th International Conference, CIAA 2013, Proceedings

T2 - 18th International Conference on Implementation and Application of Automata, CIAA 2013

Y2 - 16 July 2013 through 19 July 2013

ER -