Algorithms for a location database

Abstract
The algorithms that drive the Idb location database are described. The program captures data on genetic and physical maps and combines information from different sources into a summary map. To assure portability it was developed in Fortran on a SUN SPARCStation under Unix. The algorithms, which combine rule‐based seriation with a minimum deviance bootstrap, allow investigators and chromosome committees to produce a composite location in Mb that integrates partial maps. The program and manual are now available from the authors.

This publication has 13 references indexed in Scilit: