In CS109 and CS161, you learned some tricks of the trade in the analysis of randomized algorithms, with applications to the analysis of QuickSort and hashing. There’s also CS265, where you’ll learn more than you ever wanted to know about randomized algorithms (but a great class, you should take it). In CS261, we build a bridge between what’s covered in CS161 and CS265. Specifically, this lectur...

The minimum crossing number problem is among the oldest and most fundamental problems arising in the area of automatic graph drawing. In this paper, eight population-based meta-heuristic algorithms are utilized to tackle the minimum crossing number problem for two special types of graphs, namely complete graphs and complete bipartite graphs. A 2-page book drawing representation is employed for ...

An algorithm to determine the possible mutations that can occur in S protein responsible of Covid-19 humans is designed. To do that, nine tridimensional sequences available Protein Data Bank similar initial strain sequenced Wuhan (December 2019) are identified. The conditions driving this potential mutation are: (1) an accumulated number greater than (or equal to) 5 each position; (2), a cumula...