#include <mysql++.h>#include <iostream>#include <fstream>#include <list>#include "Range.h"#include <string>Classes | |
| struct | ProgParam |
Functions | |
| bool | createUniqueTable (Connection &dbh, const string &tab) |
| void | topfp (Connection &conn, Connection &conn2, const ProgParam &par) |
| void | usage () |
| int | main (int argc, char *argv[]) |
| bool createUniqueTable | ( | Connection & | dbh, | |
| const string & | tab | |||
| ) |
| int main | ( | int | argc, | |
| char * | argv[] | |||
| ) |
References ProgParam::enough(), ProgParam::intab, ProgParam::oufile, ProgParam::outab, topfp(), usage, and user.
| void topfp | ( | Connection & | conn, | |
| Connection & | conn2, | |||
| const ProgParam & | par | |||
| ) |
this version deals with multiple target databases Normally you don't do this. It is one search db. I am using this test case to develope this application
Make sure the quality of the table has been set to non-null. This program will only pick quality >= 0.
| void usage | ( | ) |
given gmap summary format, this program converts it into combest archive format (*.car)
It can be used a pipe, or given specific file names.
this is a helper program to count distinct estids in the ESTId column of the combest result. So it is the actual number of ESTs mapped. This could be lower for deeply covered genome because of the coverage depth-dependent filtering.
given gmap summary format, this program converts it into combest archive format (*.car)
It can be used a pipe, or given specific file names.
this is a helper program to count distinct estids in the ESTId column of the combest result. So it is the actual number of ESTs mapped. This could be lower for deeply covered genome because of the coverage depth-dependent filtering.
1.5.6