SiLiX adopts a graph-theoretical framework to interpret similarity pairs as edges of a network. A very efficient algorithm, based on the Disjoint Sets Data Structure, allows the computation of sequence families with low time and space requirements.

A parallel version of SiLiX, based on MPI, is also available in this package and has been proved to be scalable, so that its allows the study of very large datasets.

SiLiX is already included in the analysis pipeline for HOGENOM.

Address of the bookmark: http://lbbe.univ-lyon1.fr/SiLiX?lang=fr

Address of the bookmark: https://github.com/AdamCicherski/AlfaPang

HECIL’s core algorithm by introducing an iterative learning paradigm that enhances the correction policy at each iteration by incorporating knowledge gathered from previous iterations via data-driven confidence metrics assigned to prior corrections.

Address of the bookmark: https://github.com/NDBL/HECIL

http://www.extension.org/pages/67926/upcoming-webinar:-selective-sequencing-through-combinatorial-pooling#.UggsVuHyPqU

Appointment Adv.No.2

Applications in plain paper are invited from Indian citizens for one/two position each of Research Associate, Traineeship and Studentship for BIF facility, Division of Life Sciences, IASST.

Applications with complete Bio-data containing contact address, e-mail and phone number, two recent passport size photographs and attested copies of mark sheets, certificates etc., should be sent to the Registrar, IASST, Paschim Boragaon, Garchuk, Guwahati – 781035, Assam, so as to reach on or before 5/05/2014.

A. Research Associate:

Number of vacancies: 1 (One)

Qualifications:

PhD in Bioinformatics or allied disciplines with knowledge of Bioinformatics. The candidates who have submitted PhD thesis may also apply.

In case, candidates having PhD are not found, candidates having MSc in Bioinformatics or allied disciplines with sound knowledge of Bioinformatics will be preferred.

Remuneration: Candidate having PhD will get a consolidated remuneration of Rs. 22,000/- +HRA per month. MSc having NET/GATE/SLET qualified candidate will get a remuneration of Rs. 16,000/= and HRA and candidate with only MSc will get a remuneration of Rs.14,000/- and HRA.

Tenure:

The post is initially for one year and may be extended depending on the performance till the tenure of the project.

B. Traineeship:

Number of vacancies: 2 (Two)

Qualifications:

Candidate with a postgraduate degree in Bioinformatics/Biotechnology/Life sciences from a recognised University

Remuneration: Rs. 5000/month for 6 months

C. Studentship:

Number of vacancies: 2 (Two)

Qualifications:

Candidate pursuing M.Sc in bioinformatics in a recognised University.

Remuneration: Rs. 5000/month for 6 months

Advertisement:

http://iasst.gov.in/pdf/recruitment/advt%20no_2_24042014.pdf

More at http://faculty.iisertvm.ac.in/~nishantkt/index.html

We developed a novel, self-contained technique named Near HGT, based on the synteny index, to measure the divergence of a gene from its native genomic environment and used it to identify candidate HGT events between closely related strains. The method confirms candidate transferred genes based on the constant relative mutability (CRM). Using CRM, the algorithm assigns a confidence score based on “unusual” sequence divergence. A gene exhibiting exceptional deviations according to both synteny and mutability criteria, is considered a validated HGT product. We first employed the technique to a set of three E. coli strains and detected several highly probable horizontally acquired genes. We then compared the method to existing HGT detection tools using a larger strain data set.

When combined with additional approaches our new algorithm provides richer picture and brings us closer to the goal of detecting all newly acquired genes in a particular strain.

Availability: The method is publicly available athttp://research.haifa.ac.il/~ssagi/software/nearHGT.zip

Address of the bookmark: http://journals.plos.org/ploscompbiol/article?id=10.1371/journal.pcbi.1004408

• Speed: Prodigal is an extremely fast gene recognition tool (written in very vanilla C). It can analyze an entire microbial genome in 30 seconds or less.
• Accuracy: Prodigal is a highly accurate gene finder. It correctly locates the 3' end of every gene in the experimentally verified Ecogene data set (except those containing introns). It possesses a very sophisticated ribosomal binding site scoring system that enables it to locate the translation initiation site with great accuracy (96% of the 5' ends in the Ecogene data set are located correctly).
• Specificity: Prodigal's false positive rate compares favorably with other gene identification programs, and usually falls under 5%.
• GC-Content Indifferent: Prodigal performs well even in high GC genomes, with over a 90% perfect match (5'+3') to the Pseudomonas aeruginosa curated annotations.
• Metagenomic Version: Prodigal can run in metagenomic mode and analyze sequences even when the organism is unknown.
• Ease of Use: Prodigal can be run in one step on a single genomic sequence or on a draft genome containing many sequences. It does not need to be supplied with any knowledge of the organism, as it learns all the properties it needs to on its own.
• Open Source: Prodigal source code is freely available under the General Public License.

Address of the bookmark: http://prodigal.ornl.gov/

Address of the bookmark: http://pasapipeline.github.io/