Modern scientific collaborations have opened up the opportunity of solving complex problems that involve multidisciplinary expertise and large-scale computational experiments. The...
Chee Sun Liew, Malcolm P. Atkinson, Jano I. van He...
Cut games and party affiliation games are well-known classes of potential games. Schaffer and Yannakakis showed that computing pure Nash equilibrium in these games is PLScomplete....
Background: Experimental studies of gene expression have identified some of the individual molecular components and elementary reactions that comprise and control cellular behavio...
Background: To infer homology and subsequently gene function, the Smith-Waterman (SW) algorithm is used to find the optimal local alignment between two sequences. When searching s...
Background: The task of computing highly accurate structural alignments of proteins in very short computation time is still challenging. This is partly due to the complexity of pr...