Borivoj Melichar, Tomás Polcar. The Longest Common Subsequence Problem A Finite Automata Approach. In Oscar H. Ibarra, Zhe Dang, editors, Implementation and Application of Automata, 8th International Conference, CIAA 2003, Santa Barbara, California, USA, July 16-18, 2003, Proceedings. Volume 2759 of Lecture Notes in Computer Science, pages 294-296, Springer, 2003. [doi]
@inproceedings{MelicharP03,
title = {The Longest Common Subsequence Problem A Finite Automata Approach},
author = {Borivoj Melichar and Tomás Polcar},
year = {2003},
url = {http://link.springer.de/link/service/series/0558/bibs/2759/27590294.htm},
tags = {systematic-approach},
researchr = {https://researchr.org/publication/MelicharP03},
cites = {0},
citedby = {0},
pages = {294-296},
booktitle = {Implementation and Application of Automata, 8th International Conference, CIAA 2003, Santa Barbara, California, USA, July 16-18, 2003, Proceedings},
editor = {Oscar H. Ibarra and Zhe Dang},
volume = {2759},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-40561-5},
}