<?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/44472?offset=380</link>
	<atom:link href="https://bioinformaticsonline.com/related/44472?offset=380" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/33847/omega2-metagenome-assembly-pipeline</guid>
	<pubDate>Mon, 10 Jul 2017 05:56:07 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/33847/omega2-metagenome-assembly-pipeline</link>
	<title><![CDATA[Omega2: metagenome assembly pipeline]]></title>
	<description><![CDATA[<p><span>Omega found overlaps between reads using a prefix/suffix hash table. The overlap graph of reads was simplified by removing transitive edges and trimming short branches. Unitigs were generated based on minimum cost flow analysis of the overlap graph and then merged to contigs and scaffolds using mate-pair information. In comparison with three de Bruijn graph assemblers (SOAPdenovo, IDBA-UD and MetaVelvet), Omega provided comparable overall performance on a HiSeq 100-bp dataset and superior performance on a MiSeq 300-bp dataset. In comparison with Celera on the MiSeq dataset, Omega provided more continuous assemblies overall using a fraction of the computing time of existing overlap-layout-consensus assemblers. This indicates Omega can more efficiently assemble longer Illumina reads, and at deeper coverage, for metagenomic datasets.</span></p><p>Address of the bookmark: <a href="http://omega.omicsbio.org/" rel="nofollow">http://omega.omicsbio.org/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/5702/research-fellow-in-bioinformatics-queens-university-belfast-institute-for-global-food-security-school-of-biological-sciences</guid>
  <pubDate>Thu, 17 Oct 2013 04:33:02 -0500</pubDate>
  <link></link>
  <title><![CDATA[Research Fellow in Bioinformatics @  Queen's University Belfast -Institute for Global Food Security, School of Biological Sciences]]></title>
  <description><![CDATA[
<p>Ref: 13/102900</p>

<p>Available immediately until 30th November 2015, to work on the development of bioinformatics approaches to aid analysis of data derived from the metabolomic profiling of biological matrices. The successful applicant will lead research activities on an FP7 funded EU-wide collaborative project aimed at establishing biomarker-based strategies for high throughput diagnostic screening. Key tasks will involve multivariate analysis of large datasets, bioinformatic-based selection and validation of identified markers, construction of metabolomic spectral profile databases and development of machine learning/database searching approaches amenable to analytical screening techniques. This position will offer the opportunity to travel and undertake work with project collaborators based in the Republic of Ireland and Europe.</p>

<p>Informal enquiries may be directed to Dr Terry McGrath, email: terry.mcgrath@qub.ac.uk.</p>

<p>Anticipated interview date: Thursday 31st October 2013<br />Salary scale: £30,424 – £39,649 per annum (including contribution points)<br />Closing date: Monday 21st October 2013  </p>

<p>Telephone (028) 90973044 FAX: (028) 90971040 or e-mail on personnel@qub.ac.uk</p>

<p>The University is committed to equality of opportunity and to selection on merit.  It therefore welcomes applications from all sections of society and particularly welcomes applications from people with a disability. </p>

<p>Fixed term contract posts are available for the stated period in the first instance but in particular circumstances may be renewed or made permanent subject to availability of funding.</p>

<p>More @ https://hrwebapp.qub.ac.uk/tlive_webrecruitment/wrd/run/ETREC107GF.open?VACANCY_ID=5616943npO&amp;WVID=6273090Lgx&amp;LANG=USA</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34398/ont-assembly-and-illumina-polishing-pipeline</guid>
	<pubDate>Thu, 23 Nov 2017 10:13:42 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34398/ont-assembly-and-illumina-polishing-pipeline</link>
	<title><![CDATA[ONT assembly and Illumina polishing pipeline]]></title>
	<description><![CDATA[<p>This pipeline performs the following steps:</p>
<ul>
<li>Assembly of nanopore reads using&nbsp;<a href="http://canu.readthedocs.io/">Canu</a>.</li>
<li>Polish canu contigs using&nbsp;<a href="https://github.com/isovic/racon">racon</a>&nbsp;(<em>optional</em>).</li>
<li>Map a paired-end Illumina dataset onto the contigs obtained in the previous steps using&nbsp;<a href="http://bio-bwa.sourceforge.net/">BWA</a>&nbsp;mem.</li>
<li>Perform correction of contigs using&nbsp;<a href="https://github.com/broadinstitute/pilon/wiki">pilon</a>&nbsp;and the Illumina dataset.</li>
</ul><p>Address of the bookmark: <a href="https://github.com/nanoporetech/ont-assembly-polish" rel="nofollow">https://github.com/nanoporetech/ont-assembly-polish</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/5947/jrf-national-jalma-institute-of-leprosy-and-other-mycobacterial-diseases</guid>
  <pubDate>Mon, 28 Oct 2013 10:42:48 -0500</pubDate>
  <link></link>
  <title><![CDATA[JRF @ NATIONAL JALMA INSTITUTE OF LEPROSY AND OTHER MYCOBACTERIAL DISEASES]]></title>
  <description><![CDATA[
<p>NATIONAL JALMA INSTITUTE OF LEPROSY AND OTHER MYCOBACTERIAL DISEASES</p>

<p>(INDIAN COUNCIL OF MEDICAL RESEARCH)</p>

<p>P.O BOX 101,<br />Dr. M. Miyazaki Marg,<br />Tajganj, Agra - 282001</p>

<p>Applications are invited for a walk-in interview to be held in the Seminar Hall of the on 15th November, 2013, 9:30 am for temporary positions of JRF, Lab Technician and Field attendant in a ICMR funded project entitled "Elucidating the strain differentiation and transmission dynamics of M. leprae through simple sequence repeats ISSR-PCR marker"</p>

<p>1. JRF (one Post)</p>

<p>    Essential qualification: Candidates with M.Sc/IVI.Tech or equivalent degree in any life science related subjects with UGC-CSIR/ICMR/DBT-Net qualified</p>

<p>    Desirable qualification: Experience in Molecular Biology/Computational Biology will be preferred.</p>

<p>    Age. Maximum 28 years as on 11.11.2013. Age relaxation as per GOI rules.</p>

<p>    Emoluments: Rs. 6,000 + 20% HRA per Month</p>

<p>2. Lab Technician (One Post)</p>

<p>    Essential Qualification: 12th with DMLT/B.SCA4.SC in Life sciences</p>

<p>    Desirable qualification: Experience in Molecular Biology/Computational Biology will be preferred.</p>

<p>    Age: Maximum 30 years as on 11.11.2013. Age relaxation as per GOI rules.</p>

<p>    Emoluments: Rs13,760/ Per Month</p>

<p>3. Field Attendant (One Post)</p>

<p>Essential Qualification: 10th Pass</p>

<p>Desirable Qualification: Experience in field work</p>

<p>Age: Maximum 28 years as on 11.11.2013. Age relaxation as per GOI rules.</p>

<p>Emoluments: Rsl2,040l Per Month</p>

<p>Terms: posts are purely temporary. Appointment will be initially made for a period of one (01) year and may be extended further based on the performance of the candidate up to completion of the project.</p>

<p>Application &amp; Selection procedure: candidates have to appear in the walk-in-interview in person along with an application/CV on plain paper giving details of at educational qualificationq experience and submit photocopies of relevant documents at the time of interview. Selection will be based on the performance of the candidate in the interview' Candidates will not be sent any interview call letter separately. No TA/DA will be paid to the candidate for appearing in the interview. selection is not possible without appearing in the interview. All candidates must report by 9:00am on the date of interview. Advance copy of CV may be sent to m.sarathipartha@gmail.com</p>

<p>Advertisement: http://www.jalma-icmr.org.in/P_S_M_advertisment.pdf</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38067/metaplotr-a-perlr-pipeline-for-plotting-metagenes-of-nucleotide-modifications-and-other-transcriptomic-sites</guid>
	<pubDate>Mon, 05 Nov 2018 08:12:45 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38067/metaplotr-a-perlr-pipeline-for-plotting-metagenes-of-nucleotide-modifications-and-other-transcriptomic-sites</link>
	<title><![CDATA[MetaPlotR: a Perl/R pipeline for plotting metagenes of nucleotide modifications and other transcriptomic sites]]></title>
	<description><![CDATA[<p><span>An increasing number of studies are mapping protein binding and nucleotide modifications sites throughout the transcriptome. Often, these sites cluster in certain regions of the transcript, giving clues to their function. Hence, it is informative to summarize where in the transcript these sites occur. A metagene is a simple and effective tool for visualizing the distribution of sites along a simplified transcript model. In this work, we introduce MetaPlotR, a Perl/R pipeline for creating metagene plots.</span></p><p>Address of the bookmark: <a href="https://github.com/olarerin/metaPlotR" rel="nofollow">https://github.com/olarerin/metaPlotR</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/7815/post-doc-in-systems-genetics</guid>
  <pubDate>Wed, 08 Jan 2014 19:23:37 -0600</pubDate>
  <link></link>
  <title><![CDATA[Post-doc in Systems Genetics]]></title>
  <description><![CDATA[
<p>Gagneur lab at Gene Center, Ludwig-Maximilians-Universitaet, Munich, Germany</p>

<p>Deadline for applications : January 15, 2014.</p>

<p>Description :</p>

<p>We seek a talented and motivated post-doc to develop computational methods for inferring the molecular basis of genetic diseases by integration of personal omics data. Research topics include: identifying causal mutations of rare disease patients by meta-analysis; inferring disease-causing molecular pathways from genotype, human phenotypes, and omics profile of patient-derived cell lines; and causal inference from longitudinal omics studies of patients. The developed methods will be applied to analyze data from our medical collaborators.</p>

<p>Candidates must either hold a PhD in computational biology or bioinformatics, or hold a PhD in physics, statistics, or applied mathematics with practical experience with high-dimensional data analysis. Experience in quantitative genetics is a plus. Applicants must have a proven publication record and an interest for translational research.</p>

<p>The Gagneur lab is a young, lively and multidisciplinary group with a research focus on systems genetics and gene regulation. It is located at the Gene Center of the LMU (University of Munich), an interdisciplinary institution whose 16 independent research groups investigate the regulation of gene expression at all levels - from the underlying molecular mechanisms to the biological system. The institute is located on the biomedical research campus Munich-Grosshadern, offering a dynamic, interactive and internationally oriented research environment. The dynamism of Munich and the proximity of the Alps provide an excellent quality of life.</p>

<p>The salary is according to the TV-L (German academic salary scale).<br />Applications including a cover letter, CV, and references must be sent by January 15th 2014 to Julien Gagneur (gagneur@genzentrum.lmu.de)</p>

<p>About the lab: http://www.gagneur.genzentrum.lmu.de</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/39843/dnapipete-a-pipeline-designed-to-find-annotate-and-quantify-transposable-elements</guid>
	<pubDate>Mon, 12 Aug 2019 21:56:08 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/39843/dnapipete-a-pipeline-designed-to-find-annotate-and-quantify-transposable-elements</link>
	<title><![CDATA[dnaPipeTE: a pipeline designed to find, annotate and quantify Transposable Elements]]></title>
	<description><![CDATA[<p><span>dnaPipeTE (for de-novo assembly &amp; annotation Pipeline for Transposable Elements), is a pipeline designed to find, annotate and quantify Transposable Elements in small samples of NGS datasets. It is very useful to quantify the proportion of TEs in newly sequenced genomes since it does not require genome assembly and works on small datasets (&lt; 1X).</span></p>
<p><span><a href="https://github.com/clemgoub/dnaPipeTE/wiki/dnaPipeTE-WIKI-home">https://github.com/clemgoub/dnaPipeTE/wiki/dnaPipeTE-WIKI-home</a></span></p><p>Address of the bookmark: <a href="https://github.com/clemgoub/dnaPipeTE" rel="nofollow">https://github.com/clemgoub/dnaPipeTE</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/file/view/7032/computer-experts-in-biotechnology-laboratory</guid>
	<pubDate>Wed, 04 Dec 2013 02:11:43 -0600</pubDate>
	<link>https://bioinformaticsonline.com/file/view/7032/computer-experts-in-biotechnology-laboratory</link>
	<title><![CDATA[Computer experts in biotechnology laboratory]]></title>
	<description><![CDATA[<p>Only bioinformatician can understand that <strong>multiplication</strong> and <strong>division</strong> are different but same thing :)</p><p><span>Disclaimer:</span>&nbsp;This cartoon is solely designed to create humour and fun, not to offend any computer experts.</p>]]></description>
	<dc:creator>Jit</dc:creator>
	<enclosure url="https://bioinformaticsonline.com/file/download/7032" length="35726" type="image/gif" />
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40856/3d-de-novo-assembly-3d-dna-pipeline</guid>
	<pubDate>Sun, 02 Feb 2020 13:41:55 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40856/3d-de-novo-assembly-3d-dna-pipeline</link>
	<title><![CDATA[3D de novo assembly (3D DNA) pipeline]]></title>
	<description><![CDATA[<p>For a detailed description of the pipeline and how it integrates with other tools designed by the Aiden Lab see&nbsp;<a href="http://aidenlab.org/assembly/manual_180322.pdf">Genome Assembly Cookbook</a>&nbsp;on&nbsp;<a href="http://aidenlab.org/assembly">http://aidenlab.org/assembly</a>.</p>
<p>For the original version of the pipeline and to reproduce the Hs2-HiC and the AaegL4 genomes reported in&nbsp;<a href="http://science.sciencemag.org/content/356/6333/92">(Dudchenko et al.,&nbsp;<em>Science</em>, 2017)</a>&nbsp;see the&nbsp;<a href="https://github.com/theaidenlab/3d-dna/tree/745779bdf64db6e55bddb70c24e9b58825938c33">original commit</a>.</p>
<p>For the detailed description of the merge section see&nbsp;<a href="https://github.com/theaidenlab/AGWG-merge">https://github.com/theaidenlab/AGWG-merge</a>.</p><p>Address of the bookmark: <a href="https://github.com/theaidenlab/3d-dna" rel="nofollow">https://github.com/theaidenlab/3d-dna</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/6380/hidden-markov-models-viterbi-algorithm-markov-chain-exploration-with-script</guid>
	<pubDate>Thu, 14 Nov 2013 13:36:56 -0600</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/6380/hidden-markov-models-viterbi-algorithm-markov-chain-exploration-with-script</link>
	<title><![CDATA[Hidden Markov Models, Viterbi Algorithm, Markov Chain Exploration with script]]></title>
	<description><![CDATA[<p><strong>Hidden Markov Models, the Viterbi Algorithm, and CpG Islands (in VB6)</strong></p><p><strong>Problem :</strong></p><p>The CG island is a stretch of DNA (usually longer than 200 bases) in which the frequency of the CG sequence is higher than other regions. It is also called the CpG island, where "p" simply indicates that "C" and "G" are connected by a phosphodiester bond.<br /><br />CpG islands are often located around the promoters of housekeeping genes (which are essential for general cell functions) or other genes frequently expressed in a cell. At these locations, the CG sequence is not methylated. By contrast, the CG sequences in inactive genes are usually methylated to suppress their expression. The methylated cytosine may be converted to thymine by accidental deamination. Unlike the cytosine to uracil mutation which is efficiently repaired, the cytosine to thymine mutation can be corrected only by the mismatch repair which is very inefficient. Hence, over evolutionary time scales, the methylated CG sequence will be converted to the TG sequence.</p><p>Find step wise explanationand implementation steps at <a href="http://dna.cs.byu.edu/bio465/Labs/hmm.shtml">http://dna.cs.byu.edu/bio465/Labs/hmm.shtml</a></p><p>Source code with explanation <a href="http://www.tannerhelland.com/1187/hidden-markov-models-viterbi-algorithm-cpg-islands-in-vb6/">http://www.tannerhelland.com/1187/hidden-markov-models-viterbi-algorithm-cpg-islands-in-vb6/</a></p><p>Fore detail understanding of HMM read this excellent tutorial <a href="http://www.cs.ubc.ca/~murphyk/Software/HMM/labman2.pdf">http://www.cs.ubc.ca/~murphyk/Software/HMM/labman2.pdf</a></p><p>Viterbi Algo at <a href="http://en.wikipedia.org/wiki/Viterbi_path">http://en.wikipedia.org/wiki/Viterbi_path</a></p><p>For firther reading Wiki page <a href="http://en.wikipedia.org/wiki/Hidden_Markov_model">http://en.wikipedia.org/wiki/Hidden_Markov_model</a></p><p>On CpG island paper and for indepth understanding <a href="http://www.biomedcentral.com/1471-2164/12/S2/S10">http://www.biomedcentral.com/1471-2164/12/S2/S10</a></p><p>&nbsp;</p><p>If you are more interested in exploring&nbsp;Markov Chain Exploration and understand it with graphical version please visit <a href="http://www.planet-source-code.com/vb/scripts/ShowCode.asp?txtCodeId=75049&amp;lngWId=1">http://www.planet-source-code.com/vb/scripts/ShowCode.asp?txtCodeId=75049&amp;lngWId=1</a></p><p>Reference:</p><p>1.<a href="http://www.planet-source-code.com/vb/scripts/ShowCode.asp?txtCodeId=75049&amp;lngWId=1">http://www.planet-source-code.com</a></p><p>2. <a href="http://www.tannerhelland.com/1187/hidden-markov-models-viterbi-algorithm-cpg-islands-in-vb6/">http://www.tannerhelland.com</a></p>]]></description>
	<dc:creator>Manisha Mishra</dc:creator>
</item>

</channel>
</rss>