<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>These are not the k-mers you are looking for: efficient online k-mer counting using a probabilistic data structure · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1309.2975/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:16:22 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/1309.2975/feed.xml" rel="self" type="application/rss+xml" /><item><title>These are not the k-mers you are looking for: efficient online k-mer counting using a probabilistic data structure — mentioned by dekhn</title><link>https://news.ycombinator.com/item?id=36605629</link><guid isPermaLink="false">urn:hackerpapers:mention:1309.2975:36605629</guid><pubDate>Wed, 05 Jul 2023 19:16:32 GMT</pubDate><description>&lt;p&gt;For the really good candidates (IE, ones who can answer basic programming questions and explain how a hash table works), I have an open-ended question which is really an open question in an active field. I really hoped I&amp;#x27;d get candidates who would get that far (https://arxiv.org/abs/1309.2975) so that I could finally get some interesting answers I haven&amp;#x27;t heard before but most candidates I end up interviewing struggle to explain a hash table and what its advantages/disadvantages for counting unique k-mers are.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1309.2975/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>q-bio.GN</category></item></channel></rss>
