Gesellschaft für Informatik e.V.

Lecture Notes in Informatics


German Conference on Bioinformatics 2004, GCB 2004, October 4-6, 2004, Bielefeld, Germany P-53, 3-12 (2004).

GI, Gesellschaft für Informatik, Bonn
2004


Editors

Robert Giegerich (ed.), Jens Stoye (ed.)


Copyright © GI, Gesellschaft für Informatik, Bonn

Contents

Syntenic layout of two assemblies of related genomes

Olaf Delgado Friedrichs , Aaron L. Halpern , Ross Lippert , Christian Rausch , Stephan C. Schuster and Daniel H. Huson

Abstract


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.


Full Text: PDF

GI, Gesellschaft für Informatik, Bonn
ISBN 3-88579-382-2


Last changed 04.10.2013 18:03:52