A Fast Merging Algorithm

DOI10.1145/322123.322127MaRDI QIDQ4178502zbMATH OpenOpenAlexFDO

Authors Mark R. Brown, Robert E. 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

zbMATH Keywords

Linear ListMerging Algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10)

Cited in

(19)

• Algorithmic Framework for Approximate Matching Under Bounded Edits with Applications to Sequence Analysis
• A Faster Subquadratic Algorithm for the Longest Common Increasing Subsequence Problem
• Algorithms for extracting motifs from biological weighted sequences
• Improving the worst-case performance of the Hunt-Szymanski strategy for the longest common subsequence of two strings
• The longest common subsequence problem revisited
• Linear-time algorithm for long LCF with k mismatches
• Maximal closed substrings
• New algorithms for the LCS problem
• Space-efficient frameworks for top-k string retrieval
• Fast and simple sorting using partial information
• Finding maximal closed substrings
• On the optimality of tape merge of two lists with similar size
• Fast algorithm for partial covers in words
• On a stable minimum storage merging algorithm
• Longest repeats with a block of \(k\) don't cares
• Weighted \(L_{\infty}\) isotonic regression
• Longest common substrings with k mismatches
• Efficient unbalanced merge-sort
• Unimodal regression via prefix isotonic regression

This page was built for publication: A Fast Merging Algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4178502)