Joint classification and pairing of human chromosomes

We reexamine the problems of computer-aided classification and pairing of human chromosomes, and propose to jointly optimize the solutions of these two related problems. The combined problem is formulated into one of optimal three-dimensional assignment with an objective function of maximum likelihood. This formulation poses two technical challenges: 1) estimation of the posterior probability that two chromosomes form a pair and the pair belongs to a class and 2) good heuristic algorithms to solve the three-dimensional assignment problem which is NP-hard. We present various techniques to solve these problems. We also generalize our algorithms to cases where the cell data are incomplete as often encountered in practice.

[1]  J. Piper,et al.  Computer-aided classification of human chromosomes: a review , 1994 .

[2]  F. Arrighi,et al.  Automated homologue matching of human G-banded chromosomes. , 1986, Computers in biology and medicine.

[3]  Zixiang Xiong,et al.  On optimal subspaces for appearance-based object recognition , 2002, Proceedings. International Conference on Image Processing.

[4]  W. P. Sweeney,et al.  Classification of chromosomes using a probabilistic neural network. , 1994, Cytometry.

[5]  R S Ledley,et al.  Human chromosome classification using discriminant analysis and Bayesian probability. , 1980, Computers in biology and medicine.

[6]  Y. Bar-Shalom,et al.  A new relaxation algorithm and passive sensor data association , 1992 .

[7]  Jim Graham,et al.  An efficient transportation algorithm for automatic chromosome karyotyping , 1991, Pattern Recognit. Lett..

[8]  Silvio Micali,et al.  Priority queues with variable priority and an O(EV log V) algorithm for finding a maximal weighted matching in general graphs , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[9]  Thiagalingam Kirubarajan,et al.  A randomized heuristic approach for multidimensional association in target tracking , 2004, SPIE Defense + Commercial Sensing.

[10]  Dimitri P. Bertsekas,et al.  Linear network optimization - algorithms and codes , 1991 .

[11]  Boaz Lerner,et al.  Toward a completely automatic neural-network-based human chromosome analysis , 1998, IEEE Trans. Syst. Man Cybern. Part B.

[12]  Qiang Wu,et al.  Globally optimal classification and pairing of human chromosomes , 2004, The 26th Annual International Conference of the IEEE Engineering in Medicine and Biology Society.

[13]  G. Ding.  Discrete optimization , 1977 .

[14]  Neil Genzlinger.  A. and Q , 2006 .

[15]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[16]  Silvio Micali,et al.  Priority queues with variable priority and an O(EV log V) algorithm for finding a maximal weighted matching in general graphs , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).