Skip Navigation


Bioinformatics Advance Access first published online on April 26, 2007
This version published online on May 4, 2007
Bioinformatics, doi:10.1093/bioinformatics/btm153
This Article
Right arrow Advance Access manuscript (PDF) Freely available
Right arrow All Versions of this Article:
23/13/1573    most recent
btm153v2
btm153v1
Right arrow Comments: Submit a response
Right arrow Alert me when this article is cited
Right arrow Alert me when Comments are posted
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in PubMed
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Richter, D. C.
Right arrow Articles by Huson, D. H.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Richter, D. C.
Right arrow Articles by Huson, D. H.
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The Author (2007). Published by Oxford University Press. All rights reserved. For Permissions, please email: journals.permissions@oxfordjournals.org

OSLay: optimal syntenic layout of unfinished assemblies

Daniel C. Richter 1,*, Stephan C. Schuster 2 and Daniel H. Huson 1

1Center for Bioinformatics (ZBIT), Institute for Computer Science, Tübingen University, 72076 Tübingen, Germany
2Penn State University, Center for Comparative Genomics and Bioinformatics, University Park, PA 16802, USA.

*To whom correspondence should be addressed. Daniel C. Richter, E-mail: drichter{at}informatik.uni-tuebingen.de


  Abstract

Summary: The whole genome shotgun approach to genome sequencing results in a collection of contigs that must be ordered and oriented to facilitate efficient gap-closure. We present a new tool OSLay that uses synteny between matching sequences in a target assembly and a reference assembly to layout the contigs (or scaffolds) in the target assembly. The underlying algorithm is based on maximum weight matching. The tool provides an interactive visualization of the computed layout and the result can be imported into the assembly editing tool Consed to support the design of primer pairs for gap-closure.

Motivation: To enhance efficiency in the gap closure phase of a genome project it is crucial to know which contigs are adjacent in the target genome. Related genome sequences can be used to layout contigs in an assembly.

Availability: OSLay is freely available from: http://www-ab.informatik.uni-tuebingen.de/software/oslay

Associate Editor: Prof. Martin Bishop

Received on January 16, 2007; revised on March 27, 2007; accepted on April 16, 2007

Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?


This article has been cited by other articles:


Home page
 BioinformaticsHome page
A. I. Rissman, B. Mau, B. S. Biehl, A. E. Darling, J. D. Glasner, and N. T. Perna
Reordering contigs of draft genomes using the Mauve Aligner
Bioinformatics, August 15, 2009; 25(16): 2071 - 2073.
[Abstract] [Full Text] [PDF]

Home page
 BioinformaticsHome page
S. Assefa, T. M. Keane, T. D. Otto, C. Newbold, and M. Berriman
ABACAS: algorithm-based automatic contiguation of assembled sequences
Bioinformatics, August 1, 2009; 25(15): 1968 - 1969.
[Abstract] [Full Text] [PDF]

Home page
 Nucleic Acids ResHome page
F. Zhao, F. Zhao, T. Li, and D. A. Bryant
A new pheromone trail-based genetic algorithm for comparative genome assembly
Nucleic Acids Res., June 1, 2008; 36(10): 3455 - 3462.
[Abstract] [Full Text] [PDF]


Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.