Combinatorial algorithms in bioinformatics and communications networks

在我的研究中，我研究图论和相关领域中出现的问题，这些问题通常是由高速网络和生物信息学等当前网络技术的应用所驱动的。我和我的学生一起开发各种实际问题的新算法。最近，这些算法是为了更快和更好地进行长序列比对，通过Groued树网络进行单倍型分析--一个与遗传疾病易感性有关的问题，以及反向蛋白质形成--一个在现代药物设计中发挥重要作用的领域。在通信网络领域，我对两个基本问题感兴趣，虚拟路径寻找和拓扑控制。这些问题固有的数学结构使它们成为理论计算机科学界的核心。我之所以对移动(特别)网络的理论成本模型感兴趣，是因为之前的大多数工作都是实验性的，很少有定性分析。

In my research, I study problems that arise in graph theory and related areas, often motivated by applications incurrent network technologies such as high-speed networks, and bioinformatics.With my students I develop new algorithms for various practical problems. Recently, these algorithms were for faster and better long sequence alignment, for haplotyping via galled tree networks--a problem related to genetic desease susceptibility, and inverse protein forlding--an area playing a major role in modern drug designs.In the area of communications networks I am interested in two fundamental problems, the virtual path finding and topology control. The mathematical structure inherent in these problems has made them central to the theoretical computer science community. My interest in theoretical cost models for mobile (ad-hoc) networks is motivated by the fact that most previous work is experimental with little qualitative analyses.