Year: 2023
Type: article
Abstract: To index or compare sequences efficiently, often k-mers, i.e., substrings of fixed length k, are used. For efficient indexing or storage, k-mers are encoded as integers, e.g., applying some bijective mapping between all possible σ^k k-mers and the interval [0,σ^k-1], where σ is the alphabet size.
Author: Paul Medvedev
Institution: Pennsylvania State University
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: hybrid
OpenAlex ID: W4386833011