<?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/12206?offset=870</link>
	<atom:link href="https://bioinformaticsonline.com/related/12206?offset=870" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	
<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/29998/csir-nehru-science-postdoctoral-research-fellowship</guid>
  <pubDate>Tue, 29 Nov 2016 12:34:59 -0600</pubDate>
  <link></link>
  <title><![CDATA[CSIR Nehru Science Postdoctoral Research Fellowship]]></title>
  <description><![CDATA[
<p>CSIR Nehru Science Postdoctoral Research Fellowship</p>

<p>About Fellowship: <br />CSIR Nehru Science Postdoctoral Research Fellowship Scheme is an Research Fellowship awarded/given by HRD Ministry, Govt. of India every year to more than 100 fellows.</p>

<p>It was started to identify promising and young researchers with novel ideas and provide them research opportunities in the areas of basic science, engineering, medicine &amp; agriculture.</p>

<p>The fellowship aims at facilitating their transition from mentored to independent research career.</p>

<p>In addition, check these ICTS Research Fellowships:<br />1.) Max-Planck Partner Group Fellowships 2017-18<br />2.) ICTS-Simons Postdoctoral Fellowships 2017<br />3.) ICTS Post Doctoral Fellowships 2017<br />4.) Airbus Prize Postdoctoral Fellowship 2017-18</p>

<p>Eligibility: To be eligible for this fellowship, you:<br />1.) PhD degree (within 3 years of award of PhD degree), OR<br />2.) Those who have submitted PhD theses.<br />3.) Applicants should have research publications in good impact factor SCI journals.<br />4.) Indian nationals, Persons of Indian Origin (PIO) &amp; Overseas Citizen of India (OCI), a can also apply.<br />5.) Maximum Age Limit: 32 years.</p>

<p>Duration: <br />– 2 Years.<br />– extendable for a maximum of 1 more year based on performance.</p>

<p>Remuneration: <br />– Rs. 50,000/- per month plus House Rent Allowance (HRA)<br />– A contingency grant of Rs. 3.0 lakh per annum.<br />– 25% of the contingency grant can be used for domestic and international travel.</p>

<p>Mode of Selection: You can apply throughout the year, but selection will be made twice a year, in June and December.</p>

<p>How to Apply: <br />– Read the instructions, given at Annexure-I in this PDF file.<br />– And, application form is given as, Annexure-II.<br />– Fill the form &amp; send it to the given address in the PDF file.</p>

<p>Deadline: Rolling Deadline (Applications accepted throughout the year)</p>

<p>Also See: Research Internship/ Fellowship in India:<br />1.) IIT Bombay Research Internship Awards Programme 2016-17<br />2.) IIT Delhi Internship Program 2016-17<br />3.) DAAD WISE – International Internship in Germany<br />4.) Summer Research Fellowship Programme| JNCASR Bangalore<br />5.) Indian Academy of Sciences Summer Internships 2017<br />6.) Winter Internship – IIT Bombay NPDE-TCA<br />7.) Viterbi – India Program 2017 | Research Internship in US<br />8.) Internship – Centre for Stem Cell Research, Vellore</p>

<p>Accommodation &amp; other benefits: <br />– Accommodation may be provided by CSIR, if available.<br />– Medical benefits as per CSIR norms.</p>

<p>For more details: <br />– Check this PDF Notification of Fellowship.<br />– List of CSIR Labs &amp; their work/activities can be seen at www.csir.res.in.</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30018/bipype</guid>
	<pubDate>Thu, 01 Dec 2016 08:47:38 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30018/bipype</link>
	<title><![CDATA[bipype]]></title>
	<description><![CDATA[<p><span>Bipype is a very useful program, which prepare a lot of types of bioinformatics analyses. There are three input options: amplicons, WGS (whole genome sequences) and metatranscriptomic data. If amplicons are input data, then bipype does reconstruction and pairs merging. After that biodiversity is searching. There are two types of searching depending on the amplicons types (ITS or 16S). If WGS are chosen, then bipype finds the SA coordinates of the input reads and generates alignments in the SAM format given single-end reads, aligns reads to reference sequence(s). All of these analyses will be shown with Krona program, which allows to show hierarchical data with pie charts.</span></p><p>Address of the bookmark: <a href="https://readthedocs.org/projects/bipype/" rel="nofollow">https://readthedocs.org/projects/bipype/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30090/standardized-velvet-assembly-report</guid>
	<pubDate>Fri, 09 Dec 2016 03:59:59 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30090/standardized-velvet-assembly-report</link>
	<title><![CDATA[Standardized velvet assembly report]]></title>
	<description><![CDATA[<p>Requirements:</p>
<ul>
<li>velvet (velveth velvetg should be in your PATH)</li>
<li>R (with Sweave)</li>
<li>pdflatex (usually part of TeTeX)</li>
<li>ggplot2 (from R prompt type install.packages("ggplot2","proto","xtable"))</li>
<li>Perl</li>
</ul>
<p>Optional:</p>
<ul>
<li>BLAT or BLAST (to generate alignments against a reference genome). If using BLAT, add faToTwoBit,gfClient,gfServer to your PATH. If using BLAST, add blastall and formatdb.</li>
</ul>
<p>Edit permute.sh to your liking, paying particular attention to the kmer, cvCut, expCov, and other flags</p>
<p>To Run:</p>
<ol>
<li><code>perl fastaAllSize mysequences.fa &gt; mysequences.stat or gunzip -c mysequences.fa.gz | fastaAllSize &gt; mysequences.stat</code>&nbsp;Substitute fastqAllSize for fastq files.</li>
<li><code>./permute.sh mysequences</code>&nbsp;(leave out the .fa)</li>
</ol>
<p>https://github.com/leipzig/standardized-velvet-assembly-report</p><p>Address of the bookmark: <a href="https://github.com/leipzig/standardized-velvet-assembly-report" rel="nofollow">https://github.com/leipzig/standardized-velvet-assembly-report</a></p>]]></description>
	<dc:creator>Poonam Mahapatra</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/30334/postdoc-at-ubritishcolumbia-in-troutgenomics</guid>
  <pubDate>Thu, 22 Dec 2016 08:18:46 -0600</pubDate>
  <link></link>
  <title><![CDATA[Postdoc at UBritishColumbia in TroutGenomics]]></title>
  <description><![CDATA[
<p>Landscape Genomics Postdoc at UBC A research team at the University of British Columbia’s Department of Zoology and Biodiversity Research Centre is seeking a postdoctoral researcher in landscape genetics of native rainbow trout (Oncorhynchus mykiss). </p>

<p>This project is part of a larger Genome Canada project on genetics and physiology of adaptation to climate change in rainbow trout, and the population genomics component is in the labs of Eric Taylor and Michael Whitlock. The landscape genomics component primarily involves whole genome sequencing approaches to understanding the genomic basis of adaptation to features of habitat, but also to provide insights into phylogeography and the influence of watershed structure on population subdivision in rainbow trout. A PhD in a related field with expertise in basic theory and bioinformatic analysis of population genomics data is required. </p>

<p>The position is available for one year with renewal for up to three additional years. Salary is $55,000 per year plus benefits. To apply, please send a brief cover letter summarizing your qualifications for the position, a CV, and the names, addresses, phone numbers and emails of three references. </p>

<p>Review of applications will begin January 16, 2017. Address application materials to etaylor@zoology.ubc.ca to whom any questions can also be addressed. etaylor@zoology.ubc.ca</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30375/mauve-a-system-for-constructing-multiple-genome-alignments-in-the-presence-of-large-scale-evolutionary-events-such-as-rearrangement-and-inversion</guid>
	<pubDate>Sat, 24 Dec 2016 09:20:53 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30375/mauve-a-system-for-constructing-multiple-genome-alignments-in-the-presence-of-large-scale-evolutionary-events-such-as-rearrangement-and-inversion</link>
	<title><![CDATA[Mauve: a system for constructing multiple genome alignments in the presence of large-scale evolutionary events such as rearrangement and inversion]]></title>
	<description><![CDATA[<p>Mauve is a system for constructing multiple genome alignments in the presence of large-scale evolutionary events such as rearrangement and inversion. Multiple genome alignments provide a basis for research into comparative genomics and the study of genome-wide evolutionary dynamics.</p>
<p>Mauve has been developed with the idea that a multiple genome aligner should require only modest computational resources. It employs algorithmic techniques that scale well in the lengths of sequences being aligned. For example, a pair of&nbsp;<em>Y. pestis</em>&nbsp;genomes can be aligned in under a minute, while a group of 9 divergent Enterobacterial genomes can be aligned in a few hours. However, the current algorithm&rsquo;s compute time (progressiveMauve) scales cubically in the number of genomes to align, making it unsuitable for datasets containing more than 50-100 bacterial genomes.</p><p>Address of the bookmark: <a href="http://darlinglab.org/mauve/mauve.html" rel="nofollow">http://darlinglab.org/mauve/mauve.html</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30540/progressive-cactus</guid>
	<pubDate>Tue, 17 Jan 2017 03:40:06 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30540/progressive-cactus</link>
	<title><![CDATA[Progressive Cactus]]></title>
	<description><![CDATA[<h1><em style="font-size: 12.8px; font-weight: normal;">v0.0 by Glenn Hickey (<a href="mailto:hickey@soe.ucsc.edu">hickey@soe.ucsc.edu</a>)</em></h1>
<p>Progressive Cactus is a whole-genome alignment package.</p>
<h3><a href="https://github.com/glennhickey/progressiveCactus#requirements"></a>Requirements</h3>
<ul>
<li>git</li>
<li>gcc 4.2 or newer</li>
<li>python 2.7</li>
<li>wget</li>
<li>64bit processor and build environment</li>
<li>150GB+ of memory on at least one machine when aligning mammal-sized genomes; less memory is needed for smaller genomes.</li>
<li>Parasol or SGE for cluster support.</li>
<li>750M disk space</li>
</ul>
<h3><a href="https://github.com/glennhickey/progressiveCactus#instructions"></a>Instructions</h3>
<p>IMPORTANT NOTE: Progressive Cactus does not presently support installation into paths that contain spaces. Until this is resolved, you can use a softlink as a workaround: ln -s "path with spaces" "installation path without spaces"</p>
<p>In the parent directory of where you want Progressive Cactus installed:</p>
<pre><code>git clone git://github.com/glennhickey/progressiveCactus.git
cd progressiveCactus
git pull
git submodule update --init
make
</code></pre>
<p>It is also convenient to add the location of&nbsp;<code>progressiveCactus/bin</code>&nbsp;to your PATH environment variable. In order to run the included tools (ex hal2maf) in the submodules/ directory structure, first source&nbsp;<code>progressiveCactus/environment</code>&nbsp;to load the installed environment.</p>
<p>If any errors occur during the build process, you are unlikely to be able to use the tool. Please submit a GitHub issue so we can help out: not only will you help yourself, but others who wish to use the tool as well.</p>
<p><em>Note that all dependencies are also built and included in the submodules/ directory. This increases the size and build time but greatly simplifies installation and version management. The installation does not create or modify any files outside the progressiveCactus/ directory.</em></p><p>Address of the bookmark: <a href="https://github.com/glennhickey/progressiveCactus" rel="nofollow">https://github.com/glennhickey/progressiveCactus</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/31064/cgaln</guid>
	<pubDate>Wed, 22 Feb 2017 05:14:15 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/31064/cgaln</link>
	<title><![CDATA[Cgaln]]></title>
	<description><![CDATA[<p>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.</p>
<p>http://www.iam.u-tokyo.ac.jp/chromosomeinformatics/rnakato/cgaln/</p><p>Address of the bookmark: <a href="http://www.iam.u-tokyo.ac.jp/chromosomeinformatics/rnakato/cgaln/" rel="nofollow">http://www.iam.u-tokyo.ac.jp/chromosomeinformatics/rnakato/cgaln/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/30744/binc-2017</guid>
	<pubDate>Wed, 01 Feb 2017 09:36:22 -0600</pubDate>
	<link>https://bioinformaticsonline.com/news/view/30744/binc-2017</link>
	<title><![CDATA[BINC 2017]]></title>
	<description><![CDATA[<p><span>Pondicherry University,Puducherry,on behalf of Department of Biotechnology, Government of India, conducted the BINC examination in&nbsp;</span><span style="color: blue;">2015 and 2016.&nbsp;</span><span>The objective of this examination is to certify bioinformatics professionals, trained formally as well as self-trained.</span><span style="color: blue;">Registration for BINC 2017 examination will open from January 29,2017 to February 28,2017.</span><span>&nbsp;</span></p><p><span>Pondicherry University, Puducherry has been identified as a nodal agency by the Department of Biotechnology, Govt. of India to coordinate this examination along with nine centres namely, </span></p><p><span>Pune University, Pune; </span></p><p><span>Anna University, Chennai; </span></p><p><span>Bose Institute, Kolkata; </span></p><p><span>Institute of Bioinformatics &amp; Applied Biotechnology, Bangalore; </span></p><p><span>North-Eastern Hill University, Shillong, University of Hyderabad, Hyderabad; </span></p><p><span>University of Kerala, Thiruvananthapuram; </span></p><p><span>Jawaharlal Nehru University, New Delhi and </span></p><p><span>Assam Agricultural University, Guwahati.</span><span style="color: blue;"><strong>&nbsp;</strong></span></p><p><span style="color: blue;"><strong>In the BINC 2015 and 2016 examination, 23 candidates and five candidates were certified respectively.</strong></span><span>&nbsp;DBT has agreed to fund Research fellowships for all the BINC qualified Indian nationals to pursue Ph.D. in Indian Institutes/Universities. </span></p><p><span>Note that the candidate must possess a postgraduate degree(or equivalent) &amp; meet the criteria of the institutes/universities in order to avail research fellowship. </span></p><p><span>In addition, cash prize of Rs. 10,000/- will be awarded to the top 10 BINC qualifiers.</span></p><p><span>More at&nbsp;http://www.pondiuni.edu.in/exams/binc/</span></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30829/mercator</guid>
	<pubDate>Mon, 06 Feb 2017 04:20:36 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30829/mercator</link>
	<title><![CDATA[Mercator]]></title>
	<description><![CDATA[<p><span>Our basic strategy in building homology maps is to use exons that are orthologous in multiple genomes as map "anchors." Given K genomes, the steps in the map construction are as follows:</span></p>
<ul>
<li>For each genome, obtain a set of exon annotations. These annotations can be a combination of both exon predictions (e.g. Genscan) and annotations that have been experimentally verified (e.g. RefSeq). Ideally, we would like to have these annotations be as sensitive as possible. Specificity is not a concern, as incorrect annotations are not likely not have significant alignments with other gene annotations.</li>
<li>Compare all exons against all exons in other genomes and record significant alignments between exons. Currently, we use&nbsp;<a href="https://www.biostat.wisc.edu/~cdewey/mercator/#refBLAT">BLAT</a>&nbsp;to do this all-vs-all comparison with alignments being performed in protein space.</li>
<li>Construct a graph with each vertex corresponding to a exon and edges between vertices whose corresponding exons have significant alignments.</li>
<li>Identify cliques in this graph. These cliques are potential anchors to be used in the map.</li>
<li>Starting with the largest cliques (those that have exons in all or most of the genomes), join neighboring (adjacent in genomic coordinates, in each genome) cliques to form&nbsp;runs. Smaller cliques that are inconsistent with runs formed by larger cliques are filtered out. After the smallest cliques have been considered, cliques that are not part of a run are discarded.</li>
<li>The extents of each run in each genome are outputted as orthologous segments. The cliques from each run are used to output the exact genomic coordinates of anchors within each orthologous segment. These anchors can be used by genomic alignment programs (such as&nbsp;<a href="https://www.biostat.wisc.edu/~cdewey/mercator/#refMAVID">MAVID</a>) to do a detailed alignment of each orthologous segment.</li>
</ul>
<p>https://www.biostat.wisc.edu/~cdewey/mercator/</p><p>Address of the bookmark: <a href="https://www.biostat.wisc.edu/~cdewey/mercator/" rel="nofollow">https://www.biostat.wisc.edu/~cdewey/mercator/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</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>

</channel>
</rss>