A coarse-grained parallel algorithm for the all-substrings longest common subsequence problem

DOI10.1007/S00453-006-1216-ZMaRDI QIDQ2502283zbMATH OpenOpenAlexFDO

Authors C. E. R. Alves, E. Cáceres, Siang W. Song

Publication date 12 September 2006

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00453-006-1216-z

zbMATH Keywords

Coarse-Grained Multicomputer

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Recommendations

• scientific article; zbMATH DE number 278833
• Time-efficient parallel algorithms for the longest common subsequence and related problems
• scientific article; zbMATH DE number 88968
• Efficient Longest Common Subsequence Computation Using Bulk-Synchronous Parallelism
• Bit-parallel algorithm for the constrained longest common subsequence problem
• Longest common subsequence between run-length-encoded strings: a new algorithm with improved parallelism
• Algorithms for Computing the Longest Parameterized Common Subsequence
• Bit-parallel algorithms for the merged longest common subsequence problem
• scientific article; zbMATH DE number 1617276

Cited in

(6)

• Efficient Longest Common Subsequence Computation Using Bulk-Synchronous Parallelism
• A Scalable Approximation Algorithm for Weighted Longest Common Subsequence
• Efficient parallel string comparison
• An all-substrings common subsequence algorithm
• FACC: a novel finite automaton based on cloud computing for the multiple longest common subsequences search
• scientific article; zbMATH DE number 88968 (Why is no real title available?)

This page was built for publication: A coarse-grained parallel algorithm for the all-substrings longest common subsequence problem

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