Q&A: Algorithm achieves near end-to-end genome assembly without ultra-long DNA sequencing

Haoyu Cheng, Ph.D., assistant professor of biomedical informatics and data science at Yale School of Medicine, has developed a new algorithm capable of building complete human genomes using standard ...

Chinese AI Algorithm Congzi to Be Released as Open Source

This breakthrough technology is based on the first-principles approach, eliminating the traditional AI "black box illusion." The revolutionary aspect of Congzi AI lies in its unified core equation of ...
IEEE

Parallel Tall-and-Skinny QR Factorization Based on LU-CholeskyQR Algorithm

We present optimal parallel QR factorization algorithms with reduced communication overhead. QR factorization is widely applied to solve various problems in numerical linear algebra. Our focus is on ...
IEEE

An Efficient Parallel and Adaptive Algorithm for Large-Scale Multiple Longest Common Subsequence Problems

Abstract: The Multiple Longest Common Subsequence (MLCS) Problem is to find one or more longest common subsequences from multiple (≥ 3) strings. However, as the scale of the sequences increases, the ...
GitHub

Can Large Language Models Predict Parallel Code Performance?

We took this version of HeCBench and are modifying it to build the CUDA and OMP codes to gather their roofline performance data. So far we have a large portion of the CUDA and OMP codes building ...
GitHub

Diffusion Forcing: Next-token Prediction Meets Full-Sequence Diffusion

@article{chen2025diffusion, title={Diffusion forcing: Next-token prediction meets full-sequence diffusion}, author={Chen, Boyuan and Mart{\'\i} Mons{\'o}, Diego and ...