Correction to: Guan et al. BMC Bioinformatics (2021) 22:569 10.1186/s12859-021-04453-5
Following publication of the original article [1], the authors identified an error in Fig. 1. The correct figure is given below.
Fig. 1.
Scaffolding graph and SAT format example. a A scaffolding graph. The graph containing 22 vertices and 9 edges is formed by 11 contigs, each contig is split into two vertices, the text below each hexagon is the contig name. Numbers along with the edges are normalized weights, and the grey edges are removed by the pruning process. b A SAT example. All the contigs are represented as sequences (‘S’) in the SAT file, edges are defined as links and tagged as ‘L’, three scaffolds obtained from a are labelled as paths (‘P’) and three scaffolds are gathered in the assembly set tagged as ‘A’, and current assembly is tagged as ‘C’
The original article [1] has been corrected.
Footnotes
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Contributor Information
Guohua Wang, Email: ghwang@hit.edu.cn.
Yadong Wang, Email: ydwang@hit.edu.cn.
Richard Durbin, Email: rd109@cam.ac.uk.
Reference
- 1.Guan et al. Efficient iterative Hi-C scaffolder based on N-best neighbors. BMC Bioinform. 2021; 22:569. 10.1186/s12859-021-04453-5 [DOI] [PMC free article] [PubMed]