A Fast Merging Algorithm
From MaRDI portal
Publication:4178502
DOI10.1145/322123.322127zbMath0395.68055OpenAlexW2065209187MaRDI QIDQ4178502
Mark R. Brown, Robert Endre Tarjan
Publication date: 1979
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/322123.322127
Related Items (17)
Algorithmic Framework for Approximate Matching Under Bounded Edits with Applications to Sequence Analysis ⋮ Improving the worst-case performance of the Hunt-Szymanski strategy for the longest common subsequence of two strings ⋮ The longest common subsequence problem revisited ⋮ Space-Efficient Frameworks for Top- k String Retrieval ⋮ Weighted \(L_{\infty}\) isotonic regression ⋮ On the optimality of tape merge of two lists with similar size ⋮ Maximal closed substrings ⋮ On a stable minimum storage merging algorithm ⋮ Algorithms for extracting motifs from biological weighted sequences ⋮ Fast algorithm for partial covers in words ⋮ A Faster Subquadratic Algorithm for the Longest Common Increasing Subsequence Problem ⋮ Efficient unbalanced merge-sort ⋮ Longest repeats with a block of \(k\) don't cares ⋮ Unimodal regression via prefix isotonic regression ⋮ Longest common substrings with \(k\) mismatches ⋮ Linear-Time Algorithm for Long LCF with k Mismatches ⋮ New algorithms for the LCS problem
This page was built for publication: A Fast Merging Algorithm
