Pages that link to "Item:Q1291016"

The following pages link to Time-efficient parallel algorithms for the longest common subsequence and related problems (Q1291016):

Displaying 8 items.

• Novel evolutionary models and applications to sequence alignment problems (Q863608) (← links)
• Finding least-weight subsequences with fewer processors (Q2366242) (← links)
• A coarse-grained parallel algorithm for the all-substrings longest common subsequence problem (Q2502283) (← links)
• APPLICATION OF BROADCASTING WITH SELECTIVE REDUCTION TO THE MAXIMAL SUM SUBSEGMENT PROBLEM (Q3991015) (← links)
• Systolic-based parallel architecture for the longest common subsequences problem (Q4224389) (← links)
• OpenMP Implementation of Parallel Longest Common Subsequence Algorithm for Mathematical Expression Retrieval (Q5087088) (← links)
• Mining Bit-Parallel LCS-length Algorithms (Q5150933) (← links)
• Computing the Longest Common Transposition-Invariant Subsequence with GPU (Q5188713) (← links)