scientific article; zbMATH DE number 842125

zbMATH Open0841.68051MaRDI QIDQ4862293FDOQ4862293

Authors: Claus Rick 

Publication date: 6 February 1996

Title of this publication is not available (Why is that?)

Recommendations

• A new practical linear space algorithm for the longest common subsequence problem
• The longest common subsequence problem revisited
• New algorithms for the LCS problem
• A new efficient algorithm for computing the longest common subsequence
• An almost-linear time and linear space algorithm for the longest common subsequence problem

zbMATH Keywords

computational biologylongest common subsequencecombinatorial pattern matchingstring processing

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Cited In (24)

• Algorithms for the longest common subsequence problem for multiple strings based on geometric maxima
• A Scalable Approximation Algorithm for Weighted Longest Common Subsequence
• A\textsuperscript{*}-based compilation of relaxed decision diagrams for the longest common subsequence problem
• Dynamic programming algorithms for the mosaic longest common subsequence problem
• A new practical linear space algorithm for the longest common subsequence problem
• An efficient systolic algorithm for the longest common subsequence problem
• Improving the worst-case performance of the Hunt-Szymanski strategy for the longest common subsequence of two strings
• The longest common subsequence problem revisited
• A fast longest common subsequence algorithm for similar strings
• Algorithms for Computing Variants of the Longest Common Subsequence Problem
• Title not available (Why is that?)
• New refinement techniques for longest common subsequence algorithms.
• Title not available (Why is that?)
• Mining Bit-Parallel LCS-length Algorithms
• Simple and fast linear space computation of longest common subsequences
• Performance analysis of some simple heuristics for computing longest common subsequences
• A fast and practical bit-vector algorithm for the longest common subsequence problem
• New algorithms for the LCS problem
• An improved algorithm for the longest common subsequence problem
• Algorithms for computing variants of the longest common subsequence problem
• The longest common subsequence problem -- a finite automata approach
• A New Efficient Algorithm for Computing the Longest Common Subsequence
• FACC: a novel finite automaton based on cloud computing for the multiple longest common subsequences search
• A learning algorithm for the longest common subsequence problem

This page was built for publication:

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