We maintain here the list of all typos and mistakes found after the book was published.
If you find a new mistake, please let us know via email and we will publish it here.
3. Data structures
- Page 31, Lemma 3.11: lca(i, j) = rmq^{node}(i', j') should be lca(i, j) = rmq^{depth}(i', j') (reported by Léo Ackermann)
- Page 32, Sect. 3.4.4: rmqB(i,j) = min(rmqB(i,i+x-1),rmqC(⌈ i/x ⌉,⌊ j/x ⌋),rmqB(j-x+1,j)) should be rmqB(i,j) = min(rmqB(i,i+x-1),rmqC(⌈ i/x ⌉,⌊ j/x ⌋-1),rmqB(j-x+1,j)) (reported by Léo Ackermann)
14. Haplotype analysis
- Page 342, 14.3. Literature: The haplotype assembly algorithm attributed to Patterson et al. (2014) was independently and earlier discovered in Deng, F., Cui, W. & Wang, L. A highly accurate heuristic algorithm for the haplotype assembly problem. BMC Genomics 14 (Suppl 2), S2 (2013). (reported by Chirag Jain)