Versatile string kernels

Cees Elzinga, Hui Wang

Research output: Contribution to journalArticle

6 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.
LanguageEnglish
Pages50-65
JournalTheoretical Computer Science
Volume495
DOIs
Publication statusPublished - 15 Jul 2013

Fingerprint

Weighing
Image processing

Cite this

Elzinga, Cees ; Wang, Hui. / Versatile string kernels. 2013 ; Vol. 495. pp. 50-65.
@article{db01927e0a214e57805f389febb516d3,
title = "Versatile string kernels",
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.",
author = "Cees Elzinga and Hui Wang",
year = "2013",
month = "7",
day = "15",
doi = "10.1016/j.tcs.2013.06.006",
language = "English",
volume = "495",
pages = "50--65",

}

Versatile string kernels. / Elzinga, Cees; Wang, Hui.

Vol. 495, 15.07.2013, p. 50-65.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Versatile string kernels

AU - Elzinga, Cees

AU - Wang, Hui

PY - 2013/7/15

Y1 - 2013/7/15

N2 - 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.

AB - 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.

U2 - 10.1016/j.tcs.2013.06.006

DO - 10.1016/j.tcs.2013.06.006

M3 - Article

VL - 495

SP - 50

EP - 65

ER -