910 search results - page 43 / 182 » Detecting False Matches in String Matching Algorithms |
118
click to vote
BIBM
2008
IEEE
15 years 5 months ago
2008
IEEE
Recent studies in protein sequence analysis have leveraged the power of unlabeled data. For example, the profile and mismatch neighborhood kernels have shown significant improveme...
109
click to vote
CSB
2005
IEEE
15 years 8 months ago
2005
IEEE
This work presents the development of algorithms for approximate string matching using parallel methods. It intends to do the maximum of molecular sequences comparisons per unity ...
133
click to vote
AAIM
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. The Longest Common Subsequence (LCS) problem is a classic and well-studied problem in computer science. The LCS problem is a common task in DNA sequence analysis with man...
130
click to vote
ISAAC
2003
Springer
15 years 8 months ago
2003
Springer
Abstract. We present a bit-parallel technique to search a text of length n for a regular expression of m symbols permitting k differences in worst case time O(mn/ logk s), where s...
111
click to vote
ICPR
2010
IEEE
15 years 6 months ago
2010
IEEE
We present a general, simple feature representation of sequences that allows efficient inexact matching, comparison and classification of sequential data. This approach, recently ...