This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Joint Classification and Pairing of Human Chromosomes
April-June 2005 (vol. 2 no. 2)
pp. 102-109

Abstract—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] D.P. Bertsekas, Linear Network Optimization: Algorithm and Codes. Cambridge, Mass.: MIT Press, 1991.
[2] A. Carothers and J. Piper, “Computer-Aided Classificatin of Human Chromosomes: A Review,” Statistics and Computing, vol. 4, pp. 161-171, 1994.
[3] Z. Galil, S. Micali, and H. Gabow, “An O(EV log V) Algorithm for Finding a Maximal Weighted Matching in General Graphs,” SIAM J. Computing, vol. 15, no. 1, pp. 120-130, 1986.
[4] M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. San Francisco: Freeman, 1979.
[5] R. Ledley, P.S. Ing, and H.A. Lubs, “Human Chromosome Classification Using Discriminant Analyses and Bayesian Probability,” Computational Biol. Med., vol. 10, pp. 209-219, 1980.
[6] B. Lerner, “Towards a Completely Automatic Neural Network Based Human Chromosome Analysis,” IEEE Trans. Systems, Man, and Cybernatics, special issue on artificial neural networks, vol. 28, pp. 544-552, 1998.
[7] G. Parker and R.L. Rard, Discrete Optimization. Academic Press, 1988.
[8] K.R. Pattipati, S. Deb, Y. Bar-Shalom, and B.R. Washburn, “A New Relaxation Algorithm and Passive Sensor Data Association Problem,” IEEE Trans. Automatic Control, vol. 37, pp. 198-213, 1992.
[9] B.T. Poljak, Subgradient Method: A Survey of Soviet Research. London: Pergamon, 1978.
[10] A. Sinha and T. Kirubarajan, “A Randomized Heuristic Approach for Multidimensional Association in Target Tracking,” Proc. SPIE, Signal and Data Processing of Small Targets, Apr. 2004.
[11] R.J. Stanley, J.M. Keller, P. Gader, and C.W. Caldwell, “Data-Driven Homologue Matching for Chromosome Identification,” IEEE Trans. Medical Imaging, vol. 17, no. 3, pp. 452-462, 1998.
[12] W.P. Sweeney Jr., M.T. Musavi, and J.N. Guidi, “Classification of Chromosomes Using a Probabilistic Neural Network,” Cytometry, vol. 16, pp. 17-24, May 1994.
[13] M. Tso, P. Kleinschmidt, I. Mitterreiter, and J. Graham, “An Efficient Transportation Algorithm for Automatic Chromosome Karyotyping,” Pattern Recognition Letters, vol. 12, pp. 117-126, 1991.
[14] X. Wu, P. Biyani, S. Dumitrescu, and Q. Wu, “Optimal Classification of Human Chromosomes,” Proc. IEEE Eng. Med. Biol. Conf. '04, 2004.
[15] Q. Wu, Z. Liu, Z. Xiong, Y. Wang, T. Chen, and K.R. Castleman, “On Optimal Subspaces for Appearance-Based Object Recognition,” Proc. IEEE Int'l Conf. Image Processing '02, 2002.
[16] S. Zimmerman, D. Johnston, F. Arright, and M.E. Rupp, “Automated Homologue Matching of Human G-Banded Chromosomes,” Computational Biological Medicine, vol. 16, no. 3, pp. 223-233, 1986.

Index Terms:
Chromosome classification, homologue pairing, maximum likelihood estimation, three-dimensional assignment, optimization.
Citation:
Pravesh Biyani, Xiaolin Wu, Abhijit Sinha, "Joint Classification and Pairing of Human Chromosomes," IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol. 2, no. 2, pp. 102-109, April-June 2005, doi:10.1109/TCBB.2005.26
Usage of this product signifies your acceptance of the Terms of Use.