Protein sequence comparison based on K-string dictionary
Date
2013
Authors
Yu, C.
He, R.
Yau, S.
Editors
Advisors
Journal Title
Journal ISSN
Volume Title
Type:
Journal article
Citation
Gene, 2013; 529(2):250-256
Statement of Responsibility
Conference Name
Abstract
The current K-string-based protein sequence comparisons require large amounts of computer memory because the dimension of the protein vector representation grows exponentially with K. In this paper, we propose a novel concept, the "K-string dictionary", to solve this high-dimensional problem. It allows us to use a much lower dimensional K-string-based frequency or probability vector to represent a protein, and thus significantly reduce the computer memory requirements for their implementation. Furthermore, based on this new concept, we use Singular Value Decomposition to analyze real protein datasets, and the improved protein vector representation allows us to obtain accurate gene trees.
School/Discipline
Dissertation Note
Provenance
Description
Data source: Supplementary data, https://doi.org/10.1016/j.gene.2013.07.092
Access Status
Rights
Copyright 2013 Elsevier