Corrections
After publication of [1] we became aware that author revisions had not been incorporated into the final published version. The following corrections should be made. A PDF version into which all corrections are incorporated is attached as Additional file 1.
Formatting
Incorrectly formatted descriptions in [1] should be corrected as follows.
-
1.
In the original publication, the images of Figures 1, 3, 5–9 are shuffled. In addition, images of Figures 1, 3, 4, 6–9 contain incorrectly encoded symbols. They should be replaced with Figures (1, 2, 3, 4, 5, 6, 7, 8, 9) presented in this article.
-
2.
All four occurrences of “Yasuda and Miyano Page n of 11” in the main text should be removed.
-
3.
All three occurrences of “O(|E|2 log |V | log |E|)” should read “O(|E|2 log |V | log |E|)”
-
4.
In the Results, both of two “CC(\( \tilde{G} \), E+)” should read “CC(\( \tilde{G} \), E +)”
-
5.
In the Methods, a Q.E.D. symbol “☐(white box)” should be inserted at the end of the following lines:
-
The line just before Lemma 2
-
The line just before Lemma 3
-
The second line from below before “Proof of Theorem 2”, ending with “a Hamiltonian cycle on H.”
-
The line with the sentence “Therefore, C satisfies (6).” in subsection Circular chromosome graph
-
-
6.
In the Background, “BCRABL” should read “BCR-ABL”
-
7.
In the Methods, in the proof of Lemma 1, the expression “c = p 1 e 1 p 2 e 2 . . . e t cp t c +1” should read “ \( c={p}_1{e}_1{p}_2{e}_2.\ .\ .{e}_{t_c}{p}_{t_c+1} \)”
-
8.
In the same proof, just above Lemma 2, the expression “2|V |(n N +n T )+(4|V |+1)P e ∗ ∗ ∗ E S n(e) ≤U(4|V|+1)(|E|+1)” should read “ \( 2\left|V\right|\left({n}_N + {n}_T\right) + \left(4\left|V\right| + 1\right){\displaystyle {\sum}_{e\in {E}_S}n(e)}\ \le U\left(4\left|V\right| + 1\right)\left(\left|E\right|+1\right) \)”
-
9.
In the Methods, in the proof of Lemma 3, the following expressions
$$ {e_i}_{,1}=<-{v}_{i,1}^{-},+{v}_{i,2}^{\ddagger },1,1>\left(2\le\ i\le \left|V\hbox{'}\right|\right), $$$$ {e_i}_{,2} = <-{v}_{i,2}^{-},+{v}_{i,3}^{\ddagger },0,1>\left(2\le\ i\le \left|V\hbox{'}\right|\right). $$should read
$$ {e_i}_{,1} = <-{v}_{i,1}^{-},+{v}_{i,2}^{+},1,1 > \left(2\ \le\ i\ \le\ \left|V\hbox{'}\right|\right), $$$$ {e_i}_{,2}=<-{v}_{i,2}^{-},+{v}_{i,3}^{+},0,1 > \left(2\ \le\ i\ \le\ \left|V\hbox{'}\right|\right). $$ -
10.
In the Methods, in the proof of Lemma 4, in the paragraph that begins with “All of these steps”, the expression “m(C, e) = f(e) + f(ē)(∈E S ).” should read “m(C, e) = f(e) + f(ē) (e∈E S ).” (Insert a white space before “(e∈E S )”.)
-
11.
In the same proof, just before “Therefore, C satisfies (6).”, the expression “w(e,m(C, e))=0(e∈E L ∪E R ).” should read “w(e,m(C, e))=0 (e∈E L ∪E R ).” (Insert a white space before “(e∈E L ∪E R )”.)
Inaccurate descriptions
The following items correct inaccurate descriptions in the original manuscript. We regret any inconvenience that they might have caused.
-
1.
In the Results, in subsection Formulation of the problem, the phrase “its computational complexity was not analyzed” should read “its computational complexity was not intensively analyzed”
-
2.
In the Results, in the first paragraph of subsection Polynomial-time solvable variation, both of two “E L ∪E R ” should read “E”
-
3.
In the Results, in Definition 2, the phrase “if all g∈CC(G, E W ) are good” should read “if all g∈CC(G, E W ) are good and n(e) = 0 for e∈E − E W ”
-
4.
In the Results, in the paragraph just after Definition 2, the expression “E W = {e∈E S |n(e) ≥ 1}∪{e∈E L ∪E R |e is required}” should read “E W = {e∈E |e is required}”
-
5.
In the Results, the last sentence that begins with “Finally, if some” just before Definition 3 should read as follows:
“In addition, if some g∈CC(G, E W ) that are not good still remain, edges e in g are forcibly removed from E W by changing e not required and setting n(e) to 0. Finally, if n(e) > 0 for some e∈E− E W , e is changed to be required and added to E W by confirming its existence, or n(e) is forcibly set to 0.”
-
6.
In the Results, Definition 3 should read “Let G = (V, E ) be a chromosome graph that satisfies WCC with respect to given V W ⊂ V and E W ⊂ E. Then, find a set C of chromosomes on G that minimizes W(C) when (3) is satisfied, each v ∈ V W is at an end of some c∈C, and each e∈E W appears in C.”
-
7.
In the Methods, in the paragraph just above Lemma 4, the sentences “For e∈E S ∪ {e N , e T }, we set l(e) = n(e), l(ē) = 0, and u(ē) = n(e). For e∈E L ∪E R , we set l(e) = 1.” should read “For e∈E S∪{e N , e T }, we set l(e) = n(e), l(ē) = 0, and u(ē) = n(e) if e is not required, whereas l(e) = max{n(e), 1}, l(ē) = 0, and u(ē) = max{n(e) − 1, 0} if e is required. We assume that e N is required because n N ≥1. We also assume that e T is required if |V W | ≥ 1. For e∈E L ∪E R , we set l(e) = 1 if e is required, or l(e) = 0 otherwise.”
-
8.
In the Methods, in the paragraph just after Lemma 4, the description “or n(e) ≥ 1” should be removed.
-
9.
In the Methods, in subsection Proof of Theorem 3, the phrase “by making all edges in E L ∪E R required” should read “by making all edges required”
Reference
Yasuda T, Miyano S. Inferring the global structure of chromosomes from structural variations. BMC Genomics. 2015;16 Suppl 2:13.
Author information
Authors and Affiliations
Corresponding author
Additional information
The online version of the original article can be found under doi:10.1186/1471-2164-16-S2-S13.
Additional file
Additional file 1:
Corrected version. A PDF version of [1] into which all corrections in this article are incorporated.
Rights and permissions
This article is published under an open access license. Please check the 'Copyright Information' section either on this page or in the PDF for details of this license and what re-use is permitted. If your intended use exceeds what is permitted by the license or if you are unable to locate the licence and re-use information, please contact the Rights and Permissions team.
About this article
Cite this article
Yasuda, T., Miyano, S. Erratum to: inferring the global structure of chromosomes from structural variations. BMC Genomics 16, 276 (2015). https://doi.org/10.1186/s12864-015-1338-2
Received:
Accepted:
Published:
DOI: https://doi.org/10.1186/s12864-015-1338-2