Mosaicflye: resolving long mosaic repeats using long reads

Anton Bankevich, Pavel Pevzner

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Scopus citations

Abstract

Although long-read sequencing technologies opened a new era in genome assembly, the problem of resolving unbridged repeats (i.e., repeats that are not spanned by any reads) such as long segmental duplications in the human genome remains largely unsolved, making it a major obstacle towards achieving the goal of complete genome assemblies.

Original languageEnglish (US)
Title of host publicationResearch in Computational Molecular Biology - 24th Annual International Conference, RECOMB 2020, Proceedings
EditorsRussell Schwartz
PublisherSpringer
Pages226-228
Number of pages3
ISBN (Print)9783030452568
DOIs
StatePublished - 2020
Event24th Annual Conference on Research in Computational Molecular Biology, RECOMB 2020 - Padua, Italy
Duration: May 10 2020May 13 2020

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume12074 LNBI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference24th Annual Conference on Research in Computational Molecular Biology, RECOMB 2020
Country/TerritoryItaly
CityPadua
Period5/10/205/13/20

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'Mosaicflye: resolving long mosaic repeats using long reads'. Together they form a unique fingerprint.

Cite this