EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Decomposing mosaic tandem repeats accurately from long reads

Bansho Masutani iD, Riki Kawahara, Shinichi Morishita iD

Bioinformatics · 03.04.2023 · 39 (4)

DOI: 10.1093/bioinformatics/btad185 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Bioinformatics, online erschienen am 11.04.2023. Verfasst von Bansho Masutani und 2 weiteren Autor:innen. Beteiligte Einrichtung: Department of Computational Biology and Medical Sciences, Graduate School of Frontier Sciences, The University of Tokyo, Chiba 277-8562, Japan. Hauptthemen laut MEDLINE: Tandem Repeat Sequences, Software. Die Arbeit wurde bisher 15-mal zitiert (Crossref) und nennt 32 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Japan Agency for Medical Research and Development.

AbstractSchlagwörterBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Motivation Over the past 30 years, extended tandem repeats (TRs) have been correlated with ∼60 diseases with high odds ratios, and most known TRs consist of single repeat units. However, in the last few years, mosaic TRs composed of different units have been found to be associated with several brain disorders by long-read sequencing techniques. Mosaic TRs are difficult-to-characterize sequence configurations that are usually confirmed by manual inspection. Widely used tools are not designed to solve the mosaic TR problem and often fail to properly decompose mosaic TRs. Results We propose an efficient algorithm that can decompose mosaic TRs in the input string with high sensitivity. Using synthetic benchmark data, we demonstrate that our program named uTR outperforms TRF and RepeatMasker in terms of prediction accuracy, this is especially true when mosaic TRs are more complex, and uTR is faster than TRF and RepeatMasker in most cases. Availability and implementation The software program uTR that implements the proposed algorithm is available at https://github.com/morisUtokyo/uTR.

Schlagwörter

MeSH-Schlagwörter (MEDLINE)

Tandem Repeat SequencesSoftwareSequence Analysis, DNAAlgorithmsHigh-Throughput Nucleotide Sequencing

Autor:innen und Institutionen

  • Department of Computational Biology and Medical Sciences, Graduate School of Frontier Sciences, The University of Tokyo, Chiba 277-8562, Japan.

ORCID-Profile: Bansho Masutani, Shinichi Morishita

Förderung

  • Japan Agency for Medical Research and Development

Zitieren

APA

Masutani, B., Kawahara, R., & Morishita, S. (2023). Decomposing mosaic tandem repeats accurately from long reads. Bioinformatics, 39(4). https://doi.org/10.1093/bioinformatics/btad185

Vancouver

Masutani B, Kawahara R, Morishita S. Decomposing mosaic tandem repeats accurately from long reads. Bioinformatics. 2023;39(4). doi:10.1093/bioinformatics/btad185

BibTeX
@article{Masutani2023,
  author = {Masutani, Bansho and Kawahara, Riki and Morishita, Shinichi},
  title = {Decomposing mosaic tandem repeats accurately from long reads},
  journal = {Bioinformatics},
  year = {2023},
  volume = {39},
  number = {4},
  doi = {10.1093/bioinformatics/btad185}
}
Kostenlos starten →