Zur Kurzanzeige

dc.contributor.authorHusemann, Peter
dc.contributor.authorStoye, Jens
dc.contributor.editorSchomburg, Dietmar
dc.contributor.editorGrote, Andreas
dc.date.accessioned2019-01-17T10:57:30Z
dc.date.available2019-01-17T10:57:30Z
dc.date.issued2010
dc.identifier.isbn978-3-88579-267-3
dc.identifier.issn1617-5468
dc.identifier.urihttp://dl.gi.de/handle/20.500.12116/19673
dc.description.abstractThe current high-throughput sequencing technologies produce gigabytes of data even when prokaryotic genomes are processed. In a subsequent assembly phase, the generated overlapping reads are merged, ideally into one contiguous sequence. Often, however, the assembly results in a set of contigs which need to be stitched together with additional lab work. One of the reasons why the assembly produces several distinct contigs are repetitive elements in the newly sequenced genome. While knowing order and orientation of a set of non-repetitive contigs helps to close the gaps between them, special care has to be taken for repetitive contigs. Here we propose an algorithm that orders a set of contigs with respect to a related reference genome while treating the repetitive contigs in an appropriate way.en
dc.language.isoen
dc.publisherGesellschaft für Informatik e.V.
dc.relation.ispartofGerman Conference on Bioinformatics 2010
dc.relation.ispartofseriesLecture Notes in Informatics (LNI) - Proceedings, Volume P-173
dc.titleRepeat-aware comparative genome assemblyen
dc.typeText/Conference Paper
dc.pubPlaceBonn
mci.reference.pages61-70
mci.conference.sessiontitleRegular Research Papers
mci.conference.locationBraunschweig
mci.conference.dateSeptember 20-22, 2010


Dateien zu dieser Ressource

Thumbnail

Zur Kurzanzeige