Pages that link to "Item:Q1275339"

The following pages link to An efficient systolic algorithm for the longest common subsequence problem (Q1275339):

Displaying 7 items.

• Improved linear systolic algorithms for substring statistics (Q287010) (← links)
• A faster linear systolic algorithm for recovering a longest common subsequence (Q290200) (← links)
• Parallel comparison of run-length-encoded strings on a linear systolic array (Q867612) (← links)
• A systolic array for the longest common subsequence problem (Q1066678) (← links)
• Systolic-based parallel architecture for the longest common subsequences problem (Q4224389) (← links)
• DERIVING A FAST SYSTOLIC ALGORITHM FOR THE LONGEST COMMON SUBSEQUENCE PROBLEM (Q4532713) (← links)
• Algorithms for the longest common subsequence problem for multiple strings based on geometric maxima (Q4946707) (← links)