Logo des Repositoriums
 

Syntenic layout of two assemblies of related genomes

Kurzanzeige
dc.contributor.authorDelgado Friedrichs, Olaf
dc.contributor.authorHalpern, Aaron L.
dc.contributor.authorLippert, Ross
dc.contributor.authorRausch, Christian
dc.contributor.authorSchuster, Stephan C.
dc.contributor.authorHuson, Daniel H.
dc.contributor.editorGiegerich, Robert
dc.contributor.editorStoye, Jens
dc.date.accessioned2019-10-11T11:32:38Z
dc.date.available2019-10-11T11:32:38Z
dc.date.issued2004
dc.description.abstractTo facilitate research in comparative genomics, sequencing projects are increasingly aimed at assembling the genomes of closely related organisms. Given two incomplete assemblies of two related genomes, the question arises how to use the similarity of the two sequences to obtain a better ordering and orientation of both assemblies. In this paper, we formalize this question as the Optimal Syntenic Layout problem, show that it is in general NP-hard, but that it can be solved well in practice using an algorithm based on maximal graph matching. We illustrate the problem using different assemblies of two strains of Bdellovibrio bacteriovorus.en
dc.identifier.isbn3-88579-382-2
dc.identifier.pissn1617-5468
dc.identifier.urihttps://dl.gi.de/handle/20.500.12116/28661
dc.language.isoen
dc.publisherGesellschaft für Informatik e.V.
dc.relation.ispartofGerman Conference on Bioinformatics 2004, GCB 2004
dc.relation.ispartofseriesLecture Notes in Informatics (LNI) - Proceedings, Volume P-53
dc.titleSyntenic layout of two assemblies of related genomesen
dc.typeText/Conference Paper
gi.citation.endPage12
gi.citation.publisherPlaceBonn
gi.citation.startPage3
gi.conference.dateOctober 4-6, 2004
gi.conference.locationBielefeld
gi.conference.sessiontitleRegular Research Papers

Dateien

Originalbündel
1 - 1 von 1
Vorschaubild
Name:
GI-Proceedings.53-2.pdf
Größe:
206.62 KB
Format:
Adobe Portable Document Format
Herunterladen

Sammlungen

P053 - GCB 2004 - German Conference on Bioinformatics