55 search results - page 5 / 11 » More Efficient Algorithms for Closest String and Substring P... |
100
Voted
CSR
2006
Springer
15 years 6 months ago
2006
Springer
For two strings a, b of lengths m, n respectively, the longest common subsequence (LCS) problem consists in comparing a and b by computing the length of their LCS. In this paper, w...
112
Voted
GBRPR
2007
Springer
15 years 6 months ago
2007
Springer
We compare different statistical characterizations of a set of strings, for three different histogram-based distances. Given a distance, a set of strings may be characterized by it...
103
click to vote
DIS
2004
Springer
15 years 8 months ago
2004
Springer
We consider the problem of discovering the optimal pair of substring patterns with bounded distance α, from a given set S of strings. We study two kinds of pattern classes, one is...
153
Voted
BALT
2006
15 years 6 months ago
2006
In many application domains (e.g., WWW mining, molecular biology), large string datasets are available and yet under-exploited. The inductive database framework assumes that both s...
107
Voted
CSB
2003
IEEE
15 years 8 months ago
2003
IEEE
The design of large scale DNA microarrays is a challenging problem. So far, probe selection algorithms must trade the ability to cope with large scale problems for a loss of accur...