226 search results - page 25 / 46 » A Practical Algorithm to Find the Best Subsequence Patterns |
PR
2006
13 years 7 months ago
2006
In this paper we introduce a new embedding technique to find the linear projection that best projects labeled data samples into a new space where the performance of a Nearest Neig...
AIRS
2004
Springer
14 years 24 days ago
2004
Springer
There exist practical bit-parallel algorithms for several types of pair-wise string processing, such as longest common subsequence computation or approximate string matching. The b...
COMPLIFE
2006
Springer
13 years 11 months ago
2006
Springer
Background: The computer-assisted detection of small molecules by mass spectrometry in biological samples provides a snapshot of thousands of peptides, protein fragments and prote...
BMCBI
2002
13 years 7 months ago
2002
Background: Pattern matching is the core of bioinformatics; it is used in database searching, restriction enzyme mapping, and finding open reading frames. It is done repeatedly ov...
SIAMDM
1998
13 years 7 months ago
1998
For every string inclusion relation there are two optimization problems: find a longest string included in every string of a given finite language, and find a shortest string in...