This article may have been created or edited in return for undisclosed payments, a violation of Wikipedia's terms of use. It may require cleanup to comply with Wikipedia's content policies, particularly neutral point of view. (January 2024) |
Louxin Zhang | |
---|---|
Academic background | |
Education | Lanzhou University University of Waterloo |
Academic work | |
Discipline | Applied mathematics Computational biology |
Institutions | National University of Singapore |
Website | https://discovery.nus.edu.sg/822-louxin-zhang |
Louxin Zhang is a Canadian computational biologist. He is currently a professor in the Department of Mathematics at the National University of Singapore. [1] He is recognized for his contributions to combinatorial semigroup theory in mathematics. In addition,he is recognized for his work on the mathematical understanding of phylogenetic trees and networks,as well as the analysis of spaced seeds for sequence comparison in bioinformatics. [2]
Louxin Zhang grew up in Luoyang,Henan,China. He graduated from Lanzhou University with an undergraduate degree in mathematics and a master's degree in mathematics. Then he proceeded to Canada to pursue a doctorate in computer science at the University of Waterloo,where he earned his Ph.D. in Computer Science with a thesis entitled "Emulations and Embeddings of Meshes of Trees and Hypercubes of Cliques. [1] [3] [4]
After postdoctoral research in the laboratory of Ming Li,Zhang began his independent research career in 1996 at the Institute of Systems Sciences (currently the Institute for Infocomm Research),where he was awarded a three-year Lee Kuan Yew Postdoctoral Fellowship in 1997. [5] He introduced the string rewriting technique to investigate the word problem and the conjugacy problem in special monoids. [6] [7] [8] He discovered an elegant relationship between gene loss,gene duplication,and incomplete lineage sorting costs. Along with his colleagues,he developed the tree component decomposition method for studying phylogenetic networks. [9] The technique yields a solution to an open problem regarding tree containment,the exact and asymptotic counting of the so-called tree-child networks,and a scalable method for inferring the minimum phylogeny. He also contributed to the theoretical knowledge of spaced seeds for sequence comparison and reconstruction of ancestral genome sequences. [10]