Pages that link to "Item:Q1066678"

The following pages link to A systolic array for the longest common subsequence problem (Q1066678):

Displaying 10 items.

• Improved linear systolic algorithms for substring statistics (Q287010) (← links)
• A faster linear systolic algorithm for recovering a longest common subsequence (Q290200) (← links)
• Generating subsets on a systolic array (Q751858) (← links)
• Computational geometry algorithms for the systolic screen (Q1175650) (← links)
• An efficient systolic algorithm for the longest common subsequence problem (Q1275339) (← links)
• Catastrophic faults in reconfigurable systolic linear arrays (Q1363642) (← links)
• Systolic-based parallel architecture for the longest common subsequences problem (Q4224389) (← links)
• APPLICATION-SPECIFIC ARRAY PROCESSORS FOR THE LONGEST COMMON SUBSEQUENCE PROBLEM OF THREE SEQUENCES ∗ † (Q4240887) (← links)
• DERIVING A FAST SYSTOLIC ALGORITHM FOR THE LONGEST COMMON SUBSEQUENCE PROBLEM (Q4532713) (← links)
• The colored longest common prefix array computed via sequential scans (Q6109741) (← links)