2015/02/11 19:00〜20:30 に開催された Donutsプロコンチャレンジ 2015 の解説です。 http://donuts-2015.contest.atcoder.jp/

The document discusses genome assembly algorithms and software, specifically focusing on Overlap-Layout-Consensus (OLC) and De Bruijn graph methods. It highlights the challenges and methodologies involved in reconstructing genomes from sequencer reads and provides an overview of various assembly software like Celera Assembler and Velvet. Additionally, it touches on the underlying graph theory conc
The document discusses algorithms for finding minimum spanning trees in graphs. It describes Prim's and Kruskal's algorithms, which both run in O(ElogV) time where E is the number of edges and V is the number of vertices. It also mentions that Fibonacci heaps can be used to implement Prim's algorithm in O(E+VlogV) time.
リリース、障害情報などのサービスのお知らせ
最新の人気エントリーの配信
処理を実行中です
j次のブックマーク
k前のブックマーク
lあとで読む
eコメント一覧を開く
oページを開く