BOL: Related items

PostDocs positions in computer science in HELSINKI, FINLAND

Fri, 06 Sep 2013 10:11:19 -0500

Several university departments in the Helsinki region, Finland, are looking for postdoctoral researchers in the field of computer science and information technology. Jobs are available at:
· Helsinki Institute for Information Technology HIIT, Aalto University and University of Helsinki, http://www.hiit.fi
· Department of Computer Science, University of Helsinki, http://www.cs.helsinki.fi
· Department of Information and Computer Science, Aalto University, http://ics.aalto.fi
· Department of Computer Science and Engineering, Aalto University, http://cse.aalto.fi
· Department of Mathematics and Statistics, University of Helsinki, http://mathstat.helsinki.fi/english/

Why Helsinki?
The collaborating Aalto University and University of Helsinki form a leading hub of computer science and modelling, including Machine learning, Data mining, Algorithms, Computational Logic, Cloud computing, Distributed computing, Human-centric ubiquitous ICT, Bioinformatics, etc.
Helsinki region is a safe, pleasant and attractive place to live in, with well-functioning services such as public transport etc. Finland has a comprehensive social security and health care system, including exceptionally good parental leaves, and children's day care services.

Positions are offered in:
Algorithm engineering (String Algorithms group)
Algorithmic bioinformatics (Genome-Scale Algorithmics group)
Automated reasoning and search, especially propositional logic (Computational Logic group)
Computational astrophysics and/or data analysis (Computational Methods and Data Analysis for Astrophysics group)
Computational biology and statistical methods in bioinformatics (Computational Systems Biology group)
Computational creativity and data mining (Discovery group)
Dynamic and large-scale networked systems (Data Communications Software group)
Intelligent multimodal information access (Content-Based Image and Information Retrieval Group)
Machine learning and neuroscience (Statistical Machine Learning group)
Machine learning for structured data (Kernel Machines, Pattern Analysis and Computational Biology group)
Machine learning methods for infectious disease epidemiology (Bayesian Statistics Group)
Probabilistic modeling and machine learning (Complex Systems Computation group)
Statistical machine learning (Statistical Machine Learning group)
Analysing ubiquitous sensor data (HIIT-Wide Focus Area)
Interactive visualization (HIIT-Wide Focus Area)
Affective computing and BCI (HIIT-Wide Focus Area)
Intelligent user interfaces and/or recommender systems (HIIT-Wide Focus Area)
Information retrieval and HCI (HIIT-Wide Focus Area)
Machine learning and data analysis, especially information retrieval, HCI, text and context data (HIIT-Wide Focus Area)
Probabilistic modeling and data analysis for bioinformatics (HIIT-Wide Focus Area)

More at http://www.hiit.fi/postdoc-call-2013

Paolo Ruggerone Lab

Tue, 01 Oct 2013 14:15:53 -0500

Efflux pumps (RND family)

Functioning of efflux systems in Gram-negative bacteria
Determinants of the compound-efflux system interactions
Action of inhibitors on efflux systems
Structural and dynamical features of the efflux systems

TatA
Assembly of the TatA system
Study of the dynamical features of the charge zipper

Methods
Setup of a kinetic Monte Carlo (KMC) scheme to study the flux of antibiotics through porins and efflux systems
Setup of protocol to integrate MD results in a ligand-based approach

Viral inhibitors
Interactions of selected compounds with RNA-dependent RNA polymerases (RdRps) of HCV and BVDV
Assessment of the role of mutations in RdRps
Antimicrobial peptides

Interactions of antimicrobial peptides with membranes: structure and dynamics
Interactions between antimicrobial peptides in the presence of different membranes
Protein-protein interactions
Effects of mutations

Lab Page
http://www.dsf.unica.it/~paolo/Site/Home.html

Rosalind Bioinformatics problems !!!

Abhi — Thu, 18 Dec 2014 10:32:48 -0600

Rosalind is a platform for learning bioinformatics and programming through problem solving. Take a tour to get the hang of how Rosalind works.

http://rosalind.info/problems/list-view/

Address of the bookmark: http://rosalind.info/problems/list-view/

Quick tour of Genetic Algorithms !

Jit — Thu, 17 Jan 2019 03:42:48 -0600

The R package GA provides a collection of general purpose functions for optimization using genetic algorithms. The package includes a flexible set of tools for implementing genetic algorithms search in both the continuous and discrete case, whether constrained or not. Users can easily define their own objective function depending on the problem at hand.

https://cran.r-project.org/web/packages/GA/vignettes/GA.html

Address of the bookmark: https://cran.r-project.org/web/packages/GA/vignettes/GA.html

Algorithms for DNA Sequencing (course offered each month)

Rahul Agarwal — Sun, 26 Jul 2015 01:57:02 -0500

"We will learn computational methods -- algorithms and data structures -- for analyzing DNA sequencing data. We will learn a little about DNA, genomics, and how DNA sequencing is used. We will use Python to implement key algorithms and data structures and to analyze real genomes and DNA sequencing datasets."

Source : https://www.coursera.org/course/ads1

Address of the bookmark: https://www.coursera.org/course/ads1

YAHA

Jit — Fri, 20 Jan 2017 05:38:05 -0600

YAHA, a fast and flexible hash-based aligner. YAHA is as fast and accurate as BWA-SW at finding the single best alignment per query and is dramatically faster and more sensitive than both SSAHA2 and MegaBLAST at finding all possible alignments. Unlike other aligners that report all, or one, alignment per query, or that use simple heuristics to select alignments, YAHA uses a directed acyclic graph to find the optimal set of alignments that cover a query using a biologically relevant breakpoint penalty. YAHA can also report multiple mappings per defined segment of the query. We show that YAHA detects more breakpoints in less time than BWA-SW across all SV classes, and especially excels at complex SVs comprising multiple breakpoints.

Availability: YAHA is currently supported on 64-bit Linux systems. Binaries and sample data are freely available for download from http://faculty.virginia.edu/irahall/YAHA.

Contact:

http://genome.wustl.edu/people/groups/detail/hall-lab/

Address of the bookmark: https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3463118/

GenomeComp

Jit — Fri, 17 Feb 2017 08:38:32 -0600

GenomeComp is a tool for summarizing, parsing and visualizing the genome wide sequence comparison results derived from voluminous BLAST textual output, so as to locate the rearrangements, insertions or deletions of genome segments between species or strains.

It can be easily used to compare, parsing and visualize large genomic sequences, especially closely related genomes such as inter-species or inter-strains. In addition, it can also show other sequence features like repeat sequence distributions in one whole-genome DNA sequence by comparing the genome to itself.

It is a stand-alone graphical user interface (GUI) program which runs on Linux, Unix, Mac OS X (tested on version 10.2.4 only) and Microsoft Windows platforms and is written in Perl/Tk.

Address of the bookmark: http://www.mgc.ac.cn/GenomeComp/

Cgaln

Jit — Wed, 22 Feb 2017 05:14:15 -0600

Cgaln (Coarse grained alignment) is a program designed to align a pair of whole genomic sequences of not only bacteria but also entire chromosomes of vertebrates on a nominal desktop computer. Cgaln performs an alignment job in two steps, at the block level and then at the nucleotide level. The former "coarse-grained" alignment can explore genomic rearrangements and reduce the regions to be analyzed in the next step. The latter is devoted to detailed alignment within the limited regions found in the first stage. The output of Cgaln is 'glocal' in the sense that rearrangements are taken into consideration while each alignable region is extended as long as possible. Thus, Cgaln is not only fast and memory-efficient, but also can filter noisy outputs without missing the most important homologous segment pairs.

http://www.iam.u-tokyo.ac.jp/chromosomeinformatics/rnakato/cgaln/

Address of the bookmark: http://www.iam.u-tokyo.ac.jp/chromosomeinformatics/rnakato/cgaln/

A Post-assembly genome-improvement toolkit (PAGIT) to obtain annotated genomes from contigs

Abhimanyu Singh — Fri, 12 May 2017 10:50:29 -0500

PAGIT addresses the need for software to generate high quality draft genomes. It is based on a series of programs that we developed:

ABACAS, that is able to contiguate contigs from a de novo assembly against a closely related reference.

IMAGE, an iterative approach for closing gaps in assembled genomes using mate pair information. It is able to close gaps left open by the assembler in a draft genome, even when using the same data sets as used by the original assembler.

iCORN, that enables errors in the consensus sequence to be corrected by iteratively mapping reads to the current assembly. An improved version, especially correction Pacfic Bioscience assemblies (PacBio) can be found here.

RATT, a tool to transfer the annotation from a reference genome, or an earlier assembly, onto the latest assembly.

PAGIT bundles these software and makes them more accessible for users.

Address of the bookmark: http://www.sanger.ac.uk/science/tools/pagit

AVID: A Global Alignment Program

Archana Malhotra — Wed, 24 May 2017 05:19:28 -0500

A new global alignment method called AVID. The method is designed to be fast, memory efficient, and practical for sequence alignments of large genomic regions up to megabases long. We present numerous applications of the method, ranging from the comparison of assemblies to alignment of large syntenic genomic regions and whole genome human/mouse alignments. We have also performed a quantitative comparison of AVID with other popular alignment tools. To this end, we have established a format for the representation of alignments and methods for their comparison. These formats and methods should be useful for future studies. The tools we have developed for the alignment comparisons, as well as the AVID program, are publicly available. See Web Site References section for AVID Web address and Web addresses for other programs discussed in this paper.

Address of the bookmark: https://www.ncbi.nlm.nih.gov/pmc/articles/PMC430967/