BFC: correcting Illumina sequencing errors | Zendy

Heng Li | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

BFC: correcting Illumina sequencing errors

Author(s) -

Heng Li

Publication year - 2015

Publication title -

bioinformatics

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 3.599

H-Index - 390

eISSN - 1367-4811

pISSN - 1367-4803

DOI - 10.1093/bioinformatics/btv290

Subject(s) - computer science , implementation , error detection and correction , greedy algorithm , base (topology) , data mining , algorithm , mathematics , programming language , mathematical analysis

BFC is a free, fast and easy-to-use sequencing error corrector designed for Illumina short reads. It uses a non-greedy algorithm but still maintains a speed comparable to implementations based on greedy methods. In evaluations on real data, BFC appears to correct more errors with fewer overcorrections in comparison to existing tools. It particularly does well in suppressing systematic sequencing errors, which helps to improve the base accuracy of de novo assemblies.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research