English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
EndNote (UTF-8)
 
DownloadE-Mail
 Local TagsRelease HistoryDetailsSummary
  An Automated Combination of Kernels for Predicting Protein Subcellular Localization

Ong, C., & Zien, A. (2008). An Automated Combination of Kernels for Predicting Protein Subcellular Localization. In K. Krandall, & J. Lagergren (Eds.), Algorithms in Bioinformatics: 8th International Workshop, WABI 2008, Karlsruhe, Germany, September 15-19, 2008 (pp. 186-197). Berlin, Germany: Springer.

Item is

 

show all

Basic

hide
Item Permalink: https://hdl.handle.net/11858/00-001M-0000-0013-C729-F Version Permalink: https://hdl.handle.net/21.11116/0000-0010-5A54-B
Genre: Conference Paper

Files

show Files

Locators

hide
Locator:
https://link.springer.com/content/pdf/10.1007%2F978-3-540-87361-7_16.pdf (Publisher version)
Description:
-
OA-Status:
Not specified

Creators

hide
 Creators:
Ong, CS1, Author           
Zien, A, Author           
Affiliations:
1Department Empirical Inference, Max Planck Institute for Biological Cybernetics, Max Planck Society, ou_1497795              

Content

hide
Free keywords: -
 Abstract: Protein subcellular localization is a crucial ingredient to many important inferences about cellular processes, including prediction of protein function and protein interactions. While many predictive computational tools have been proposed, they tend to have complicated architectures and require many design decisions from the developer. Here we utilize the multiclass support vector machine (m-SVM) method to directly solve protein subcellular localization without resorting to the common approach of splitting the problem into several binary classification problems. We further propose a general class of protein sequence kernels which considers all motifs, including motifs with gaps. Instead of heuristically selecting one or a few kernels from this family, we utilize a recent extension of SVMs that optimizes over multiple kernels simultaneously. This way, we automatically search over families of possible amino acid motifs. We compare our automated approach to three other predictors on four different datasets, and show that we perform better than the current state of the art. Further, our method provides some insights as to which sequence motifs are most useful for determining subcellular ocalization, which are in agreement with biological reasoning.

Details

hide
Language(s):
 Dates: 2008-09
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: DOI: 10.1007/978-3-540-87361-7_16
 Degree: -

Event

hide
Title: 8th Workshop on Algorithms in Bioinformatics (WABI 2008)
Place of Event: Karlsruhe, Germany
Start-/End Date: 2008-09-15 - 2008-09-19

Legal Case

show

Project information

show

Source 1

hide
Title: Algorithms in Bioinformatics: 8th International Workshop, WABI 2008, Karlsruhe, Germany, September 15-19, 2008
Source Genre: Proceedings
 Creator(s):
Krandall, KA, Editor
Lagergren, J, Editor
Affiliations:
-
Publ. Info: Berlin, Germany : Springer
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 186 - 197 Identifier: ISBN: 978-3-540-87360-0

Source 2

hide
Title: Lecture Notes in Computer Science
Source Genre: Series
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: 5251 Sequence Number: - Start / End Page: - Identifier: -