The Longest Common Subsequence Problem A Finite Automata Approach
From MaRDI portal
Publication:3559786
DOI10.1007/3-540-45089-0_27zbMath1279.68165OpenAlexW1546804653MaRDI QIDQ3559786
Tomáš Polcar, Bořivoj Melichar
Publication date: 7 May 2010
Published in: Implementation and Application of Automata (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-45089-0_27
Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Algorithms on strings (68W32)
This page was built for publication: The Longest Common Subsequence Problem A Finite Automata Approach
