1: Faster subsequence recognition in compressed strings 2: Faster exon assembly by sparse spliced alignment 3: Semi-local string comparison: algorithmic techniques and applications 4: Constant-degree graph expansions that preserve the treewidth