Joint Classification and Pairing of Human Chromosomes

Authors:
Pravesh Biyani;Xiaolin Wu;Abhijit Sinha
Affiliations:
-;-;-
Venue:
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Year:
2005

Citing 6
Cited 3

An O(EV log V) algorithm for finding a maximal weighted matching in general graphs

SIAM Journal on Computing
Discrete optimization

Discrete optimization
An efficient transportation algorithm for automatic chromosome karyotyping

Pattern Recognition Letters
Linear network optimization: algorithms and codes

Linear network optimization: algorithms and codes
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Toward a completely automatic neural-network-based human chromosomeanalysis

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

Chromosome classification based on the band profile similarity along approximate medial axis

Pattern Recognition
Iterative Contextual Recurrent Classification of Chromosomes

Neural Processing Letters
Between a rock and a hard place: the two-to-one assignment problem

WAOA'09 Proceedings of the 7th international conference on Approximation and Online Algorithms

Quantified Score

Hi-index	0.00

Visualization

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.