CHOISS for selection of single nucleotide polymorphism markers on interval regularity
Author(s) -
Soohyun Lee,
Changwon Kang
Publication year - 2004
Publication title -
bioinformatics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 3.599
H-Index - 390
eISSN - 1367-4811
pISSN - 1367-4803
DOI - 10.1093/bioinformatics/btg458
Subject(s) - single nucleotide polymorphism , selection (genetic algorithm) , interval (graph theory) , genetics , polymorphism (computer science) , biology , confidence interval , computational biology , mathematics , computer science , statistics , combinatorics , genotype , artificial intelligence , gene
We developed algorithms that find a set of single nucleotide polymorphism (SNP) markers based on interval regularity, given either the number of SNPs to choose (m) or the desired interval (I), subject to minimum variance or minimum sum of squared deviations from I. In both cases, the number of all possible sets increases exponentially with respect to the number of input SNPs (n), but our algorithms find the minima only with O(n(2)) calculations and comparisons by elimination of redundancy.
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