Pages that link to "Item:Q673470"

The following pages link to An improved algorithm for computing the edit distance of run-length coded strings (Q673470):

Displaying 14 items.

• Fast algorithms for computing the constrained LCS of run-length encoded strings (Q428842) (← links)
• Speeding up HMM decoding and training by exploiting sequence repetitions (Q834590) (← links)
• Parallel comparison of run-length-encoded strings on a linear systolic array (Q867612) (← links)
• Computing similarity of run-length encoded strings with affine gap penalty (Q932322) (← links)
• A fast and simple algorithm for computing the longest common subsequence of run-length encoded strings (Q975491) (← links)
• Matching for run-length encoded strings (Q1288529) (← links)
• Edit distance of run-length encoded strings. (Q1853090) (← links)
• Unified compression-based acceleration of edit-distance computation (Q1939664) (← links)
• A fully compressed algorithm for computing the edit distance of run-length encoded strings (Q1939665) (← links)
• Edit distance for a run-length-encoded string and an uncompressed string (Q2380032) (← links)
• Longest common subsequence between run-length-encoded strings: a new algorithm with improved parallelism (Q2390245) (← links)
• Dynamic RLE-Compressed Edit Distance Tables Under General Weighted Cost Functions (Q3177340) (← links)
• Faster STR-EC-LCS Computation (Q3297762) (← links)
• (Q5092429) (← links)