<?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/29384?offset=1160</link>
	<atom:link href="https://bioinformaticsonline.com/related/29384?offset=1160" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37512/purecn-copy-number-calling-and-snv-classification-using-targeted-short-read-sequencing</guid>
	<pubDate>Thu, 09 Aug 2018 04:09:37 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37512/purecn-copy-number-calling-and-snv-classification-using-targeted-short-read-sequencing</link>
	<title><![CDATA[PureCN: copy number calling and SNV classification using targeted short read sequencing]]></title>
	<description><![CDATA[<p>This package estimates tumor purity, copy number, and loss of heterozygosity (LOH), and classifies single nucleotide variants (SNVs) by somatic status and clonality. PureCN is designed for targeted short read sequencing data, integrates well with standard somatic variant detection and copy number pipelines, and has support for tumor samples without matching normal samples.</p>
<p>Author: Markus Riester [aut, cre], Angad P. Singh [aut]</p>
<p>Maintainer: Markus Riester &lt;markus.riester at novartis.com&gt;</p>
<div id="bioc_citation_outer">
<p>Citation (from within R, enter&nbsp;<code>citation("PureCN")</code>):</p>
<div id="bioc_citation">
<p>Riester M, Singh A, Brannon A, Yu K, Campbell C, Chiang D, Morrissey M (2016). &ldquo;PureCN: Copy number calling and SNV classification using targeted short read sequencing.&rdquo;&nbsp;<em>Source Code for Biology and Medicine</em>,&nbsp;<strong>11</strong>, 13. doi:&nbsp;<a href="http://doi.org/10.1186/s13029-016-0060-z">10.1186/s13029-016-0060-z</a>.</p>
</div>
</div><p>Address of the bookmark: <a href="http://bioconductor.org/packages/release/bioc/html/PureCN.html" rel="nofollow">http://bioconductor.org/packages/release/bioc/html/PureCN.html</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/5220/paolo-ruggerone-lab</guid>
  <pubDate>Tue, 01 Oct 2013 14:15:53 -0500</pubDate>
  <link></link>
  <title><![CDATA[Paolo Ruggerone Lab]]></title>
  <description><![CDATA[
<p>Efflux pumps (RND family)</p>

<p>Functioning of efflux systems in Gram-negative bacteria<br />Determinants of the compound-efflux system interactions<br />Action of inhibitors on efflux systems<br />Structural and dynamical features of the efflux systems</p>

<p>TatA<br />Assembly of the TatA system<br />Study of the dynamical features of the charge zipper</p>

<p>Methods<br />Setup of a kinetic Monte Carlo (KMC) scheme to study the flux of antibiotics through porins and efflux systems<br />Setup of protocol to integrate MD results in a ligand-based approach</p>

<p>Viral inhibitors<br />Interactions of selected compounds with RNA-dependent RNA polymerases (RdRps) of HCV and BVDV<br />Assessment of the role of mutations in RdRps<br />Antimicrobial peptides</p>

<p>Interactions of antimicrobial peptides with membranes: structure and dynamics<br />Interactions between antimicrobial peptides in the presence of different membranes<br />Protein-protein interactions<br />Effects of mutations</p>

<p>Lab Page<br />http://www.dsf.unica.it/~paolo/Site/Home.html</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43552/understanding-pango-networks</guid>
	<pubDate>Sat, 16 Oct 2021 14:02:36 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43552/understanding-pango-networks</link>
	<title><![CDATA[Understanding pango networks !]]></title>
	<description><![CDATA[<p><span>In the vast majority of instances it is expected that Pango lineage names and designations will conform to the following rules. These rules also act as guidelines for the decisions made by the Lineage Designation Committee.</span></p>
<p>https://www.pango.network/the-pango-nomenclature-system/statement-of-nomenclature-rules/</p>
<p>https://www.pango.network/how-does-the-system-work/what-are-pango-lineages/</p>
<p>Reference paper</p>
<p>https://www.nature.com/articles/s41564-020-0770-5</p><p>Address of the bookmark: <a href="https://www.pango.network/the-pango-nomenclature-system/statement-of-nomenclature-rules/" rel="nofollow">https://www.pango.network/the-pango-nomenclature-system/statement-of-nomenclature-rules/</a></p>]]></description>
	<dc:creator>Abhi</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/5310/bergman-lab</guid>
  <pubDate>Thu, 03 Oct 2013 17:20:09 -0500</pubDate>
  <link></link>
  <title><![CDATA[Bergman Lab]]></title>
  <description><![CDATA[
<p>Broad area of research:</p>

<p>Genome Annotation and Functional Genomics</p>

<p>Bergman Lab is actively engaged in the development and application of computational methods to improve the annotation of functional biological features in genome sequences.  Bergman Lab work focuses on improving annotation of non-protein-coding regions of the genome including conserved noncoding sequences (CNSs), cis-regulatory modules (CRMs), transcription factor binding sites (TFBSs), transposable elements (TEs) and noncoding RNA (ncRNA) genes. Current projects include improving the (i) annotation of TEs in the fly and yeast genomes, (ii) annotation of CRMs and TFBSs in the fly genome, and (iii) analysis of transposon knockout collections in flies. Research in this area is supported by the EC FP7 programme.</p>

<p>Genome and Molecular Evolution<br />Text and Data Mining</p>

<p>More @ http://bergmanlab.smith.man.ac.uk/</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/44236/type-of-ssr</guid>
	<pubDate>Thu, 09 Mar 2023 04:35:41 -0600</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/44236/type-of-ssr</link>
	<title><![CDATA[Type of SSR]]></title>
	<description><![CDATA[<div><div><div><div><div><div><div><div><div><div><p>Types of SSRs (simple sequence repeats), SSRs are short DNA sequences consisting of a tandem repeat of a few nucleotides, typically 2-6 nucleotides in length. There are different types of SSRs based on the length and pattern of the repeated sequence, as well as the presence or absence of interruptions of non-repeated nucleotides within the repeat array. The four types of SSRs are:</p><ol>
<li>
<p>Perfect SSR: This is the simplest type of SSR, where the same repeat motif is present adjacent to each other without any interruption of any other nucleotide. For example, a perfect SSR with the repeat motif "CAT" would be "CATCATCATCAT", where the "CAT" sequence is repeated four times.</p>
</li>
<li>
<p>Imperfect SSR: This type of SSR contains repeat motifs that are interrupted by one or a few non-repeat nucleotides. For example, an imperfect SSR with the repeat motif "CAT" would be "CATCATGGCATCATCAT", where the "CAT" sequence is repeated twice, but interrupted by "GG".</p>
</li>
<li>
<p>Compound perfect SSR: This type of SSR contains two or more repeat motifs lying adjacent to each other, separated by no or very few intervening nucleotides. For example, a compound perfect SSR with the repeat motifs "CAT" and "GTC" would be "CATCATCATGTCGTC", where the "CAT" sequence is repeated three times, followed by the "GTC" sequence repeated twice.</p>
</li>
<li>
<p>Compound imperfect SSR: This type of SSR contains two or more repeat motifs interrupted by several non-repeat nucleotides. For example, a compound imperfect SSR with the repeat motifs "CAT" and "GTC" would be "CATCATCATNNNNNNNGTCGTCGTC", where the "CAT" sequence is repeated three times, interrupted by several non-repeat nucleotides, followed by the "GTC" sequence repeated three times.</p>
</li>
</ol></div></div></div></div></div></div></div></div></div></div>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/5436/the-anatomy-of-successful-computational-biology-software</guid>
	<pubDate>Thu, 10 Oct 2013 11:53:08 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/5436/the-anatomy-of-successful-computational-biology-software</link>
	<title><![CDATA[The anatomy of successful computational biology software]]></title>
	<description><![CDATA[<p>Creators of software widely used in computational biology discuss the factors that contributed to their success</p><p><em>Nature Biotechnology</em><span>&nbsp;spoke with Altschul and several other originators of computational biology software programs widely used today (</span><a href="http://www.nature.com/nbt/journal/v31/n10/full/nbt.2721.html#t1">Table 1</a><span>). The conversations explored what makes certain software tools successful, the unique challenges of developing them for biological research and how the field of computational biology, as a whole, can move research agendas forward. What follows is an edited compilation of interviews.</span></p><p>Detail @&nbsp;<a href="http://www.nature.com/nbt/journal/v31/n10/full/nbt.2721.html">http://www.nature.com/nbt/journal/v31/n10/full/nbt.2721.html</a></p><p>News Source @ Nature</p>]]></description>
	<dc:creator>Jitendra Narayan</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/4590/tigers-genome-sequenced</guid>
	<pubDate>Tue, 17 Sep 2013 16:48:24 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/4590/tigers-genome-sequenced</link>
	<title><![CDATA[Tigers genome sequenced]]></title>
	<description><![CDATA[<p>Fifteen scientists led by Dr Jong Bhak of Genome Research Foundation, South Korea, decoded as many as 3 billion nucleotides (organic molecules that form the basic building blocks of nucleic acids, such as DNA). They identified 20,000 genes related to various functions of the tiger.&nbsp;</p><p>The biggest and perhaps most fearsome of the world's big cats, the tiger, shares 95.6 percent of its DNA with humans' cute and furry companions, domestic cats.</p><p>The new research showed that big cats have genetic mutations that enabled them to be carnivores. The team also identified mutations that allow snow leopards to thrive at high altitudes.</p><p>Reference:</p><p><a href="http://www.nbcnews.com/science/your-cat-ferocious-tigers-share-lot-95-6-percent-their-4B11182690">http://www.nbcnews.com/science/your-cat-ferocious-tigers-share-lot-95-6-percent-their-4B11182690</a></p><p><a href="http://timesofindia.indiatimes.com/home/environment/flora-fauna/Gene-mapping-of-tiger-completed/articleshow/22671681.cms">http://timesofindia.indiatimes.com/home/environment/flora-fauna/Gene-mapping-of-tiger-completed/articleshow/22671681.cms</a></p><p>Paper:</p><p><a href="http://www.nature.com/ncomms/2013/130917/ncomms3433/full/ncomms3433.html">http://www.nature.com/ncomms/2013/130917/ncomms3433/full/ncomms3433.html</a></p>]]></description>
	<dc:creator>Rahul Agarwal</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/5663/network-analysis-indian-statistical-institute</guid>
  <pubDate>Wed, 16 Oct 2013 08:06:50 -0500</pubDate>
  <link></link>
  <title><![CDATA[Network Analysis @ Indian Statistical Institute]]></title>
  <description><![CDATA[
<p>Indian Statistical Institute Kolkata invites applications for the following posts</p>

<p>2013 Oct Advertisement from Indian Statistical Institute</p>

<p>Post: Network Analysis</p>

<p>No. of Positions:  01</p>

<p>Educational Qualifications:</p>

<p>Candidate should have passed BE/B.Tech Or Equivalent in Computer Science / Electrical Engineering / Electronics / Information Technology / Bioinformatics / Biotechnology with throughout first Class<br />Experience:</p>

<p>(details of experience required)<br />Pay Scale: INR Rs.16000-20000/-P.M.</p>

<p>Walk-In-Interview : 22 Oct 2013 at 10:30 AM</p>

<p>Download Official Notification:<br />http://www.isical.ac.in/JobApplicationFiles/MIU_0310201311433700.pdf</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34443/opera-an-optimal-genome-scaffolding-program</guid>
	<pubDate>Mon, 27 Nov 2017 10:18:20 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34443/opera-an-optimal-genome-scaffolding-program</link>
	<title><![CDATA[Opera: An optimal genome scaffolding program]]></title>
	<description><![CDATA[<p><span>Opera (Optimal Paired-End Read Assembler) is a sequence assembly program (</span><a href="http://en.wikipedia.org/wiki/Sequence_assembly" target="_blank">http://en.wikipedia.org/wiki/Sequence_assembly&nbsp;<img src="https://a.fsdn.com/con/img/icons/external_asset.png" alt="image" style="border: 0px;"></a><span>). It uses information from paired-end or long reads to optimally order and orient contigs assembled from shotgun-sequencing reads.</span><br><br><span>An updated version called OPERA-LG has been re-engineered with features for the assembly of large and complex genomes.</span><br><br><span>Song Gao, Denis Bertrand, Burton K. H. Chia and Niranjan Nagarajan. OPERA-LG: efficient and exact scaffolding of large, repeat-rich eukaryotic genomes with performance guarantees. Genome Biology, May 2016, doi: 10.1186/s13059-016-0951-y.</span><br><br><span>Song Gao, Wing-Kin Sung, Niranjan Nagarajan. Opera: reconstructing optimal genomic scaffolds with high-throughput paired-end sequences. Journal of Computational Biology, Sept. 2011, doi:10.1089/cmb.2011.0170.</span></p>
<p><span>https://genomebiology.biomedcentral.com/articles/10.1186/s13059-016-0951-y</span></p><p>Address of the bookmark: <a href="https://sourceforge.net/projects/operasf/" rel="nofollow">https://sourceforge.net/projects/operasf/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/5748/troyanskaya-lab</guid>
  <pubDate>Fri, 18 Oct 2013 10:57:40 -0500</pubDate>
  <link></link>
  <title><![CDATA[Troyanskaya  Lab]]></title>
  <description><![CDATA[
<p>In our research, we combine computational methods with an experimental component in a unified effort to develop comprehensive descriptions of genetic systems of cellular controls, including those whose malfunctioning becomes the basis of genetic disorders, such as cancer, and others whose failure might produce developmental defects in model systems.</p>

<p>Research Interest<br />Genomic Data Integration</p>

<p>Microarray Analysis</p>

<p>Gene and Protein Function Prediction</p>

<p>Detection and Analysis of Chromosomal Abnormalities and Functional Evolution</p>

<p>Integration of Computation and Experiments</p>

<p>Identification of Biological Networks and Pathways</p>

<p>Evaluation and Validation of Computational Predictions</p>

<p>Scalable Visualization-Based Data Analysis</p>

<p>More @ http://reducio.princeton.edu/cm/<br />PI page @ http://reducio.princeton.edu/cm/ogt</p>
]]></description>
</item>

</channel>
</rss>