4302 search results - page 245 / 861 » Index Pairs Algorithms |
115
Voted
IPPS
2003
IEEE
15 years 6 months ago
2003
IEEE
We have developed a new algorithm that allows the exhaustive determination of words of up to 12 nucleotides in DNA sequences. It is fast enough as to be used at a genomic scale ru...
105
Voted
SPIRE
2009
Springer
15 years 5 months ago
2009
Springer
Abstract. A set of sequences S is pairwise bounded if the Hamming distance between any pair of sequences in S is at most 2d. The Consensus Sequence problem aims to discern between ...
STACS
2001
Springer
15 years 5 months ago
2001
Springer
The stretch factor of a Euclidean graph is the maximum ratio of the distance in the graph between any two points and their Euclidean distance. Given a set S of n points in Rd, we ...
112
Voted
CPM
2000
Springer
15 years 5 months ago
2000
Springer
Abstract. We apply the Boyer–Moore technique to compressed pattern matching for text string described in terms of collage system, which is a formal framework that captures variou...
106
click to vote
FOCS
1999
IEEE
15 years 5 months ago
1999
IEEE
Hausdorff metrics are used in geometric settings for measuring the distance between sets of points. They have been used extensively in areas such as computer vision, pattern recog...