Triallelic Single Nucleotide Polymorphisms and Genotyping Error in Genetic Epidemiology Studies: MDR1 (ABCB1) G2677/T/A as an Example
C Huebner, I Petermann, BL Browning… - … Biomarkers & Prevention, 2007 - AACR
Accurate measurement of allele frequencies between population groups with differing
sensitivities to disease is fundamental to genetic epidemiology. Genotyping errors can …
sensitivities to disease is fundamental to genetic epidemiology. Genotyping errors can …
[HTML][HTML] A hybrid Lagrangean heuristic with GRASP and path-relinking for set k-covering
The set multicovering or set k-covering problem is an extension of the classical set covering
problem, in which each object is required to be covered at least k times. The problem finds …
problem, in which each object is required to be covered at least k times. The problem finds …
Single nucleotide polymorphism data analysis-state-of-the-art review on this emerging field from a signal processing viewpoint
The basic structural units of the genome are nucleotides. A single nucleotide polymorphism
(SNP) is a mutation at a single nucleotide position. This paper discusses several major …
(SNP) is a mutation at a single nucleotide position. This paper discusses several major …
A novel local search algorithm with configuration checking and scoring mechanism for the set k‐covering problem
The set k‐covering problem, an extension of the classical set covering problem, is an
important NP‐hard combinatorial optimization problem with extensive applications …
important NP‐hard combinatorial optimization problem with extensive applications …
[HTML][HTML] Assessing effectiveness of many-objective evolutionary algorithms for selection of tag SNPs
Background Studies on genome-wide associations help to determine the cause of many
genetic diseases. Genome-wide associations typically focus on associations between single …
genetic diseases. Genome-wide associations typically focus on associations between single …
[HTML][HTML] Snagger: a user-friendly program for incorporating additional information for tagSNP selection
Background There has been considerable effort focused on developing efficient programs
for tagging single-nucleotide polymorphisms (SNPs). Many of these programs do not …
for tagging single-nucleotide polymorphisms (SNPs). Many of these programs do not …
A hybrid of max–min ant system and linear programming for the k-covering problem
S Al-Shihabi - Computers & Operations Research, 2016 - Elsevier
This paper presents a hybrid algorithm of linear programming (LP), max–min ant system,
and local search for solving large instances of the k-covering problem (SC k P). This …
and local search for solving large instances of the k-covering problem (SC k P). This …
A greedier approach for finding tag SNPs
Motivation: Recent studies have shown that a small subset of Single Nucleotide
Polymorphisms (SNPs)(called tag SNPs) is sufficient to capture the haplotype patterns in a …
Polymorphisms (SNPs)(called tag SNPs) is sufficient to capture the haplotype patterns in a …
Multi-objective tag SNPs selection using evolutionary algorithms
Motivation: Integrated analysis of single nucleotide polymorphisms (SNPs) and structure
variations showed that the extent of linkage disequilibrium is common across different types …
variations showed that the extent of linkage disequilibrium is common across different types …
MLQCC: an improved local search algorithm for the set k‐covering problem
The set k‐covering problem (SKCP) is NP‐hard and has important real‐world applications.
In this paper, we propose several improvements over typical algorithms for its solution. First …
In this paper, we propose several improvements over typical algorithms for its solution. First …