CS 7542

CS 7542

Course information provided by the 2026-2027 Catalog.

Topics include scalable algorithms for sequence alignment, genome assembly, pangenomics, population genetics, and more, with an emphasis on irregular computation, graph analytics, sparse methods, and hardware acceleration.


Prerequisites CS 3410.

Last 4 Terms Offered (None)

Learning Outcomes

  • Characterize the computational structure of core genomics algorithms and identify opportunities for parallelism.
  • Formulate genomics problems using sparse linear algebra and graph-analytic primitives.
  • Analyze sources of irregular computation and evaluate mitigation strategies at the algorithmic and systems levels.
  • Evaluate hardware acceleration trade-offs, considering programmability and portability.
  • Interpret scaling experiments and critically assess performance claims in the literature.
  • Synthesize knowledge of HPC systems, algorithms, and genomics in written critiques and discussions.

View Enrollment Information

Syllabi: none
  •   Regular Academic Session. 

  • 1 Credit S/U NoAud

  • 19345 CS 7542   SEM 101

    • T
    • Guidi, G

  • Instruction Mode: In Person