A Fast Merging Algorithm
From MaRDI portal
Publication:4178502
DOI10.1145/322123.322127zbMath0395.68055MaRDI 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
Linear-Time Algorithm for Long LCF with k Mismatches, Algorithmic Framework for Approximate Matching Under Bounded Edits with Applications to Sequence Analysis, Maximal closed substrings, A Faster Subquadratic Algorithm for the Longest Common Increasing Subsequence Problem, Unimodal regression via prefix isotonic regression, Fast algorithm for partial covers in words, New algorithms for the LCS problem, Improving the worst-case performance of the Hunt-Szymanski strategy for the longest common subsequence of two strings, The longest common subsequence problem revisited, On a stable minimum storage merging algorithm, On the optimality of tape merge of two lists with similar size, Longest common substrings with \(k\) mismatches, Weighted \(L_{\infty}\) isotonic regression, Algorithms for extracting motifs from biological weighted sequences, Efficient unbalanced merge-sort, Longest repeats with a block of \(k\) don't cares, Space-Efficient Frameworks for Top- k String Retrieval
