Pages that link to "Item:Q1288529"

The following pages link to Matching for run-length encoded strings (Q1288529):

Displaying 21 items.

• LCS\(k\): a refined similarity measure (Q294924) (← links)
• A multiobjective optimization algorithm for the weighted LCS (Q313763) (← links)
• Straight-line programs: a practical test (extended abstract) (Q376125) (← links)
• 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)
• Hardness of comparing two run-length encoded strings (Q990818) (← 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)
• Longest common subsequence between run-length-encoded strings: a new algorithm with improved parallelism (Q2390245) (← links)
• Theoretical lower bound for border length minimization problem (Q2412793) (← links)
• Finding a longest common subsequence between a run-length-encoded string and an uncompressed string (Q2483205) (← links)
• Dynamic RLE-Compressed Edit Distance Tables Under General Weighted Cost Functions (Q3177340) (← links)
• Sequence Alignment Algorithms for Run-Length-Encoded Strings (Q3511343) (← links)
• Approximate Matching for Run-Length Encoded Strings Is 3sum-Hard (Q3637111) (← links)
• R\'enyi entropy and pattern matching for run-length encoded sequences (Q4989421) (← links)
• (Q5092429) (← links)
• Weighted LCS (Q5901140) (← links)