1272 search results - page 27 / 255 » Approximate Parameterized Matching |
JUCS
2008
14 years 11 months ago
2008
: This article provides a comparison among different methods for estimating the aggregation of Internet traffic resulting from different users, network-access types and correspondi...
RECOMB
2002
Springer
15 years 11 months ago
2002
Springer
This talk presents an algorithm to search for all approximate matches of a helix in a genome, where a helix is a combination of sequence and folding constraints. It is a joint wor...
IPPS
2006
IEEE
15 years 5 months ago
2006
IEEE
Approximate string matching problem is a common and often repeated task in information retrieval and bioinformatics. This paper proposes a generic design of a programmable array p...
102
click to vote
DASFAA
2003
IEEE
15 years 4 months ago
2003
IEEE
Approximate string matching on large DNA sequences data is very important in bioinformatics. Some studies have shown that suffix tree is an efficient data structure for approxim...
110
click to vote
ASAP
2004
IEEE
15 years 2 months ago
2004
IEEE
Dynamic programming for approximate string matching is a large family of different algorithms, which vary significantly in purpose, complexity, and hardware utilization. Many impl...