— The Smith-Waterman algorithm is a dynamic programming method for determining optimal local alignments between nucleotide or protein sequences. However, it suffers from quadrati...
— We study the problem of dynamic learning by a social network of agents. Each agent receives a signal about an underlying state and communicates with a subset of agents (his nei...
— One of the critical issues in search engines is the size of search indexes: as the number of documents handled by an engine increases, the search must preserve its efficiency,...
: Automated tools for understanding application behavior and its changes during the application life-cycle are essential for many performance analysis and debugging tasks. Applicat...
Ludmila Cherkasova, Kivanc M. Ozonat, Ningfang Mi,...
Motivation: Extracting functional information from protein–protein interactions (PPI) poses significant challenges arising from the noisy, incomplete, generic and static nature...