Efficient parallel string comparison

MaRDI QIDQ3601062zbMATH OpenFDO

Authors Peter Krusche, Alexander Tiskin

Publication date 9 February 2009

zbMATH Keywords

longest common subsequence

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Recommendations

• A coarse-grained parallel algorithm for the all-substrings longest common subsequence problem
• scientific article; zbMATH DE number 88968
• scientific article; zbMATH DE number 278833
• A Scalable Approximation Algorithm for Weighted Longest Common Subsequence
• Mining Bit-Parallel LCS-length Algorithms

Cited in

(7)

• Testing string superprimitivity in parallel
• Efficient Longest Common Subsequence Computation Using Bulk-Synchronous Parallelism
• A Scalable Approximation Algorithm for Weighted Longest Common Subsequence
• Parallel String Matching
• On almost Monge all scores matrices
• Fast distance multiplication of unit-Monge matrices
• Efficient Concurrent Covert Computation of String Equality and Set Intersection

This page was built for publication: Efficient parallel string comparison

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