This work treats the problem of error-resilient DNA searching via oblivious evaluation of finite automata, formulated as follows: a client has a DNA sequence, and a service provid...
Background: The number of k-words shared between two sequences is a simple and effcient alignment-free sequence comparison method. This statistic, D2, has been used for the cluste...
This paper presents a seed-based algorithm for intensive DNA sequence comparison. The novelty comes from the way seeds are used to efficiently generate small ungapped alignments ...
Abstract. Being an essential key in biological research, the DNA sequences are often shared between researchers and digitally stored for future use. As these sequences grow in volu...