Appendices
A
A forward scheme for canonical minimizers
PhD Thesis
Abstract
Foreword
Introduction
1
Delving into genomic sequences
2
Comparing using
k
‑mers
3
Sketching sequences
4
Sampling with minimizers
High-performance sequence processing
5
A primer on vectorization
6
Vectorized sequence parsing
7
Rolling hashes on sequences
8
Vectorized computation of minimizers
9
Application to sequence filtering
First discussion
Locality-preserving representations of k‑mer sets
10
Background on
k
‑mer sets
11
Necklaces and minimizers
12
Set operations on
k
-mer collections
13
Dynamic super‑
k
‑mer maps
14
From super‑
k
‑mers to hyper-
k
-mers
Second discussion
Sampling k‑mers to lower memory & complexity
15
Background on low-density minimizers
16
Multiminimizers
17
Sketching super‑
k
‑mers
Third discussion
Conclusion & perspectives
References
Appendices
A
A forward scheme for canonical minimizers
B
Experiments on parsing
C
Experiments on hyper-
k
-mers
D
Proofs and experiments on multiminimizers
E
Proofs and experiments on fractional hitting sets
F
Useful tools
Appendices
A
A forward scheme for canonical minimizers
Appendix A — A forward scheme for canonical minimizers
This appendix will be completed later.
References
B
Experiments on parsing