github.com - Generate unique k-mers for every contig in a FASTA file.
Unique k-mer is consisted of k-mer keys (i.e. ATCGATCCTTAAGG) that are only presented in one contig, but not presented in any other contigs (for both forward and reverse strands).
This tool...
github.com - Perform Alignment-free k-tuple frequency comparisons from sequences. This can be in the form of two input files (e.g. a reference and a query) or a single file for pairwise comparisons to be made.
The Computational Biology Group of Interdisciplinary Center for
Clinical Research (IZKF) Aachen, RWTH Aachen University Hospital,
Aachen, invites applicants for PhD candidate or postdoctoral position
in computational biology in one of the...
https://genomes.atcc.org/ - The ATCC Genome Portal (AGP, https://genomes.atcc.org/) is a database of authenticated genomes for bacteria, fungi, protists, and viruses held in ATCC’s biorepository. It now includes 3,938 assemblies (253% increase) produced under ISO...
Cost-effective whole human genome sequencing has revolutionized the landscape of genetic research and personalized medicine by making comprehensive genetic analysis accessible to a wider population. Through advancements in sequencing technologies,...
Dr. Jarvis’ laboratory studies the neurobiology of vocal communication. We want to know how the brain generates, perceives, and learns behavior. We use vocal communication as a model behavior. Emphasis is placed on the molecular pathways involved in...
github.com - Shovill is a pipeline which uses SPAdes at its core, but alters the steps before and after the primary assembly step to get similar results in less time. Shovill also supports other assemblers like SKESA, Velvet and Megahit, so you can take...
Indian Institute of Information Technology, Allahabad
Devghat, Jhalwa, Allahabad – 211012, Uttar Pradesh, India
E-mail: contact@iiita.ac.in, faculty.applications@iiita.ac.in
Web: www.iiita.ac.in Phone : 0532-2922031/27/67
Applications are...
code.google.com - lideSort-BPR ( b reak p oint r eads) is based on a fast algorithm for all-against-all comparisons of short reads and theoretical analyses of the number of neighboring reads. When applied to a dataset with a sequencing...