| Literature DB >> 21682849 |
Dominik Heider1, Daniel Hoffmann.
Abstract
BACKGROUND: Most machine learning techniques currently applied in the literature need a fixed dimensionality of input data. However, this requirement is frequently violated by real input data, such as DNA and protein sequences, that often differ in length due to insertions and deletions. It is also notable that performance in classification and regression is often improved by numerical encoding of amino acids, compared to the commonly used sparse encoding.Entities:
Year: 2011 PMID: 21682849 PMCID: PMC3138420 DOI: 10.1186/1756-0381-4-16
Source DB: PubMed Journal: BioData Min ISSN: 1756-0381 Impact factor: 2.522
Method overview
| command | parameters | information |
|---|---|---|
| amino acid sequence | ||
| 1-532; default = 151 [ | ||
| 0: no; 1:[-1,1]; 2:[0,1]; default = 0 | ||
| encoded amino acid sequence | ||
| desired length | ||
| default = | ||
Figure 1Example: Interpolation. A V3 loop sequence was encoded with AAdescriptor and then normalized with Interpol from length 38 to 35. Solid line: encoded sequence of length 38; dashed line: normalized sequence of length 35.
Figure 2Example: ROC curves. Comparison of prediction performance based on different descriptors and interpolation methods implemented in Interpol and visualized with ROCR [14]. black: hydropathy (descriptor = 151); grey: net charge (descriptor = 146); solid line: linear interpolation; dashed line: spline interpolation.