Related Experiment Video
Updated: Dec 25, 2025
11:41
Mapping Mammalian 3D Genome Interactions with Micro-C-XL
Published on: November 3, 2023
3.4K
GenMap: ultra-fast computation of genome mappability.
Christopher Pockrandt1,2,3,4, Mai Alzamel5,6, Costas S Iliopoulos5
1Center for Computational Biology, School of Medicine.
Bioinformatics (Oxford, England)
|April 5, 2020
Summary
GenMap efficiently computes k-mer uniqueness across genomes, even with mismatches. This tool aids in designing guide RNAs and probes by identifying unique or shared k-mers.
Area of Science:
- Genomics
- Bioinformatics
- Computational Biology
Background:
- Computing k-mer uniqueness with mismatches is essential for biological applications like CRISPR guide RNA design.
- The (k, e)-mappability quantifies k-mer occurrence frequency with up to 'e' mismatches.
Purpose of the Study:
- To present GenMap, a fast method for computing (k, e)-mappability.
- To extend mappability computation for cross-genome analysis, identifying k-mers unique to or shared across genomes.
- To facilitate marker sequence computation and probe design candidate identification.
Main Methods:
- Developed GenMap, an extension of existing mappability algorithms.
- Implemented efficient computation of (k, e)-mappability for single and multiple genomes.
- Supported various output formats including binary, wig, bed, and CSV.
Main Results:
- GenMap provides a fast computation of (k, e)-mappability.
- The method enables cross-genome analysis for identifying unique or conserved k-mers.
- Output formats facilitate downstream analysis for marker discovery and probe design.
Conclusions:
- GenMap offers a computationally efficient solution for assessing k-mer uniqueness with mismatches.
- The tool supports versatile applications in genomics, including CRISPR design and marker discovery.
- GenMap is readily available for installation and use in bioinformatics research.
