Algorithm of OMA for large-scale orthology inference

We lately identified inadvertent errors in our publication [1]. We regret these errors, and offer our sincere apologizes for the confusion and inconvenience. The corrections are described in detail in what follows.In the main text of section "Formation of stable pairs", the formula for stable pair formation is missing a minus sign after the "greater than" symbol. The sentence should read:"Formally, a pair of sequences (x, y) from genomes X and Y is considered a stable pair if and only if, for all xi ∈ X, xi ≠ x, and for all yj ∈ Y, yj ≠ y:andwhere d is a pairwise maximum likelihood distance estimate and k, the tolerance parameter of the standard deviation between the two distances, where ."In the subsection "Ortholog clustering", the example describing the clustering algorithm suggests that our algorithm could find best global maximum edge weight clique partition. This is incorrect, as our current implementation consists of a k-greedy approximation algorithm which is not guaranteed to find the best global maximum edge weight clique. To avoid any confusion, figure Eight has been updated (Fig. 1 here). The figure caption remains unchanged, but the numbers reported in the main text should now read:"Figure 1A shows a graph with edges between all vertices except (z1, z2) and (z1, y2), which are paralogous relations. The highest scoring partition is {w1, x1, z1}, {y2, z2}, with the total sum of edge weights of 4·900 = 3600. The score is higher than the highest scoring maximum size clique {w1, x1, y2, z2}, {z1}, where the sum of the scores is 2·900 + 4·100 = 2200."In section "Results and discussion", figure Ten shows the decrease of the relative number of pairs after each step. The y-axis in the figure was scaled incorrectly. A corrected version is provided here (Fig. 2). The caption remains unchanged.Finally, this correction gives us the opportunity to update a bibliographic reference: since publication of our original manuscript, Reference 33 [2], "in press" then, has be