Sciweavers

78 search results - page 16 / 16
» On The Closest String and Substring Problems
Sort
View
ICWN
2008
13 years 7 months ago
A Framework of Authentic Post-Issuance Program Modification for Multi-Application Smart Cards
Authentic program modification is very important for a multi-application smart card system since applications in the system are realized after the issuance of the smart card. In t...
Mohammad Mesbah Uddin, Salahuddin Muhammad Salim Z...
CIKM
2008
Springer
13 years 7 months ago
TinyLex: static n-gram index pruning with perfect recall
Inverted indexes using sequences of characters (n-grams) as terms provide an error-resilient and language-independent way to query for arbitrary substrings and perform approximate...
Derrick Coetzee
RECOMB
2005
Springer
14 years 5 months ago
Learning Interpretable SVMs for Biological Sequence Classification
Background: Support Vector Machines (SVMs) ? using a variety of string kernels ? have been successfully applied to biological sequence classification problems. While SVMs achieve ...
Christin Schäfer, Gunnar Rätsch, Sö...