Protein sequence comparison based on K-string dictionary

- K-string dictionary can solve high-dimensional protein representation problem.
- The cardinality of K-string dictionary is studied by real and simulated datasets.
- This method can save a lot of memory space when calculating in computers.

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.