A New Efficient Algorithm for Computing the Longest Common Subsequence

DOI10.1007/978-3-540-72870-2_8MaRDI QIDQ5434425zbMATH OpenOpenAlexFDO

Authors M. Sohel Rahman, Costas S. Iliopoulos

Publication date 4 January 2008

Published in Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-72870-2_8

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Combinatorics on words (68R15)

Recommendations

• A new efficient algorithm for computing the longest common subsequence
• A new practical linear space algorithm for the longest common subsequence problem
• New efficient algorithms for the LCS and constrained LCS problems
• The longest common subsequence problem -- a finite automata approach
• Publication:4862293

Cited in

(22)

• Faster Algorithms for Computing Longest Common Increasing Subsequences
• A new efficient algorithm for computing the longest common subsequence
• Efficient Longest Common Subsequence Computation Using Bulk-Synchronous Parallelism
• New efficient algorithms for the LCS and constrained LCS problems
• A Scalable Approximation Algorithm for Weighted Longest Common Subsequence
• A new practical linear space algorithm for the longest common subsequence problem
• An efficient systolic algorithm for the longest common subsequence problem
• A fast and simple algorithm for computing the longest common subsequence of run-length encoded strings
• On the generalized constrained longest common subsequence problems
• Computing the longest common subsequence of two run-length encoded strings
• scientific article; zbMATH DE number 5545474 (Why is no real title available?)
• New tabulation and sparse dynamic programming based techniques for sequence similarity problems
• Efficient algorithms for the longest common subsequence problem with sequential substring constraints
• Efficient algorithms for the longest common subsequence in \(k\)-length substrings
• An efficient algorithm for LCS problem between two arbitrary sequences
• Fast computation of a longest increasing subsequence and application
• Computing the Longest Common Transposition-Invariant Subsequence with GPU
• The longest common subsequence problem -- a finite automata approach
• Efficient merged longest common subsequence algorithms for similar sequences
• FACC: a novel finite automaton based on cloud computing for the multiple longest common subsequences search
• On finding a longest common palindromic subsequence
• A learning algorithm for the longest common subsequence problem

This page was built for publication: A New Efficient Algorithm for Computing the Longest Common Subsequence

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5434425)