Evidence map›Paper›PMID 37641111›Full record

ArticleGenome biology2023

Ariadne: synthetic long read deconvolution using assembly graphs.

Lauren Mak, Dmitry Meleshko, David C Danko, Waris N Barakzai, Salil Maharjan, Natan Belchikov, Iman Hajirasouliha

Abstract read
In one paragraph

Article in Genome biology, 2023. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 5 papers.

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

5 citing papers in PubMed.

  1. Article
  2. Anchorage accurately assembles anchor-flanked synthetic long reads.Algorithms for molecular biology : AMB · 2025
    Article
  3. The Bioinformatic Applications of Hi-C and Linked Reads.Genomics, proteomics & bioinformatics · 2024
    Review
  4. Article
  5. 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

7 authors.

Lauren MakTri-Institutional Computational Biology & Medicine Program, Weill Cornell Medicine of Cornell University, New York, USA. lam4003@med.cornell.edu.
Dmitry MeleshkoTri-Institutional Computational Biology & Medicine Program, Weill Cornell Medicine of Cornell University, New York, USA.
David C DankoTri-Institutional Computational Biology & Medicine Program, Weill Cornell Medicine of Cornell University, New York, USA.
Waris N BarakzaiDepartment of Computer Science, New York University, New York, USA.
Salil MaharjanInstitute for Computational Biomedicine, Department of Physiology and Biophysics, Weill Cornell Medicine of Cornell University, New York, USA.
Natan BelchikovPhysiology, Biophysics & Systems Biology Program, Weill Cornell Medicine of Cornell University, New York, USA.
Iman HajirasoulihaInstitute for Computational Biomedicine, Department of Physiology and Biophysics, Weill Cornell Medicine of Cornell University, New York, USA. imh2003@med.cornell.edu.ORCID http://orcid.org/0000-0002-0600-3371

Funding

Tri-Institutional Training Program in Computational Biology & MedicineT32GM083937 · NIGMS · WEILL MEDICAL COLL OF CORNELL UNIV · PI CHRISTINI, DAVID J. · 2009 to 2018
$3.1M
Improving Metagenomic Analysis with Novel Algorithms and TechnologiesR35GM138152 · NIGMS · WEILL MEDICAL COLL OF CORNELL UNIV · PI Iman Hajirasouliha · 2020 to 2026
$2.5M
NIGMS NIH HHS R35 GM138152NIGMS NIH HHS T32 GM083937
6 · The paper itself

Abstract

Synthetic long read sequencing techniques such as UST's TELL-Seq and Loop Genomics' LoopSeq combine 3[Formula: see text] barcoding with standard short-read sequencing to expand the range of linkage resolution from hundreds to tens of thousands of base-pairs. However, the lack of a 1:1 correspondence between a long fragment and a 3[Formula: see text] unique molecular identifier confounds the assignment of linkage between short reads. We introduce Ariadne, a novel assembly graph-based synthetic long read deconvolution algorithm, that can be used to extract single-species read-clouds from synthetic long read datasets to improve the taxonomic classification and de novo assembly of complex populations, such as metagenomes.

Indexed as

AlgorithmsGenomicsMetagenomeAssembly graphsBarcode deconvolutionMetagenomicsSynthetic long read

Identifiers

PMID37641111
PMCPMC10463629

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.