BOL: Related items

Ancestor at work !!!

Jit — Sun, 25 Aug 2013 19:45:28 -0500

When they will learn Bioinformatics :)

Opera: An optimal genome scaffolding program

Jit — Mon, 27 Nov 2017 10:18:20 -0600

Opera (Optimal Paired-End Read Assembler) is a sequence assembly program (http://en.wikipedia.org/wiki/Sequence_assembly ). It uses information from paired-end or long reads to optimally order and orient contigs assembled from shotgun-sequencing reads.

An updated version called OPERA-LG has been re-engineered with features for the assembly of large and complex genomes.

Song Gao, Denis Bertrand, Burton K. H. Chia and Niranjan Nagarajan. OPERA-LG: efficient and exact scaffolding of large, repeat-rich eukaryotic genomes with performance guarantees. Genome Biology, May 2016, doi: 10.1186/s13059-016-0951-y.

Song Gao, Wing-Kin Sung, Niranjan Nagarajan. Opera: reconstructing optimal genomic scaffolds with high-throughput paired-end sequences. Journal of Computational Biology, Sept. 2011, doi:10.1089/cmb.2011.0170.

https://genomebiology.biomedcentral.com/articles/10.1186/s13059-016-0951-y

Address of the bookmark: https://sourceforge.net/projects/operasf/

Chang lab

Tue, 24 Sep 2013 17:25:49 -0500

The Chang lab is focused on how the activities of hundreds or even thousands of genes (gene parties) are coordinated to achieve biological meaning. We have pioneered methods to predict, dissect, and control large-scale gene regulatory programs; these methods have provided insights into human development, cancer, and aging. A particular interest is how cells know and remember their locations in the body, particularly with the help of long noncoding RNAs.

More at http://changlab.stanford.edu/index.html

Bandage: interactive visualization of de novo genome assemblies

Shruti Paniwala — Mon, 04 Dec 2017 10:09:37 -0600

Bandage (a Bioinformatics Application for Navigating De novo Assembly Graphs Easily) is a tool for visualizing assembly graphs with connections. Users can zoom in to specific areas of the graph and interact with it by moving nodes, adding labels, changing colors and extracting sequences. BLAST searches can be performed within the Bandage graphical user interface and the hits are displayed as highlights in the graph. By displaying connections between contigs, Bandage presents new possibilities for analyzing de novo assemblies that are not possible through investigation of contigs alone.

Availability and implementation: Source code and binaries are freely available at https://github.com/rrwick/Bandage. Bandage is implemented in C++ and supported on Linux, OS X and Windows. A full feature list and screenshots are available at http://rrwick.github.io/Bandage.

Address of the bookmark: http://rrwick.github.io/Bandage/

Genetics for Fun and Profit: Andrew Hessel at TEDxVilnius

Sun, 01 Sep 2013 19:15:06 -0500

Andrew Hessel co-chairs the Bioinformatics and Biotechnology track at the Singularity University, an institution founded by futurist Ray Kurzweil and X Prize Foundation CEO Peter Diamandis, with sponsorship from world-leading organizations that include Google, Autodesk, and NASA. He is also the founder of the Pink Army Cooperative, a venture aiming to make open source personalized cancer therapies. His work has been featured in The New York Times, Futurist Magazine, H+, and Wired News. In the spirit of ideas worth spreading, TEDx is a program of local, self-organized events that bring people together to share a TED-like experience. At a TEDx event, TEDTalks video and live speakers combine to spark deep discussion and connection in a small group. These local, self-organized events are branded TEDx, where x = independently organized TED event. The TED Conference provides general guidance for the TEDx program, but individual TEDx events are self-organized.* (*Subject to certain rules and regulations)

Mash: fast genome and metagenome distance estimation using MinHash

Jit — Tue, 12 Dec 2017 17:30:12 -0600

Mash is normally distributed as a dependency-free binary for Linux or OSX (see https://github.com/marbl/Mash/releases). This source distribution is intended for other operating systems or for development. Mash requires c++11 to build, which is available in and GCC >= 4.8 and OSX >= 10.7.

See http://mash.readthedocs.org for more information.

Address of the bookmark: https://github.com/marbl/Mash/releases

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

MUMmer4: A fast and versatile genome alignment system

Jit — Sat, 03 Feb 2018 04:59:17 -0600

MUMmer4, a substantially improved version of MUMmer that addresses genome size constraints by changing the 32-bit suffix tree data structure at the core of MUMmer to a 48-bit suffix array, and that offers improved speed through parallel processing of input query sequences. With a theoretical limit on the input size of 141Tbp, MUMmer4 can now work with input sequences of any biologically realistic length. We show that as a result of these enhancements, the nucmer program in MUMmer4 is easily able to handle alignments of large genomes;

Address of the bookmark: https://mummer4.github.io/

CPCRI Kasaragod Bioinformatics PA

Sat, 07 Sep 2013 14:15:53 -0500

CENTRAL PLANTATION CROPS RESEARCH INSTITUTE
(Indian Council of Agricultural Research)
KASARAGOD -671 124, KERALA

WALK-IN-INTERVIEW

Walk-in-test cum interview for selection to the following temporary assignments sanctioned under the DBT sponsored adhoc time bound research scheme entitled "Establishment of a Sub-DIC" will be held at CPCRl, Kudlu PO, Kasaragod District, Kerala -6711 24 on the date and time indicated against each:

Project Assistant

Qualification: Essential: Masters Degree in Bioinformatics / B.Tech Degree in Bioinformatics

Desirable: 1. Experience in the field of bioinformatics
2. M.Phil / Doctoral degree in the field

Date of interview 24.09.2013 at 10.00 a.m.

Trainee – 2 Posts

Essential: Masters Degree in Bioinformatics or B.Tech Degree in Bioinformatics.

Date of interview 25.09.2013 at 10.00 a.m.

Studentship – 2 Posts

Essential Final Year/Semester students of MSc Bioinformatics or B.Tech Bioinformatics

Date of Interview 25.09.2013 at 10.00 a.m.

The candidates fulfilling the above eligibility criteria for Item No.1 & II shall apply online and walk-in for a written test and interview at CPCRI, Kasaragod on the respective dates at 10.00 a.m. The candidates for Studentship should submit the application through their Head of the Department. They shall also bring with them a set of bio data and original certificates in proof of age, educational qualifications, experience etc. Candidates who fail to produce the original of the Degree/PO certificates OR provisional certificate will not be allowed to attend the test / interview. Those who are qualified in written test will only be permitted to attend the interview.

No TA will be paid for the journey for attending the interview.

Advertisement: http://www.cpcri.gov.in/images/images/opportunity/sep4_opp.pdf

Metassembler: merging and optimizing de novo genome assemblies

Rahul Nayak — Tue, 08 May 2018 04:52:33 -0500

Metassembler combines multiple whole genome de novo assemblies into a combined consensus assembly using the best segments of the individual assemblies.

Genome assembly projects typically run multiple algorithms in an attempt to find the single best assembly, although those assemblies often have complementary, if untapped, strengths and weaknesses. We present our metassembler algorithm that merges multiple assemblies of a genome into a single superior sequence.

Address of the bookmark: https://sourceforge.net/projects/metassembler/?source=directory