<?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/37460?offset=40</link>
	<atom:link href="https://bioinformaticsonline.com/related/37460?offset=40" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/28884/tgnet</guid>
	<pubDate>Wed, 24 Aug 2016 05:36:36 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/28884/tgnet</link>
	<title><![CDATA[TGNet]]></title>
	<description><![CDATA[<p><span>Recent technological progress has greatly facilitated&nbsp;</span><em>de novo</em><span>&nbsp;genome sequencing. However,&nbsp;</span><em>de novo</em><span>&nbsp;assemblies consist in many pieces of contiguous sequence (contigs) arranged in thousands of scaffolds instead of small numbers of chromosomes. Confirming and improving the quality of such assemblies is critical for subsequent analysis.&nbsp;</span></p>
<p>Visualization and quality assessment of de novo genome assemblies</p>
<p>Citation</p>
<p>This software is fully described in the paper:<br>Riba-Grognuz, Keller, Falquet, Xenarios &amp; Wurm (2011) Visualization and quality assessment of de novo genome assemblies.</p>
<p>In brief, our scripts create Cytoscape files to visualize transcript evidence that suggests adjacency between scaffolds and contigs.</p>
<p>Software requirements</p>
<p>BLAT (tested with Standalone BLAT v. 32&times;1). Source Binaries .<br>Cytoscape (tested with versions 2.7.0, 2.8.2)<br>a UNIX machine (tested on Mac OS X 10.6 and CentOS 4.6)</p><p>Address of the bookmark: <a href="https://github.com/ksanao/TGNet" rel="nofollow">https://github.com/ksanao/TGNet</a></p>]]></description>
	<dc:creator>Shruti Paniwala</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/31014/sockeye</guid>
	<pubDate>Fri, 17 Feb 2017 08:51:16 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/31014/sockeye</link>
	<title><![CDATA[sockeye]]></title>
	<description><![CDATA[<p>This sockeye&nbsp;software uses the Ensembl database project to import sequence and annotation information from several eukaryotic species. A user can additionally import their own custom sequence and annotation data. Individual annotation objects are displayed in Sockeye by using custom 3D models. Ensembl-derived and imported sequences can be analyzed by using a suite of multiple and pair-wise alignment algorithms. The results of these comparative analyses are also displayed in the 3D environment of Sockeye. By using the Java3D API to visualize genomic data in a 3D environment, we are able to compactly display cross-sequence comparisons. This provides the user with a novel platform for visualizing and comparing genomic feature organization.</p><p>Address of the bookmark: <a href="http://www.bcgsc.ca/platform/bioinfo/software/sockeye/releases/1.3" rel="nofollow">http://www.bcgsc.ca/platform/bioinfo/software/sockeye/releases/1.3</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40583/trelliscope-flexibly-visualize-large-complex-data-in-great-detail-from-within-the-r-statistical-programming-environment</guid>
	<pubDate>Tue, 21 Jan 2020 04:22:49 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40583/trelliscope-flexibly-visualize-large-complex-data-in-great-detail-from-within-the-r-statistical-programming-environment</link>
	<title><![CDATA[Trelliscope: flexibly visualize large, complex data in great detail from within the R statistical programming environment.]]></title>
	<description><![CDATA[<p>Trelliscope provides a way to flexibly visualize large, complex data in great detail from within the R statistical programming environment. Trelliscope is a component in the<span>&nbsp;</span><a href="http://deltarho.org/docs-trelliscope/deltarho.org">DeltaRho</a><span>&nbsp;</span>environment.</p>
<p>For those familiar with<span>&nbsp;</span><a href="http://cm.bell-labs.com/cm/ms/departments/sia/project/trellis/">Trellis Display</a>,<span>&nbsp;</span><a href="http://docs.ggplot2.org/0.9.3.1/facet_wrap.html">faceting in ggplot</a>, or the notion of<span>&nbsp;</span><a href="http://en.wikipedia.org/wiki/Small_multiple">small multiples</a>, Trelliscope provides a scalable way to break a set of data into pieces, apply a plot method to each piece, and then arrange those plots in a grid and interactively sort, filter, and query panels of the display based on metrics of interest. With Trelliscope, we are able to create multipanel displays on data with a very large number of subsets and view them in an interactive and meaningful way.</p><p>Address of the bookmark: <a href="http://deltarho.org/docs-trelliscope/#introduction" rel="nofollow">http://deltarho.org/docs-trelliscope/#introduction</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42357/irscope-an-online-program-to-visualize-the-junction-sites-of-chloroplast-genomes</guid>
	<pubDate>Wed, 25 Nov 2020 19:44:46 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42357/irscope-an-online-program-to-visualize-the-junction-sites-of-chloroplast-genomes</link>
	<title><![CDATA[IRscope: an online program to visualize the junction sites of chloroplast genomes]]></title>
	<description><![CDATA[<p><span>eMPRess, a software program for phylogenetic tree reconciliation under the duplication-transfer-loss model that systematically addresses the problems of choosing event costs and selecting representative solutions, enabling users to make more robust inferences.</span></p><p>Address of the bookmark: <a href="https://sites.google.com/g.hmc.edu/empress/home" rel="nofollow">https://sites.google.com/g.hmc.edu/empress/home</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/1973/webinar-wednesday-21-august-2013-at-noon-edt</guid>
	<pubDate>Sun, 11 Aug 2013 19:31:56 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/1973/webinar-wednesday-21-august-2013-at-noon-edt</link>
	<title><![CDATA[Webinar: Wednesday 21 August 2013 at Noon EDT]]></title>
	<description><![CDATA[<p>This webinar will describe the use of combinatorial pooling to reconstruct gene sequences within BACs. Recent work in barley has shown that this level of sequence knowledge is sufficient to support critical end-point objectives such as map-based cloning and marker-assisted breeding.</p><p>http://www.extension.org/pages/67926/upcoming-webinar:-selective-sequencing-through-combinatorial-pooling#.UggsVuHyPqU</p>]]></description>
	<dc:creator>Jitendra Narayan</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/10392/research-associate-ra-at-institute-of-advanced-study-in-science-and-technology</guid>
  <pubDate>Mon, 05 May 2014 08:44:24 -0500</pubDate>
  <link></link>
  <title><![CDATA[Research Associate (RA) at INSTITUTE OF ADVANCED STUDY IN SCIENCE AND TECHNOLOGY]]></title>
  <description><![CDATA[
<p>INSTITUTE OF ADVANCED STUDY IN SCIENCE AND TECHNOLOGY<br />(An Autonomous Institute under Department of Science and Technology, Govt. of India)<br />Paschim Boragaon, Garchuk, Guwahati-781035</p>

<p>Appointment Adv.No.2</p>

<p>Applications in plain paper are invited from Indian citizens for one/two position each of Research Associate, Traineeship and Studentship for BIF facility, Division of Life Sciences, IASST.</p>

<p>Applications with complete Bio-data containing contact address, e-mail and phone number, two recent passport size photographs and attested copies of mark sheets, certificates etc., should be sent to the Registrar, IASST, Paschim Boragaon, Garchuk, Guwahati – 781035, Assam, so as to reach on or before 5/05/2014.</p>

<p>A. Research Associate:</p>

<p>Number of vacancies: 1 (One)</p>

<p>Qualifications:</p>

<p>PhD in Bioinformatics or allied disciplines with knowledge of Bioinformatics. The candidates who have submitted PhD thesis may also apply.</p>

<p>In case, candidates having PhD are not found, candidates having MSc in Bioinformatics or allied disciplines with sound knowledge of Bioinformatics will be preferred.</p>

<p>Remuneration: Candidate having PhD will get a consolidated remuneration of Rs. 22,000/- +HRA per month. MSc having NET/GATE/SLET qualified candidate will get a remuneration of Rs. 16,000/= and HRA and candidate with only MSc will get a remuneration of Rs.14,000/- and HRA.</p>

<p>Tenure:</p>

<p>The post is initially for one year and may be extended depending on the performance till the tenure of the project.</p>

<p>B. Traineeship:</p>

<p>Number of vacancies: 2 (Two)</p>

<p>Qualifications:</p>

<p>Candidate with a postgraduate degree in Bioinformatics/Biotechnology/Life sciences from a recognised University</p>

<p>Remuneration: Rs. 5000/month for 6 months</p>

<p>C. Studentship:</p>

<p>Number of vacancies: 2 (Two)</p>

<p>Qualifications:</p>

<p>Candidate pursuing M.Sc in bioinformatics in a recognised University.</p>

<p>Remuneration: Rs. 5000/month for 6 months</p>

<p>Advertisement:</p>

<p>http://iasst.gov.in/pdf/recruitment/advt%20no_2_24042014.pdf</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/videolist/watch/11195/ncbi-gene-screencast</guid>
	<pubDate>Fri, 30 May 2014 06:21:18 -0500</pubDate>
	<link>https://bioinformaticsonline.com/videolist/watch/11195/ncbi-gene-screencast</link>
	<title><![CDATA[NCBI Gene Screencast]]></title>
	<description><![CDATA[<iframe width="" height="" src="https://www.youtube-nocookie.com/embed/WyFIf7YdM8A" frameborder="0" allowfullscreen></iframe>A short walkthrough of the NCBI Gene page]]></description>
	
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/26569/genome-stability-laboratory</guid>
  <pubDate>Mon, 07 Mar 2016 04:16:32 -0600</pubDate>
  <link></link>
  <title><![CDATA[Genome Stability Laboratory]]></title>
  <description><![CDATA[
<p>The bakers yeast, Saccharomyces cerevisiae is an ideal model organism to understand mechanisms of meiotic chromosome segregation. In S. cerevisiae and in mammals, the majority of meiotic crossovers are formed through a highly conserved MSH4p-MSH5p, MLH1p-MLH3p dependent pathway. We are interested in charactering the role of these complexes in crossover formation and distribution among all homolog pairs. Errors in this process are linked to congenital birth defects in humans such as Down's syndrome.Our laboratory is also interested in understanding the effect of genetic background on mutation rate variation using S. cerevisiae as a model. These studies are relevant for understanding cancer progression, genome evolution and architecture. We use high- throughput genomic methods as well as classical genetics to achieve these aims. </p>

<p>More at http://faculty.iisertvm.ac.in/~nishantkt/index.html</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27961/nearhgt</guid>
	<pubDate>Wed, 22 Jun 2016 05:41:57 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27961/nearhgt</link>
	<title><![CDATA[NearHGT]]></title>
	<description><![CDATA[<p>Horizontal gene transfer (HGT), the transfer of genetic material between organisms, is crucial for genetic innovation and the evolution of genome architecture. Existing HGT detection algorithms rely on a strong phylogenetic signal distinguishing the transferred sequence from ancestral (vertically derived) genes in its recipient genome. Detecting HGT between closely related species or strains is challenging, as the phylogenetic signal is usually weak and the nucleotide composition is normally nearly identical. Nevertheless, there is a great importance in detecting HGT between congeneric species or strains, especially in clinical microbiology, where understanding the emergence of new virulent and drug-resistant strains is crucial, and often time-sensitive.</p>
<p>We developed a novel, self-contained technique named&nbsp;<em>Near HGT</em>, based on the&nbsp;<em>synteny index</em>, to measure the divergence of a gene from its native genomic environment and used it to identify candidate HGT events between closely related strains. The method confirms candidate transferred genes based on the&nbsp;<em>constant relative mutability</em>&nbsp;(CRM). Using CRM, the algorithm assigns a confidence score based on &ldquo;unusual&rdquo; sequence divergence. A gene exhibiting exceptional deviations according to both synteny and mutability criteria, is considered a validated HGT product. We first employed the technique to a set of three&nbsp;<em>E. coli</em>&nbsp;strains and detected several highly probable horizontally acquired genes. We then compared the method to existing HGT detection tools using a larger strain data set.</p>
<p>When combined with additional approaches our new algorithm provides richer picture and brings us closer to the goal of detecting all newly acquired genes in a particular strain.</p>
<p><strong>Availability:</strong><span>&nbsp;The method is publicly available at</span><a href="http://research.haifa.ac.il/~ssagi/software/nearHGT.zip">http://research.haifa.ac.il/~ssagi/software/nearHGT.zip</a></p><p>Address of the bookmark: <a href="http://journals.plos.org/ploscompbiol/article?id=10.1371/journal.pcbi.1004408" rel="nofollow">http://journals.plos.org/ploscompbiol/article?id=10.1371/journal.pcbi.1004408</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>

</channel>
</rss>