Open AccessA nearest-neighboring-end algorithm for genetic mapping
Author(s) -
Charles F. Crane
Publication year - 2004
Publication title -
computer applications in the biosciences
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 3.599
H-Index - 390
eISSN - 1460-2059
pISSN - 0266-7061
DOI - 10.1093/bioinformatics/bti164
Subject(s) - computer science , k nearest neighbors algorithm , algorithm , genetic algorithm , artificial intelligence , machine learning
High-throughput methods are beginning to make possible the genotyping of thousands of loci in thousands of individuals, which could be useful for tightly associating phenotypes to candidate loci. Current mapping algorithms cannot handle so many data without building hierarchies of framework maps.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom