Skip Navigation

Bioinformatics 2007 23(2):e50-e56; doi:10.1093/bioinformatics/btl321
This Article
Right arrow Full Text Freely available
Right arrow FREE Full Text (Print PDF) Freely available
Right arrow Alert me when this article is cited
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 Faraut, T.
Right arrow Articles by Schiex, T.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Faraut, T.
Right arrow Articles by Schiex, T.
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

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

Computational Genomics

A comparative genome approach to marker ordering

T. Faraut 1,*,{dagger}, S. de Givry 2,{dagger}, P. Chabrier 2, T. Derrien 3, F. Galibert 3, C. Hitte 3 and T. Schiex 2

1 Laboratoire de génétique cellulaire BP 52627, 31326 Castanet Tolosan, France
2 Laboratoire de mathématiques et informatique appliquées, INRA BP 52627, 31326 Castanet Tolosan, France
3 CNRS UMR6061 Génétique et Développement, Université de Rennes 1 IFR 140, 2 Av du Pr Léon Bernard, CS 34317, 35043 Rennes, France

*To whom correspondence should be addressed.


   Abstract

Motivation: Genome maps are fundamental to the study of an organism and essential in the process of genome sequencing which in turn provides the ultimate map of the genome. The increased number of genomes being sequenced offers new opportunities for the mapping of closely related organisms. We propose here an algorithmic formalization of a genome comparison approach to marker ordering.

Results: In order to integrate a comparative mapping approach in the algorithmic process of map construction and selection, we propose to extend the usual statistical model describing the experimental data, here radiation hybrids (RH) data, in a statistical framework that models additionally the evolutionary relationships between a proposed map and a reference map: an existing map of the corresponding orthologous genes or markers in a closely related organism. This has concretely the effect of exploiting, in the process of map selection, the information of marker adjacencies in the related genome when the information provided by the experimental data is not conclusive for the purpose of ordering. In order to compute efficiently the map, we proceed to a reduction of the maximum likelihood estimation to the Traveling Salesman Problem. Experiments on simulated RH datasets as well as on a real RH dataset from the canine RH project show that maps produced using the likelihood defined by the new model are significantly better than maps built using the traditional RH model.

Availability: The comparative mapping approach is available in the last version of de Givry,S. et al. [(2004) Bioinformatics, 21, 1703–1704, www.inra.fr/mia/T/CarthaGene], a free (the LKH part is free for academic use only) mapping software in C++, including LKH (Helsgaun,K. (2000) Eur. J. Oper. Res., 126, 106–130, www.dat.ruc.dk/keld/research/LKH) for maximum likelihood computation.

Contact: thomas.faraut{at}toulouse.inra.fr

{dagger}The authors wish it to be known that, in their opinion, the first two authors should be regarded as joint First Authors.



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




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.