<?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/30074?offset=1460</link>
	<atom:link href="https://bioinformaticsonline.com/related/30074?offset=1460" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/3013/python-and-biopython-tutorial</guid>
	<pubDate>Fri, 23 Aug 2013 06:47:40 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/3013/python-and-biopython-tutorial</link>
	<title><![CDATA[Python and BioPython Tutorial]]></title>
	<description><![CDATA[<p>A quickstart tutorial that allows to become familiar with the Python language. The exercises expect knowledge of basic concepts of programming. A group of 2nd year computer science students with no previous Python knowledge required 60'-90' to complete the exercises. With about 3 hours time, the exercise is suitable for non-programmers as well.</p><p>Address of the bookmark: <a href="http://www.biotnet.org/training-materials/python-programmers" rel="nofollow">http://www.biotnet.org/training-materials/python-programmers</a></p>]]></description>
	<dc:creator>Manshi Raghubanshi</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42987/public-databases-for-bioinformatics</guid>
	<pubDate>Tue, 23 Mar 2021 05:32:15 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42987/public-databases-for-bioinformatics</link>
	<title><![CDATA[Public Databases for Bioinformatics !]]></title>
	<description><![CDATA[<pre>https://www.nature.com/articles/s41467-020-17155-y<br><br>Server Infrastructure:

File Server:

dhara: Synology 3614 Storage Appliance
4 Core Xeon
108TB disk storage
10Gb ethernet to SCG3
Access atx: dhara:5000
Has btsync server (try it - its much better than dropbox)

Compute Servers:

nandi: Kundaje and Phi Server
24 intel cores
256GB RAM
500GB of SSD storage 
36TB RAID6 local storage
4 Intel Phi's (space for 4 more GPU's)


durga: Montgomery and sensitive data
24 intel cores
256GB RAM
500GB of SSD RAID0 storage 
60TB RAID6 local storage

mitra: Bassik and Web/DB Server
24 core
256GB RAM 
500GB of SSD RAID0 storage 
36TB RAID6 local storage

vayu: Kundaje GPU server
4 core
64GB RAM 
200GB of SSD storage 
8TB RAID10 local storage
4 Nvidia GTX 970 4GB GPUs

amold: Bickel and SGE server
32 AMD core
128GB RAM 
200GB of SSD storage 
12TB RAID5 local storage

wotan: Bickel and SGE server
64 AMD core
256GB RAM 
200GB of SSD storage 
12TB RAID5 local storage

Filesystem:

/users/$USER
default home directory
full backups nightly 
nfs mount to dhara
should store code, papers, and other highly processed data here

/mnt/data/
globally accessible data
should store common data here
e.g. genomes and indexes, annotations, ENCODE data  
if you dont want this to count towards your quote you must chown

/mnt/lab_data/$LAB/
lab accessible data
should store lab project data here 
e.g. ATAC-seq prediction data, enhancer prediction, motif calls

/srv/scratch/$USER
fast local storage
not backed up, but on raid and data will never be deleted
most analysis should be performed here

/srv/persistent/$USER
fast local storage
synced nightly, but not backed up
       ie if the hard drives fail or you delete something and notice 
       within 24 hours we can recover. Otherwise not. (vs home which is 
       properly backed up )  
intermediate analysis products that would be hard to recover should be stored here 
       e.g. stochastic analysis results that need to be kept so that paper 
       results can be reproduced

/srv/www/$LABNAME/
web accessible from mitra.stanford.edu
*NOT BACKED UP*

Some parallel programming patterns:

# gzip a bunch of files
parallel gzip -- *.FILESTOGZIP

# fork example in python:
(for more detailed examples look at 
 https://github.com/nboley/grit/ grit/lib/multiprocessing_utils.py)

import os
import time
import random

import multiprocessing

class ProcessSafeOPStream( object ):
    def __init__( self, writeable_obj ):
        self.writeable_obj = writeable_obj
        self.lock = multiprocessing.Lock()
        self.name = self.writeable_obj.name
        return
    
    def write( self, data ):
        self.lock.acquire()
        self.writeable_obj.write( data )
        self.writeable_obj.flush()
        self.lock.release()
        return
    
    def close( self ):
        self.writeable_obj.close()

def worker(queue, ofp):
    # Try without this
    random.seed()
    while True:
        i = queue.get()
        if i == 'FINISHED': return
        # simulate an expensive function
        x = random.random()
        time.sleep(x/10)
        print i, x
        ofp.write("%i\t%s\n" % (i, x))

NSIMS = 10000
NPROC = 25

# populate queue
todo = multiprocessing.Queue()
for i in xrange(NSIMS): todo.put(i)
for i in xrange(NPROC): todo.put('FINISHED')

ofp = ProcessSafeOPStream( open("output.txt", "w") )

pids = []
for i in xrange(NPROC):
    pid = os.fork()
    if pid == 0:
       worker(todo, ofp)
       os._exit(0)
    else:
       pids.append(pid)  

for pid in pids:
    os.waitpid(pid, 0)

ofp.close()

print "FINISHED"<br><br></pre>
<p>For use case 1 we obtained the following ENCODE and ROADMAP datasets&nbsp;<a href="https://www.encodeproject.org/files/ENCFF446WOD/@@download/ENCFF446WOD.bed.gz">https://www.encodeproject.org/files/ENCFF446WOD/@@download/ENCFF446WOD.bed.gz</a>,&nbsp;<a href="https://www.encodeproject.org/files/ENCFF546PJU/@@download/ENCFF546PJU.bam">https://www.encodeproject.org/files/ENCFF546PJU/@@download/ENCFF546PJU.bam</a>,&nbsp;<a href="https://www.encodeproject.org/files/ENCFF059BEU/@@download/ENCFF059BEU.bam">https://www.encodeproject.org/files/ENCFF059BEU/@@download/ENCFF059BEU.bam</a>. Blacklisted regions were obtained from&nbsp;<a href="http://mitra.stanford.edu/kundaje/akundaje/release/blacklists/hg38-human/hg38.blacklist.bed.gz">http://mitra.stanford.edu/kundaje/akundaje/release/blacklists/hg38-human/hg38.blacklist.bed.gz</a>. The human genome version hg38 was obtained from&nbsp;<a href="http://hgdownload.cse.ucsc.edu/goldenPath/hg38/bigZips/hg38.fa.gz">http://hgdownload.cse.ucsc.edu/goldenPath/hg38/bigZips/hg38.fa.gz</a>.</p>
<p>For use case 2 we used the set of narrowPeak files summarized in&nbsp;<a href="https://github.com/wkopp/janggu_usecases/tree/master/extra/urls.txt">https://github.com/wkopp/janggu_usecases/tree/master/extra/urls.txt</a>&nbsp;(archived version v1.0.1). The human genome version hg19 was obtained from&nbsp;<a href="http://hgdownload.cse.ucsc.edu/goldenPath/hg19/bigZips/hg19.fa.gz">http://hgdownload.cse.ucsc.edu/goldenPath/hg19/bigZips/hg19.fa.gz</a></p>
<p>For use case 3 we used the ENCODE datasets&nbsp;<a href="https://www.encodeproject.org/files/ENCFF591XCX/@@download/ENCFF591XCX.bam">https://www.encodeproject.org/files/ENCFF591XCX/@@download/ENCFF591XCX.bam</a>,&nbsp;<a href="https://www.encodeproject.org/files/ENCFF736LHE/@@download/ENCFF736LHE.bigWig">https://www.encodeproject.org/files/ENCFF736LHE/@@download/ENCFF736LHE.bigWig</a>,&nbsp;<a href="https://www.encodeproject.org/files/ENCFF177HHM/@@download/ENCFF177HHM.bam">https://www.encodeproject.org/files/ENCFF177HHM/@@download/ENCFF177HHM.bam</a>&nbsp;as we as the GENCODE annotation v29 from&nbsp;<a href="ftp://ftp.ebi.ac.uk/pub/databases/gencode/Gencode_human/release_29/gencode.v29.annotation.gtf.gz">ftp://ftp.ebi.ac.uk/pub/databases/gencode/Gencode_human/release_29/gencode.v29.annotation.gtf.gz</a>.</p><p>Address of the bookmark: <a href="http://mitra.stanford.edu/" rel="nofollow">http://mitra.stanford.edu/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/3967/research-project-posts-for-csir-project-delhi</guid>
  <pubDate>Tue, 27 Aug 2013 04:31:41 -0500</pubDate>
  <link></link>
  <title><![CDATA[Research Project Posts for CSIR Project, Delhi]]></title>
  <description><![CDATA[
<p>Positions Open For Temporary Research Project Posts for CSIR Project, Delhi<br />CSIR is looking for bright young candidates to get involved in building algorithms and platforms for large biological data analyses in the areas of comparative genomics, computational workflows, disease association studies, simulating virtual organelles, etc. Anyone who fulfills the eligibility criteria mentioned below may appear for a walk-in interview on 3rd September 2013 at CSIR Headquarters, Anusandhan Bhawan, 2 Rafi Marg, Delhi – 110001.<br />you can go to link for details or download PDF</p>

<p>http://www.csir.res.in/External/Heads/aboutcsir/announcements/ProjectPost_130813.pdf</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/4098/bioinformatics-algorithm-demonstrations-and-tutorials</guid>
	<pubDate>Thu, 29 Aug 2013 09:23:51 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/4098/bioinformatics-algorithm-demonstrations-and-tutorials</link>
	<title><![CDATA[Bioinformatics Algorithm Demonstrations and Tutorials]]></title>
	<description><![CDATA[<p>Abstract</p>
<p>This project presents demonstrations of selected computer science algorithms important in&nbsp;bioinformatics, implemented in the spreadsheet program Microsoft Excel. Spreadsheets provide an&nbsp;interesting platform for demonstration of algorithms, since various steps of the calculations can be&nbsp;exposed in a manner that is easily comprehensible to users with little programming experience. The&nbsp;algorithms demonstrated include two approaches to approximate string matching (dynamic programming&nbsp;and Shift-AND numeric approximate matching), Hierarchical Clustering (used in phylogenetic studies&nbsp;and microarray analysis of gene expression), a Naive Bayes Classifier for simulated microarray gene&nbsp;expression data, and a simple Neural Network. These demonstrations are designed to serve as&nbsp;instructional aids in bioinformatics courses.</p>
<p>Tutorial @&nbsp;http://www.cybertory.org/downloads/bae/BioinformaticsAlgorithmsInExcel.zip</p>
<p>One of the best resource for online bioinformatics learning is https://stepic.org/Bioinformatics-Algorithms-2 Enjoy the online learning.</p>
<p>Reference :&nbsp;cybertory</p>
<blockquote>
<p><span>" Please add your favourite bioinformatics algorithms and tutorial links below in the comment section, for the benefit of bioinformatics and computational biology community ".&nbsp;</span></p>
</blockquote><p>Address of the bookmark: <a href="http://www.cybertory.org/downloads/bae/BioinformaticsAlgorithmsExcelDoc.pdf" rel="nofollow">http://www.cybertory.org/downloads/bae/BioinformaticsAlgorithmsExcelDoc.pdf</a></p>]]></description>
	<dc:creator>Jitendra Narayan</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34567/jobtree-based-python-wrapper-to-run-the-genome-simulation-tool-suite-evolver</guid>
	<pubDate>Fri, 08 Dec 2017 16:26:32 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34567/jobtree-based-python-wrapper-to-run-the-genome-simulation-tool-suite-evolver</link>
	<title><![CDATA[jobTree based python wrapper to run the genome simulation tool suite Evolver]]></title>
	<description><![CDATA[<p><span>evolverSimControl</span><span>&nbsp;(</span><span>eSC</span><span>) can be used to simulate multi-chromosome genome evolution on an arbitrary phylogeny (</span><a href="http://evolution.genetics.washington.edu/phylip/newicktree.html">Newick format</a><span>). In addition to simply running evolver,&nbsp;</span><span>eSC</span><span>&nbsp;also automatically creates statistical summaries of the simulation as it runs including text and image files. Also included are convenience scripts to: check on a running simulation and see detailed status and logging information; extract fasta sequence files from the leaf nodes of a completed simulation; extract pairwise multiple alignment files (</span><a href="http://genome.ucsc.edu/FAQ/FAQformat.html#format5">.maf</a><span>) from leaf and branch nodes from a completed simulation and with the help of&nbsp;</span><a href="https://github.com/dentearl/mafTools/">mafJoin</a><span>, join them together into a single maf covering the entire simulation.</span></p><p>Address of the bookmark: <a href="https://github.com/dentearl/evolverSimControl" rel="nofollow">https://github.com/dentearl/evolverSimControl</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/4162/4273%CF%80-bioinformatics-education-on-low-cost-arm-hardware</guid>
	<pubDate>Mon, 02 Sep 2013 07:02:43 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/4162/4273%CF%80-bioinformatics-education-on-low-cost-arm-hardware</link>
	<title><![CDATA[4273π: Bioinformatics education on low cost ARM hardware]]></title>
	<description><![CDATA[<p>Are you teaching bioinformatics at universities and found it complicated by typical computer classroom settings. As well as running software locally and online, students should gain experience of systems administration. Hmm don't worry there is one new OS for the rescue. 4273<em>&pi;</em>, an operating system image for Raspberry Pi based on Raspbian Linux. It provides an attractive, general-purpose computing environment, within which the course 4273&pi; Bioinformatics for Biologists is embedded.<br /><br />Though far slower than current desktop and laptop computers, the Raspberry Pi is notably faster than the Cray 1 supercomputer, a marvel of computer speed in its day. The Raspberry Pi approach includes all the benefits of the laptop approach, above, but at lower cost. In addition, the Raspberry Pi is a new and exciting computer system, which in itself can add interest to the course.<br /><br />As the Raspbian operating system, Raspberry Pi firmware and hardware and 4273&pi; Bioinformatics for Biologists teaching material develop, further releases of 4273&pi; will be made available. It is anticipated that there will be a minimum of two releases per year during the next four years.</p><p>4273<em>&pi;</em> is a means to teach bioinformatics, including systems administration tasks, to undergraduates at low cost.</p><p>Descriptive paper @ http://www.biomedcentral.com/1471-2105/14/243</p><p>Image source: BMC Bioinformatics</p><p><img src="http://www.biomedcentral.com/content/download/figures/1471-2105-14-243-1.png" alt="image" style="border: 0px; border: 0px;"></p>]]></description>
	<dc:creator>Jitendra Narayan</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34867/magic-blast-a-tool-for-mapping-large-next-generation-rna-or-dna-sequencing-runs-against-a-whole-genome-or-transcriptome</guid>
	<pubDate>Tue, 26 Dec 2017 22:23:39 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34867/magic-blast-a-tool-for-mapping-large-next-generation-rna-or-dna-sequencing-runs-against-a-whole-genome-or-transcriptome</link>
	<title><![CDATA[Magic-BLAST: a tool for mapping large next-generation RNA or DNA sequencing runs against a whole genome or transcriptome.]]></title>
	<description><![CDATA[<p>Magic-BLAST is a tool for mapping large next-generation RNA or DNA sequencing runs against a whole genome or transcriptome. Each alignment optimizes a composite score, taking into account simultaneously the two reads of a pair, and in case of RNA-seq, locating the candidate introns and adding up the score of all exons. This is very different from other versions of BLAST, where each exon is scored as a separate hit and read-pairing is ignored.</p>
<p>Magic-BLAST incorporates within the NCBI BLAST code framework ideas developed in the NCBI Magic pipeline, in particular hit extensions by local walk and jump&nbsp;<a href="http://www.ncbi.nlm.nih.gov/pubmed/26109056">(http://www.ncbi.nlm.nih.gov/pubmed/26109056)</a>, and recursive clipping of mismatches near the edges of the reads, which avoids accumulating artefactual mismatches near splice sites and is needed to distinguish short indels from substitutions near the edges.</p><p>Address of the bookmark: <a href="https://ncbi.github.io/magicblast/" rel="nofollow">https://ncbi.github.io/magicblast/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/4409/huber-lab</guid>
  <pubDate>Mon, 09 Sep 2013 21:57:03 -0500</pubDate>
  <link></link>
  <title><![CDATA[Huber Lab]]></title>
  <description><![CDATA[
<p>The Huber group develops computational and statistical methods to design and analyse novel experimental approaches in genetics and cell biology. </p>

<p>Future projects and goals</p>

<p>Large-scale systematic maps of gene-gene and gene-environment interactions by automated phenotyping, using image analysis, machine learning, sparse model building and causal inference.<br />DNA-, RNA- and ChIP-Seq and their applications to gene expression regulation: statistical and computational foundations.<br />Cancer genomics, genomes as biomarkers, cancer phylogeny.<br />Image analysis for systems biology: measuring the dynamics of cell cycle and of cell migration of individual cells under normal conditions and many different perturbations (RNAi, drugs).</p>

<p>More @ http://www.embl.de/research/units/genome_biology/huber/index.html</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41158/carefully-opt-for-human-reference-genome</guid>
	<pubDate>Tue, 18 Feb 2020 07:43:32 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41158/carefully-opt-for-human-reference-genome</link>
	<title><![CDATA[Carefully opt for human reference genome]]></title>
	<description><![CDATA[<p><a href="http://lh3.github.io/2017/11/13/which-human-reference-genome-to-use" target="_blank">Heng Li posted several issues with the human reference genomes given in these resources</a> and suggests the following compressed FASTA file to be used as hg38/GRCh38 human reference genome.</p>
<p>if you map reads to GRCh38 or hg38, use the following:</p>
<div>
<div>
<pre><code>ftp://ftp.ncbi.nlm.nih.gov/genomes/all/GCA/000/001/405/GCA_000001405.15_GRCh38/seqs_for_alignment_pipelines.ucsc_ids/GCA_000001405.15_GRCh38_no_alt_analysis_set.fna.gz
</code></pre>
</div>
</div>
<p>There are several other versions of GRCh37/GRCh38. What&rsquo;s wrong with them? Here are a collection of potential issues:</p>
<p>More at http://lh3.github.io/2017/11/13/which-human-reference-genome-to-use</p><p>Address of the bookmark: <a href="http://lh3.github.io/2017/11/13/which-human-reference-genome-to-use" rel="nofollow">http://lh3.github.io/2017/11/13/which-human-reference-genome-to-use</a></p>]]></description>
	<dc:creator>biogeek</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/4456/asst-prof-in-bioinformatics-at-jaipur-national-university</guid>
  <pubDate>Thu, 12 Sep 2013 07:18:02 -0500</pubDate>
  <link></link>
  <title><![CDATA[Asst. PROF IN BIOINFORMATICS at JAIPUR NATIONAL UNIVERSITY]]></title>
  <description><![CDATA[
<p>JAIPUR NATIONAL UNIVERSITY, SCHOOL OF LIFE SCIENCES (SIILAS CAMPUS) URGENTLY REQUIRES</p>

<p>Asst. PROF IN BIOINFORMATICS.</p>

<p>QUALIFICATION: AS PER UGC</p>

<p>DESIRABLE: 1 YEAR EXPERIENCE IN ACADEMICS</p>

<p>CONTACT immediately</p>

<p>Prof D.S.Bhatia<br />Director<br />9351288070</p>

<p>Last date within 7 days of the publication.</p>

<p>Find more @ http://jnujaipur.ac.in/downloads/AdvtDec2012.jpg</p>
]]></description>
</item>

</channel>
</rss>