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.

It takes as an input a set of genomes represented as sequences of genes (or synteny blocks) and produces such sequences for ancestral genomes at the internal nodes of the phylogenetic tree.

The phylogenetic tree may be also specified completely or partially, in the latter case MGRA can reconstruct conserved ancestral regions (CARs) of the ancestral genome of interest.

Since version 2 MGRA supports gene insertion and deletions in addition to genome rearrangements and allows the input genomes to have different gene content.

It also can reconstruct most plausible phylogenetic tree based on the rearrangement characters.

Address of the bookmark: http://mgra.cblab.org/

More at http://ncb.qau.edu.pk/

Once a query gene has been entered, it is displayed in its genomic context in parallel to the genomic context of all its orthologous and paralogous copies in all the other sequenced metazoan genomes. Moreover, Genomicus stores and displays the predicted ancestral genome structure in all the ancestral species within the phylogenetic range of interest.

All the data on extant species displayed in this browser are from Ensembl.

Address of the bookmark: http://genomicus.biologie.ens.fr/genomicus-90.01/cgi-bin/search.pl

ADVERTISEMENT NO: NITR/SR/CH-BIF/2014/30

Applications are invited on prescribed format for the following assignment in a purely time bound research project undertaken in the Department of Biotechnology & Medical Engineering of the Institute.

1. Name of the Temporary Post : Senior Research Fellow-01
2. Name of the Research Project: “ Bioinformatics Infrastructure Facility (BIF)”
3. Name of the Sponsoring Agency: DBT, Government of India, 4 Tenure of the Project : 12th Five year Plan
5 Tenure of the Assignment : 01 year [Likely to be extended for 04 more years]
6 Job Description : BIF Maintenance and Active Research in Bioinformatics
7. Consolidated monthly compensation / Fellowship: Rs.18,000/- P.M.

8. Essential Qualifications and experience: B.Tech with valid GATE Score or M.Tech degree in Biotechnology/Bioinformatics/Computer Science/Computational Biology
9. Desirable Qualifications/ Experiences: Experience of Programming in PERL,R, Python, Unix and Visual Studio + Knowledge in NGS data analysis work flows ,WGS and statistical packages such as CRAN-R,MATLAB etc.

10. Accommodation : Bachelor accommodation in the Institute may be provided subject to availability.
11. For technical information on the project, the candidate may contact the Principal Investigator at the following address:

Name : Prof. Mukesh K Gupta
Address : Dept. of Biotechnology & Medical Engineering,
N.I.T.Rourkela-769 008
Telephone No : 0661-2462294
E-mail : guptam@nitrkl.ac.in

Eligible persons may apply in the prescribed format (available in the Institute Website)affixed with coloured photographs to be submitted in duplicate along with photo copies of relevant certificates, grade/ mark sheets, publications etc., to Asst. Registrar, SRICCE,
National Institute of Technology, Rourkela–769 008 before 22.08.2014. The cover should be super- scribed clearly the post applied for & Name of the Project.

Mere possession of minimum qualification does not guarantee invitation to the interview.
Candidates will be short listed based on merit and need of the project.

Advertisement:

http://www.nitrkl.ac.in/IntraWeb/Jobs_Tenders/Jobs/ProjectFellowship/2014/141707192838_1.pdf

Studentship and Traineeship in Bioinformatics

Applications are invited on plain paper from suitable candidates for Studentship and Traineeship (One each) at Bioinformatics Sub-Center as detailed below:

1. Studentship: Studentship is for those who have completed M. Sc. Degrees in Life Science.

Number of seats : One

Duration : Six months

Eligibility : Passed M.Sc. degree in Life Sciences.

Fellowship : Rs. 5000/- (Five thousand only) per month

2. Traineeship: Traineeship is for those who have completed M. Sc. Degrees in Life Science/Registered Ph. D. student in Life Sciences.

Number of seats : One

Duration : Six months

Eligibility : Passed M.Sc. degree in Life Sciences/ Registered Ph. D. student in Life Sciences

Fellowship : Rs. 5000/- (Five thousand only) per month

Preferences will be given to person who has experience in Bioinformatics and Computer
sciences. The application along with detailed bio-data should reach the undersigned, on or before 25th August 2014. Both, the studentship and the traineeship are temporary, will be discontinued after the six months from the date of Joining. It may be discontinued in-between without any notice, if the work is not found satisfactory.

Advertisement www.bioinfobubpl.nic.in/Advertisement_st.pdf

Address of the bookmark: https://sourceforge.net/projects/ksnp/files/

Following are the genome assembly tools based on string graph:

1.SGA (String Graph Assembler) https://github.com/jts/sga

Assembles large genomes from high coverage short read data. SGA is designed as a modular set of programs, which are used to form an assembly pipeline. SGA implements a set of assembly algorithms based on the FM-index. As the FM-index is a compressed data structure, the algorithms are very memory efficient. The SGA assembly has three distinct phases. The first phase corrects base calling errors in the reads. The second phase assembles contigs from the corrected reads. The third phase uses paired end and/or mate pair data to build scaffolds from the contigs. The output of this software is a PDF report that allows the properties of the genome and data quality to be visually explored. By providing more information to the user at the start of an assembly project, this software will help increase awareness of the factors that make a given assembly easy or difficult, assist in the selection of software and parameters and help to troubleshoot an assembly if it runs into problems.

2. SAGE: String-overlap Assembly of GEnomes https://github.com/lucian-ilie/SAGE2

SAGE, for de novo genome assembly. As opposed to most assemblers, which are de Bruijn graph based, SAGE uses the string-overlap graph. SAGE builds upon great existing work on string-overlap graph and maximum likelihood assembly, bringing an important number of new ideas, such as the efficient computation of the transitive reduction of the string overlap graph, the use of (generalized) edge multiplicity statistics for more accurate estimation of read copy counts, and the improved use of mate pairs and min-cost flow for supporting edge merging. The assemblies produced by SAGE for several short and medium-size genomes compared favourably with those of existing leading assemblers.

3. FSG: Fast String Graph

The new integrated assembler has been assessed on a standard benchmark, showing that fast string graph (FSG) is significantly faster than SGA while maintaining a moderate use of main memory, and showing practical advantages in running FSG on multiple threads. Moreover, we have studied the effect of coverage rates on the running times.

4.  BASE https://github.com/dhlbh/BASE

It enhances the classic seed-extension approach by indexing the reads efficiently to generate adaptive seeds that have high probability to appear uniquely in the genome. Such seeds form the basis for BASE to build extension trees and then to use reverse validation to remove the branches based on read coverage and paired-end information, resulting in high-quality consensus sequences of reads sharing the seeds. Such consensus sequences are then extended to contigs. BASE is a practically efficient tool for constructing contig, with significant improvement in quality for long NGS reads. It is relatively easy to extend BASE to include scaffolding.

5. Fermi https://github.com/lh3/fermi/

Fermi is a de novo assembler with a particular focus on assembling Illumina short sequence reads from a mammal-sized genome. In addition to the role of a typical assembler, fermi also aims to preserve heterozygotes which are often collapsed by other assemblers. Its ultimate goal is to find a minimal set of unitigs to represent all the information in raw reads.

If you want to learn about String Graph assembler, please read the following papers -

i) The Fragment Assembly String Graph - E. W. Myers

This paper describes the String Graph concept.

ii) Efficient construction of an assembly string graph using the FM-index - Jared T. Simpson and Richard Durbin

This earlier paper from Simpson and Durbin

iii) Efficient de novo assembly of large genomes using compressed data structures - Jared T. Simpson and Richard Durbin

Walk in interview for guest faculty in Pondicherry University, India. For more information please visit http://www.bicpu.edu.in/bioinfor140814.pdf

1. Supply your genes/genomic segments/phylogenetic tree of interest in the input-box by
   • selecting the type of identifier and pasting identifiers (one per line)
   • or by using the gene ID search tool
   • or with the BLAST search tool
2. Click "Visualize context".

Consult the documentation to learn more about MGcV.

Address of the bookmark: http://mgcv.cmbi.ru.nl/