All fingers are not the same: handling variable-length sequences in a discriminative setting using conformal multi-instance kernels

DOI10.4230/LIPICS.WABI.2017.16MaRDI QIDQ5111817zbMATH OpenFDO

Authors Sarvesh Nikumbh, Peter Ebert, Nico Pfeifer

Publication date 27 May 2020

Full work available at URL https://doi.org/10.4230/LIPICS.WABI.2017.16

zbMATH Keywords

5Cconformal MI kernelsHi-Cmultiple instance learning

Mathematics Subject Classification ID

Computational methods for problems pertaining to biology (92-08) Protein sequences, DNA sequences (92D20)

Recommendations

• Versatile string kernels
• Fast string kernels using inexact matching for protein sequences
• Fast kernels for inexact string matching.
• Research in Computational Molecular Biology
• Kernels for sequentially ordered data

Cites work

• Solving the multiple instance problem with axis-parallel rectangles.

Cited in

(1)

• CoMIK

Describes a project that uses

Uses Software

• KIRMES

This page was built for publication: All fingers are not the same: handling variable-length sequences in a discriminative setting using conformal multi-instance kernels

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111817)