-
AFE
-
Lehre
-
Algorithmische Grundlagen
Project Groups
as close as possibile to the information-theoretic lower bound. A simple example is the counting of 0 or 1 bits in bit strings up to a certain position: without any preprocessing, this can only be done [...] about 500 TB). However, the variation between different individuals of the same species is only about 0.5%. This fact, in combination with the very small alphabet (A, C, G, T, possible few more), suggests …