Merge n sorted sequences of different lengths into one output while minimizing reads. Only two sequences can be merged at once. At each step, the two shortest sequences are merged. Formal Definition: Let D=(n₁, ... , n_k) be the set of lengths of sequences to be merged. Take the two shortest sequences, n_i, n_j∈ D, such that n≥ n_i and n≥ n_j ∀ n∈ D. Merge these two sequences. The new set D is D' = (D - (n_i, n_j)) ∪ (n_i+n_j). Repeat until there is only one sequence.