We consider the practical NP-complete problem of finding a minimum weight spanning tree with both edge weights and inner nodes weights. We present two polynomial time algorithms ...
Rudolf Fleischer, Qi Ge, Jian Li, Shijun Tian, Hai...
Pawlak recently introduced rough set flow graphs (RSFGs) as a graphical framework for reasoning from data. Each rule is associated with three coefficients, which have been shown t...
Abstract. In his seminal paper [5], Granger presents an analysis which infers linear congruence relations between integer variables. For affine programs without guards, his analys...
We present several new results pertaining to haplotyping. The first set of results concerns the combinatorial problem of reconstructing haplotypes from incomplete and/or imperfect...
Rudi Cilibrasi, Leo van Iersel, Steven Kelk, John ...
Abstract. The haplotype inference (HI) problem is the problem of inferring 2n haplotype pairs from n observed genotype vectors. This is a key problem that arises in studying geneti...