The following pages link to A Fast Merging Algorithm (Q4178502):
Displaying 17 items.
- Unimodal regression via prefix isotonic regression (Q152633) (← links)
- Fast algorithm for partial covers in words (Q493243) (← links)
- New algorithms for the LCS problem (Q1072704) (← links)
- Improving the worst-case performance of the Hunt-Szymanski strategy for the longest common subsequence of two strings (Q1085982) (← links)
- The longest common subsequence problem revisited (Q1098310) (← links)
- On a stable minimum storage merging algorithm (Q1149257) (← links)
- On the optimality of tape merge of two lists with similar size (Q2182103) (← links)
- Longest common substrings with \(k\) mismatches (Q2345877) (← links)
- Weighted \(L_{\infty}\) isotonic regression (Q2409576) (← links)
- Algorithms for extracting motifs from biological weighted sequences (Q2457295) (← links)
- Efficient unbalanced merge-sort (Q2489231) (← links)
- Longest repeats with a block of \(k\) don't cares (Q2508981) (← links)
- Space-Efficient Frameworks for Top- <i>k</i> String Retrieval (Q3189644) (← links)
- Linear-Time Algorithm for Long LCF with k Mismatches (Q5140788) (← links)
- Algorithmic Framework for Approximate Matching Under Bounded Edits with Applications to Sequence Analysis (Q5881357) (← links)
- A Faster Subquadratic Algorithm for the Longest Common Increasing Subsequence Problem (Q6065393) (← links)
- Maximal closed substrings (Q6166967) (← links)