<?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/44734?offset=940</link>
	<atom:link href="https://bioinformaticsonline.com/related/44734?offset=940" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/35249/gpopsim-a-simulation-tool-for-whole-genome-genetic-data</guid>
	<pubDate>Wed, 17 Jan 2018 03:47:46 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/35249/gpopsim-a-simulation-tool-for-whole-genome-genetic-data</link>
	<title><![CDATA[GPOPSIM: a simulation tool for whole-genome genetic data]]></title>
	<description><![CDATA[<p><span>GPOPSIM is a simulation tool for pedigree, phenotypes, and genomic data, with a variety of population and genome structures and trait genetic architectures. It provides flexible parameter settings for a wide discipline of users, especially can simulate multiple genetically correlated traits with desired genetic parameters and underlying genetic architectures.</span></p><p>Address of the bookmark: <a href="https://github.com/SCAU-AnimalGenetics/GPOPSIM" rel="nofollow">https://github.com/SCAU-AnimalGenetics/GPOPSIM</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/36833/bfc-a-standalone-high-performance-tool-for-correcting-sequencing-errors-from-illumina-sequencing-data</guid>
	<pubDate>Thu, 31 May 2018 09:35:23 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36833/bfc-a-standalone-high-performance-tool-for-correcting-sequencing-errors-from-illumina-sequencing-data</link>
	<title><![CDATA[BFC: a standalone high-performance tool for correcting sequencing errors from Illumina sequencing data]]></title>
	<description><![CDATA[BFC is a standalone high-performance tool for correcting sequencing errors from Illumina sequencing data. It is specifically designed for high-coverage whole-genome human data, though also performs well for small genomes.

The BFC algorithm is a variant of the classical spectrum alignment algorithm introduced by Pevzner et al (2001). It uses an exhaustive search to find a k-mer path through a read that minimizes a heuristic objective function jointly considering penalties on correction, quality and k-mer support. This algorithm was first implemented in my fermi assembler and then refined a few times in fermi, fermi2 and now in BFC. In the k-mer counting phase, BFC uses a blocked bloom filter to filter out most singleton k-mers and keeps the rest in a hash table (Melsted and Pritchard, 2011). The use of bloom filter is how BFC is named, though other correctors such as Lighter and Bless actually rely more on bloom filter than BFC.

https://github.com/lh3/bfc<p>Address of the bookmark: <a href="https://github.com/lh3/bfc" rel="nofollow">https://github.com/lh3/bfc</a></p>]]></description>
	<dc:creator>Jit</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/bookmarks/view/37527/nanopack-visualizing-and-processing-long-read-sequencing-data</guid>
	<pubDate>Fri, 10 Aug 2018 18:41:34 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37527/nanopack-visualizing-and-processing-long-read-sequencing-data</link>
	<title><![CDATA[NanoPack: visualizing and processing long-read sequencing data]]></title>
	<description><![CDATA[<p>The NanoPack tools are written in Python3 and released under the GNU GPL3.0 License. The source code can be found at&nbsp;<a href="https://github.com/wdecoster/nanopack" target="">https://github.com/wdecoster/nanopack</a>, together with links to separate scripts and their documentation. The scripts are compatible with Linux, Mac OS and the MS Windows 10 subsystem for Linux and are available as a graphical user interface, a web service at&nbsp;<a href="http://nanoplot.bioinf.be/" target="">http://nanoplot.bioinf.be</a>&nbsp;and command line tools.</p>
<p>&nbsp;https://academic.oup.com/bioinformatics/article/34/15/2666/4934939</p><p>Address of the bookmark: <a href="https://github.com/wdecoster/nanoQC" rel="nofollow">https://github.com/wdecoster/nanoQC</a></p>]]></description>
	<dc:creator>Jit</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/bookmarks/view/38505/allhic-phasing-and-scaffolding-polyploid-genomes-based-on-hi-c-data</guid>
	<pubDate>Thu, 20 Dec 2018 12:03:32 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38505/allhic-phasing-and-scaffolding-polyploid-genomes-based-on-hi-c-data</link>
	<title><![CDATA[ALLHiC: Phasing and scaffolding polyploid genomes based on Hi-C data]]></title>
	<description><![CDATA[<p><span>The major problem of scaffolding polyploid genome is that Hi-C signals are frequently detected between allelic haplotypes and any existing stat of art Hi-C scaffolding program links the allelic haplotypes together. To solve the problem, we developed a new Hi-C scaffolding pipeline, called ALLHIC, specifically tailored to the polyploid genomes. ALLHIC pipeline contains a total of 5 steps:&nbsp;</span><em>prune</em><span>,&nbsp;</span><em>partition</em><span>,&nbsp;</span><em>rescue</em><span>,&nbsp;</span><em>optimize</em><span>&nbsp;and&nbsp;</span><em>build</em><span>.</span></p><p>Address of the bookmark: <a href="https://github.com/tangerzhang/ALLHiC/wiki" rel="nofollow">https://github.com/tangerzhang/ALLHiC/wiki</a></p>]]></description>
	<dc:creator>BioStar</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/38623/kallisto-a-program-for-quantifying-abundances-of-transcripts-from-bulk-and-single-cell-rna-seq-data</guid>
	<pubDate>Mon, 07 Jan 2019 10:35:14 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38623/kallisto-a-program-for-quantifying-abundances-of-transcripts-from-bulk-and-single-cell-rna-seq-data</link>
	<title><![CDATA[kallisto: a program for quantifying abundances of transcripts from bulk and single-cell RNA-Seq data]]></title>
	<description><![CDATA[<p><strong>kallisto</strong>&nbsp;is a program for quantifying abundances of transcripts from bulk and single-cell RNA-Seq data, or more generally of target sequences using high-throughput sequencing reads. It is based on the novel idea of&nbsp;<em>pseudoalignment</em>&nbsp;for rapidly determining the compatibility of reads with targets, without the need for alignment. On benchmarks with standard RNA-Seq data,&nbsp;<strong>kallisto</strong>&nbsp;can quantify 30 million human reads in less than 3 minutes on a Mac desktop computer using only the read sequences and a transcriptome index that itself takes less than 10 minutes to build. Pseudoalignment of reads preserves the key information needed for quantification, and&nbsp;<strong>kallisto</strong>&nbsp;is therefore not only fast, but also as accurate as existing quantification tools. In fact, because the pseudoalignment procedure is robust to errors in the reads, in many benchmarks&nbsp;<strong>kallisto</strong>&nbsp;significantly outperforms existing tools.&nbsp;<strong>kallisto</strong>&nbsp;is described in detail in:</p>
<p>Nicolas L Bray, Harold Pimentel, P&aacute;ll Melsted and Lior Pachter,&nbsp;<a href="http://www.nature.com/nbt/journal/v34/n5/full/nbt.3519.html">Near-optimal probabilistic RNA-seq quantification</a>, Nature Biotechnology&nbsp;<strong>34</strong>, 525&ndash;527 (2016), doi:10.1038/nbt.3519</p><p>Address of the bookmark: <a href="https://pachterlab.github.io/kallisto/about" rel="nofollow">https://pachterlab.github.io/kallisto/about</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>