Coursera Flash Sale
40% Off Coursera Plus for 3 Months!
Grab it
Learn about the Prokrustean Graph, a novel substring index designed for rapid k-mer size analysis in computational genomics, in this 28-minute conference talk from the Computational Genomics Summer Institute. Explore how this innovative data structure addresses the critical challenge of selecting optimal k-mer sizes for genomic applications, particularly genome assembly. Discover the theoretical foundations and practical implementations of this substring indexing approach that enables efficient analysis across multiple k-mer sizes simultaneously. Examine the relationship between k-mer size selection and assembly quality, understanding how automated methods can improve upon traditional manual selection processes. Gain insights into the computational complexity and space efficiency considerations of the Prokrustean Graph compared to existing indexing methods. Understand the broader context of substring indices in computational biology and their applications in sequence analysis, including connections to compressed text indices and linear time construction algorithms. Review recent advances in measuring sequence growth and similarity that complement k-mer analysis techniques, providing a comprehensive view of modern approaches to genomic sequence processing and analysis.
