Reference health

FMLRC: Hybrid long read error correction using an FM-index

https://doi.org/10.1186/s12859-018-2051-3
CiteStamped reference-health badge
22/22 checkable references clean · checked 2026-07-22

Every reference with a DOI in the deposited reference list resolved to a known work in Crossref or DataCite at the dated check, and none carried a retraction, withdrawal, or removal notice.

6 without a DOI — not checked. A reference deposited without a DOI is never matched by title or guessed at; it stays outside the checked set, and this line discloses that.

The 22 checked references that resolve
resolves10.1038/nmeth.2474
Nonhybrid, finished microbial genome assemblies from long-read SMRT sequencing data
resolves10.1371/journal.pone.0046679
Improving PacBio Long Read Accuracy by Short Read Alignment
resolves10.1038/nbt.2280
Hybrid error correction and de novo assembly of single-molecule sequencing reads
resolves10.1093/bioinformatics/btu538
LoRDEC: accurate and efficient long read error correction
resolves10.1038/nbt.3238
Assembling large genomes with single-molecule sequencing and locality-sensitive hashing
resolves10.1093/bioinformatics/btw152
Minimap and miniasm: fast mapping and de novo assembly for noisy long sequences
resolves10.1186/1471-2164-15-699
Performance comparison of second- and third-generation sequencers using a bacterial genome with two chromosomes
resolves10.1093/bioinformatics/btw321
Accurate self-correction of errors in long reads using de Bruijn graphs
resolves10.1101/006395
Error correction and assembly complexity of single molecule sequencing reads
resolves10.1186/s13015-016-0075-7
Jabba: hybrid error correction for long sequencing reads
resolves10.1093/bioinformatics/btw463
CoLoRMap: Correcting Long Reads by Mapping short reads
resolves10.1101/gr.191395.115
Oxford Nanopore sequencing, hybrid error correction, and de novo assembly of a eukaryotic genome
resolves10.1007/978-3-642-40453-5_27
Cerulean: A Hybrid Assembly Using High Throughput Short and Long Reads
resolves10.1038/srep31900
DBG2OLC: Efficient Assembly of Large Genomes Using Long Erroneous Reads of the Third Generation Sequencing Technologies
resolves10.1093/bioinformatics/btv688
<scp>hybrid</scp>SPA<scp>des</scp>: an algorithm for hybrid assembly of short and long reads
resolves10.1109/BIBM.2015.7359662
Short read error correction using an FM-index
resolves10.1093/bioinformatics/btu541
Fast construction of FM-index for long sequence reads
resolves10.1186/1471-2105-13-238
Mapping single molecule sequencing reads using basic local alignment with successive refinement (BLASR): application and theory
resolves10.1093/bib/bbs015
A survey of error-correction methods for next-generation sequencing
resolves10.1093/bioinformatics/btt086
QUAST: quality assessment tool for genome assemblies
resolves10.1038/nmeth.3444
A complete bacterial genome assembled de novo using only nanopore sequencing data
resolves10.1038/nrg3117
Repetitive DNA and next-generation sequencing: computational challenges and solutions
The 6 references without a DOI — listed, not checked
no DOI — not checkedBauer MJ, Cox AJ, Rosone G. Lightweight BWT construction for very large string collections In: Giancarlo R, Manzini G, editors. Combinatorial Pattern Matching. CPM 2011. Lecture Notes in Computer Science, vol. 6661. Berlin: Springer: 2011. p. 219–31.
no DOI — not checkedBruijn d. N.A combinatorial problem. Proceedings of the Koninklijke Nederlandse Akademie van Wetenschappen. Series A. 1946; 49(7):758.
no DOI — not checkedFerragina P, Manzini G. An experimental study of an opportunistic index. In: Proceedings of the twelfth annual ACM-SIAM symposium on discrete algorithms (SODA ’01). Philadelphia: Society for Industrial and Applied Mathematics: 2001. p. 269–78.
no DOI — not checkedBurrows M, Wheeler DJ. A block-sorting lossless data compression algorithm. Digital Systems Research Center Research Reports. 1994.
no DOI — not checkedBoucher C, Bowe A, Gagie T, Puglisi SJ, Sadakane K. Variable-order de bruijn graphs. In: Proceedings of the 2015 Data Compression Conference, DCC ’15. Washington: IEEE Computer Society: 2015. p. 383–92.
no DOI — not checkedCazaux B, Lecroq T, Rivals E. In: Kulikov AS, Kuznetsov SO, Pevzner P, (eds).From Indexing Data Structures to de Bruijn Graphs. Cham: Springer; 2014, pp. 89–99.
What this badge says. CiteStamped means the CHECKABLE references of this work were clean at the dated check: each resolved to a known work in a public registry, and none carried a retraction notice at that time. It says nothing about the quality, findings, or importance of the work itself, and nothing about references deposited without a DOI.

checked 2026-07-22 — re-checked daily as this page is visited; titles and statuses come from Crossref and DataCite and are not part of the signed record

view as graph · paper page

Embed this badge

Both snippets point at the live badge image and link back to this page. The badge re-renders from the daily check, so an embed never goes stale by more than a day of visits.

<a href="https://citestamp.com/citestamped/10.1186/s12859-018-2051-3"><img src="https://citestamp.com/citestamped/10.1186/s12859-018-2051-3/badge.svg" alt="CiteStamped reference-health badge" width="460" height="64"></a>
[![CiteStamped reference-health badge](https://citestamp.com/citestamped/10.1186/s12859-018-2051-3/badge.svg)](https://citestamp.com/citestamped/10.1186/s12859-018-2051-3)