A Faster Haplotyping Algorithm Based on Block Partition, and Greedy Ligation Strategy.
Xiaohui YaoYun XuJiaoyun YangPublished in: ICIC (3) (2011)
Keyphrases
- computational cost
- improved algorithm
- selection algorithm
- detection algorithm
- dynamic programming
- optimal solution
- search space
- learning algorithm
- highly efficient
- search strategy
- times faster
- segmentation algorithm
- np hard
- similarity measure
- computational complexity
- significant improvement
- experimental evaluation
- tree structure
- selection strategy
- preprocessing
- fixed size
- k means
- cost function
- block wise
- worst case
- locally optimal
- greedy algorithms
- globally optimal
- neural network
- greedy strategy
- recognition algorithm
- convergence rate
- greedy algorithm
- binary images
- optimization algorithm
- theoretical analysis
- high accuracy