---------- Post updated at 13:52 ---------- Previous update was at 13:30 ----------
Anyhow, try
Code:
awk '!MIN[$6] {MIN[$6] = 1E100}
FNR==NR {CNT[$6]++
if ($9 < MIN[$6]) {MIN[$6]=$9; F3[$6]=$3; F7[$6]=$7}
next
}
FNR==1 {print $0, " no of SNPs Top rs ID Top categ Top P"
next
}
{$1=$1}
{print $0, CNT[$1], F3[$1], F7[$1], MIN[$1]}
' file2 OFS="\t" file1
Name test1 status P no of SNPs Top rs ID Top categ Top P
Gene1 0.00236753 1 1.00E-01 6 SNP3 MEDIUM 1.70E-01
Gene2 0.134187 2 2.00E-01 2 SNP7 HIGH 6.34E-01
Gene3 0.000608716 2 3.00E-01 1 SNP9 HIGH 2.94E-01
Gene4 0.0016234 1 4.00E-01 4 SNP12 HIGH 1.55E-01
Gene5 0.000665868 2 5.00E-01 5 SNP15 LOW 2.09E-02
---------- Post updated at 14:01 ---------- Previous update was at 13:52 ----------
This is running into problems as the space in "VERY HIGH" shifts the field count... so the field separator needs to be <TAB>, and both files should comply...replace ' file2 OFS="\t" file1
with ' FS="\t" OFS="\t" file2 file1.
hi guys i need to extract information from log files generated by an application.
log file has the following lines for each process..
----------------------------------------------
Fri Aug 03 12:06:43 WST 2007 INFO: Running project PROJECT1
Fri Aug 03 12:06:43 WST 2007 INFO: Source Files... (7 Replies)
Anyone have a better idea to automate extraction of info like ...
"uname"
"ifconfig"
"ps efl"
"netstat -ao"
etc.
from several hundred aix, solaris, red hat boxes? without logging into each box and manually performing these tasks and dumping them to individual files?
thanks for any input (1 Reply)
I am not an expert in awk, SED, etc... but I really hope there is a way to do this, because I don't want to have to right a program. I am using C shell.
FILE 1 FILE 2
H0000000 H0000000
MA1 MA1
CA1DDDDDD CA1AAAAAA
MA2 ... (2 Replies)
I have this code
awk 'NR==FNR{a=$1;next} a' file1 file2
which does what I need it to do, but for only two files. I want to make it so that I can have multiple files (for example 30) and the code will return only the items that are in every single one of those files and ignore the ones... (7 Replies)
I have two files : Alpha and Beta.
The files are as follows (without arrow marks.)
Alpha:
A 1
D 90
G 11
B 24
C 15
Beta:
B 24
C 0 <--
G 11
D 20 <--
A 4 <--
E 777 <--
Expected output of the script :
Alpha: (2 Replies)
Hi all, I'm pretty much a newbie to UNIX. I would appreciate any help with UNIX coding on comparing two large csv files (greater than 10 GB in size), and output a file with matching columns.
I want to compare file1 and file2 by 'id' and 'chain' columns, then extract exact matching rows'... (5 Replies)
Assume we have two files - FileA and FileB. Content of files are as shown below :
FileA:1001,value1,value4,value8,value9
1002,value4,value32,value46,value33
1503,value5,value45,value68,value53
1605,value4,value67,value56,value57
1073,value5,value45,value68,value53... (3 Replies)
bup-margin(1) General Commands Manual bup-margin(1)NAME
bup-margin - figure out your deduplication safety margin
SYNOPSIS
bup margin [options...]
DESCRIPTION
bup margin iterates through all objects in your bup repository, calculating the largest number of prefix bits shared between any two
entries. This number, n, identifies the longest subset of SHA-1 you could use and still encounter a collision between your object ids.
For example, one system that was tested had a collection of 11 million objects (70 GB), and bup margin returned 45. That means a 46-bit
hash would be sufficient to avoid all collisions among that set of objects; each object in that repository could be uniquely identified by
its first 46 bits.
The number of bits needed seems to increase by about 1 or 2 for every doubling of the number of objects. Since SHA-1 hashes have 160 bits,
that leaves 115 bits of margin. Of course, because SHA-1 hashes are essentially random, it's theoretically possible to use many more bits
with far fewer objects.
If you're paranoid about the possibility of SHA-1 collisions, you can monitor your repository by running bup margin occasionally to see if
you're getting dangerously close to 160 bits.
OPTIONS --predict
Guess the offset into each index file where a particular object will appear, and report the maximum deviation of the correct answer
from the guess. This is potentially useful for tuning an interpolation search algorithm.
--ignore-midx
don't use .midx files, use only .idx files. This is only really useful when used with --predict.
EXAMPLE
$ bup margin
Reading indexes: 100.00% (1612581/1612581), done.
40
40 matching prefix bits
1.94 bits per doubling
120 bits (61.86 doublings) remaining
4.19338e+18 times larger is possible
Everyone on earth could have 625878182 data sets
like yours, all in one repository, and we would
expect 1 object collision.
$ bup margin --predict
PackIdxList: using 1 index.
Reading indexes: 100.00% (1612581/1612581), done.
915 of 1612581 (0.057%)
SEE ALSO bup-midx(1), bup-save(1)BUP
Part of the bup(1) suite.
AUTHORS
Avery Pennarun <apenwarr@gmail.com>.
Bup unknown-bup-margin(1)