<?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/31382?offset=800</link>
	<atom:link href="https://bioinformaticsonline.com/related/31382?offset=800" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/videolist/watch/4043/what-is-bioinformatics</guid>
	<pubDate>Wed, 28 Aug 2013 06:53:05 -0500</pubDate>
	<link>https://bioinformaticsonline.com/videolist/watch/4043/what-is-bioinformatics</link>
	<title><![CDATA[What is Bioinformatics?]]></title>
	<description><![CDATA[<iframe src="http://player.vimeo.com/video/71581534?byline=0" width="" height="" frameborder="0" webkitAllowFullScreen allowFullScreen></iframe>Illustration and Animation: Rachel Robinson Script: Tiffany Trent Voice-over: Kris Monger Sound: Glisten Carefully by Guennadi Malyshevski]]></description>
	
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40251/mosdepth-fast-bamcram-depth-calculation-for-wgs-exome-or-targeted-sequencing</guid>
	<pubDate>Wed, 13 Nov 2019 22:20:19 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40251/mosdepth-fast-bamcram-depth-calculation-for-wgs-exome-or-targeted-sequencing</link>
	<title><![CDATA[mosdepth: fast BAM/CRAM depth calculation for WGS, exome, or targeted sequencing]]></title>
	<description><![CDATA[<p>mosdepth can output:</p>
<p>per-base depth about 2x as fast samtools depth--about 25 minutes of CPU time for a 30X genome.<br>mean per-window depth given a window size--as would be used for CNV calling.<br>the mean per-region given a BED file of regions.<br>a distribution of proportion of bases covered at or above a given threshold for each chromosome and genome-wide.<br>quantized output that merges adjacent bases as long as they fall in the same coverage bins e.g. (10-20)<br>threshold output to indicate how many bases in each region are covered at the given thresholds.<br>A summary of mean depths per chromosome and within specified regions per chromosome.</p><p>Address of the bookmark: <a href="https://github.com/brentp/mosdepth" rel="nofollow">https://github.com/brentp/mosdepth</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/videolist/watch/4093/ibm-research-computational-biology-center</guid>
	<pubDate>Thu, 29 Aug 2013 08:43:59 -0500</pubDate>
	<link>https://bioinformaticsonline.com/videolist/watch/4093/ibm-research-computational-biology-center</link>
	<title><![CDATA[IBM Research Computational Biology Center]]></title>
	<description><![CDATA[<iframe width="" height="" src="https://www.youtube-nocookie.com/embed/lr2bB_2g_Uc" frameborder="0" allowfullscreen></iframe>The IBM Computational Biology Center embraces activities at Yorktown Heights, with strong affiliations with activities at Almaden and other IBM Research Centers. Computational Biology (CompBio) including bioinformatics is the study of how computer systems can manage, analyze, and simulate the complex structures and processes inherent in living systems. CompBio Research at IBM spans pattern recognition in sequences, structures and processes, the studying of systems ranging from single protein molecules through to complex molecular interactions, and the data analysis, interpretation and reverse-engineering of complex disease-lifestyle-genomic interactions for fuller biological understanding. "CompBio" has a flavor of its own independant of its parents, biology and computer science. Nonetheless, CompBio is inherently a multi- disciplinary field with important applications in biology, chemical physics, materials science, agriculture, chemistry and ultimately nanotechnology.]]></description>
	
</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/videolist/watch/4271/may-17-2013-differential-network-analysis</guid>
	<pubDate>Wed, 04 Sep 2013 16:22:28 -0500</pubDate>
	<link>https://bioinformaticsonline.com/videolist/watch/4271/may-17-2013-differential-network-analysis</link>
	<title><![CDATA[May 17, 2013 - Differential Network Analysis]]></title>
	<description><![CDATA[<iframe width="" height="" src="https://www.youtube-nocookie.com/embed/BvD6SkZRw9w" frameborder="0" allowfullscreen></iframe>Steve Horvath presents Differential Network Analysis at the UCLA Human Genetics/Biostatistics Network Course]]></description>
	
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/4353/project-fellow-alagappa-university</guid>
  <pubDate>Sat, 07 Sep 2013 14:24:13 -0500</pubDate>
  <link></link>
  <title><![CDATA[Project Fellow @ Alagappa University]]></title>
  <description><![CDATA[
<p>Advertisement for the post of project Fellow in UGC project</p>

<p>Project Fellow – One Post</p>

<p>Duration: Three Years</p>

<p>Fellowship : Rs.14, 000/- per month + HRA</p>

<p>Walk-in-interview: 16th Sept, 2013 at 10.00 am</p>

<p>Venue : Department of Bioinformatics, Alagappa University</p>

<p>Eligible candidates can attend walk in interview for the post of Project Fellow in UGC supported project entitled “Shape and chemical feature based 3D- Pharmacophore Model generation, Virtual Screening and MESP studies to identify Potential Leads for Antifungal Azoles”</p>

<p>Interested candidates may apply to Dr. Sanjeev Kumar Singh, Principal Investigator, Department of Bioinformatics, Karaikudi with their Curriculum Vitae along with the copies of the certificates in proof of their educational qualification and experience at skysanjeev@gmail.com</p>

<p>Qualification:</p>

<p>PG Degree in Bioinformatics / Chemistry/ Molecular Biology/ Biotechnology / Biophysics / Biochemistry / Life Sciences/ Pharmacy with minimum of 55% marks in the PG examinations</p>

<p>Desirable:</p>

<p>Research experience in Molecular modeling and CADD will be given preference. UGC-NET/ CSIR-JRF qualified candidates will get preference.</p>

<p>The posts are purely on temporary basis. No TA/DA will be paid for attending the interview.</p>

<p>Advertisement: http://www.alagappauniversity.ac.in/files/news_files/new%20advt-UGC-16sept,13.doc</p>
]]></description>
</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/opportunity/view/6961/research-assistant-national-bureau-of-animal-genetic-resources</guid>
  <pubDate>Tue, 03 Dec 2013 06:17:34 -0600</pubDate>
  <link></link>
  <title><![CDATA[Research Assistant @ NATIONAL BUREAU OF ANIMAL GENETIC RESOURCES]]></title>
  <description><![CDATA[
<p>NATIONAL BUREAU OF ANIMAL GENETIC RESOURCES<br />Near Basant Vihar G.T. Road Bypass<br />P.O. Box No.129, Karnal-132001 (Haryana)</p>

<p>WALK-IN-INTERVIEW</p>

<p>A walk-in-Interview is proposed to be held at National Bureau of Animal Genetic Resources, Karnal (Haryana)-132001 at 11:30 AM on 18.12.2013 to select One RA and One SRF as per details given below:</p>

<p>1. One post of Research Associate under DBT sponsored Support under BIPP for the “SanGenix: A comprehensive Next Generation Sequence (NGS) data analysis solution” as Grants in AID. Thepost duration is Upto 31st March 2015 or earlier.</p>

<p>2. One post of Senior Research Fellow under NAIP (Component-4) Bioprospecting of genes and allele mining for abiotic stress tolerance. The post duration is Upto 31st March 2014 or earlier</p>

<p>Essential Qualifications: Ph.D. in Bioinformatics/ Computer Application or<br />First Class Masters degree in Bioinformatics/ Computer Application with two years experience as evidenced by Publications.</p>

<p>Desirable: Experience in the field of handling Next generation Sequencing Data.</p>

<p>Emolument: Rs. 22,000/- per month + HRA as per admissibility</p>

<p>Age Limit:</p>

<p>40 years for Men<br />45 years for women as on date of interview</p>

<p>Research Associate: ONE</p>

<p>Duration of engagement: Upto</p>

<p>31st March 2015 or earlier &amp; Coterminus with the project</p>

<p>Responsibilities: To help the PI for Beta testing and development of the SanGenix Tool for NGS data.</p>

<p>Essential Qualifications: First Class Masters’ degree in Bioinformatics/Biotechnology.</p>

<p>Desirable: Experience in the field of Biotechnology/ Bioinformatics</p>

<p>Emoluments:</p>

<p>Rs. 16,000/- per month + HRA as per admissibility.<br />Senior Research Fellow: ONE<br />Duration of engagement: Upto 31st March 2014 or earlier &amp; Coterminus with the project</p>

<p>Age Limit</p>

<p>35 years for men<br />40 years for women as on date of interview</p>

<p>Note: Relaxation in age will be admissible for SC/ST &amp; OBC candidates as per Govt. of India /ICAR norms</p>

<p>1. The applicants must bring with them original documents and brief of research work done during post graduation along with a set of photocopy and latest two passport size photographs.<br />2. A panel of selected candidates will also be made which may be utilized for filling of positions of shorter durations in future if demand arises.<br />3. Experience certificate in original, if any 4. The above positions are purely on temporary basis and are co-terminus with the project. No TA/DA will be paid to attend the interview.<br />5. Any other clarifications can be had on the date of interview.<br />6. The Director’s decision will be final and binding on all respects.</p>

<p>Advertisement: http://210.212.93.85/rasrfadvertise.pdf</p>
]]></description>
</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/4655/mathivanan-lab</guid>
  <pubDate>Fri, 20 Sep 2013 13:09:38 -0500</pubDate>
  <link></link>
  <title><![CDATA[Mathivanan Lab]]></title>
  <description><![CDATA[
<p>The major research interests are in exploring the role of extracellular matrix components (soluble secreted proteins and membrane vesicles) in cancer and intercellular communication. The lab integrates proteomic, genomic and bioinformatics methodologies to explore cancer cells. </p>

<p>More at http://www.mathivananlab.org/index.html</p>

<p>http://scholar.google.com/citations?user=U6PyEdYAAAAJ&amp;hl=en</p>
]]></description>
</item>

</channel>
</rss>