Finding Clumps in Strings in Go
We solve the problem of identifying which strings "clump" in a longer string, i.e., occur frequently in a short region of that string. After introducing an intuitive algorithm, we see how to optimize that algorithm, and then apply our approach to find clumps in the E. coli genome.
Like what you see? Please like, subscribe, and check out our free online course accompanying this video at https://programmingforlovers.com.
Check your work on this code along and get access to dozens of autograded exercises at Cogniterra: https://cogniterra.org/course/63/promo.
Join our P4❤️ community Discord: / discord
Help us grow our project by making a donation: https://www.paypal.com/donate?campaig....
00:00 Introduction
00:46 Writing a FindClumps() function
08:43 Determining if a string is contained in a slice
10:33 Using a map to keep track of strings we have encountered
13:29 Reading in a genome from file
22:21 Deferring a closed connection
25:43 Optimizing the clump finding algorithm
40:04 Applying the clump finding algorithm to a genome
43:25 Interpreting the results of our algorithm on E. coli
46:13 Pointer to our next code along, and happy coding! ❤️
Sur cette page du site, vous pouvez voir la vidéo en ligne Finding Clumps in Strings in Go durée heure minute seconde en bonne qualité , qui a été Téléchargé par l'utilisateur Philomath 16 novembre 2023, Partagez le lien avec vos amis et connaissances, sur youtube cette vidéo a déjà été regardée 780 fois et il a aimé 9 téléspectateurs. Bon visionnage!
