Evidence map›Paper›PMID 32530974›Full record

ArticlePloS one2020

Minimum error correction-based haplotype assembly: Considerations for long read data.

Sina Majidian, Mohammad Hossein Kahaei, Dick de Ridder

Abstract read
In one paragraph

Article in PloS one, 2020. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 6 papers.

0numbers the graph read from it
0cells of the map it votes in
6citing 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

6 citing papers in PubMed.

  1. Article
  2. Article
  3. Article
  4. Article
  5. flopp: Extremely Fast Long-Read Polyploid Haplotype Phasing by Uniform Tree Partitioning.Journal of computational biology : a journal of computational molecular cell biology · 2022
    Article
  6. Review
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

3 authors.

Sina MajidianSchool of Electrical Engineering, Iran University of Science & Technology, Narmak, Tehran, Iran.ORCID 0000-0001-5345-6982
Mohammad Hossein KahaeiSchool of Electrical Engineering, Iran University of Science & Technology, Narmak, Tehran, Iran.ORCID 0000-0002-1920-659X
Dick de RidderBioinformatics Group, Wageningen University, Wageningen, The Netherlands.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

The single nucleotide polymorphism (SNP) is the most widely studied type of genetic variation. A haplotype is defined as the sequence of alleles at SNP sites on each haploid chromosome. Haplotype information is essential in unravelling the genome-phenotype association. Haplotype assembly is a well-known approach for reconstructing haplotypes, exploiting reads generated by DNA sequencing devices. The Minimum Error Correction (MEC) metric is often used for reconstruction of haplotypes from reads. However, problems with the MEC metric have been reported. Here, we investigate the MEC approach to demonstrate that it may result in incorrectly reconstructed haplotypes for devices that produce error-prone long reads. Specifically, we evaluate this approach for devices developed by Illumina, Pacific BioSciences and Oxford Nanopore Technologies. We show that imprecise haplotypes may be reconstructed with a lower MEC than that of the exact haplotype. The performance of MEC is explored for different coverage levels and error rates of data. Our simulation results reveal that in order to avoid incorrect MEC-based haplotypes, a coverage of 25 is needed for reads generated by Pacific BioSciences RS systems.

Indexed as

Scientific Experimental ErrorData AnalysisElectronic Data ProcessingGenome, HumanHaplotypesHumansPolymorphism, Single NucleotideSequence Analysis, DNA

Identifiers

PMID32530974
PMCPMC7292361

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.