Tools

• Parsnp - Core-genome alignment and analysis
• Gingr - Interactive visualization of alignments, trees and variants
• HarvestTools - Archiving and postprocessing

Citation

Treangen TJ, Ondov BD, Koren S, Phillippy AM. The Harvest suite for rapid core-genome alignment and visualization of thousands of intraspecific microbial genomes. Genome Biology, 15 (11), 1-15 [PDF]

Address of the bookmark: http://harvest.readthedocs.io/en/latest/index.html

A walk-in-interview will be held on 15.7.2013 at 12 noon in the Department of Biophysics, Molecular Biology and Bioinformatics, 92 A.P.C Road, Kolkata-700 009 to select one trainee research fellow and two students under DIC. The positions are purely temporary and would be for a period of six months from the date of joining which may be extended by another six months subject to successful performance.

Qualification:

For the Trainee Research Fellow: Should have a master degree in Bioinformatics or allied subjects and should have biological database development experience. Must have at least one publication.

For the Students: Should have a master degree in Bioinformatics or allied subjects and should be proficient in C-programming language. Must be familiar with techniques of Developmental Biology.

The Trainee Research Fellow would be paid a consolidated sum of Rs 10000/- per month and the students would be paid a sum amount Rs. 7000/- per month during the tenure of the project.

Advertisement:
www.caluniv.ac.in/News%20&%20Announcement/trainee_rf_DIC.pdf

Address of the bookmark: http://samtools.sourceforge.net/swlist.shtml

DBT-Junior Research Fellowship (DBT-JRF) in Biotechnology (2020)

BIOTECHNOLOGY ELIGIBILITY TEST (BET) 2020

Applications are invited from bonafide Indian citizens, residing in India for award of “DBT-Junior Research Fellowship” (DBT-JRF) for pursuing research in frontier areas of Biotechnology and Life Sciences. The candidates will be selected through “Biotechnology Eligibility Test (BET)”. Based on the performance in BET, two categories of merit list will be prepared (Category-I and Category-II). Government of India norms for reservation will be followed for selection. Candidates selected under category-I will be eligible to avail fellowship under the programme. These will be tenable at any University/Institute in India where the selected candidate registers for PhD Programme. Candidates selected under Category-II will be eligible to be appointed in any DBT sponsored project and avail fellowship from the project equivalent to NET/GATE, subject to selection through institutional selection process. There will be no binding on Principal Investigators of DBT sponsored projects to select JRF for their project from category-II list. Selection in category-II will not entitle student for any fellowship from DBT-JRF programme.

ELIGIBILITY

Qualification: M.Sc./ M.Tech./ M.V.Sc. or equivalent degree/ Integrated BS-MS/ B.E./ B.Tech. in any discipline of Biotechnology, M.Sc./ M.Tech. Bioinformatics/ Computational Biology, students admitted under DBT supported Postgraduate Teaching Programs. M.Sc. Life Science/ Bioscience/ Zoology/ Botany/ Microbiology/ Biochemistry/ Biophysics and Masters in Allied areas of Biology/Life Sciences. Candidates appearing in the final year examination are also eligible to apply.

Marks: Minimum 60% marks for General, EWS & OBC category and 55% for SC/ ST/ Differently abled in aggregate (or equivalent grade).

Age Limit: Upto 28 years as on the last date of application for General & EWS category. Age relaxation of up to 5 years (33 years) for SC/ ST/ Differently Abled/ women candidates and upto 3 years (31 years) for OBC (Non-Creamy Layer) candidates.

For detailed procedure for filling the application form, payment of application fee and uploading of required documents/ certificates in the prescribed format, please visit: http://rcb.res.in/BET2020. A non-refundable and non-transferable application fee of Rs. 1000/-is payable online by General/ OBC/ EWS candidates and Rs 250/- by SC/ ST/ Differently abled candidates.

IMPORTANT DATES

http://www.uib.no/rs/mcb

Classificier of reads from metagenomic sequencing experiments.

•  Kawulok, J., Deorowicz, S., CoMeta: Classification of Metagenomes Using k-mers, PLOS ONE, 2015; 10(4):1–23,

CoMSA

Compressor of multiple sequence alignments of proteins.

•  Deorowicz, S., Walczyszyn, J., Debudaj-Grabysz, A., CoMSA: compression of protein multiple sequence alignment files, Bioinformatics, 2019; 35(2):22–234,

DSRC

Compressor of sequencing reads.

•  Roguski, L., Deorowicz, S., DSRC 2: Industry-oriented compression of FASTQ files, Bioinformatics, 2014; 30(15):2213–2215,
•  Deorowicz, S., Grabowski, Sz., Compression of DNA sequences in FASTQ format, Bioinformatics, 2011; 27(6):860–862,

FAMSA

Multiple sequence alignment designed for huge families of proteins (even containing hundreds of thousands of sequences).

•  Deorowicz, S., Debudaj-Grabysz, A., Gudys, A., FAMSA: Fast and accurate multiple sequence alignment of huge protein families, Scientific Reports, 2016; 6(33964):

FaStore

Compressor of FASTQ files.

•  Roguski, L., Ochoa, I., Hernaez, M., Deorowicz, S., FaStore - a space-saving solution for raw sequencing data, Bioinformatics, 2018; 34(16):2748–2756,

FQSqueezer

Experimental high-end compressor of FASTQ files.

•  Deorowicz, S., FQSqueezer: k-mer-based compression of sequencing data, Scientific Reports, 2020; 10(578):

GDC

Compressor of collections of genome sequences.

•  Deorowicz, S., Danek, A., Niemiec, M., GDC 2: Compression of large collections of genomes, Scientific Reports, 2015; 5(11565):1–12,
•  Deorowicz, S., Grabowski, Sz., Robust relative compression of genomes with random access, Bioinformatics, 2011; 27(21):2979–2986,

GTC

Genotype databases compressor with support for fast queries.

•  Danek, A., Deorowicz, S., GTC: how to maintain huge genotype collections in a compressed form, Bioinformatics, 2018; 34(11):1834–1840,

GTShark

Genotypes compressor.

•  Deorowicz, S., Danek, A., GTShark: Genotype compression in large projects, Bioinformatics, 2019; 35(22):4791–4793,

KMC

Memory frugal k-mer counter.

•  Kokot, M., Długosz, M., Deorowicz, S., KMC 3: counting and manipulating k -mer statistics, Bioinformatics, 2017; 33(17):2759–2761,
•  Deorowicz, S., Kokot, M., Grabowski, Sz., Debudaj-Grabysz, A., KMC 2: Fast and resource-frugal k-mer counting, Bioinformatics, 2015; 31(10):1569–1576,
•  Deorowicz, S., Debudaj-Grabysz, A., Grabowski, Sz., Disk-based k-mer counting on a PC, BMC Bioinformatics, 2013; 14():Article no. 160,

Kmer-db

Tool for estimation of evolutionary distances in a collection of genomes.

•  Deorowicz, S., Gudys, A., Dlugosz, M., Kokot, M., Danek, A., Kmer-db: instant evolutionary distance estimation, Bioinformatics, 2019; 35(1):133–136,

MuGI

Index allowing queries for a collection of multiple genome sequences.

•  Danek, A., Deorowicz, S., Grabowski, Sz., Indexes of Large Genome Collections on a PC, PLOS ONE, 2014; 9(10):e109384,

ORCOM

Experimental compressor of sequencing reads.

•  Grabowski, Sz., Deorowicz, S., Roguski, L., Disk-based compression of data from genome sequencing, Bioinformatics, 2014; 31(9):1389–1395,

PgSA

Index allowing queries for a collection of sequencing reads.

•  Kowalski, T., Grabowski, Sz., Deorowicz, S., Indexing arbitrary-length k-mers in sequencing reads, PLOS ONE, 2015; 10(7):1–16,

QuickProbs

Multiple sequence alignment designed especially for GPU.

•  Gudys, A., Deorowicz, S., QuickProbs 2: towards rapid construction of high-quality alignments of large protein families, Scientific Reports, 2017; 7(41553):
•  Gudys, A., Deorowicz, S., QuickProbs – A Fast Multiple Sequence Alignment Algorithm Designed for Graphics Processors, PLOS ONE, 2014; 9(2):e88901,

RECKONER

Read error corrector.

•  Maciej Długosz, M., Deorowicz, S., RECKONER: read error corrector based on KMC, Bioinformatics, 2017; 33(7):1086–1089,

TGC

Compressor of collections of genomes given in Variant Call Format (VCF) files.

•  Deorowicz, S., Danek, A., Grabowski, Sz., Genome compression: a novel approach for large collections, Bioinformatics, 2013; 29(20):2572–2578,

VCFShark

Compressor of VCF files.

•  Deorowicz, S., Danek, A., GTShark: Genotype compression in large projects, biorxiv.org, 2020; ():

Whisper

Experimental mapper of whole genome sequencing data.

•  Deorowicz, S., Gudys, A., Whisper 2: indel-sensitive short read mapping, bioRxiv.org, 2019; :
•  Deorowicz, S., Debudaj-Grabysz, A., Gudys, A., Grabowski, Sz., Whisper: read sorting allows robust robust mapping of DNA sequencing data, Bioinformatics, 2019; 35(12):2043–2050,
•  Deorowicz, S., Debudaj-Grabysz, A., Gudys, A., Grabowski, Sz., Robust mapping of whole genome sequencing data, Poster at The Biology of Genomes Conference, 2017;

Main mission:

Develop and implement strategies for whole-genome sequencing of non-model
species
Generate high-quality de novo genome assemblies using short- and long-read
sequencing technologies
Perform genome annotation and structural/functional characterization
Conduct comparative genomic analyses across related species or populations
Design and implement genome-wide association studies (GWAS) to identify
loci associated with phenotypic or adaptive traits
Integrate genomic, phenotypic, and environmental datasets
Contribute to the development of reproducible bioinformatics pipelines

Activités (Activities):

Lead the genomic component of the research project
High-molecular-weight DNA extraction optimization
Long-read genome assembly (PacBio HiFi / ONT)
Genome polishing and quality assessment (BUSCO, QUAST)
Structural and functional annotation
Variant discovery (SNPs, indels, SVs)
Population genomic analyses (FST, demographic inference)
Mixed-model GWAS accounting for structure
Workflow development (Snakemake/Nextflow)
HPC-based pipeline implementation
Publish results in peer-reviewed journals
Present findings at international conferences
Collaborate with experimental and computational team members
Contribute to project development
Mentor graduate students when appropriate

More at https://evol.mcmaster.ca/brian/evoldir/PostDocs//MontpellierU.ComparativeGenomics

http://elements.eaglegenomics.com/

1. SPAdes: An assembler specifically designed for single-cell and multi-cell bacterial genomes, as well as small eukaryotic genomes.

2. ABySS: A parallelized assembler for large genomes that uses de Bruijn graphs.

3. Velvet: Another de Bruijn graph-based assembler optimized for short-read sequencing data.

4. SOAPdenovo: A de Bruijn graph-based assembler designed for short reads, widely used for assembling large and complex genomes.

5. MaSuRCA: A hybrid assembler that combines data from multiple sequencing technologies, such as Illumina and PacBio.

6. Canu: A long-read assembler optimized for PacBio and Oxford Nanopore sequencing data.

7. Flye: A long-read assembler suitable for bacterial and small eukaryotic genomes.

8. SMARTdenovo: An assembler designed for long reads, particularly suited for PacBio data.

9. SPAdes Long Read (SPAdesLR): An extension of SPAdes for long-read data, such as those from PacBio or Nanopore.

10. Minia: An assembler optimized for low memory consumption, suitable for small and medium-sized genomes.

11. Unicycler: A hybrid assembler that combines short and long reads for circular bacterial genome assembly.

12. wtdbg2: A de Bruijn graph assembler for long reads, efficient for very large genomes.

13. Shasta: A long-read assembler that uses the Overlap-Layout-Consensus approach, suitable for PacBio and Nanopore data.

14. Sparc: An assembler designed to handle noisy long reads from Nanopore sequencing.

15. CANA: An assembler for metagenomic data, particularly for complex and diverse microbial communities.

16. Ra Assembler: A metagenome assembler for long reads, designed for highly complex metagenomic samples.

Please note that the field of bioinformatics is constantly evolving, and new assembly tools may have emerged since my last update. Additionally, the performance of these tools can vary depending on the characteristics of the sequencing data and the genome being assembled. When selecting an assembly tool, consider the specific requirements of your project, the available data types, and the computational resources at your disposal. Always refer to the respective tool's documentation and publications for the most up-to-date information and recommendations.