Abstract. We apply the concept of subset seeds proposed in [1] to similarity search in protein sequences. The main question studied is the design of efficient seed alphabets to con...
Mikhail A. Roytberg, Anna Gambin, Laurent No&eacut...
—Previously, we have developed a framework to perform systematic analysis of CSMA/CA based wireless MAC protocols. The framework first identifies protocol states that meet our ...
Extensible lattice sequences have been proposed and studied in [5–7]. For the special case of extensible Korobov sequences, parameters can be found in [6]. The searches made to ...
The issues of compiler optimization phase ordering and selection present important challenges to compiler developers in several domains, and in particular to the speed, code size,...
Prasad A. Kulkarni, Michael R. Jantz, David B. Wha...
Abstract—We study the performance of several search algorithms on unstructured peer-to-peer networks, both using classic search algorithms such as flooding and random walk, as w...