Logo des Repositoriums
 
Konferenzbeitrag

Syntenic layout of two assemblies of related genomes

Lade...
Vorschaubild

Volltext URI

Dokumententyp

Text/Conference Paper

Zusatzinformation

Datum

2004

Zeitschriftentitel

ISSN der Zeitschrift

Bandtitel

Verlag

Gesellschaft für Informatik e.V.

Zusammenfassung

To 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.

Beschreibung

Delgado Friedrichs, Olaf; Halpern, Aaron L.; Lippert, Ross; Rausch, Christian; Schuster, Stephan C.; Huson, Daniel H. (2004): Syntenic layout of two assemblies of related genomes. German Conference on Bioinformatics 2004, GCB 2004. Bonn: Gesellschaft für Informatik e.V.. PISSN: 1617-5468. ISBN: 3-88579-382-2. pp. 3-12. Regular Research Papers. Bielefeld. October 4-6, 2004

Schlagwörter

Zitierform

DOI

Tags