<?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/30168?offset=450</link>
	<atom:link href="https://bioinformaticsonline.com/related/30168?offset=450" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<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/41604/synteny-and-rearrangement-identifier-syri</guid>
	<pubDate>Tue, 05 May 2020 10:37:10 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41604/synteny-and-rearrangement-identifier-syri</link>
	<title><![CDATA[Synteny and Rearrangement Identifier (SyRI)]]></title>
	<description><![CDATA[<p>SyRI is a comprehensive tool for predicting genomic differences between related genomes using whole-genome assemblies (WGA). The assemblies are aligned using whole-genome alignment tools, and these alignments are then used as input to SyRI. SyRI identifies syntenic path (longest set of co-linear regions), structural rearrangements (inversions, translocations, and duplications), local variations (SNPs, indels, CNVs etc) within syntenic and structural rearrangements, and un-aligned regions.</p><p>Address of the bookmark: <a href="https://schneebergerlab.github.io/syri/" rel="nofollow">https://schneebergerlab.github.io/syri/</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>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34920/xmatchview-smith-waterman-alignment-visualization</guid>
	<pubDate>Thu, 28 Dec 2017 09:00:58 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34920/xmatchview-smith-waterman-alignment-visualization</link>
	<title><![CDATA[xmatchview: smith-waterman alignment visualization]]></title>
	<description><![CDATA[<p><span>xmatchview and xmatchview-conifer are imaging tools for comparing the synteny between DNA sequences. It allows users to align 2 DNA sequences in fasta format using cross_match and displays the alignment in a variety of image formats. xmatchview and xmatchview-conifer are written in python and run on linux and windows. They serve as visual tools for analyzing cross_match alignments. Cross_match (Green, P. (1994)&nbsp;</span><a href="http://www.phrap.org/">http://www.phrap.org</a><span>) uses an implementation of the Smith-Waterman algorithm for comparing DNA sequences that is sensitive.</span></p>
<p><span>http://www.bcgsc.ca/platform/bioinfo/software/xmatchview</span></p><p>Address of the bookmark: <a href="https://github.com/warrenlr/xmatchview" rel="nofollow">https://github.com/warrenlr/xmatchview</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/6562/molecular-bioinformatics-lab-mbl</guid>
  <pubDate>Tue, 19 Nov 2013 18:23:27 -0600</pubDate>
  <link></link>
  <title><![CDATA[Molecular Bioinformatics Lab (MBL)]]></title>
  <description><![CDATA[
<p>The main subject of interest in our laboratory is the study of the relationship among sequence, structure, and function in proteins and nucleic acids. Our research can be divided in two major topics:</p>

<p>the study of the sequence-structure relationship<br />(application -&gt; structure prediction)<br />the study of the structure-function relationship<br />(application -&gt; function prediction)</p>

<p>Therefore, anything related to the configuration (sequence) and conformation (structure) in atomic systems of proteins and nucleic acids, and the interaction of these with other elements (function) is of our major interest.</p>

<p>Lab page @ http://melolab.org/mbl/</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41582/flexidot-highly-customizable-ambiguity-aware-dotplots-for-visual-sequence-analyses</guid>
	<pubDate>Fri, 24 Apr 2020 08:39:28 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41582/flexidot-highly-customizable-ambiguity-aware-dotplots-for-visual-sequence-analyses</link>
	<title><![CDATA[flexidot: Highly customizable, ambiguity-aware dotplots for visual sequence analyses]]></title>
	<description><![CDATA[<p><span>FlexiDot is a cross-platform dotplot suite generating high quality self, pairwise and all-against-all visualizations. To improve dotplot suitability for comparison of consensus and error-prone sequences, FlexiDot harbors routines for strict and relaxed handling of mismatches and ambiguous residues. The custom shading modules facilitate dotplot interpretation and motif identification by adding information on sequence annotations and sequence similarities to the images. Combined with collage-like outputs, FlexiDot supports simultaneous visual screening of a large sequence sets, allowing dotplot use for routine screening.</span></p>
<p><img src="https://github.com/molbio-dresden/flexidot/blob/master/images/Beetle_matrix_shading.png?raw=true" alt="image" style="border: 0px; border: 0px;"></p><p>Address of the bookmark: <a href="https://github.com/molbio-dresden/flexidot" rel="nofollow">https://github.com/molbio-dresden/flexidot</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/6818/scientist-positions-gujarat-state-biotechnology-mission</guid>
  <pubDate>Mon, 25 Nov 2013 10:26:39 -0600</pubDate>
  <link></link>
  <title><![CDATA[Scientist Positions @ Gujarat State Biotechnology Mission]]></title>
  <description><![CDATA[
<p>Gujarat State Biotechnology Mission invite applications [Online Only] under various projects* namely Gujarat Biodiversity Gene Bank (BioGene), Gujarat Institute of Genomics (GIG), Gujarat Institute of Bioinformatics [GIBS] and Gujarat Institute of Marine Biotechnology. Eligible candidates can Apply through online application portal.</p>

<p>1 Scientist E 3</p>

<p>50,000/-</p>

<p>M.Sc. in Life sciences or Plant Sciences or Biotechnology or Microbiology or Bioinformatics or Ph.D. from a recognized university in any of above subject.</p>

<p>Minimum 8 Yrs. of experience after M.Sc. or 5 Yrs. of experience after Ph.D. in responsible position of work in R &amp; D in the area of genomics/ conservation biotechnology/bioinformatics/Planning/Scientific Administration in Science and technology organization. Highly qualified in the area of modern biology, as evidenced through research experience and proven ability to carry out work in the area of conservation biotechnology. Age limit not exceeding 40yrs.</p>

<p>2 Scientist B 6</p>

<p>30,000/-</p>

<p>M.Sc. in Life sciences or Plant Sciences or Biotechnology or Microbiology or Bioinformatics or Ph.D. from a recognized university in any of above subject shall be preferred.</p>

<p>Minimum 3 Yrs. of experience after M.Sc. in responsible position of work in R &amp; D in the area of genomics/ conservation biotechnology/ bioinformatics /Planning/Scientific Administration in Science and technology organization. Highly qualified in the area of modern biology, as evidenced through research experience and proven ability to carry out work in the area of conservation biotechnology. Age limit not exceeding 35yrs.</p>

<p>The positions are purely on contractual basis for 11 months. Interested candidates can apply online in specified format available at "http://leogen.in/recruit/" The last date of applying is 24th December, 2013. Applications must be submitted online only. Applications submitted in any other format except online prescribed performa will be rejected. Candidates in service must apply through proper channel. Candidates will be required to provide original documents along with duly filled and signed application Performa, as and when called for interview.</p>

<p>For more details please visit the website URL : http://leogen.in/recruit</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43062/jcvi-utility-libraries</guid>
	<pubDate>Sat, 08 May 2021 22:04:02 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43062/jcvi-utility-libraries</link>
	<title><![CDATA[JCVI utility libraries]]></title>
	<description><![CDATA[<p><span>Collection of Python libraries to parse bioinformatics files, or perform computation related to assembly, annotation, and comparative genomics.</span></p><p>Address of the bookmark: <a href="https://github.com/tanghaibao/jcvi" rel="nofollow">https://github.com/tanghaibao/jcvi</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/7088/gabi</guid>
  <pubDate>Fri, 06 Dec 2013 16:43:01 -0600</pubDate>
  <link></link>
  <title><![CDATA[GABi]]></title>
  <description><![CDATA[
<p>GABi Research<br />The major researching fields defined as the GABi scope are described next:<br />    Sequence Analysis<br />    Protein Structure Prediction<br />    Comparative Genomics<br />    Functional Analysis of Residues on Protein Families<br />    Gene/Protein Networks<br />    Genome structure &amp; base composition<br />    Highthroughput data analysis from NGS</p>

<p>Lab Page http://gabi.cidbio.org/index/</p>
]]></description>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/7214/lapti-lab</guid>
  <pubDate>Thu, 12 Dec 2013 18:19:12 -0600</pubDate>
  <link></link>
  <title><![CDATA[LAPTI Lab]]></title>
  <description><![CDATA[
<p>The main theme of our research is the understanding of how genetic information is decoded from DNA into RNA and proteins. Someone may find this topic a little strange and argue that we already know how this is happening.</p>

<p>Translational recoding. </p>

<p>RNA editing. </p>

<p>Evolution of the genetic code and translation.</p>

<p>More at http://lapti.ucc.ie/research.html</p>

<p>Lab page http://lapti.ucc.ie/index.html</p>
]]></description>
</item>

</channel>
</rss>