Efficient Longest Common Subsequence Computation Using Bulk-Synchronous Parallelism

DOI10.1007/11751649_18MaRDI QIDQ3603043zbMATH OpenOpenAlexFDO

Authors Peter Krusche, Alexander Tiskin

Publication date 12 February 2009

Published in Computational Science and Its Applications - ICCSA 2006 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11751649_18

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Parallel algorithms in computer science (68W10) Algorithms on strings (68W32)

Recommendations

• scientific article; zbMATH DE number 88968
• A New Efficient Algorithm for Computing the Longest Common Subsequence
• Efficient parallel string comparison
• scientific article; zbMATH DE number 278833
• A coarse-grained parallel algorithm for the all-substrings longest common subsequence problem

Cited in

(11)

• FACC: a novel finite automaton based on cloud computing for the multiple longest common subsequences search
• A coarse-grained parallel algorithm for the all-substrings longest common subsequence problem
• scientific article; zbMATH DE number 88968 (Why is no real title available?)
• Systolic-based parallel architecture for the longest common subsequences problem
• scientific article; zbMATH DE number 1984233 (Why is no real title available?)
• 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
• Parallel application of Levenshtein distance to establish similarity between strings
• A Scalable Approximation Algorithm for Weighted Longest Common Subsequence
• Parallel comparison of run-length-encoded strings on a linear systolic array

This page was built for publication: Efficient Longest Common Subsequence Computation Using Bulk-Synchronous Parallelism

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