Capacitated clustering problem in computational biology: combinatorial and statistical approach for sibling reconstruction

DOI10.1016/J.COR.2011.04.017MaRDI QIDQ1762010zbMATH OpenOpenAlexFDO

Authors Chun-An Chou, Tanya Y. Berger-Wolf, Mary V. Ashley, Wanpracha A. Chaovalitwongse, Bhaskar Dasgupta

Publication date 15 November 2012

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cor.2011.04.017

zbMATH Keywords

combinatorial optimizationclustering analysiscomputational biologycapacitated clustering problemsibling reconstruction

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) General biostatistics (92B15)

Recommendations

• Haplotyping Problem, A Clustering Approach
• New optimization model and algorithm for sibling reconstruction from genetic markers
• On the scalability of biocomputing algorithms: the case of the maximum clique problem
• Clique-detection models in computational biochemistry and genomics
• scientific article; zbMATH DE number 2149595
• Clustering and classification problems in genetics through U-statistics
• A Generalized Clustering Problem, with Application to DNA Microarrays

Cites work

• A bionomic approach to the capacitated \(p\)-median problem
• A column generation approach to capacitated \(p\)-median problems
• A computational evaluation of a general branch-and-price framework for capacitated network location problems
• A graphical approach to relatedness inference
• A new method for solving capacitated location problems based on a set partitioning approach
• A simulated annealing algorithm for maximum likelihood pedigree reconstruction
• An effective heuristic for large-scale capacitated facility location problems
• Capacitated clustering problems by hybrid simulated annealing and tabu search
• Cliques and clustering: A combinatorial approach
• Cluster analysis and mathematical programming
• Clustering search algorithm for the capacitated centered clustering problem
• Density based problem space search for the capacitated clustering \(p\)-median problem
• Greedy random adaptive memory programming search for the capacitated clustering problem
• Greedy randomized adaptive search procedures
• New optimization model and algorithm for sibling reconstruction from genetic markers
• Partition-distance: A problem and class of perfect graphs arising in clustering
• Set covering approach for reconstruction of sibling relationships
• Solving capacitated clustering problems
• Tabu Search—Part I
• Tabu Search—Part II
• The capacitated centred clustering problem
• The noising method: A new method for combinatorial optimization

Cited in

(5)

• New optimization model and algorithm for sibling reconstruction from genetic markers
• Discrete facility location in machine learning
• Model-based capacitated clustering with posterior regularization
• Set covering approach for reconstruction of sibling relationships
• Column-generation framework of nonlinear similarity model for reconstructing sibling groups

This page was built for publication: Capacitated clustering problem in computational biology: combinatorial and statistical approach for sibling reconstruction

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1762010)