Louxin Zhang: Difference between revisions

Add links
From Wikipedia, the free encyclopedia
Browse history interactively
← Previous editNext edit →
Content deleted Content added
VisualWikitext
Unreferenced. Sorry. Please don't add again without reliable and published third-party sources. Thanks
Sidboo (talk | contribs)
33 edits
Line 18: Line 18:


* Tran NH, Choi KP, Zhang L. 2013. Counting motifs in the human interactome. Nature Communications 4:2241.<ref>{{Cite journal |last=Tran |first=Ngoc Hieu |last2=Choi |first2=Kwok Pui |last3=Zhang |first3=Louxin |date=2013-08-06 |title=Counting motifs in the human interactome |url=https://www.nature.com/articles/ncomms3241 |journal=Nature Communications |language=en |volume=4 |issue=1 |pages=2241 |doi=10.1038/ncomms3241 |issn=2041-1723}}</ref>
* Tran NH, Choi KP, Zhang L. 2013. Counting motifs in the human interactome. Nature Communications 4:2241.<ref>{{Cite journal |last=Tran |first=Ngoc Hieu |last2=Choi |first2=Kwok Pui |last3=Zhang |first3=Louxin |date=2013-08-06 |title=Counting motifs in the human interactome |url=https://www.nature.com/articles/ncomms3241 |journal=Nature Communications |language=en |volume=4 |issue=1 |pages=2241 |doi=10.1038/ncomms3241 |issn=2041-1723}}</ref>

* Gambette P, Gunawan AD, Labarre A, Vialette S, Zhang L. 2015. Locating a tree in a phylogenetic network in quadratic time. In Proc. 19th Annual International Conference, Warsaw, Poland, April 12-15, 2015.<ref>{{Cite journal |last=Gambette |first=Philippe |last2=Gunawan |first2=Andreas D. M. |last3=Labarre |first3=Anthony |last4=Vialette |first4=Stéphane |last5=Zhang |first5=Louxin |date=2015 |title=Locating a Tree in a Phylogenetic Network in Quadratic Time |url=http://arxiv.org/abs/1502.03379 |journal=arXiv:1502.03379 [cs, q-bio] |volume=9029 |pages=96–107 |doi=10.1007/978-3-319-16706-0_12}}</ref>


==References==
==References==

Revision as of 10:01, 30 April 2023


Louxin Zhang is a Canadian computational biologist and applied mathematician of Chinese descent who 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.[3][4][5]

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.[6] He developed the confluent string rewriting technique to investigate the word problem and the conjugacy problem in special monoids.[7][8][9] 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.[10] 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.[11]

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 G, Steel M, Zhang L. More taxa are not necessarily better for the reconstruction of ancestral character states. Systematic Biology 57:647-653.[12]
  • Zhang L. 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:1685-1691.[13]
  • Tran NH, Choi KP, Zhang L. 2013. Counting motifs in the human interactome. Nature Communications 4:2241.[14]
  • Gambette P, Gunawan AD, Labarre A, Vialette S, Zhang L. 2015. Locating a tree in a phylogenetic network in quadratic time. In Proc. 19th Annual International Conference, Warsaw, Poland, April 12-15, 2015.[15]

References

  1. ^ discovery.nus.edu.sg https://discovery.nus.edu.sg/822-louxin-zhang. Retrieved 2023-04-06. {{cite web}}: Missing or empty |title= (help)
  2. ^ blog.nus.edu.sg https://blog.nus.edu.sg/louxinzhang/. Retrieved 2023-04-06. {{cite web}}: Missing or empty |title= (help)
  3. ^ discovery.nus.edu.sg https://discovery.nus.edu.sg/822-louxin-zhang. Retrieved 2023-04-06. {{cite web}}: Missing or empty |title= (help)
  4. ^ "WebmedCentral.com :: WMC Plus Editorial Board Member". www.webmedcentral.com. Retrieved 2023-04-06.
  5. ^ "æ–°åŠ å¡å›½ç«‹å¤§å­¦Louxin Zhang教授学术报å'Š-山大计算机ç§'学与技术学院". www.cs.sdu.edu.cn. Retrieved 2023-04-06. {{cite web}}: soft hyphen character in |title= at position 20 (help)
  6. ^ "Lee Kuan Yew Postdoctoral Fellowship". NUS-ODPRT. Retrieved 2023-04-06.
  7. ^ Zhang, Louxin (1992-11). "Applying rewriting methods to special monoids". Mathematical Proceedings of the Cambridge Philosophical Society. 112 (3): 495–505. doi:10.1017/S0305004100071176. ISSN 1469-8064. {{cite journal}}: Check date values in: |date= (help)
  8. ^ Zhang, Louxin (1991-11-01). "Conjugacy in special monoids". Journal of Algebra. 143 (2): 487–497. doi:10.1016/0021-8693(91)90275-D. ISSN 0021-8693.
  9. ^ 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 (02): 209–220. doi:10.1142/S021819679200013X. ISSN 0218-1967.
  10. ^ Gunawan, Andreas D. M.; DasGupta, Bhaskar; Zhang, Louxin (2017-02-01). "A decomposition theorem and two algorithms for reticulation-visible networks". Information and Computation. 252: 161–175. doi:10.1016/j.ic.2016.11.001. ISSN 0890-5401.
  11. ^ Wu, Yufeng; Zhang, Louxin (2022-07-06). "Can Multiple Phylogenetic Trees Be Displayed in a Tree-Child Network Simultaneously?". arXiv:2207.02629 [q-bio]. doi:10.48550/arxiv.2207.02629.
  12. ^ 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.
  13. ^ Zhang, Louxin (2011-11). "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. {{cite journal}}: Check date values in: |date= (help)
  14. ^ Tran, Ngoc Hieu; Choi, Kwok Pui; Zhang, Louxin (2013-08-06). "Counting motifs in the human interactome". Nature Communications. 4 (1): 2241. doi:10.1038/ncomms3241. ISSN 2041-1723.
  15. ^ Gambette, Philippe; Gunawan, Andreas D. M.; Labarre, Anthony; Vialette, Stéphane; Zhang, Louxin (2015). "Locating a Tree in a Phylogenetic Network in Quadratic Time". arXiv:1502.03379 [cs, q-bio]. 9029: 96–107. doi:10.1007/978-3-319-16706-0_12.


Retrieved from "https://en.wikipedia.org/w/index.php?title=Louxin_Zhang&oldid=1152455382"