—We consider the problem of identifying motifs, recurring or conserved patterns, in the sets of biological sequences. To solve this task, we present new deterministic and exact a...
Recently, many computational methods for predicting protein-protein interaction (PPI) have been developed by utilizing domain-domain interaction or associated information. However...
—The Possibilistic Latent Variable (PLV) clustering algorithm is a powerful tool for the analysis of complex datasets due to its robustness toward data distributions of different...
Abstract. Phylogenetic trees are tree structures that depict relationships between organisms. Popular analysis techniques often produce large collections of candidate trees, which ...
Suzanne Matthews, Seung-Jin Sul, Tiffani L. Willia...
We present a randomized DNA algorithm for k-SAT based on the classical algorithm of Paturi et al. [8]. For an n-variable, m-clause instance of k-SAT (m > n), our algorithm finds...
In this paper we develop data mining techniques to predict 3D contact potentials among protein residues (or amino acids) based on the hierarchical nucleationpropagation model of p...
We present a theoretically founded framework for fuzzy unification and resolution based on edit distance over trees. Our framework extends classical unification and resolution con...