INJclust: Iterative neighbor-joining tree clustering framework for inferring population structure

• Main Authors: Tulaya Limpiti, Chainarong Amornbunchornvej, Apichart Intarapanich, Anunchai Assawamakin, Sissades Tongsima
• Other Authors: King Mongkut's Institute of Technology Ladkrabang
• Format: Article
• Published: 2018
• Subjects: Biochemistry, Genetics and Molecular Biology; Mathematics
• Online Access: https://repository.li.mahidol.ac.th/handle/123456789/33228
• Institution: Mahidol University

© 2014 IEEE. Understanding genetic differences among populations is one of the most important issues in population genetics. Genetic variations, e.g., single nucleotide polymorphisms, are used to characterize commonality and difference of individuals from various populations. This paper presents an efficient graph-based clustering framework which operates iteratively on the Neighbor-Joining (NJ) tree called the iNJclust algorithm. The framework uses well-known genetic measurements, namely the allele-sharing distance, the neighbor-joining tree, and the fixation index. The behavior of the fixation index is utilized in the algorithm's stopping criterion. The algorithm provides an estimated number of populations, individual assignments, and relationships between populations as outputs. The clustering result is reported in the form of a binary tree, whose terminal nodes represent the final inferred populations and the tree structure preserves the genetic relationships among them. The clustering performance and the robustness of the proposed algorithm are tested extensively using simulated and real data sets from bovine, sheep, and human populations. The result indicates that the number of populations within each data set is reasonably estimated, the individual assignment is robust, and the structure of the inferred population tree corresponds to the intrinsic relationships among populations within the data.