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 ...
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 ...