Johnathan Wong

biHash is a rolling hash algorithm designed for bisulfite-sequenced data, offering faster hashing by recognizing bisulfite-compatible sequence states.

aaKomp provides a fast, memory-efficient, alignment-free method for genome completeness assessment, outperforming existing tools in speed and scalability.

The paper introduces ntSynt, a tool for detecting multi-genome synteny blocks using minimizer graphs, showing high coverage and efficiency across diverse genomes.

GoldPolish-Target polishes targeted regions of genome assemblies, reducing errors and improving accuracy with lower computational demands.

ntRoot infers human super-population ancestry from genomic data with high accuracy and efficiency, outperforming traditional methods on large datasets.

GoldRush is a de novo long read genome assembler with linear time complexity, achieving efficient assembly of large genomes with high contiguity and low memory usage.

aaHash is a recursive amino acid sequence hashing algorithm that improves speed and sensitivity for protein sequence analysis.

LongStitch improves draft genome assemblies using long reads, significantly increasing contiguity and accuracy compared to existing methods.

The paper analyzes APA patterns in 114 cancer-related genes across 33 cancer types to show complex 3 UTR cleavage changes in tumors.