Biography:Louxin Zhang
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]
Early life
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]
Career
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]
Publications
- Zhang L. 1991. Conjugacy in special monoids. Journal of Algebra 143: 487-497.
- Ma B, Li M, Zhang L. From gene trees to species trees. SIAM Journal on Computing 30:729-752.
- Choi KP, Zeng F, Zhang L. Good spaced seeds for homology search. Bioinformatics 20:1053-1059.
- Li, Guoliang; Steel, Mike; Zhang, Louxin (2008-08-01). "More Taxa Are Not Necessarily Better for the Reconstruction of Ancestral Character States". Systematic Biology 57 (4): 647–653. doi:10.1080/10635150802203898. ISSN 1063-5157. PMID 18709600. https://doi.org/10.1080/10635150802203898.
- Zhang, Louxin (November 2011). "From Gene Trees to Species Trees II: Species Tree Inference by Minimizing Deep Coalescence Events". IEEE/ACM Transactions on Computational Biology and Bioinformatics 8 (6): 1685–1691. doi:10.1109/TCBB.2011.83. ISSN 1557-9964. PMID 21576759. https://ieeexplore.ieee.org/document/5765936.
- Tran, Ngoc Hieu; Choi, Kwok Pui; Zhang, Louxin (2013-08-06). "Counting motifs in the human interactome" (in en). Nature Communications 4 (1): 2241. doi:10.1038/ncomms3241. ISSN 2041-1723. PMID 23917172. Bibcode: 2013NatCo...4.2241T.
- Gambette, Philippe; Gunawan, Andreas D. M.; Labarre, Anthony; Vialette, Stéphane; Zhang, Louxin (2015). "Locating a Tree in a Phylogenetic Network in Quadratic Time". Research in Computational Molecular Biology. Lecture Notes in Computer Science. 9029. pp. 96–107. doi:10.1007/978-3-319-16706-0_12. ISBN 978-3-319-16705-3.
- Zheng, Yu; Zhang, Louxin (2017-08-17). "Reconciliation With Nonbinary Gene Trees Revisited". Journal of the ACM 64 (4): 24:1–24:28. doi:10.1145/3088512. ISSN 0004-5411. https://doi.org/10.1145/3088512.
- Gunawan, Andreas D. M.; DasGupta, Bhaskar; Zhang, Louxin (2017-02-01). "A decomposition theorem and two algorithms for reticulation-visible networks" (in en). Information and Computation 252: 161–175. doi:10.1016/j.ic.2016.11.001. ISSN 0890-5401. https://www.sciencedirect.com/science/article/pii/S0890540116301109.
- Zhang, Louxin; Abhari, Niloufar; Colijn, Caroline; Wu, Yufeng (2023-01-03). "A Fast and Scalable Method for Inferring Phylogenetic Networks from Trees by Aligning Lineage Taxon Strings". arXiv:2301.00992 [q-bio.PE].
References
- ↑ 1.0 1.1 "Louxin Zhang Profile | National University of Singapore". https://discovery.nus.edu.sg/822-louxin-zhang.
- ↑ "Home page". https://blog.nus.edu.sg/louxinzhang/.
- ↑ "WebmedCentral.com :: WMC Plus Editorial Board Member". https://www.webmedcentral.com/plus/editorial_member_details/4335.
- ↑ "新加坡国立大学Louxin Zhang教授学术报告-山大计算机科学与技术学院". https://www.cs.sdu.edu.cn/info/1056/1778.htm.
- ↑ "Lee Kuan Yew Postdoctoral Fellowship" (in en). https://www.nus.edu.sg/research/research-management/funding-opportunities/lee-kuan-yew-postdoctoral-fellowship.
- ↑ Zhang, Louxin (November 1992). "Applying rewriting methods to special monoids" (in en). Mathematical Proceedings of the Cambridge Philosophical Society 112 (3): 495–505. doi:10.1017/S0305004100071176. ISSN 1469-8064. Bibcode: 1992MPCPS.112..495Z. https://www.cambridge.org/core/journals/mathematical-proceedings-of-the-cambridge-philosophical-society/article/abs/applying-rewriting-methods-to-special-monoids/BD174EDC8CE4178E5760879BB5035B63.
- ↑ Zhang, Louxin (1991-11-01). "Conjugacy in special monoids" (in en). Journal of Algebra 143 (2): 487–497. doi:10.1016/0021-8693(91)90275-D. ISSN 0021-8693. https://dx.doi.org/10.1016/0021-8693%2891%2990275-D.
- ↑ Zhang, Louxin (1992-06-01). "On the conjugacy problem for one-relator monoids with elements of finite order". International Journal of Algebra and Computation 02 (2): 209–220. doi:10.1142/S021819679200013X. ISSN 0218-1967. https://www.worldscientific.com/doi/abs/10.1142/S021819679200013X.
- ↑ Gunawan, Andreas D. M.; DasGupta, Bhaskar; Zhang, Louxin (2017-02-01). "A decomposition theorem and two algorithms for reticulation-visible networks" (in en). Information and Computation 252: 161–175. doi:10.1016/j.ic.2016.11.001. ISSN 0890-5401. https://www.sciencedirect.com/science/article/pii/S0890540116301109.
- ↑ Wu, Yufeng; Zhang, Louxin (2022-07-06). "Can Multiple Phylogenetic Trees Be Displayed in a Tree-Child Network Simultaneously?". arXiv:2207.02629 [q-bio.PE].
 |  |
