Improving the efficiency of de Bruijn graph construction using compact universal hitting sets

Keyphrases

• Universal Hitting Sets 100%
• De Bruijn Graph Construction 100%
• K-mer 80%
• DNA Sequencing 60%
• Substring 40%
• Set-based 40%
• High-throughput Sequencing Analysis 40%
• Genome Assembly 40%
• Low Density 20%
• Large Volume 20%
• Memory Consumption 20%
• Fixed-length 20%
• Computation Time 20%
• Consecutive Windows 20%
• Efficient Data Structures 20%
• Biomedical Research 20%
• Ultra-high Speed 20%
• Sequence Method 20%
• Short Reads 20%
• Genomic Applications 20%
• Partitioning Algorithms 20%
• Assembly Task 20%
• Data Collection Algorithm 20%
• De Bruijn Graph 20%
• High-throughput Sequencing Technique 20%
• Improved Properties 20%

Computer Science

• High Throughput 100%
• Graph Construction 100%
• Data Structure 66%
• Large Data Set 33%
• Subgraphs 33%
• Predefined Order 33%
• Computation Time 33%

Mathematics

• Hitting Set 100%
• Data Structure 40%