scientific article; zbMATH DE number 88968

MaRDI QIDQ4016531zbMATH OpenFDO

Authors Mi Lu

Publication date 16 January 1993

zbMATH Keywords

longest common subsequence

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Distributed algorithms (68W15)

Recommendations

• scientific article; zbMATH DE number 278833
• The longest common subsequence problem -- a finite automata approach
• Efficient Longest Common Subsequence Computation Using Bulk-Synchronous Parallelism
• A new efficient algorithm for computing the longest common subsequence
• A coarse-grained parallel algorithm for the all-substrings longest common subsequence problem

Cited in

(13)

• Time-efficient parallel algorithms for the longest common subsequence and related problems
• Coloring permutation graphs in parallel
• A coarse-grained parallel algorithm for the all-substrings longest common subsequence problem
• The longest common subsequence problem -- a finite automata approach
• Efficient parallel string comparison
• Efficient Longest Common Subsequence Computation Using Bulk-Synchronous Parallelism
• Systolic-based parallel architecture for the longest common subsequences problem
• OpenMP implementation of parallel longest common subsequence algorithm for mathematical expression retrieval
• Mining Bit-Parallel LCS-length Algorithms
• Computing the Longest Common Transposition-Invariant Subsequence with GPU
• scientific article; zbMATH DE number 278833 (Why is no real title available?)
• Parallel application of Levenshtein distance to establish similarity between strings
• Parallel comparison of run-length-encoded strings on a linear systolic array

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 Q4016531)