1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479
|
/*=====================================================================*/
/*(C) Copyright 1991-2001 by Fred Hutchinson Cancer Research Center */
/* uextract.c Un-indexed extract from GENBANK, EMBL, .UNI */
/* Reads through ENTIRE list of requested entries for each db entry. */
/* USE: uextract lisname dbname [-f -ofilename] */
/* dbname = name of database file, program will determine its type
lisname = name of a file containing a list of entries to
be extracted. For the various file types this should be:
GENBANK: LOCUS name (FASTA type 1)
EMBL: ID name (FASTA type 3)
PIR: ENTRY name (NBRF/CODATA format, FASTA type 2))
VMS: name immediately following the ; on the first line.
(NBRF/VMS format, FASTA type 5)
UNI: name immediately following the > on the first line.
(FASTA type 0)
-f => extract fragments (not extracted by default)
-ofilename => put all sequences in file filename (extracted
to separate files by default)
-n => don't execute motifj (executed by default if MOTIF
is on title line of .lis file
-l => don't execute motifj but make .lst file
-k => like -l but take fewer sequences
* The "lisname" file should have a title line starting with ">".
The second line may contain the name of a directory where the
extracted sequences will be stored; it will be created if it
does not exist. Subsequent lines should contain the sequence
entry IDs, one per line. EG:
>PS00094 ;Cytosine methylases
c:\proteins\PS00094\
MTB1_BACSH
MTB1_BACSU
MTB1_BREEP
* One output file is created for each entry in "universal" format
(>title $, then sequence, then *). The name of the file
is the 1st 8 characters of the entry name followed by .dna for
GENBANK and by .pro for EMBL and UNI. EG: "MTB1$BAC.pro".
NOTE FOR DOS: IF THE ENTRY NAME IS > 8 CHARACTERS THE FILE NAME
MAY NOT BE UNIQUE SINCE IT IS TRUNCATED!!
* Another file with a ".lst" extension is created containing the
names of sequences in lisname which were found and do not appear
to be fragments (the word FRAGMENT does not appear in the
description for the sequence). In addition, if the IDs. in the
lisname file are of SWISS-PROT format, aaaa$aaaaa, then only
the longest of all the sequences with the same characters before
the $ and with the first three characters following the $ the
same is written to the .lst file. For example, if lisname contains
MTB1$BACSU and MTB1$BACSH and MTB1$BREEP, and MTB1$BACSU is longer
than MTB1$BACSH, then MTB1$BACSU and MTB1$BREEP will be written
to .lst, but not MTB1$BACSH. See lst_list().
* A statistics file named "uextract.dat" is created.
KNOWN PROBLEMS: *If input database is not sorted by ID, may miss some
requested entries.
*If input list file has extension .lst, overwrites it.
*VMS format does not have fragment information.
--------------------------------------------------------------------------*/
/*
2/19/95 Don't create directory if filename is specified.
Don't activate -n if filename is specified, works okay now.
Don't write .lst or rewrite .lis files if -n (don't run motif)
11/14/95 Added usage; update title signif, etc. before writing .lis/.lst
6/ 6/98 Added Version; print ids of sequences NOT found.
7/26/98 Always rewrite .lis file
8/11/98 Added -l option: writes .lst file but doesn't execute motifj
Only rewrite .lis file if -n or -l
8/24/99 Fix problem with MOTIFJ on separate line when -l
2/21/00 Changed lst_list() to print id->full_entry name
>>>>>>>>>>>>>>>>>>> BLIMPS 3.4 <<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<
6/25/00 Changed lis_list() to print id->full_entry
6/12/01 Added -k option; like -l but modified lst_list() to put fewer
sequences in .lst file
5/23/03 Bugs in lst_list() - e.g. when full_entry=P81137
but entry=BTR1_MANSE|P81137
=========================================================================*/
#include <sys/types.h>
#include <dirent.h>
#include <unistd.h>
#include "motifj.h"
int get_ids();
int lst_list();
int lis_list();
/*-------------- Routines from motmisc.o --------------------------*/
void init_dbs();
void kr_itoa();
int type_dbs();
int extract_seqs();
struct db_id *makedbid();
char *dir_unix();
struct split_name *split_names();
char Version[12] = " 2/21/00.1";
char Pros[FNAMELEN];
/*======================================================================*/
int main(argc, argv)
int argc;
char *argv[];
{
char infile[FNAMELEN], lisfile[FNAMELEN], title[MAXLINE], stemp[MAXLINE];
char foutname[FNAMELEN], stitle[MAXLINE];
char lstname[FNAMELEN], *temp, *ptr;
char runtype[3], signif[5], dups[5], distance[5];
struct db_info *dbs[MAXDB];
struct db_id *ids, *id;
int arg, totseqs, nids, test, totlst, reseqs, frag, motif, lstflag, i;
int fewer;
FILE *fin, *flis, *flst, *fdat, *fout;
struct split_name *lissplit;
printf("\nUEXTRACT %s: (C) Copyright 1991-2000 by\n", Version);
printf(" Fred Hutchinson Cancer Research Center\n");
if (argc < 3)
{
printf("USAGE: uextract <lisfile> <dbfile> [-f -o<outfile> -n]\n");
printf(" <lisfile> = file listing sequence names to extract\n");
printf(" in PROTOMAT format\n");
printf(" <dbfile> = sequence database\n");
printf(" -f to extract FRAGMENTs\n");
printf(" -o<outfile> to have all sequences put in <outfile>\n");
printf(" -n to NOT execute motifj or create .lst file\n");
printf(" -l to NOT execute motifj but create .lst file\n");
printf(" -k to NOT execute motifj but create .lst file ");
printf(" with fewer sequences than -l\n");
}
/*------------- arg 1. List of entries to extract ---------------------*/
if (argc > 1)
strcpy(lisfile, argv[1]);
else
{
printf("\nEnter name of file containing list of entries to extract: ");
fgets(lisfile, FNAMELEN, stdin);
}
if ( (flis=fopen(lisfile, "r")) == NULL)
{
printf("\nCannot open file %s\n", lisfile);
exit(-1);
}
lissplit=split_names(lisfile);
/*----------------- arg 2 database name --------------------------------*/
if (argc > 2)
strcpy(infile, argv[2]);
else
{
printf("\nEnter name of database file to extract entries from: ");
fgets(infile, FNAMELEN, stdin);
}
if ( (fin=fopen(infile, "r")) == NULL)
{
printf("\nCannot open file %s\n", infile);
exit(-1);
}
/*----------------- args 3+ extract fragments---------------------------*/
frag = fewer = NO;
foutname[0] = '\0';
motif = lstflag = YES;
if (argc > 3)
{
for (arg=3; arg < argc; arg++)
{
if (argv[arg][0] == '-')
{
switch(argv[arg][1]) /* no space allowed after '-' */
{
case 'f': frag = YES; break;
case 'o': strcpy(foutname, argv[arg]+2); break;
case 'n': motif = lstflag = NO; break;
case 'l': motif = NO; break;
case 'k': motif = NO; fewer = YES; break;
default: break;
}
}
}
}
if (strlen(foutname))
{
/* motif = NO; motifj won't work with this option */
if ( (fout=fopen(foutname, "w+t")) == NULL)
{
printf("\nCannot open file %s\n", foutname);
exit(-1);
}
else
printf("\nExtracting all sequences to %s", foutname);
}
else fout = NULL;
/*------------- First line of extract file may have a title ----------*/
fgets(title, MAXLINE, flis);
if (strlen(title) && title[0] != '>')
{
title[0] = '\0';
rewind(flis);
}
else /* Don't print the MOTIFJ= part, confuses people ! */
{
strcpy(stitle, title); ptr = strstr(stitle, "MOTIFJ=[");
if (ptr != NULL) stitle[strlen(stitle)-strlen(ptr)] = '\0';
else stitle[strlen(stitle) - 1] = '\0'; /* get rid of \n */
printf("\n%s", stitle);
/* if (fout != NULL) fprintf(fout, "%s\n", stitle); gibbsj loops! */
}
/*------------Second line may have a directory name --------------*/
Pros[0] = '\0';
if (getcwd(Pros, FNAMELEN) != NULL) strcat(Pros, "/"); /*DOS*/
fgets(stemp, MAXLINE, flis);
if (strlen(stemp) && stemp[0] != '>' && strstr(stemp, "/") != NULL) /*DOS*/
{
strcpy(Pros, stemp); Pros[strlen(stemp)-1] = '\0'; /* get rid of nl */
if (fout == NULL)
strcpy(Pros,dir_unix(stemp)); /* create the directory if nec. */
}
/*--------------- Get extract list --------------------------------------*/
ids = makedbid();
nids = get_ids(flis, ids);
fclose(flis);
printf("\n%d sequences requested for extract from %s", nids, infile);
if (fout == NULL)
printf("\n and deposit into directory %s", Pros);
else
printf("\n and deposit into file %s", foutname);
/*------------------- Extract the sequences ---------------------------*/
if (nids > 0)
{
init_dbs(dbs); /* load database infor. */
totseqs = extract_seqs(nids, dbs, fin, ids, Pros, fout, frag);
}
else totseqs = 0;
printf("\n%d sequences extracted\n", totseqs);
if (totseqs < nids)
{
printf("The following sequences were not found:\n");
i = totseqs;
id = ids->next;
while (id != NULL)
{
if (id->found == NO)
{
i++;
printf("%s\n", id->entry);
}
id = id->next;
}
}
fclose(fin);
/*======================================================================*/
/*---- Rewrite the .lis file ------------------------------------
if ( (flis=fopen(lisfile, "w+t")) == NULL)
{
printf("\nCannot open file %s for update\n", lisfile);
}
else
{
if (strlen(title) > 2) fprintf(flis, "%s", title);
if (strlen(Pros) > 2) fprintf(flis, "%s\n", Pros);
reseqs = lis_list(flis, ids);
printf("\n%d entries re-written to %s\n", reseqs, lisfile);
fclose(flis);
}
*/
/*-----------If they want to run motif, do a lot of stuff now ------*/
if ((motif || lstflag) && totseqs > 0)
{
/*-------- Make the .lst file in the current directory----------*/
lstname[0] = '\0';
strncat(lstname, lisfile+lissplit->dir_len, lissplit->name_len);
lstname[lissplit->name_len] = '\0';
strcat(lstname, ".lst");
if ( (flst=fopen(lstname, "w+t")) == NULL)
{
printf("\nCannot open file %s\n", lstname);
exit(-1);
}
if (strlen(title) > 2) fprintf(flst, "%s", title);
if (strlen(Pros) > 2) fprintf(flst, "%s\n", Pros);
totlst = lst_list(fewer, flst, ids);
printf("\n%d entries written to %s\n", totlst, lstname);
fclose(flst);
if (motif)
{
/*----- Update the title line for the .lis file ------------*/
/* NOTE: should do this in the .lst file, too, but requires totlst */
/* See if any info. from PROTOMOT; just use runtype & dups */
temp = strstr(title, "MOTIFJ=[");
if (temp != NULL)
{
ptr = strtok(temp, "[");
ptr = strtok(NULL, ",");
strcpy(runtype, ptr);
ptr = strtok(NULL, ",");
strcpy(signif, ptr);
ptr = strtok(NULL, ",");
strcpy(dups, ptr);
test = atoi(dups);
if (test < 0) test = 0; /* Default is zero dups */
kr_itoa(test, dups, 10);
ptr = strtok(NULL, "]");
strcpy(distance, ptr);
}
else /* use defaults */
{
strcpy(runtype, "4");
strcpy(dups, "0");
}
/*---- redo distance & signif; don't use PROTOMOT stuff!---*/
strcpy(distance, "17"); /* Force distance=17 */
/*-- totlst=#seqs in .lst; totseqs=#seqs in .lis --*/
if (strcmp(runtype, "4") == 0)
test = (int) ((totlst+1)/2) + 1; /* start at NUMSEQS/2 +1 */
else test = totlst;
if (test <= MINSEQS) test = MINSEQS + 1;
kr_itoa(test, signif, 10);
/* Re-write MOTIFJ=[] stuff in title now! */
/*>>>>> be sure stitle doesn't already have \n !!! */
sprintf(title, "%s MOTIFJ=[%s,%s,%s,%s];$\n",
stitle, runtype, signif, dups, distance);
} /* end of if motif */
/*---- Rewrite the .lis file ------------------------------------*/
if ( (flis=fopen(lisfile, "w+t")) == NULL)
{
printf("\nCannot open file %s for update\n", lisfile);
}
else
{
if (strlen(title) > 2) fprintf(flis, "%s", title);
if (strlen(Pros) > 2) fprintf(flis, "%s\n", Pros);
reseqs = lis_list(flst, ids); /* why flst here ? */
printf("\n%d entries re-written to %s\n", reseqs, lisfile);
fclose(flis);
}
/*================Execute motifj now================================*/
if (motif)
{
/*--------------Write stats to the .dat file --------------------*/
if ( (fdat=fopen("uextract.dat", "a")) != NULL)
{
fprintf(fdat, "%s %d %d %s %s %s\n",
lisfile, totseqs, totlst, signif, dups, distance);
fclose(fdat);
}
/*------Execute motifj----------------------------------------*/
/*------motifj will read either a list of sequences or a file
of sequences if the file name is preceded with a "-" --------*/
if (fout == NULL) strcpy(stemp, lstname);
else
{ strcpy(stemp, "-"); strcat(stemp, foutname);
fclose(fout);
}
execlp("motifj", "motifj", runtype, stemp,
signif, dups, distance, NULL);
} /* end of if motif */
} /* end of if motif or lstflag */
exit(0);
} /* end of main */
/*======================================================================
Build the .lst file for motifj:
The sequences in the .lis file are all included EXCEPT:
1. If one was not extracted (id->found=NO)
2. If one was found to be a fragment (id->frag=1)
3. If two or more sequences appear to be from SWISS-PROT
(id contains a _) and their ids are identical before the
_ and for 3 characters following the _, only the longest of
the group is included.
4. If fewer == YES, modifies 3 to compare just before _
======================================================================*/
int lst_list(fewer, flst, ids)
int fewer;
FILE *flst;
struct db_id *ids;
{
struct db_id *id, *save;
char sid[80], tid[80], sid1[80];
int maxlen, nlst, doll;
sid1[0] = sid[0] = '\0';
nlst = 0;
id = ids->next; /* initialize 1st set */
/*---- Skip to first non-fragment, non-P sequence ----*/
while (id != NULL &&
(id->frag || !id->found || strcmp(id->ps, "P")==0))
id = id->next;
if (id == NULL) return(0); /* No .lst sequences */
strcpy(sid, id->full_entry); maxlen = id->len; save=id;
/*----- Copy up to $ or _, plus 3 more characters ---------*/
/*>>>> Note, assuming the Swiss id comes first if compound
entry name, should break it up at | points.
Also, this doesn't work at all unless the ids are sorted
by full_entry, not entry; see motmisc.c:check_entry()
<<<<<*/
strcpy(sid1, sid);
/* doll = #chars before $ or _ */
doll = strcspn(sid1, "$_");
if (fewer == NO)
{ if ( (doll+4) < strlen(sid1) ) sid1[doll+4] = '\0'; }
else
{ sid1[doll] = '\0'; }
/*---- Now do the rest of the entries -------------------*/
while (id != NULL &&
(id->frag || !id->found || strcmp(id->ps, "P")==0))
id=id->next;
while (id != NULL)
{
strcpy(tid, id->full_entry);
doll = strcspn(tid, "$_");
if (fewer == NO)
{ if ( (doll+4) < strlen(tid) ) tid[doll+4] = '\0'; }
else
{ tid[doll] = '\0'; }
if ((save != id) && (strcmp(tid, sid1) != 0)) /* New set */
{
nlst += 1;
/* Print the previous set (save) */
fprintf(flst, "%-20s", save->full_entry);
if (strlen(save->ps)) fprintf(flst, " PS=%s", save->ps);
if (save->len > 0) fprintf(flst, " LENGTH=%-6d", save->len);
fprintf(flst, "\n");
save->lst = YES;
strcpy(sid, id->full_entry); /* Initialize the next set */
save = id;
strcpy(sid1, tid);
maxlen = id->len;
}
else if (strcmp(tid, sid1) == 0 && id->len > maxlen)
{
strcpy(sid, id->full_entry); save = id;
maxlen = id->len;
}
/*---- Skip to next non-fragment, non-P sequence ------*/
id = id->next;
while (id != NULL &&
(id->frag || !id->found || strcmp(id->ps, "P")==0))
id = id->next;
}
nlst += 1;
/* Print the last set */
fprintf(flst, "%-20s", sid);
if (strlen(save->ps)) fprintf(flst," PS=%s", save->ps);
if (save->len > 0) fprintf(flst," LENGTH=%-6d", save->len);
fprintf(flst,"\n");
save->lst = YES;
return(nlst);
} /* end of lst_list */
/*======================================================================*/
int lis_list(flis, ids)
FILE *flis;
struct db_id *ids;
{
struct db_id *id;
int nlis;
nlis = 0;
id = ids->next;
while (id != NULL)
{
nlis += 1;
fprintf(flis, "%-20s", id->full_entry);
if (strlen(id->ps)) fprintf(flis, " PS=%s", id->ps);
if (id->len > 0 ) fprintf(flis, " LENGTH=%-6d", id->len);
if (id->frag) fprintf(flis, " FRAGMENT");
if (id->lst) fprintf(flis, " LST");
if (strlen(id->pir)) fprintf(flis, " PIR=%s", id->pir);
fprintf(flis, "\n");
id = id->next;
}
return(nlis);
} /* end of lis_list */
|