A Fast Longest Common Subsequence Algorithm for Similar Strings

DOI10.1007/978-3-642-13089-2_7zbMath1284.68690OpenAlexW1559989935MaRDI QIDQ3564851

Abdullah N. Arslan

Publication date: 26 May 2010

Published in: Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-13089-2_7

zbMATH Keywords

algorithmdynamic programmingstringsuffix arraysuffix treeedit distancelongest common subsequencelowest common ancestorlongest common extension

Mathematics Subject Classification ID

Algorithms on strings (68W32)

This page was built for publication: A Fast Longest Common Subsequence Algorithm for Similar Strings