About Me
Nguyen Cam Ly
Master student
Department of Computer Science,
Graduate School of Information Science and Technology,
The University of Tokyo
Imai Laboratory,
Room 311, Science Building 7, the University of Tokyo,
7-3-1 Hongo, Bunkyo-ku, Tokyo, 113-0033, Japan
Email: l_nguyen (at) is.s.u-tokyo.ac.jp
Education
- April, 2005: Entered School of Foreign studies, Osaka University (for Japanese study)
- March, 2006: Graduated School of Foreign studies, Osaka University
- April, 2006: Entered School of Engineering Science, Osaka University
- March, 2010: Graduated School of Engineering Science, Osaka University
- April, 2010: Entered Graduate School of Information Science and Technology, The University of Tokyo
Research Topics
- From April, 2010 to present
I am researching about Market equilibirium. Market equilibrium is a major problem in economic. Market equilibrium is the situation where the supply of an item is exactly equal to its demand. There are many market models, and Fisher model is one of important, well-researched models. From 20th century until nowadays, many researchers have studies about the model. In 2010, James B. Orlin developed an algorithm which is considered as the best one to solve linear case of Fisher model. We use Orlin's algorithm to solve modified market model where goods and buyers are changeable.
- Until April, 2010
I researched about searching chemical compounds, one of major problems in bioinformatic. Here is the abstract.
We have created a method to search chemical compounds quickly and accurately by grouping similar compounds together. The proposed method uses two well-known compound databases, PubChem and DrugBank, as the searching database and query, respectively. Results showed it can run nearly 5 times faster than conventional method in the worst case and almost 77 times faster in the best case. Our method can be used in all applications in which the database size is large and data preprocessing is allowed.
Publications
- L. Nguyen, S. Seno, Y. Takenaka and H. Matsuda,
"An algorithm for fast exact search of chemical compounds by clustered data beforehand",
21st International Workshop on Combinatorial Algorithms (IWOCA2010), Poster Presentation, 2010.
- グエン カム リー, 瀬尾茂人, 竹中要一, 松田秀雄, "Tanimoto係数を用いた類似化合物検索のクラスタリングによる高速化手法",
情報処理学会研究会報告, Vol. 2010-BIO-20, No.7, 2010
|