JDSL: Java Data Structures Libary
JDSL is the Data Structures Library in Java. It is a collection of Java interfaces and classes that implement fundamental data structures and algorithms, such as: * sequences, trees, priority queues, search trees, hash tables * sorting and searching algorithms * graphs * graph traversals, shortest path, minimum spanning tree A unique feature of JDSL is the concept of accessors, which allow powerfu
The Stony Brook Algorithm Repository
This WWW page is intended to serve as a comprehensive collection of algorithm implementations for over seventy of the most fundamental problems in combinatorial algorithms. The problem taxonomy, implementations, and supporting material are all drawn from my book The Algorithm Design Manual. Since the practical person is more often looking for a program than an algorithm, we provide pointers to sol
Algorithms in C++ -- Sedgewick
Sedgewick's popular algorithms text Algorithms in C++ comes in several different language editions, including C, C++, and Modula-3. It distinguishes itself through the use of algorithm animation, and in its broad topic coverage, including numerical, string, and geometric algorithms. The language specific parts of the text consist of many small code fragments, instead of full programs or subroutine
Skiena's Audio Lectures
Below are audio, video and lecture sides for 1997 and 2007. Since the lectures are 10 years apart some of the topics covered by the course have changed. The 1997 lectures have a better quality video and audio than the 2007, although the 2007 covers the newer material and has better lecture notes. If you found this useful also check out the video lectures of my Discrete Mathematics, Computational B
1.7.9 Shortest Common Superstring
Input Description: A set of strings s_1, ..., s_m. Problem: Find the shortest string S which contains each s_i as a substring of S. Excerpt from The Algorithm Design Manual: Shortest common superstring arises in a variety of applications, including sparse matrix compression. Suppose we have an n X m matrix with most of the elements being zero. We can partition each row into m/k runs of k elements
Celera Assembler
Celera Assembler is scientific software for DNA research. It can reconstruct long sequences of genomic DNA from the fragmentary data produced by whole-genome shotgun sequencing. The Celera Assembler is mature, efficient, open-source software written mostly in C for unix operating systems. Download Files (local site)Offical Site Problem Links
1
リリース、障害情報などのサービスのお知らせ
最新の人気エントリーの配信
処理を実行中です
j次のブックマーク
k前のブックマーク
lあとで読む
eコメント一覧を開く
oページを開く
