310 search results - page 31 / 62 » Using Parallel Algorithms for Searching Molecular Sequence D... |
118
click to vote
GECCO
2009
Springer
15 years 6 months ago
2009
Springer
Given a set of strings S of equal lengths over an alphabet Σ, the closest string problem seeks a string over Σ whose maximum Hamming distance to any of the given strings is as s...
101
Voted
CORR
2002
Springer
15 years 2 months ago
2002
Springer
In order to control the process of data mining and focus on the things of interest to us, many kinds of constraints have been added into the algorithms of data mining. However, di...
133
click to vote
BMCBI
2010
15 years 2 months ago
2010
Background: The impressive increase of novel RNA structures, during the past few years, demands automated methods for structure comparison. While many algorithms handle only small...
149
click to vote
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...
146
click to vote
ICDM
2002
IEEE
15 years 7 months ago
2002
IEEE
Over the years, a variety of algorithms for finding frequent sequential patterns in very large sequential databases have been developed. The key feature in most of these algorith...