title: Improvements on a privacy-protection algorithm for DNA sequences with generalization lattices.
abstract: When developing personal DNA databases, there must be an appropriate guarantee of anonymity, which means that the data cannot be related back to individuals. DNA lattice anonymization (DNALA) is a successful method for making personal DNA sequences anonymous. However, it uses time-consuming multiple sequence alignment and a low-accuracy greedy clustering algorithm. Furthermore, DNALA is not an online algorithm, and so it cannot quickly return results when the database is updated. This study improves the DNALA method. Specifically, we replaced the multiple sequence alignment in DNALA with global pairwise sequence alignment to save time, and we designed a hybrid clustering algorithm comprised of a maximum weight matching (MWM)-based algorithm and an online algorithm. The MWM-based algorithm is more accurate than the greedy algorithm in DNALA and has the same time complexity. The online algorithm can process data quickly when the database is updated.
authors.affiliation: School of Computer Science and Technology, Harbin Institute of Technology, Harbin 150001, People's Republic of China. hit6006@126.com
authors.forename: Guang
authors.initials: G
authors.lastname: Li
authors.forename: Yadong
authors.initials: Y
authors.lastname: Wang
authors.forename: Xiaohong
authors.initials: X
authors.lastname: Su
mesh_terms: D000465:Algorithms; D016000:Cluster Analysis; D018907:Privacy; D016415:Sequence Alignment; D017422:Sequence Analysis, DNA