2017/06/16 by Paul Medvedev, Medvedev, Paul · 1 voice · 1 citation
Biochemistry, Genetics and Molecular Biology · Computer Science · #Algorithms and Data Compression #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Biological sciences #FOS: Computer and information sciences #Genome Rearrangement Algorithms #Genomics (q-bio.GN) #Genomics and Phylogenetic Studies #cs.DM #cs.DS #q-bio.GN
paper · pdf · doi:10.48550/arxiv.1706.05429
openalex publication_date 2017/06/16 · arxiv published 2017/06/16 · arxiv updated 2018/01/02 · openalex created_date 2022/10/03 · openalex updated_date 2026/07/28
As computer scientists working in bioinformatics/computational biology, we often face the challenge of coming up with an algorithm to answer a biological question. This occurs in many areas, such as variant calling, alignment, and assembly. In this tutorial, we use the example of the genome assembly problem to demonstrate how to go from a question in the biological realm to a solution in the computer science realm. We show the modeling process step-by-step, including all the intermediate failed attempts.