Author: Marie Hoffmann; Michael T. Monaghan; Knut Reinert
Title: PriSeT: Efficient De Novo Primer Discovery Document date: 2020_4_7
ID: 3b3hv53b_54
Snippet: Algorithm 3 puts together the previously described encodings of k-mers and their locations. TKMerIDs need to be in order of occurrence, but k-mers are not processed in order. The strategy is to first set bits in the reference bit vector for k-mers, secondly to determine which values of k occur at a specific index, and thirdly, to fill the TKMerID vector......
Document: Algorithm 3 puts together the previously described encodings of k-mers and their locations. TKMerIDs need to be in order of occurrence, but k-mers are not processed in order. The strategy is to first set bits in the reference bit vector for k-mers, secondly to determine which values of k occur at a specific index, and thirdly, to fill the TKMerID vector.
Search related documents:
Co phrase search for related documents- bit set and reference bit: 1
- bit set and reference bit vector: 1
- order process and specific index: 1
Co phrase search for related documents, hyperlinks ordered by date