Evidence map›Paper›PMID 32657390›Full record

ArticleBioinformatics (Oxford, England)2020

The string decomposition problem and its applications to centromere analysis and assembly.

Tatiana Dvorkina, Andrey V Bzikadze, Pavel A Pevzner

Abstract read
In one paragraph

Article in Bioinformatics (Oxford, England), 2020. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 34 papers.

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

34 citing papers in PubMed.

  1. Article
  2. Article
  3. Article
  4. Article
  5. Article
  6. Article
  7. Article
  8. A global view of human centromere variation and evolution.bioRxiv : the preprint server for biology · 2025
    Article
  9. Article
  10. Article
  11. Article
  12. Article
  13. Centromere Landscapes Resolved from Hundreds of Human Genomes.Genomics, proteomics & bioinformatics · 2024
    Article
  14. Article
  15. Article
  16. Article
  17. Review
  18. Article
  19. Article
  20. 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

3 authors.

Tatiana DvorkinaCenter for Algorithmic Biotechnology, Institute of Translational Biomedicine, Saint Petersburg State University, Saint Petersburg 199034, Russia.
Andrey V BzikadzeGraduate Program in Bioinformatics and Systems Biology, University of California, San Diego, CA 92093, USA.
Pavel A PevznerDepartment of Computer Science and Engineering, University of California, San Diego, CA 92093, USA.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

motivationRecent attempts to assemble extra-long tandem repeats (such as centromeres) faced the challenge of translating long error-prone reads from the nucleotide alphabet into the alphabet of repeat units. Human centromeres represent a particularly complex type of high-order repeats (HORs) formed by chromosome-specific monomers. Given a set of all human monomers, translating a read from a centromere into the monomer alphabet is modeled as the String Decomposition Problem. The accurate translation of reads into the monomer alphabet turns the notoriously difficult problem of assembling centromeres from reads (in the nucleotide alphabet) into a more tractable problem of assembling centromeres from translated reads.

resultsWe describe a StringDecomposer (SD) algorithm for solving this problem, benchmark it on the set of long error-prone Oxford Nanopore reads generated by the Telomere-to-Telomere consortium and identify a novel (rare) monomer that extends the set of known X-chromosome specific monomers. Our identification of a novel monomer emphasizes the importance of identification of all (even rare) monomers for future centromere assembly efforts and evolutionary studies. To further analyze novel monomers, we applied SD to the set of recently generated long accurate Pacific Biosciences HiFi reads. This analysis revealed that the set of known human monomers and HORs remains incomplete. SD opens a possibility to generate a complete set of human monomers and HORs for using in the ongoing efforts to generate the complete assembly of the human genome. AVAILABILITY AND IMPLEMENTATION: StringDecomposer is publicly available on https://github.com/ablab/stringdecomposer. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.

Indexed as

CentromereNanoporesAlgorithmsHigh-Throughput Nucleotide SequencingHumansSequence Analysis, DNATandem Repeat Sequences

Identifiers

PMID32657390
PMCPMC7428072

What OpenQuestion holds

Textmetadata
LicenceCC BY-NC
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.