English

dna2vec: Consistent vector representations of variable-length k-mers

Quantitative Methods 2017-01-24 v1 Computation and Language Machine Learning Machine Learning

Abstract

One of the ubiquitous representation of long DNA sequence is dividing it into shorter k-mer components. Unfortunately, the straightforward vector encoding of k-mer as a one-hot vector is vulnerable to the curse of dimensionality. Worse yet, the distance between any pair of one-hot vectors is equidistant. This is particularly problematic when applying the latest machine learning algorithms to solve problems in biological sequence analysis. In this paper, we propose a novel method to train distributed representations of variable-length k-mers. Our method is based on the popular word embedding model word2vec, which is trained on a shallow two-layer neural network. Our experiments provide evidence that the summing of dna2vec vectors is akin to nucleotides concatenation. We also demonstrate that there is correlation between Needleman-Wunsch similarity score and cosine similarity of dna2vec vectors.

Keywords

Cite

@article{arxiv.1701.06279,
  title  = {dna2vec: Consistent vector representations of variable-length k-mers},
  author = {Patrick Ng},
  journal= {arXiv preprint arXiv:1701.06279},
  year   = {2017}
}

Comments

10 pages, 3 figures, 2 tables

R2 v1 2026-06-22T17:56:48.523Z