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 likeliho...

Full description

Saved in:
Bibliographic Details
Published in:IEEE/ACM transactions on computational biology and bioinformatics 2005-04, Vol.2 (2), p.102-109
Main Authors: Biyani, P., Xiaolin Wu, Sinha, A.
Format: Article
Language:English
Subjects:
Algorithms
Artificial Intelligence
Biological cells
Cells (biology)
Chromosome classification
Chromosomes, Human - genetics
Chromosomes, Human - ultrastructure
Genetics
Heuristic algorithms
homologue pairing
Humans
Image Interpretation, Computer-Assisted - methods
Imaging, Three-Dimensional - methods
Karyotyping - methods
Likelihood Functions
Linear programming
Maximum likelihood estimation
Neural networks
optimization
Pattern Recognition, Automated - methods
Testing
three-dimensional assignment
Transportation
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:1545-5963
1557-9964
DOI:10.1109/TCBB.2005.26