title: Protein Sequence Analysis by Proximities.
abstract: Sequence data are widely used to get a deeper insight into biological systems. From a data analysis perspective they are given as a set of sequences of symbols with varying length. In general they are compared using nonmetric score functions. In this form the data are nonstandard, because they do not provide an immediate metric vector space and their analysis using standard methods is complicated. In this chapter we provide various strategies for how to analyze these type of data in a mathematically accurate way instead of the often seen ad hoc solutions. Our approach is based on the scoring values from protein sequence data although be applicable in a broader sense. We discuss potential recoding concepts of the scores and discuss algorithms to solve clustering, classification and embedding tasks for score data for a protein sequence application.
authors.affiliation: School of Computer Science, University of Birmingham, Birmingham, Edgbaston, B15 2TT, UK. schleify@cs.bham.ac.uk.
authors.forename: Frank-Michael
authors.initials: FM
authors.lastname: Schleif
mesh_terms: D000465:Algorithms; D019295:Computational Biology / Q000379:methods*; D020539:Sequence Analysis, Protein / Q000379:methods*
keywords: Indefinite-kernel; Machine learning; Protein sequence analysis; Proximity data