Background According to many field experts, specimens classification based on
morphological keys needs to be supported with automated techniques based on the …

Background Rapid and reliable identification of quarantine pests is essential for plant
inspection services to prevent introduction of invasive species. For insects, this may be a …

Comprehensive evaluation of common genetic variations through association of single-
nucleotide polymorphism (SNP) structure with common complex disease in the genome …

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 …

Contribution/Originality: This study documents a methodology that iteratively uses integer
programming software to efficiently generate solutions that are guaranteed to be very close …

The set k‐covering problem, an extension of the classical set covering problem, is an
important NP‐hard combinatorial optimization problem with extensive applications …

Background Studies on genome-wide associations help to determine the cause of many
genetic diseases. Genome-wide associations typically focus on associations between single …

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 …

Currently, there are lots of methods to select informative SNPs for haplotype reconstruction.
However, there are still some challenges that render them ineffective for large data sets …

The search for the association between complex disease and single nucleotide
polymorphisms (SNPs) or haplotypes has recently received great attention. Finding a set of …