Repeat-aware comparative genome assembly
| dc.contributor.author | Husemann, Peter | |
| dc.contributor.author | Stoye, Jens | |
| dc.contributor.editor | Schomburg, Dietmar | |
| dc.contributor.editor | Grote, Andreas | |
| dc.date.accessioned | 2019-01-17T10:57:30Z | |
| dc.date.available | 2019-01-17T10:57:30Z | |
| dc.date.issued | 2010 | |
| dc.description.abstract | The 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.identifier.isbn | 978-3-88579-267-3 | |
| dc.identifier.pissn | 1617-5468 | |
| dc.identifier.uri | https://dl.gi.de/handle/20.500.12116/19673 | |
| dc.language.iso | en | |
| dc.publisher | Gesellschaft für Informatik e.V. | |
| dc.relation.ispartof | German Conference on Bioinformatics 2010 | |
| dc.relation.ispartofseries | Lecture Notes in Informatics (LNI) - Proceedings, Volume P-173 | |
| dc.title | Repeat-aware comparative genome assembly | en |
| dc.type | Text/Conference Paper | |
| gi.citation.endPage | 70 | |
| gi.citation.publisherPlace | Bonn | |
| gi.citation.startPage | 61 | |
| gi.conference.date | September 20-22, 2010 | |
| gi.conference.location | Braunschweig | |
| gi.conference.sessiontitle | Regular Research Papers |
Dateien
Originalbündel
1 - 1 von 1