Fetching latest commit…
Cannot retrieve the latest commit at this time.
| .. | |||
| Failed to load latest commit information. | |||
|
perl | ||
|
|
Makefile | ||
|
|
README | ||
|
|
chr20.txt | ||
|
|
chr20.txt.tidx | ||
|
|
fastq-lib.cpp | ||
|
|
fastq-lib.h | ||
|
|
foo.txt | ||
|
|
tidx-lib.cpp | ||
|
|
tidx.cpp | ||
|
|
tidx.h | ||
|
|
utils.cpp | ||
|
|
utils.h | ||
README
This program aims to index a text file. It should probably use a file-based btree, instead of reading the whole thing into RAM (DBSnp eats 1.2GB ram). The important pert of th algorithm is the part that a) sorts b) removes overlaps c) creates an index that can be searched trivially, rather than requiring an r-tree This could be generalized to n-dminensional speces as well.... by removing all possible overlapping regions