Chia-Jung Chang1, Yao-Ting Huang, Kun-Mao Chao
1Department of Computer Science and Information Engineering, National Taiwan University Taipei, Taiwan.
Finding the optimal set of tag Single Nucleotide Polymorphisms (SNPs) is computationally challenging. This study introduces a hybrid algorithm combining branch-and-bound and greedy methods for more efficient and accurate tag SNP selection.
You might also read
Articles linked to this work by shared authors, journal, and citation graph.
Area of Science:
Background:
Purpose of the Study:
Main Methods:
Main Results:
Conclusions: