www.simonsfoundation.org - Complete genome sequences from more than one hundred diverse human populations
All genomes in the dataset were sequenced to at least 30x coverage using Illumina technology. The sequencing reads were mapped and genotyped using a customized procedure...
Ongoing research in the group of Karine Van Doninck involves topics at the core of
evolutionary biology, including the evolution of sex, genome maintenance,
recombination and extreme stress resistance on different eukaryotic systems,
including...
www.science.org - Telomere-to-telomere consortium
We have sequenced the CHM13hTERT human cell line with a number of technologies. Human genomic DNA was extracted from the cultured cell line. As the DNA is native, modified bases will be preserved. The data includes...
To find repeats in a genome from 2 to 9 length using a Perl script, you can use the RepeatMasker tool with the "--length" option[0]. Here's a step-by-step guide:
Install RepeatMasker: First, you need to install RepeatMasker on your system. You...
ikim-essen.github.io - UnCoVar: Workflow for Transparent and Robust Virus Variant Calling, Genome Reconstruction and Lineage Assignment
Using state of the art tools, easily extended for other viruses
Tool and database updates for critical components via...
github.com - npScarf (jsa.np.npscarf) is a program that scaffolds and completes draft genomes assemblies in real-time with Oxford Nanopore sequencing. The pipeline can run on a computing cluster as well as on a laptop computer for microbial datasets. It...
ftp.genomics.org.cn - RePS (Repeat-masked Phrap with scaffolding), a WGS sequence assembler, that explicitly identifies exact kmer repeats from the shotgun data and removes them prior to the assembly. The established software Phrap is used to compute meaningful error...
omega.omicsbio.org - Omega found overlaps between reads using a prefix/suffix hash table. The overlap graph of reads was simplified by removing transitive edges and trimming short branches. Unitigs were generated based on minimum cost flow analysis of the overlap graph...
github.com - Miniasm is a very fast OLC-based de novo assembler for noisy long reads. It takes all-vs-all read self-mappings (typically by minimap) as input and outputs an assembly graph in the GFA format. Different from mainstream...