z-logo
Premium
A comparison of two algorithms, multimap and gene mapping system, for automated construction of genetic linkage maps
Author(s) -
Marinov Marin,
Matise Tara Cox,
Lathrop G. Mark,
Weeks Daniel E.
Publication year - 1999
Publication title -
genetic epidemiology
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.301
H-Index - 98
eISSN - 1098-2272
pISSN - 0741-0395
DOI - 10.1002/gepi.13701707106
Subject(s) - ambiguity , set (abstract data type) , linkage (software) , algorithm , computer science , contrast (vision) , order (exchange) , gene mapping , data set , genetic algorithm , mathematics , artificial intelligence , gene , biology , genetics , machine learning , chromosome , finance , economics , programming language
Using the GAW11 Problem 2 data set, we compared the performance of two automated map construction algorithms, MultiMap and GMS (Gene Mapping System). The MultiMap algorithm iteratively adds markers in a stepwise manner to the map, while the GMS algorithm seeks to find the best order of the whole set of markers by selective permutations of logically formed subgroups of the markers. While it is difficult to compare these two rather different algorithms, we found that, on these data, GMS performed better than MultiMap, placing more markers in their true order on average, with little order ambiguity. In addition, as the number of markers increased, GMS was less computationally demanding than MultiMap. However, if MultiMap placed a marker, it was almost always in the correct order. In contrast, GMS often placed a group of markers on the wrong end of the map; such incorrect placements occur when the evidence for placement on one end or the other is not strong. Thus, there is room for further algorithmic developments that combine the strengths of both the MultiMap and GMS approaches.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here