Evidence map›Paper›PMID 36781726›Full record

ArticleMethods in molecular biology (Clifton, N.J.)2023

A Guide to Sequencing for Long Repetitive Regions.

Nobuaki Kono

Abstract read
PubMed Publisher
In one paragraph

Article in Methods in molecular biology (Clifton, N.J.), 2023. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.

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

0 citing papers in PubMed.

No citing paper in PubMed yet.

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

1 author.

Nobuaki KonoInstitute for Advanced Biosciences, Keio University, Tsuruoka City, Yamagata, Japan. ciconia@sfc.keio.ac.jp.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

Full-length analysis of genes with highly repetitive sequences is challenging in two respects: assembly algorithm and sequencing accuracy. The de Bruijn graph often used in short-read assembly cannot distinguish adjacent repeat units. On the other hand, the accuracy of long reads is not yet high enough to identify each and every repeat unit. In this chapter, I present an example of a strategy to solve these problems and obtain the full length of long repeats by combining the extraction and assembly of repeat units based on overlap-layout-consensus and scaffolding by long reads.

Indexed as

High-Throughput Nucleotide SequencingRepetitive Sequences, Nucleic AcidAlgorithmsSequence Analysis, DNADe novo sequencingHighly repetitive sequenceNon-model organismOverlap-layout-consensusStructural protein

Identifiers

PMID36781726

What OpenQuestion holds

Textmetadata
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.