Adm: Created page with "==Set Operations== We assume two sets '''A''' and '''B''' whose elements are listed line by line. Set size: the number of elements in set A :`wc -l A` Set inclusion..."

2015-11-09T07:23:49Z

Created page with "==Set Operations== We assume two sets '''A''' and '''B''' whose elements are listed line by line. *Set size: the number of elements in set A :<tt>wc -l A</tt> *Set inclusion..."

New page

==Set Operations==
We assume two sets '''A''' and '''B''' whose elements are listed line by line.

*Set size: the number of elements in set A
:<tt>wc -l A</tt>

*Set inclusion: whether an element k is in set A
:<tt>$ grep -xc 'k' A </tt>

*Set equivalence between two sets A and B
:<tt>$ diff -q <(sort A | uniq) <(sort B | uniq)</tt>

*Set union A ∪ B = C
:<tt>$ cat A B | sort | uniq > C</tt>

*Set intersection A ∩ B = C
:<tt>$ comm -12 <(sort A | uniq) <(sort B | uniq)</tt>
:The 'comm -12' command outputs shared lines only. This command can be used to find the set inclusion (whether set A is a subset of B). The following option outputs lines only in the first file (set A), i.e., no output means that A is completely included B.
:<tt>$ comm -23 <(sort A | uniq) <(sort B | uniq)</tt>

==Arithmetics==

* Simple arithmetic by the shell command echo "$(( ... ))" (no floating number)
:<tt>echo "$((12345 + 23456))"</tt>
* Interactive mode of Perl
:<tt>perl -E "say 123 / 1.5"</tt>

Aritalab:Lecture/NGS/Unix commands/Examples - Revision history

Adm: Created page with "==Set Operations== We assume two sets '''A''' and '''B''' whose elements are listed line by line. *Set size: the number of elements in set A :wc -l A *Set inclusion..."

Adm: Created page with "==Set Operations== We assume two sets '''A''' and '''B''' whose elements are listed line by line. Set size: the number of elements in set A :`wc -l A` Set inclusion..."