Intelligent splitting in the chromosome domain
Pattern Recognition
Introduction to parallel computing: design and analysis of algorithms
Introduction to parallel computing: design and analysis of algorithms
Machine vision
Parallel path planning on the distributed array processor
Parallel Computing
Efficient Algorithms for Shortest Paths in Sparse Networks
Journal of the ACM (JACM)
Digital Picture Processing
Recovery and visualization of 3D structure of chromosomes from tomographic reconstruction images
EURASIP Journal on Applied Signal Processing
| Hi-index | 0.00 |
The grid graph shortest path problem has many applications. In thispaper, we present practical mesh algorithms using a local cost-reducingoperation for various forms of the grid graph shortest path problem. Thealgorithms are very simple and can easily mark the vertices on shortestpaths between any two vertices. The time complexity of the algorithm isproportional to the maximum length of the shortest paths with a very smallmultiplicative constant. Also in this paper, we discuss the application ofthe parallel algorithms in automatic chromosome analysis to intelligentlysplit touching chromosomes. We identify local features useful for finding apotential path to separate touching chromosomes. We then define a distancemeasure based on the local features and find the best splitting path to cuttouching chromosomes. The splitting algorithm only uses local informationand is highly parallel.