My research revolves around the application of mathematical modeling
and algorithmic techniques to various problems, including scheduling, load balancing,
and more recently computational biology, especially the problem of
RNA interaction and combinatorial problems inspired by it. My work
includes complexity analysis, approximation algorithms, game theory/optimal strategies, and lower/upper bounds.
For more detail, see below and refer to my list of publications.
What kind of performance guarnatees are possible in packet scheduling and the load balancing of switches?
Properties such as throughput, order, and liveliness are of particular importance.
We prove several bounds on throughput and some impossibility results,
and we provide scheduling, load balancing, and resource allocation algorithms for
several settings studied in computer science.
The pairwise interaction of RNAs has been studied extensively. However, the interaction of multiple RNAs (more than two) is important for understanding other biological mechanisms involving snRNAs and snoRNAs. We develop combinatorial formulations and algorithms to predict the interaction of multiple RNAs.
A generalized percolation theory approach for secondary structures in proteins reveals an interesting evolutionary
aspect of the probability distribution of amino acids in terms of hydrophobic, hydrophilic, and breakers.
The approach can be adapted to make prediction of secondary structure based on protein sequence alone.