Our software, PASHA, uses a randomized heuristic for a Set Cover instance along with architectural techniques to efficiently compute near-optimal universal hitting sets (sets of k-mers that hit every sequence of a certain length) for k > 13 for the first time. 2/n
-
-
Prikaži ovu nit
-
Honored and humbled to have had the chance to work with two amazing supervisors,
@OrensteinYaron and Bonnie Berger, and grateful for their help and support. Open to collaborations on different applications of universal hitting sets of practical size! 3/n, n = 3.Prikaži ovu nit
Kraj razgovora
Novi razgovor -
-
-
Wowww, that sounds amazing, even if I can't understand a thing of it

congratulations
keep up the good work!!! 

Hvala. Twitter će to iskoristiti za poboljšanje vaše vremenske crte. PoništiPoništi
-
-
-
Congratulations Baris!!
Hvala. Twitter će to iskoristiti za poboljšanje vaše vremenske crte. PoništiPoništi
-
-
-
Nice job!
Hvala. Twitter će to iskoristiti za poboljšanje vaše vremenske crte. PoništiPoništi
-
Čini se da učitavanje traje već neko vrijeme.
Twitter je možda preopterećen ili ima kratkotrajnih poteškoća u radu. Pokušajte ponovno ili potražite dodatne informacije u odjeljku Status Twittera.
. 4-letter alphabets.