<?xml version='1.0'?><rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:georss="http://www.georss.org/georss" xmlns:atom="http://www.w3.org/2005/Atom" >
<channel>
	<title><![CDATA[BOL: Related items]]></title>
	<link>https://bioinformaticsonline.com/related/26325?offset=1190</link>
	<atom:link href="https://bioinformaticsonline.com/related/26325?offset=1190" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30550/genomering-alignment-visualization-based-on-supergenome-coordinates</guid>
	<pubDate>Wed, 18 Jan 2017 10:24:10 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30550/genomering-alignment-visualization-based-on-supergenome-coordinates</link>
	<title><![CDATA[GenomeRing: alignment visualization based on SuperGenome coordinates]]></title>
	<description><![CDATA[<p>The number of completely sequenced genomes is continuously rising, allowing for comparative analyses of genomic variation. Such analyses are often based on whole-genome alignments to elucidate structural differences arising from insertions, deletions or from rearrangement events. Computational tools that can visualize genome alignments in a meaningful manner are needed to help researchers gain new insights into the underlying data. Such visualizations typically are either realized in a linear fashion as in genome browsers or by using a circular approach, where relationships between genomic regions are indicated by arcs. Both methods allow for the integration of additional information such as experimental data or annotations. However, providing a visualization that still allows for a quick and comprehensive interpretation of all important genomic variations together with various supplemental data, which may be highly heterogeneous, remains a challenge.</p>
<p>More at https://academic.oup.com/bioinformatics/article/28/12/i7/268598/GenomeRing-alignment-visualization-based-on</p><p>Address of the bookmark: <a href="http://it.informatik.uni-tuebingen.de/?page_id=185" rel="nofollow">http://it.informatik.uni-tuebingen.de/?page_id=185</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/30657/studentship</guid>
  <pubDate>Tue, 24 Jan 2017 04:26:14 -0600</pubDate>
  <link></link>
  <title><![CDATA[Studentship]]></title>
  <description><![CDATA[
<p>Advt. No. ACBR/BTBI/BIF/Manpower/ADV/16-17<br />Research Associate/ Studentship/ Traineeship Jobs opportunity in  University of Delhi - Dr. B.R. Ambedkar Center for Biomedical Research (ACBR) on temporary basis<br />Studentship<br />No. of Post : 01<br />Qualifications : Applicants who are pursuing Post Graduate Degree course/ Diploma in Bioinformatics/ Biomedical Sciences/ Biotechnology/Life Sciences/Chemistry/ Biochemistry with a programme in Bioinformatics to carry out the project.<br />Remuneration : Rs. 8,000/-<br />Traineeship<br />No. of Post : 01<br />Qualifications : Applicants who have completed their Post Graduate degree in Bioinformatics /Biomedical Sciences/Biotechnology/Life Sciences/Chemistry/Biochemistry or any other branch of Life Sciences with knowledge in Bioinformatics<br />Remuneration : Rs. 8,000/-<br />Research Associate<br />No. of Post : 01<br />Qualifications : Ph.D. in Bio-Medical Sciences/Bioinformatics/ Biotechnology/Life Sciences/ Chemistry/ Bio-Chemistry and related areas<br />Remuneration : Rs. 36,000/-</p>

<p>Applicant are required to bring applications on plain paper, stating the name, address, date of birth. educational qualifications and experiences and Institute, along with attested photocopies of mark sheets and certificates etc. at the time of Interview. Applications should also be sent by Entail to Dr. Madhu Chopra, Coordinator, BIF Facility. Email: acbrdu.blisnet@nic.in;  mchopradu@gmail.com.<br />Interview Date : 13.02.2017<br />Time : 10:00 am-12:00 noon<br />Venue : ACBR</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30696/many-core-engine-mce-for-perl-example</guid>
	<pubDate>Tue, 31 Jan 2017 05:37:50 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30696/many-core-engine-mce-for-perl-example</link>
	<title><![CDATA[Many-Core Engine (MCE) for Perl example]]></title>
	<description><![CDATA[<p><span>MCE spawns a pool of workers and therefore does not fork a new process per each element of data. Instead, MCE follows a bank queuing model. Imagine the line being the data and bank-tellers the parallel workers. MCE enhances that model by adding the ability to chunk the next n elements from the input stream to the next available worker.</span></p>
<p>CORE MODULES</p>
<p>Three modules make up the core engine for MCE.</p>
<dl><dt id="MCE::Core"><a href="https://metacpan.org/pod/MCE#MCE::Core"><span></span></a><a></a><a href="https://metacpan.org/pod/distribution/MCE/lib/MCE/Core.pod">MCE::Core</a></dt><dd>
<p>Provides the Core API for Many-Core Engine. The various MCE options are described here.</p>
</dd><dt id="MCE::Signal"><a href="https://metacpan.org/pod/MCE#MCE::Signal"><span></span></a><a></a><a href="https://metacpan.org/pod/MCE::Signal">MCE::Signal</a></dt><dd>
<p>Temporary directory creation, cleanup, and signal handling.</p>
</dd><dt id="MCE::Util"><a href="https://metacpan.org/pod/MCE#MCE::Util"><span></span></a><a></a><a href="https://metacpan.org/pod/MCE::Util">MCE::Util</a></dt><dd>
<p>Utility functions for Many-Core Engine.</p>
</dd></dl>
<p><a href="https://metacpan.org/pod/MCE#MCE-EXTRAS"><span></span></a><a></a>MCE EXTRAS</p>
<p>There are 4 add-on modules for use with MCE.</p>
<dl><dt id="MCE::Candy"><a href="https://metacpan.org/pod/MCE#MCE::Candy"><span></span></a><a></a><a href="https://metacpan.org/pod/MCE::Candy">MCE::Candy</a></dt><dd>
<p>Provides a collection of sugar methods and output iterators for preserving output order.</p>
</dd><dt id="MCE::Mutex"><a href="https://metacpan.org/pod/MCE#MCE::Mutex"><span></span></a><a></a><a href="https://metacpan.org/pod/MCE::Mutex">MCE::Mutex</a></dt><dd>
<p>Provides a simple semaphore implementation supporting threads and processes.</p>
</dd><dt id="MCE::Queue"><a href="https://metacpan.org/pod/MCE#MCE::Queue"><span></span></a><a></a><a href="https://metacpan.org/pod/MCE::Queue">MCE::Queue</a></dt><dd>
<p>Provides a hybrid queuing implementation for MCE supporting normal queues and priority queues from a single module. MCE::Queue exchanges data via the core engine to enable queuing to work for both children (spawned from fork) and threads.</p>
</dd><dt id="MCE::Relay"><a href="https://metacpan.org/pod/MCE#MCE::Relay"><span></span></a><a></a><a href="https://metacpan.org/pod/MCE::Relay">MCE::Relay</a></dt><dd>
<p>Enables workers to receive and pass on information orderly with zero involvement by the manager process while running.</p>
</dd></dl>
<p><a href="https://metacpan.org/pod/MCE#MCE-MODELS"><span></span></a><a></a>MCE MODELS</p>
<p>The models take Many-Core Engine to a new level for ease of use. Two options (chunk_size and max_workers) are configured automatically as well as spawning and shutdown.</p>
<dl><dt id="MCE::Loop"><a href="https://metacpan.org/pod/MCE#MCE::Loop"><span></span></a><a></a><a href="https://metacpan.org/pod/MCE::Loop">MCE::Loop</a></dt><dd>
<p>Provides a parallel loop utilizing MCE for building creative loops.</p>
</dd><dt id="MCE::Flow"><a href="https://metacpan.org/pod/MCE#MCE::Flow"><span></span></a><a></a><a href="https://metacpan.org/pod/MCE::Flow">MCE::Flow</a></dt><dd>
<p>A parallel flow model for building creative applications. This makes use of user_tasks in MCE. The author has full control when utilizing this model. MCE::Flow is similar to MCE::Loop, but allows for multiple code blocks to run in parallel with a slight change to syntax.</p>
</dd><dt id="MCE::Grep"><a href="https://metacpan.org/pod/MCE#MCE::Grep"><span></span></a><a></a><a href="https://metacpan.org/pod/MCE::Grep">MCE::Grep</a></dt><dd>
<p>Provides a parallel grep implementation similar to the native grep function.</p>
</dd><dt id="MCE::Map"><a href="https://metacpan.org/pod/MCE#MCE::Map"><span></span></a><a></a><a href="https://metacpan.org/pod/MCE::Map">MCE::Map</a></dt><dd>
<p>Provides a parallel map model similar to the native map function.</p>
</dd><dt id="MCE::Step"><a href="https://metacpan.org/pod/MCE#MCE::Step"><span></span></a><a></a><a href="https://metacpan.org/pod/MCE::Step">MCE::Step</a></dt><dd>
<p>Provides a parallel step implementation utilizing MCE::Queue between user tasks. MCE::Step is a spin off from MCE::Flow with a touch of MCE::Stream. This model, introduced in 1.506, allows one to pass data from one sub-task into the next transparently.</p>
</dd><dt id="MCE::Stream"><a href="https://metacpan.org/pod/MCE#MCE::Stream"><span></span></a><a></a><a href="https://metacpan.org/pod/MCE::Stream">MCE::Stream</a></dt><dd>
<p>Provides an efficient parallel implementation for chaining multiple maps and greps together through user_tasks and MCE::Queue. Like with MCE::Flow, MCE::Stream can run multiple code blocks in parallel with a slight change to syntax from MCE::Map and MCE::Grep.</p>
</dd></dl>
<p><a href="https://metacpan.org/pod/MCE#MISCELLANEOUS"><span></span></a>MISCELLANEOUS</p>
<p>Miscellaneous additions included with the distribution.</p>
<dl><dt id="MCE::Examples"><a href="https://metacpan.org/pod/MCE#MCE::Examples"><span></span></a><a></a><a href="https://metacpan.org/pod/distribution/MCE/lib/MCE/Examples.pod">MCE::Examples</a></dt><dd>
<p>Describes various demonstrations for MCE including a Monte Carlo simulation.</p>
</dd><dt id="MCE::Subs"><a href="https://metacpan.org/pod/MCE#MCE::Subs"><span></span></a><a></a><a href="https://metacpan.org/pod/MCE::Subs">MCE::Subs</a></dt><dd>
<p>Exports functions mapped directly to MCE methods; e.g. mce_wid. The module allows 3 options; :manager, :worker, and :getter.</p>
</dd></dl>
<p><a href="https://metacpan.org/pod/MCE#REQUIREMENTS"><span></span></a>REQUIREMENTS</p>
<p>Perl 5.8.0 or later. PDL::IO::Storable is required in scripts running PDL.</p>
<p><a href="https://metacpan.org/pod/MCE#SOURCE-AND-FURTHER-READING"><span></span></a><a></a>SOURCE AND FURTHER READING</p>
<p>The source, cookbook, and examples are hosted at GitHub.</p>
<ul>
<li>
<p><a href="https://github.com/marioroy/mce-perl">https://github.com/marioroy/mce-perl</a></p>
</li>
<li>
<p><a href="https://github.com/marioroy/mce-cookbook">https://github.com/marioroy/mce-cookbook</a></p>
</li>
<li>
<p><a href="https://github.com/marioroy/mce-examples">https://github.com/marioroy/mce-examples</a></p>
</li>
</ul>
<p><a href="https://metacpan.org/pod/MCE#SEE-ALSO"><span></span></a><a></a>SEE ALSO</p>
<p><code>MCE::Shared</code>&nbsp;provides data sharing capabilities for&nbsp;<code>MCE</code>. It includes&nbsp;<code>MCE::Hobo</code>&nbsp;for running code asynchronously.</p>
<ul>
<li>
<p><a href="https://metacpan.org/pod/MCE::Shared">MCE::Shared</a></p>
</li>
<li>
<p><a href="https://metacpan.org/pod/MCE::Hobo">MCE::Hobo</a></p>
</li>
</ul><p>Address of the bookmark: <a href="https://github.com/marioroy/mce-examples" rel="nofollow">https://github.com/marioroy/mce-examples</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/30825/open-positions-in-pasini%E2%80%99s-lab</guid>
  <pubDate>Sat, 04 Feb 2017 08:17:18 -0600</pubDate>
  <link></link>
  <title><![CDATA[Open Positions in Pasini’s lab]]></title>
  <description><![CDATA[
<p>Computational Biologists<br />Open to PhD-student and Post-doc candidates<br />We are looking for wet and computational biologists to work on an ERC funded project in our<br />laboratory located at the Department of Experimental Oncology of the European Institute of<br />Oncology in Milan (Italy). The project will focus on different aspects of the function of Polycomb<br />Group proteins and other chromatin modifying activities in relation to their role in regulating cellular<br />identity in the development of adult tissues.<br />The candidates will be in charge of computational analysis and data management related to the<br />project. She/he will directly interact with the wet scientists working in our laboratory while working<br />embedded in the community of computational biologists present at our institution. The work will<br />involve the analysis of sequencing data produced with cutting edge technologies to study gene<br />expression and chromatin environment including data produced on rare cell populations and single<br />cells. The applicants must have a good knowledge of programming in python/perl/java along with<br />strong statistical background and performing analysis in R platform. A biological background is<br />also recommended however it’s not mandatory for application.<br />Each applicant should submit a full CV (with a detailed description of her/his background,<br />expertise, achievements and publication records) together with a letter of intent and at least two<br />contacts for recommendations (for a post-doc position). Competitive salary will be offered based<br />on the experience of the candidate. Non Italian as well as Italian applicants that have been working<br />outside Italy (&gt;3yrs.) will have the opportunity to benefit of a full tax deduction for the first three<br />years of contract.<br />Applications should be submitted as single PDF to diego.pasini@ieo.it</p>

<p>Lab https://www.ieo.it/en/RESEARCH/People/Researchers/Pasini-Diego/</p>
]]></description>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/30889/phd-program-in-computer-science-at-university-of-essex</guid>
  <pubDate>Sat, 11 Feb 2017 13:11:36 -0600</pubDate>
  <link></link>
  <title><![CDATA[PhD program in Computer Science at University of Essex]]></title>
  <description><![CDATA[
<p>As part of the PhD program in Computer Science at University of Essex, I am looking for a PhD student in computational and synthetic biology.<br />The ideal candidate is interested in designing new biological design automation methods for genome scale projects and/or network modelling of genomic, transcriptomic and proteomic data.<br />Candidates interested in developing optimization algorithms for biological problems are encouraged to apply as well.<br />A summary of the research work in the lab can be found on o this page.</p>

<p>Candidates interested in the position should contact me in advance by email to: g.stracquadanio@essex.ac.uk</p>

<p>The deadline for the application is 28/02/2017; info about the application can be found on the Essex CSEE website.</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30966/maftools</guid>
	<pubDate>Thu, 16 Feb 2017 11:16:01 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30966/maftools</link>
	<title><![CDATA[MafTools]]></title>
	<description><![CDATA[<p>maftools - An R package to summarize, analyze and visualize MAF files. <a href="https://github.com/PoisonAlien/maftools#introduction"></a>Introduction.</p>
<p>With advances in Cancer Genomics, Mutation Annotation Format (MAF) is being widley accepted and used to store variants detected. <a href="http://cancergenome.nih.gov">The Cancer Genome Atlas</a> Project has seqenced over 30 different cancers with sample size of each cancer type being over 200. The <a href="https://wiki.nci.nih.gov/display/TCGA/TCGA+MAF+Files">resulting data</a> consisting of genetic variants is stored in the form of <a href="https://wiki.nci.nih.gov/display/TCGA/Mutation+Annotation+Format+%28MAF%29+Specification">Mutation Annotation Format</a>. This package attempts to summarize, analyze, annotate and visualize MAF files in an efficient manner either from TCGA sources or any in-house studies as long as the data is in MAF format. Maftools can also handle ICGC Simple Somatic Mutation format.</p>
<p>maftools is on <img src="https://assets-cdn.github.com/images/icons/emoji/unicode/1f449.png" alt=":point_right:" width="20" height="20" style="border: 0px;"> <a href="http://biorxiv.org/content/early/2016/05/11/052662">bioRxiv</a> <img src="https://assets-cdn.github.com/images/icons/emoji/bowtie.png" alt=":bowtie:" title=":bowtie:" width="20" height="20" style="border: 0px; text-align: absmiddle;"></p>
<p>Please cite the below if you find this tool useful for you.</p>
<p>Mayakonda, A. and H.P. Koeffler, Maftools: Efficient analysis, visualization and summarization of MAF files from large-scale cohort based cancer studies. bioRxiv, 2016. doi: <a href="http://dx.doi.org/10.1101/052662">http://dx.doi.org/10.1101/052662</a></p><p>Address of the bookmark: <a href="https://github.com/PoisonAlien/maftools" rel="nofollow">https://github.com/PoisonAlien/maftools</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/31209/dial</guid>
	<pubDate>Wed, 01 Mar 2017 08:42:28 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/31209/dial</link>
	<title><![CDATA[DIAL]]></title>
	<description><![CDATA[<p>A computational pipeline for identifying single-base substitutions between two closely related genomes without the help of a reference genome. DIAL works even when the depth of coverage is insufficient for de novo assembly, and it can be extended to determine small insertions/deletions. Our main motivation is to use this tool to survey the genetic diversity of endangered species as the identified sequence differences can be used to design genotyping arrays to assist in the species' management.</p>
<p>http://www.bx.psu.edu/~ratan/</p><p>Address of the bookmark: <a href="http://www.bx.psu.edu/miller_lab/" rel="nofollow">http://www.bx.psu.edu/miller_lab/</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/31300/clgenomics</guid>
	<pubDate>Fri, 03 Mar 2017 09:57:28 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/31300/clgenomics</link>
	<title><![CDATA[CLgenomics]]></title>
	<description><![CDATA[<p>CLgenomics is a standalone desktop software specifically designed for bacterial genome analysis. This program has a powerful multi-genome browser, which enables rapid and responsive exploration of bacterial genomes.</p>
<p>To use CLgenomics, individual genome data (genome sequences + annotation details) are compiled and saved in a specially formatted file called CLG (ChunLab Genomics).&nbsp;Each CLG file corresponds with one bacterial genome. If multiple genomes are being considered and compared, multiple CLG files are needed. ChunLab offers &gt;40,000 CLG files of publicly available Bacterial and Archaeal genomes.</p><p>Address of the bookmark: <a href="https://chunlab.wordpress.com/clgenomics-software/" rel="nofollow">https://chunlab.wordpress.com/clgenomics-software/</a></p>]]></description>
	<dc:creator>Radha Agarkar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/31976/snpgenie</guid>
	<pubDate>Thu, 30 Mar 2017 17:38:02 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/31976/snpgenie</link>
	<title><![CDATA[SNPGenie]]></title>
	<description><![CDATA[<p>SNPGenie is a Perl script for estimating evolutionary parameters, mainly from pooled next-generation sequencing (NGS) single-nucleotide polymorphism (SNP) variant data. SNP reports (acceptable in a variety of formats) much each correspond to a single population, with variants called relative to a single reference sequence (one sequence in one FASTA file). Just run the main script, <strong>snpgenie.pl</strong>, in a directory containing the necessary <a href="https://github.com/hugheslab/snpgenie#snpgenie-input">input files</a>, and we take care of the rest! For the earlier version, see <a href="http://ww2.biol.sc.edu/~austin/">Hughes Lab Bioinformatics Resource</a>.</p><p>Address of the bookmark: <a href="https://github.com/hugheslab/snpgenie" rel="nofollow">https://github.com/hugheslab/snpgenie</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/32129/lordec-a-hybrid-error-correction-program-for-long-pacbio-reads</guid>
	<pubDate>Mon, 10 Apr 2017 04:16:09 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32129/lordec-a-hybrid-error-correction-program-for-long-pacbio-reads</link>
	<title><![CDATA[LoRDEC: a hybrid error correction program for long, PacBio reads]]></title>
	<description><![CDATA[<p>LoRDEC is a program to correct sequencing errors in long reads from 3rd generation sequencing with high error rate, and is especially intended for PacBio reads. It uses a hybrid strategy, meaning that it uses two sets of reads: the reference read set, whose error rate is assumed to be small, and the PacBio read set, which is then corrected using the reference set. Typically, the reference set contains Illumina reads.</p>
<p><br> Usually, errors in PacBio reads include many insertions and deletions, and comparatively less substitutions. LoRDEC can correct errors of all these types.<br> After correction, a larger portion of the sequence of PacBio reads is usable for detection of region of similarity with other sequences, for aligning them to the contigs of an assembly, etc.</p>
<p>Why is LoRDEC different?</p>
<ul>
<li>It is efficient and can process large read data sets, included from eukaryotic or vertebrate species, on a usual computing server, and even works on desktop/laptop computers.</li>
<li>It adopts a novel graph based approach: it builds a succinct De Bruijn Graph (DBG) representing the short reads, and seeks a corrective sequence for each erroneous region of a long read by traversing chosen paths in the graph.</li>
</ul><p>Address of the bookmark: <a href="http://www.atgc-montpellier.fr/lordec/" rel="nofollow">http://www.atgc-montpellier.fr/lordec/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>