An efficient algorithm for LCS problem between two arbitrary sequences

DOI10.1155/2018/4158071zbMath1427.68375OpenAlexW2903386140MaRDI QIDQ1720875

Yubo Li

Publication date: 8 February 2019

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2018/4158071

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Algorithms on strings (68W32)

Cites Work

• Unnamed Item
• New tabulation and sparse dynamic programming based techniques for sequence similarity problems
• The longest common subsequence problem revisited
• A faster algorithm computing string edit distances
• A longest common subsequence algorithm suitable for similar text strings
• The early history of the factorial function
• The central limit theorem around 1935. With comments, and a rejoinder by the author
• A fast and practical bit-vector algorithm for the longest common subsequence problem
• A bit-string longest-common-subsequence algorithm
• Fast and compact regular expression matching
• A linear space algorithm for computing maximal common subsequences
• Longest common subsequences of two random sequences
• Bounds on the Complexity of the Longest Common Subsequence Problem
• A fast algorithm for computing longest common subsequences
• The Complexity of Some Problems on Subsequences and Supersequences
• Algorithms for the Longest Common Subsequence Problem
• Algorithms on Strings, Trees and Sequences
• Sparse dynamic programming I