Click on a keyword to filter my blog content + then scroll down to have a read.

April 2, 2018

The following is an excellent guide to understanding Ukkonen's linear-time suffix tree construction algorithm.

October 1, 2017

Traversing, or searching, a tree involves visiting each node of ...

May 2, 2017

I found a great video on YouTube in which an simple explanation of time complexity is given.

March 15, 2017

Burrows-Wheeler Transform, or BWT, is a text indexing algorithm, which is used in data compression applications.

March 13, 2017

This genome assembly approach utilises an existing complete reference genome sequence to assemble newly sequenced genome, by aligning...

February 21, 2017

The Hamming distance dH between two strings x and y is...

February 11, 2017

To split a file by a number of lines, use the following command...

February 9, 2017

To print the number of lines in...

July 1, 2016

The border of a string x is defined as a substring u which is both a prefix and suffix of x = uvu, where v is an infix of x.

April 15, 2016

An Eulerian walk through a graph visits each edge exactly once.

Please reload

Please reload

See posts from

PhDomics by Fatima