<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>BGT: efficient and flexible genotype query across many samples · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1506.08452/</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/1506.08452/feed.xml" rel="self" type="application/rss+xml" /><item><title>BGT: efficient and flexible genotype query across many samples — mentioned by temujin</title><link>https://news.ycombinator.com/item?id=9866480</link><guid isPermaLink="false">urn:hackerpapers:mention:1506.08452:9866480</guid><pubDate>Fri, 10 Jul 2015 20:19:42 GMT</pubDate><description>&lt;p&gt;Better representations are already used for downstream data analysis and continue to be improved; see e.g. http://arxiv.org/abs/1506.08452 . However, algorithms for producing variant calls from raw sequencer output are also improving over time, and the way to get the most benefit from them is to save the old raw data so newer algorithms can be applied to them. That&amp;#x27;s where the storage challenges come into play.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1506.08452/"&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>
