Fig. 1From: CDKAM: a taxonomic classification tool using discriminative k-mers and approximate matching strategiesThe structure of k-mers in CDKAM. A k-mer contains two parts: PREFIX and SUFFIX. SUFFIX can further be divided into two fragments: QM and DP, where QM stands for “quick mapping”, DP means “dynamic programming”, which are two fragments used for quick classification based on approximate matching strategies. For k-mers with the same PREFIX, we can group them by using a groupID converted from PREFIX, and save multiple k-mers (one PREFIX and multiple SUFFIXes) in a compressed way (see Reference database creation for more details)Back to article page