Guillaume Marçais

1 ta ish

University of Maryland, College Park

1. A fast, lock-free approach for efficient parallel counting of occurrences of <i>k</i> -mers

   Guillaume Marçais, Carl Kingsford

   MaqolaOAOchiq kirish20117 iqtibos

   ABIABI:AkademIndex/2026.other.206806