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

ABSTRACT:

Motivation

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

Results

We describe a StringDecomposer (SD) algorithm for so

SUBMITTER: Dvorkina T 

PROVIDER: S-EPMC7428072 | biostudies-literature | 2020 Jul

REPOSITORIES: biostudies-literature