Abstract. Contact maps are a model to capture the core information in the structure of biological molecules, e.g., proteins. A contact map consists of an ordered set ¡ of elements...
Abstract. In this paper we present a more efficient algorithm for comparison of minisatellites which has complexity O(n 3 + m 3 + mn 2 + nm 2 + mn) where n and m are the lengths of...
We consider the problem of finding the optimal pair of string patterns for discriminating between two sets of strings, i.e. finding the pair of patterns that is best with respect...
We describe an algorithm for comparing two RNA secondary structures coded in the form of trees that introduces two novel operations, called node fusion and edge fusion, besides the...
Abstract. Sequence alignment algorithms have a long standing tradition in bioinformatics. In this paper, we formulate an extension to existing local alignment algorithms: local ali...