Evidence map›Paper›PMID 38730374›Full record

ArticleBMC bioinformatics2024

CAREx: context-aware read extension of paired-end sequencing data.

Felix Kallenborn, Bertil Schmidt

Abstract read
In one paragraph

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

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

2 citing papers in PubMed.

  1. Anchorage accurately assembles anchor-flanked synthetic long reads.Algorithms for molecular biology : AMB · 2025
    Article
  2. Anchorage Accurately Assembles Anchor-Flanked Synthetic Long Reads.Algorithms in bioinformatics : ... International Workshop, WABI ..., proceedings. WABI (Workshop) · 2024
    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.

Felix KallenbornDepartment of Computer Science, Johannes Gutenberg University Mainz, Mainz, Germany. kallenborn@uni-mainz.de.ORCID https://orcid.org/0000-0003-4516-6357
Bertil SchmidtDepartment of Computer Science, Johannes Gutenberg University Mainz, Mainz, Germany.ORCID https://orcid.org/0000-0003-2597-8331

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

backgroundCommonly used next generation sequencing machines typically produce large amounts of short reads of a few hundred base-pairs in length. However, many downstream applications would generally benefit from longer reads.

resultsWe present CAREx-an algorithm for the generation of pseudo-long reads from paired-end short-read Illumina data based on the concept of repeatedly computing multiple-sequence-alignments to extend a read until its partner is found. Our performance evaluation on both simulated data and real data shows that CAREx is able to connect significantly more read pairs (up to

conclusionCAREx is a new MSA-based algorithm and software for producing pseudo-long reads from paired-end short read data. It outperforms other state-of-the-art programs in terms of (i) percentage of connected read pairs, (ii) reduction of error rates of filled gaps, (iii) runtime, and (iv) downstream analysis using de novo assembly. CAREx is open-source software written in C++ (CPU version) and in CUDA/C++ (GPU version). It is licensed under GPLv3 and can be downloaded at ( https://github.com/fkallen/CAREx ).

Indexed as

AlgorithmsHigh-Throughput Nucleotide SequencingSoftwareHumansSequence AlignmentSequence Analysis, DNAGPUNext-generation sequencingPseudo-long reads

Identifiers

PMID38730374
PMCPMC11088031

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.