Multilocus consensus genetic maps (MCGM): Formulation, algorithms, and results

Authors:
D. I. Mester;Y. I. Ronin;M. A. Korostishevsky;V. L. Pikus;A. E. Glazman;A. B. Korol
Affiliations:
Institute of Evolution, University of Haifa, Haifa 31905, Israel;Institute of Evolution, University of Haifa, Haifa 31905, Israel;Department of Human Genetics and Molecular Medicine, Sackler School of Medicine, Tel Aviv University, Tel Aviv 69978, Israel;Institute of Evolution, University of Haifa, Haifa 31905, Israel;Institute of Evolution, University of Haifa, Haifa 31905, Israel;Institute of Evolution, University of Haifa, Haifa 31905, Israel
Venue:
Computational Biology and Chemistry
Year:
2006

Citing 7
Cited 2

CARTHAGENE: Constructing and Joining Maximum Likelihood Genetic Maps

Proceedings of the 5th International Conference on Intelligent Systems for Molecular Biology
Solution of a Min-Max Vehicle Routing Problem

INFORMS Journal on Computing
Finding Cuts in the TSP (A preliminary report)

Finding Cuts in the TSP (A preliminary report)
A strategy for assembling the maize (Zea mays L.) genome

Bioinformatics
Carhta Gene: multipopulation integrated genetic and radiation hybrid mapping

Bioinformatics
Active guided evolution strategies for large-scale vehicle routing problems with time windows

Computers and Operations Research
Fast and high precision algorithms for optimization in large-scale genomic problems

Computational Biology and Chemistry

Accurate Construction of Consensus Genetic Maps via Integer Linear Programming

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
A fast and scalable clustering-based approach for constructing reliable radiation hybrid maps

Proceedings of the 12th International Workshop on Data Mining in Bioinformatics

Quantified Score

Hi-index	0.00

Visualization

Abstract

In process of creating genetic maps different labs/research groups obtain overlapping parts of the map. Merging these parts into one integrative map is based on looking for maximum shared marker orders among the maps. Really, not all shared markers of such maps have consensus order that obstructs building of the integrative maps. In this paper we propose a new approach to build verified multilocus consensus genetic maps in which shared markers always are integrated in stable consensus order. The approach is based on combined analysis of initial mapping data rather than manipulating with previously constructed maps. We show that more effective and reliable solutions may be obtained based on ''synchronized ordering'' facilitated by cycles of ''re-sampling-ordering-removing unstable markers''. The proposed formulation of consensus genetic mapping can be considered as a version of traveling salesperson problem (TSP) that we refer to as synchronized-TSP. From the viewpoint of optimization, synchronized-TSP belongs to discrete constrained optimization problems. Earlier we developed new powerful and fast guided evolution strategy algorithms for some types of discrete constrained optimization. These algorithms were used here as a basis for solving more challenging problems of consensual marker ordering. ing.