We propose a method for finding seeds for the local alignment of two nucleotide sequences. Our method uses randomized algorithms to find approximate seeds. We present a dynamic ...
Hierarchical categorization is a powerful and convenient method so that it is commonly used in various areas, such as ontologies. Although each hierarchy is useful, there are probl...
Sequence alignment is an important problem in computational biology. We compare two different approaches to the problem of optimally aligning two or more character strings: bounde...
The problem of comparing two sequences A and B to determine their similarity is one of the fundamental problems in pattern matching. A challenging, basic variation of the sequence...
Gad M. Landau, Eugene W. Myers, Michal Ziv-Ukelson
Visual understanding is often based on measuring similarity between observations. Learning similarities specific to a certain perception task from a set of examples has been show...
Michael Bronstein, Alexander Bronstein, Nikos Para...