Example for CountSorted node
Simple workflow that reads in a fastq file from NCBI/SRA (SRR001356, Illumina sequencing of Mouse brain transcript fragment library). Then the table is sorted by the sequence. Afterwards the Value counter and the Count sorted nodes are applied.
Unfortunately, this is a somewhat ill example as the data set is too small to really show that the CountSorted node is faster. We use the node on sam formatted files coming from the bowtie aligner, where we can safely assume that the reads are ordered by cluster ID. Thus we can identify unique reads...