Versatile string kernels

Cees Elzinga, Hui Wang

Research output: Contribution to journalArticlepeer-review

11 Citations (Scopus)

Abstract

This paper proposes a class of string kernels that can handle a variety of subsequence-based features. Slight adaptations of the basic algorithm allow for weighing subsequence lengths, restricting or soft-penalizing gap-size, character-weighing and soft-matching of characters. An easy extension of the kernels allows for comparing run-length encoded strings with a time-complexity that is independent of the length of the original strings. Such kernels have applications in image processing, computational biology, in demography and in comparing partial rankings.
Original languageEnglish
Pages (from-to)50-65
Number of pages16
JournalTheoretical Computer Science
Volume495
Early online date14 Jun 2013
DOIs
Publication statusPublished - 15 Jul 2013
Externally publishedYes

Fingerprint

Dive into the research topics of 'Versatile string kernels'. Together they form a unique fingerprint.

Cite this