Key Features of BLAST:
1. Sequence Comparison: BLAST searches for local alignments between the query sequence and sequences in a database. It identifies regions of similarity, which can help infer functional and evolutionary relationships.

2. Speed and Efficiency: BLAST uses heuristic algorithms, making it faster than exhaustive search methods, suitable for large-scale database searches.

3. Versatility: There are several versions of BLAST for different types of sequence comparisons:
- blastn: Compares a nucleotide query sequence against a nucleotide sequence database.
- blastp: Compares a protein query sequence against a protein sequence database.
- blastx: Compares a nucleotide query sequence translated in all reading frames against a protein sequence database.
- tblastn: Compares a protein query sequence against a nucleotide sequence database translated in all reading frames.
- tblastx: Compares the six-frame translations of a nucleotide query sequence against the six-frame translations of a nucleotide sequence database.

4. Scoring and E-value: BLAST results are scored based on the quality and length of the alignments. The E-value (expect value) indicates the number of alignments one can expect to find by chance, with lower E-values representing more significant matches.

5. Output Formats: BLAST provides results in various formats, including plain text, HTML, XML, and JSON, making it adaptable for different types of analyses and integrations with other tools.

Applications of BLAST:
- Genomic Research: Identifying genes, understanding genetic diversity, and mapping genome sequences.
- Protein Function Prediction: Inferring the function of unknown proteins by comparing them to known protein sequences.
- Evolutionary Studies: Exploring evolutionary relationships between organisms by comparing their genetic material.
- Medical Research: Identifying pathogens, understanding disease mechanisms, and developing treatments by comparing sequences of interest.

Overall, BLAST is an essential tool in bioinformatics, offering a reliable and efficient way to analyze and interpret biological sequence data.

(A) Senior Research Fellow (One Post): Emoluments as per DST/DBT norms.

Candidates having M.Sc. degree (with minimum of 55% marks) or equivalent in Life Sciences/Biotechnology/Bioinformatics/ Molecular Biology or any other related field with minimum of two years of post M.Sc. research experience are eligible to apply. The candidate having computer skill (Linux, Perl, Java, MySQL) and/or experience in advanced molecular biology, next generation sequencing data analysis and molecular markers analysis will be preferred.

The position is completely on temporary basis and co-terminus with the project. The initial appointment will be for one year, which can be curtailed/extended on the basis of assessment of the candidate’s performance and discretion of the Competent Authority. NIPGR reserves the right to select the candidate against the above posts depending upon the qualifications and experience of the candidates. Reservation of posts shall be as per Govt. of India norms.

Eligible candidates may apply by sending hard copy of completed application in the given format with a cover letter showing interest and attested copies of the certificates and proof of research experience. The applications should reach at the address given below within 15 days from the date of the advertisement. The subject line on envelope must be superscribed by “Application for the Post of SRF in DST - AISRF project”.

Note: ONLY hard copy of the application in the given format will be accepted.

Last date April 03, 2014

Dr. Mukesh Jain
Staff Scientist
National Institute of Plant Genome Research
Aruna Asaf Ali Marg, P.O. Box NO. 10531,
New Delhi - 110067

Advertisement: http://www.nipgr.res.in/careers/vacancies_latest.php#

Address of the bookmark: https://github.com/PapenfussLab/gridss

Address of the bookmark: https://github.com/liviurotiul/PeGAS

Address of the bookmark: https://github.com/cauyrd/SVfinder

http://www.putonti-lab.com/uploads/4/5/3/0/45307835/s-plot2_tutorial.pdf

http://journals.sagepub.com/doi/pdf/10.1177/1176934318797354

Address of the bookmark: https://bitbucket.org/lkalesinskas/splot

As a computational genomicists our work involves examining billions of DNA base pairs and interpreting how variation impacts basic biology and disease. We develop computational methods and resources for the functional annotation of genomes with a special emphasis on sequencing-based assays (e.g. ChIP-seq, RNA-Seq, exome- and whole-genome sequencing, single-cell analysis).

http://www.computationalgenomics.ca

Link to working demo: https://vgteam.github.io/sequenceTubeMap/

Address of the bookmark: https://github.com/vgteam/sequenceTubeMap

• FracMinHash sketching, which enables accurate comparisons (including ANI) between data sets of different sizes
• sourmash gather, a combinatorial k-mer approach for more accurate metagenomic profiling

Please see the sourmash publications for details.

The name is a riff off of Mash, combined with @ctb's love of whiskey. (Sour mash is used in making whiskey.)

Maintainers: C. Titus Brown (@ctb), Luiz C. Irber, Jr (@luizirber), and N. Tessa Pierce-Ward (@bluegenes).

sourmash was initially developed by the Lab for Data-Intensive Biology at the UC Davis School of Veterinary Medicine, and now includes contributions from the global research and developer community.

Address of the bookmark: https://github.com/sourmash-bio/sourmash