27 search results - page 1 / 6 » A Small Automaton for Word Recognition in DNA Sequences |
ISMB
1993
13 years 6 months ago
1993
DBSEC
2010
13 years 6 months ago
2010
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...
BMCBI
2006
13 years 5 months ago
2006
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...
IPPS
2008
IEEE
13 years 11 months ago
2008
IEEE
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 ...
IBPRIA
2009
Springer
13 years 9 months ago
2009
Springer
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...