<?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/27438?offset=1460</link>
	<atom:link href="https://bioinformaticsonline.com/related/27438?offset=1460" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/file/view/29652/bioistats-ppt</guid>
	<pubDate>Tue, 08 Nov 2016 07:09:01 -0600</pubDate>
	<link>https://bioinformaticsonline.com/file/view/29652/bioistats-ppt</link>
	<title><![CDATA[Bioistats PPT]]></title>
	<description><![CDATA[<p>Basics concepts of&nbsp;Probability: The Study of Randomness</p><p>Biostatistics is the application of statistics to a wide range of topics in biology. The science of biostatistics encompasses the design of biological experiments, especially in medicine, pharmacy, agriculture and fishery; the collection, summarization, and analysis of data from those experiments; and the interpretation of, and inference from, the results. A major branch of this is medical biostatistics, which is exclusively concerned with medicine and health.</p>]]></description>
	<dc:creator>Jit</dc:creator>
	<enclosure url="https://bioinformaticsonline.com/file/download/29652" length="1663809" type="application/pdf" />
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42941/csa-a-high-throughput-chromosome-scale-assembly-pipeline-for-vertebrate-genomes</guid>
	<pubDate>Wed, 10 Mar 2021 06:13:49 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42941/csa-a-high-throughput-chromosome-scale-assembly-pipeline-for-vertebrate-genomes</link>
	<title><![CDATA[CSA: A high-throughput chromosome-scale assembly pipeline for vertebrate genomes]]></title>
	<description><![CDATA[<p>The pipeline can use information from scaffolded assemblies (for example from HiC or 10X Genomics), or even from diverged (~65-100 Mya) reference genomes for ordering the contigs and thus support the assembly process. This typically results in improved contig N50 when compared to current state of the art methods.</p>
<p><img src="https://github.com/HMPNK/CSA2.6/raw/master/Fig1.png" alt="image" style="border: 0px;"></p>
<p>For smaller vertebrate genomes (~1 Gbp) chromosome scale assemblies can be achieved within 12h on high-end Desktop computers (Intel i7, 12 CPU threads, 128 GB RAM). Larger mammalian genomes (~3Gbp) can be processed within 15-18 h on server equipment (Xeon, 96 CPU threads, 1TB RAM).</p><p>Address of the bookmark: <a href="https://github.com/HMPNK/CSA2.6" rel="nofollow">https://github.com/HMPNK/CSA2.6</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/29679/comparative-genomics-educational-material-and-papers-bookmarks</guid>
	<pubDate>Wed, 09 Nov 2016 16:23:30 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/29679/comparative-genomics-educational-material-and-papers-bookmarks</link>
	<title><![CDATA[Comparative genomics educational material and papers bookmarks]]></title>
	<description><![CDATA[<p><span>Alignment of the porcine genome against seven other mammalian genomes (</span><a href="http://www.nature.com/nature/journal/v491/n7424/full/nature11622.html#supplementary-information">Supplementary Information</a><span>) identified homologous synteny blocks (HSBs). Using porcine HSBs and stringent filtering criteria, 192 pig-specific evolutionary breakpoint regions (EBRs) were located. The number of porcine EBRs </span><span>is comparable to the number of bovine-lineage-specific EBRs (100) reported earlier using a slightly lower resolution (500</span><span><span>&thinsp;</span></span><span>kilobases (kb)), indicating that both lineages evolved with an average rate of ~2.1 large-scale rearrangements per million years after the divergence from a common cetartiodactyl ancestor ~60</span><span><span>&thinsp;</span></span><span>Myr ago</span><sup><a href="http://www.nature.com/nature/journal/v491/n7424/full/nature11622.html#ref2" title="Meredith, R. W. et al. Impacts of the Cretaceous Terrestrial Revolution and KPg extinction on mammal diversification. Science 334, 521-524 (2011)">2</a></sup><span>. This rate compares to ~1.9 rearrangements per million years within the primate lineage (</span><a href="http://www.nature.com/nature/journal/v491/n7424/full/nature11622.html#supplementary-information">Supplementary Table 11</a><span>). A total of 20 and 18 cetartiodactyl EBRs (shared by pigs and cattle) were detected using the pig and human genomes as a reference, respectively.</span></p><p>Address of the bookmark: <a href="http://www.nature.com/nature/journal/v491/n7424/abs/nature11622.html" rel="nofollow">http://www.nature.com/nature/journal/v491/n7424/abs/nature11622.html</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/29849/ra-bioinformatics-at-national-institute-of-cancer-prevention-research-icmr</guid>
  <pubDate>Thu, 17 Nov 2016 04:11:09 -0600</pubDate>
  <link></link>
  <title><![CDATA[RA Bioinformatics at NATIONAL INSTITUTE OF CANCER PREVENTION &amp; RESEARCH (ICMR)]]></title>
  <description><![CDATA[
<p>NATIONAL INSTITUTE OF CANCER PREVENTION &amp; RESEARCH (ICMR)</p>

<p>Noida 201301 (U.P)</p>

<p>Applications are invited upto 21.11.2016 from interested candidates as per details available on NICPR website (www.nicpr.res.in)/ ICMR website (www.icmr.nic.in) to fill up following temporary position in the time bound DHR Project entitled “Next generation EGFR inhibitor identification using ligand based QSAR technique” under Dr. Subhash M. Agarwal, Scientist-D, Division of Bioinformatics.</p>

<p>Research Assistant (One)</p>

<p>Rs.27000/- p.m. (Fixed/temporary)</p>

<p>Essential: M.Sc. in Bioinformatics or related field.</p>

<p>Desirable: Experience in QSAR and structure based drug designing.</p>

<p>More Info : www.icmr.nic.in/icmrnews/NICPR_Advertisement%20for%20RA.pdf</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30027/dbt-india</guid>
	<pubDate>Sun, 04 Dec 2016 22:30:37 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30027/dbt-india</link>
	<title><![CDATA[DBT India]]></title>
	<description><![CDATA[<p>Latest announcement on DBT India.&nbsp;</p>
<p>Calls</p>
<p>Events</p>
<p>Projects</p>
<p>Jobs</p>
<p>&nbsp;</p><p>Address of the bookmark: <a href="http://www.dbtindia.nic.in/out-reach/latest-announcements/" rel="nofollow">http://www.dbtindia.nic.in/out-reach/latest-announcements/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/30245/venkatesh-lab</guid>
  <pubDate>Tue, 20 Dec 2016 04:38:01 -0600</pubDate>
  <link></link>
  <title><![CDATA[Venkatesh Lab]]></title>
  <description><![CDATA[
<p>We are using a comparative genomics approach to better understand the structure, function and evolution of the human genome. Our group is one of the pioneers in the field of comparative genomics. We proposed the compact genome of the fugu (Takifugu rubripes) as a model vertebrate genome in 1993 (Nature 366: 265-268, 1993) and determined its whole genome sequence in 2002 (Science 297: 1301-1310, 2002).</p>

<p>More at <br />https://zfin.org/ZDB-LAB-110408-1<br />http://www.imcb.a-star.edu.sg/php/venkatesh.php</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30336/finding-patterns-in-biological-sequences</guid>
	<pubDate>Thu, 22 Dec 2016 10:30:49 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30336/finding-patterns-in-biological-sequences</link>
	<title><![CDATA[Finding Patterns in Biological Sequences]]></title>
	<description><![CDATA[<p>In this report we provide an overview of known techniques for discovery of patterns of biological sequences (DNA and proteins). We also provide biological motivation, and methods of biological verification of such patterns. Finally we list publicly available tools and databases for pattern discovery. On-line supplement is available through http://genetics.uwaterloo.ca/&sim;tvinar/cs798g/motif.</p><p>Address of the bookmark: <a href="http://engr.case.edu/li_jing/papers/00798gpattern.pdf" rel="nofollow">http://engr.case.edu/li_jing/papers/00798gpattern.pdf</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30459/prodigal-prokaryotic-dynamic-programming-genefinding-algorithm</guid>
	<pubDate>Thu, 29 Dec 2016 03:26:45 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30459/prodigal-prokaryotic-dynamic-programming-genefinding-algorithm</link>
	<title><![CDATA[Prodigal (Prokaryotic Dynamic Programming Genefinding Algorithm)]]></title>
	<description><![CDATA[<p><span>Prodigal (</span><strong>Pro</strong><span>karyotic&nbsp;</span><strong>Dy</strong><span>namic Programming&nbsp;</span><strong>G</strong><span>enefinding&nbsp;</span><strong>Al</strong><span>gorithm) is a microbial (bacterial and archaeal) gene finding program developed at Oak Ridge National Laboratory and the University of Tennessee. Key features of Prodigal include:</span></p>
<ul>
<li><strong>Speed</strong>: Prodigal is an extremely fast gene recognition tool (written in very vanilla C). It can analyze an entire microbial genome in 30 seconds or less.</li>
<li><strong>Accuracy</strong>: Prodigal is a highly accurate gene finder. It correctly locates the 3' end of every gene in the experimentally verified Ecogene data set (except those containing introns). It possesses a very sophisticated ribosomal binding site scoring system that enables it to locate the translation initiation site with great accuracy (96% of the 5' ends in the Ecogene data set are located correctly).</li>
<li><strong>Specificity</strong>: Prodigal's false positive rate compares favorably with other gene identification programs, and usually falls under 5%.</li>
<li><strong>GC-Content Indifferent</strong>: Prodigal performs well even in high GC genomes, with over a 90% perfect match (5'+3') to the&nbsp;<em>Pseudomonas aeruginosa</em>&nbsp;curated annotations.</li>
<li><strong>Metagenomic Version</strong>: Prodigal can run in metagenomic mode and analyze sequences even when the organism is unknown.</li>
<li><strong>Ease of Use</strong>: Prodigal can be run in one step on a single genomic sequence or on a draft genome containing many sequences. It does not need to be supplied with any knowledge of the organism, as it learns all the properties it needs to on its own.</li>
<li><strong>Open Source</strong>: Prodigal source code is freely available under the General Public License.</li>
</ul>
<p>&nbsp;</p>
<div style="text-align: center;"><strong>Download the latest version of Prodigal at&nbsp;<a href="http://github.com/hyattpd/prodigal/releases/">the Prodigal github page.</a></strong>&nbsp;<br>or&nbsp;<br><strong>Browse the&nbsp;<a href="http://github.com/hyattpd/prodigal/wiki">wiki documenation.</a></strong>&nbsp;</div><p>Address of the bookmark: <a href="http://prodigal.ornl.gov/" rel="nofollow">http://prodigal.ornl.gov/</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/30658/srf-bioinformatics-at-jnu</guid>
  <pubDate>Tue, 24 Jan 2017 07:34:35 -0600</pubDate>
  <link></link>
  <title><![CDATA[SRF Bioinformatics at JNU]]></title>
  <description><![CDATA[
<p>School of Life Sciences <br />Jawaharlal Nehru University <br />New Delhi 110067</p>

<p>Positions available</p>

<p>Applications were invited from for the following posts in an industry sponsored project. The project entitled "OsHK3b technology and Know How", valid for a period upto February, 2018.</p>

<p>Post 3: Senior Research Fellow (Computational Biologist / Metabolic engineering)</p>

<p>Salary: As per DBT rule.</p>

<p>Duration: All the above posts are purely temporary and liable to be terminated at any time without prior notice or ceased/withdrawn by the funding agency.</p>

<p>Age limit: The upper age limit for SRF shall be 32 years, which is relaxed upto 5 years in the case of candidates belonging to Schedule Castes/Schedule Tribes, Women, Physically Handicapped and OBC applicants.</p>

<p>Essential Qualifications: Masters/B Tech/Mtech in Basic Sciences with at least 2yrs of research experience in Bioinformatics/Computational Biology related to Database /portal building &amp; maintenance, high throughput data handling and analysis etc. For M.Sc/B.Tech, Published paper in peer-reviewed Journal and for M.Tech, thesis submission in computational biology is a must. Selection preference will be given to candidates with a good knowledge of Python and/or R. Knowledge of JAVA will also get a special consideration.</p>

<p>Desired Skills: Will be expected to manage ongoing research activities in the project, interact with Experimental group, manage the project data analysis, prepare file reports and associated project work etc. Familiarity with plant systems biology and genomics /metabolite resources related to plant metabolomics is desirable.</p>

<p>1. The post applied for must be clearly written on the Envelope containing the application <br />2. Applications received after last date shall not be entertained, School will not be responsible for any postal delay. <br />3. No application will be accepted via hand delivery or via e-mail. Please send printed &amp; signed applications with detailed CV on or before 31st January, 2017 by post to the following address:</p>

<p>Prof. Ashwani Pareek <br />(Project Investigator) <br />Stress Physiology and Molecular Biology Laboratory (Room No-413), <br />School of Life Sciences, <br />Jawaharlal Nehru University, <br />New Delhi, India – 110067 <br />Email: ashwanipareek@gmail.com</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30698/itol-interactive-tree-of-life</guid>
	<pubDate>Tue, 31 Jan 2017 05:56:30 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30698/itol-interactive-tree-of-life</link>
	<title><![CDATA[iTOL: interactive Tree Of Life]]></title>
	<description><![CDATA[<p><strong>Interactive Tree Of Life</strong><span>&nbsp;is an online tool for the display and manipulation of phylogenetic trees. It provides most of the features available in other tree viewers, and offers a novel circular tree layout, which makes it easy to visualize mid-sized tree (up to several thousand leaves). Trees can be exported to several graphical formats, both bitmap and vector based.</span></p>
<p><img src="http://itol.embl.de/img/home/ex3.png" alt="image" style="border: 0px;"><br><span>There are several pre-computed trees available for display, including the main Tree Of Life, described in&nbsp;</span><a href="http://www.ncbi.nlm.nih.gov/pubmed/16513982">Ciccarelli, et al., 2006</a><span>. In addition to the precomputed trees, users can upload and display personal trees and data, using the 'Data upload' page or through a personal user account.</span></p><p>Address of the bookmark: <a href="http://itol.embl.de/" rel="nofollow">http://itol.embl.de/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>