License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.WABI.2018.11
URN: urn:nbn:de:0030-drops-93135
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2018/9313/
Go to the corresponding LIPIcs Volume Portal

Walve, Riku ; Rastas, Pasi ; Salmela, Leena

Kermit: Guided Long Read Assembly using Coloured Overlap Graphs

pdf-format:
LIPIcs-WABI-2018-11.pdf (0.4 MB)

Abstract

With long reads getting even longer and cheaper, large scale sequencing projects can be accomplished without short reads at an affordable cost. Due to the high error rates and less mature tools, de novo assembly of long reads is still challenging and often results in a large collection of contigs. Dense linkage maps are collections of markers whose location on the genome is approximately known. Therefore they provide long range information that has the potential to greatly aid in de novo assembly. Previously linkage maps have been used to detect misassemblies and to manually order contigs. However, no fully automated tools exist to incorporate linkage maps in assembly but instead large amounts of manual labour is needed to order the contigs into chromosomes. We formulate the genome assembly problem in the presence of linkage maps and present the first method for guided genome assembly using linkage maps. Our method is based on an additional cleaning step added to the assembly. We show that it can simplify the underlying assembly graph, resulting in more contiguous assemblies and reducing the amount of misassemblies when compared to de novo assembly.

BibTeX - Entry

@InProceedings{walve_et_al:LIPIcs:2018:9313,
  author =	{Riku Walve and Pasi Rastas and Leena Salmela},
  title =	{{Kermit: Guided Long Read Assembly using Coloured Overlap Graphs}},
  booktitle =	{18th International Workshop on Algorithms in  Bioinformatics (WABI 2018)},
  pages =	{11:1--11:11},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-082-8},
  ISSN =	{1868-8969},
  year =	{2018},
  volume =	{113},
  editor =	{Laxmi Parida and Esko Ukkonen},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2018/9313},
  URN =		{urn:nbn:de:0030-drops-93135},
  doi =		{10.4230/LIPIcs.WABI.2018.11},
  annote =	{Keywords: Genome assembly, Linkage maps, Coloured overlap graph}
}

Keywords: Genome assembly, Linkage maps, Coloured overlap graph
Collection: 18th International Workshop on Algorithms in Bioinformatics (WABI 2018)
Issue Date: 2018
Date of publication: 02.08.2018

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI