BOL: Related items

Mulan: MUltiple sequence Local AligNment and conservation visualization tool

Rahul Nayak — Thu, 20 Jul 2017 08:02:32 -0500

Mulan performs multiple (2 or more) sequence alignments with an efficient and rapid "full local" alignment strategy that ensures a recapitulation of evolutionary sequence rearrangements (such as inversions and reshuffling) in any of the species. It combines refine and tba tools to align either "draft" or "finished" quality sequences. Mulan provides a dynamic graphical interface to align and visualize conservation profiles for evolutionarily distant and closely related species.

Input formats, automated data upload from the UCSC Genome Browser, gene annotation, annotation of repetitive elements, and progress report were previously described in the zPicture instructions and we refer the users to these materials for more details. This introduction is mainly focused on some novel features unique to the Mulan.

Address of the bookmark: https://mulan.dcode.org/mulanInstructions.php

Affy has acquired Eureka Genomics for 15M $

Martin Jones — Wed, 20 May 2015 15:11:20 -0500

Affymetrix Acquires Assets Of Eureka Genomics Corporation To Provide High Throughput And Economical Crop And Animal Genotyping

http://www.thestreet.com/story/13151062/1/affymetrix-acquires-assets-of-eureka-genomics-corporation-to-provide-high-throughput-and-economical-crop-and-animal-genotyping.html

Many-to-many pairwise alignments of two sequence sets

Poonam Mahapatra — Tue, 19 Jun 2018 08:34:15 -0500

needleall reads a set of input sequences and compares them all to one or more sequences, writing their optimal global sequence alignments to file. It uses the Needleman-Wunsch alignment algorithm to find the optimum alignment (including gaps) of two sequences along their entire length. The algorithm uses a dynamic programming method to ensure the alignment is optimum, by exploring all possible alignments and choosing the best. A scoring matrix is read that contains values for every possible residue or nucleotide match. Needleall finds the alignment with the maximum possible score where the score of an alignment is equal to the sum of the matches taken from the scoring matrix, minus penalties arising from opening and extending gaps in the aligned sequences. The substitution matrix and gap opening and extension penalties are user-specified.

Address of the bookmark: http://emboss.sourceforge.net/apps/release/6.6/emboss/apps/needleall.html

Alessandra Carbone Lab

Tue, 26 May 2015 08:54:34 -0500

Our group works on various problems connected with the functioning and evolution of biological systems. We use mathematical tools, coming from statistics and combinatorics, algorithmic tools and molecular physics tools to study basic principles of cellular functioning starting from genomic data. We run several projects in parallel, all aiming at understanding the basic principles of evolution and co-evolution of molecular structures in the cell. They are intimately linked to each other.

Our main research themes are:

Domain annotation and metagenomics
Transcriptomics and sequence analysis
Protein evolution and interactions
Protein conformational dynamics

More at http://www.lcqb.upmc.fr/AnalGenom/home.html

X. Shirley Liu Lab

Tue, 26 May 2015 17:28:23 -0500

The research in our laboratories are focused on the following three areas:

Bioinformatics
Cancer
Epigenetics

More at http://liulab.dfci.harvard.edu/

MSAProbs - Parallel and accurate multiple sequence alignment

Neel — Tue, 09 Jul 2019 23:58:44 -0500

MSAProbs is a well-established state-of-the-art multiple sequence alignment algorithm for protein sequences. The design of MSAProbs is based on a combination of pair hidden Markov models and partition functions to calculate posterior probabilities. Assessed using the popular benchmarks: BAliBASE, PREFAB, SABmark and OXBENCH, MSAProbs achieves statistically significant accuracy improvements over the existing top performing aligners, including ClustalW, MAFFT, MUSCLE, ProbCons and Probalign. In addition, MSAProbs is optimized for shared-memory CPUs by employing a multi-threaded design, and further parallelized for distributed-memory systems using MPI to overcome high memory overhead barrier and achieve good parallel and data-size scalability.

Address of the bookmark: http://msaprobs.sourceforge.net/homepage.htm#latest

RA Bioinformatics at NATIONAL BUREAU OF ANIMAL GENETIC RESOURCES

Thu, 28 May 2015 19:25:33 -0500

NATIONAL BUREAU OF ANIMAL GENETIC RESOURCES

Near Basant Vihar G.T. Road Bypass P.O. Box No.129

Karnal - 132001 (Haryana)

WALK-IN-INTERVIEW

A walk-in-Interview is proposed to be held at National Bureau of Animal Genetic Resources, Karnal (Haryana)-132001 at 10:30 AM on 10.06.2015 to select One Research Associate as per details given below:

1. One post of Research Associate under National Fellow project entitled “Genome data mining to unravel molecular basis of thermotolerance and adaptation to diverse environments in native cattle and buffaloes”.

The post duration is Upto 22.05.2016 or earlier & Co-terminus with the project.

Essential Qualifications: Master’s degree (M.Sc. / M.V.Sc.) in Biotechnology/ Animal Genetics and Breeding/ Life Sciences/ Bioinformatics with 2 Years research experience in relevant subject or Ph.D in any of the above subjects.

Desirable: Working Experience in molecular biology, gene expression/ microarray data analysis, SNP genotyping and sequence data analysis, mammalian cell-culture handling etc.

Emolument: Rs. 23,000/- per month + HRA as per admissibility

Research Associate: ONE

Duration of engagement: Upto 22.05.2016 or earlier Co-terminus with the project

Age Limit:  40 years for Men  45 years for women as on date of interview

Note: Relaxation in age will be admissible for SC/ST & OBC candidates as per Govt. of India /ICAR norms

1. The applicants must bring with them original documents and brief of research work done during post graduation along with a set of photocopy and latest two passport size photographs. 2. A panel of selected candidates will also be made which may be utilized for filling of positions of shorter durations in future if demand arises. 3. Experience certificate in original, if any 4. The above positions are purely on temporary basis and are coterminus with the project. No TA/DA will be paid to attend the interview. 5. Any other clarifications can be had on the date of interview. 6. The Director’s decision will be final and binding on all respects.

Advertisement: http://210.212.93.85/RAadvertisiment.pdf

Shouji: a fast and efficient pre-alignment filter for sequence alignment

Jit — Mon, 04 Nov 2019 07:09:45 -0600

The ability to generate massive amounts of sequencing data continues to overwhelm the processing capacity of existing algorithms and compute infrastructures. In this work, we explore the use of hardware/software co-design and hardware acceleration to significantly reduce the execution time of short sequence alignment, a crucial step in analyzing sequenced genomes.

We introduce Shouji, a highly parallel and accurate pre-alignment filter that remarkably reduces the need for computationally-costly dynamic programming algorithms. The first key idea of our proposed pre-alignment filter is to provide high filtering accuracy by correctly detecting all common subsequences shared between two given sequences. The second key idea is to design a hardware accelerator design that adopts modern FPGA (field-programmable gate array) architectures to further boost the performance of our algorithm.

More at https://github.com/CMU-SAFARI/Shouji

Address of the bookmark: https://github.com/CMU-SAFARI/Shouji

JRF Position – Bioinformatics Department, Aravind Medical Research Foundation (AMRF), Madurai.

Fri, 12 Jun 2015 05:42:12 -0500

Applications are invited from eligible candidates for the post of Junior Research Fellow (JRF) to work at the Department of Bioinformatics, Aravind Medical Research Foundation in the following DST-SERB funded project “Clinical exome analysis pipeline for eye disease next-generation sequencing panel”.

Post: Junior Research Fellow (1 Position)

Duration: Three years

Qualification: First class in M.Sc/M.tech in Bioinformatics/Life Sciences/Biophysics/ Biostatistics/Bioengineering. Experience in Database development, NGS data analysis, Systems Biology and Structural Bioinformatics is desired. Preference will be given to the candidates with good computer programming skills in C, C++, R, Perl, PHP, Unix Scripting etc.

Selected candidates will be paid fellowship as per existing DST norms.

How to apply:

Candidates are requested to apply through one of the two modes given below
1. Online application – Click here to submit the online application https://docs.google.com/forms/d/16h2GLnQ-Ny-tLtlgfY3Bx3sCjeHJE30cfhJaDqW_uRs/viewform?c=0&w=1
2. Application forms can be downloaded from here.https://docs.google.com/file/d/0BwwJEudQStxFWXdNWXl4NWtDaWc/edit
Filled in application form should be sent by post to Dr. D. Bharanidharan, Department of Bioinformatics, Aravind Medical Research Foundation No 1, Anna Nagar Madurai – 625 020,

Candidates should apply by online or submit their applications by post on or before 15th June, 2015. Only Short listed candidates will be called for an interview. No TA/DA will be paid.

CLARK: Fast, accurate and versatile sequence classification system

Jit — Sat, 15 Feb 2020 01:49:01 -0600

CLARK, a method based on a supervised sequence classification using discriminative k-mers. Considering two distinct specific classification problems (see the article for details), namely (1) the taxonomic classification of metagenomic reads to known bacterial genomes, and (2) the assignment of BAC clones and transcript to chromosome arms/centromeres (in the absence of a finished assembly for the reference genome), CLARK outperforms in classification speed and precision the best state-of-the-art methods.

http://clark.cs.ucr.edu/Spaced/

Address of the bookmark: http://clark.cs.ucr.edu/Spaced/