Linkage identification by non-monotonicity detection for overlapping functions

M Munetomo; D E Goldberg

doi:10.1162/evco.1999.7.4.377

Linkage identification by non-monotonicity detection for overlapping functions

Evol Comput. 1999 Winter;7(4):377-98. doi: 10.1162/evco.1999.7.4.377.

Authors

M Munetomo¹, D E Goldberg

Affiliation

¹ Graduate School of Engineering, Hokkaido University, North 13, West 8, Kita-ku, Sapporo 606-8628, JAPAN. munetomo@eng.hokudai.ac.jp

PMID: 10578028
DOI: 10.1162/evco.1999.7.4.377

Abstract

This paper presents the linkage identification by non-monotonicity detection (LIMD) procedure and its extension for overlapping functions by introducing the tightness detection (TD) procedure. The LIMD identifies linkage groups directly by performing order-2 simultaneous perturbations on a pair of loci to detect monotonicity/non-monotonicity of fitness changes. The LIMD can identify linkage groups with at most order of k when it is applied to O(2(k)) strings. The TD procedure calculates tightness of linkage between a pair of loci based on the linkage groups obtained by the LIMD. By removing loci with weak tightness from linkage groups, correct linkage groups are obtained for overlapping functions, which were considered difficult for linkage identification procedures.

Publication types

Research Support, U.S. Gov't, Non-P.H.S.

MeSH terms

Algorithms*
Computer Simulation
Genetic Linkage*
Models, Genetic*
Models, Statistical
Nonlinear Dynamics
Population Density