Evidence map›Paper›PMID 29179672›Full record

ArticleBMC bioinformatics2017

An efficient error correction algorithm using FM-index.

Yao-Ting Huang, Yu-Wen Huang

Abstract read
In one paragraph

Article in BMC bioinformatics, 2017. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 1 paper.

0numbers the graph read from it
0cells of the map it votes in
1citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

1 citing paper in PubMed.

  1. An optimized FM-index library for nucleotide and amino acid search.Algorithms for molecular biology : AMB · 2021
    Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

2 authors.

Yao-Ting HuangDepartment of Computer Science and Information Engineering, National Chuang Cheng University, Chiayi, Taiwan. ythuang@cs.ccu.edu.tw.
Yu-Wen HuangDepartment of Computer Science and Information Engineering, National Chuang Cheng University, Chiayi, Taiwan.

Funding

Ministry of Science and Technology, Taiwan 106-2221-E-194 -056 -MY3
6 · The paper itself

Abstract

backgroundHigh-throughput sequencing offers higher throughput and lower cost for sequencing a genome. However, sequencing errors, including mismatches and indels, may be produced during sequencing. Because, errors may reduce the accuracy of subsequent de novo assembly, error correction is necessary prior to assembly. However, existing correction methods still face trade-offs among correction power, accuracy, and speed.

resultsWe develop a novel overlap-based error correction algorithm using FM-index (called FMOE). FMOE first identifies overlapping reads by aligning a query read simultaneously against multiple reads compressed by FM-index. Subsequently, sequencing errors are corrected by k-mer voting from overlapping reads only. The experimental results indicate that FMOE has highest correction power with comparable accuracy and speed. Our algorithm performs better in long-read than short-read datasets when compared with others. The assembly results indicated different algorithms has its own strength and weakness, whereas FMOE is good for long or good-quality reads.

conclusionsFMOE is freely available at https://github.com/ythuang0522/FMOC .

Indexed as

AlgorithmsAnimalsBacteriaBase SequenceCaenorhabditis elegansGenomeHigh-Throughput Nucleotide SequencingSequence AlignmentTime FactorsFM-indexNext-generation sequencing

Identifiers

PMID29179672
PMCPMC5704532

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.