<?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/28922?offset=810</link>
	<atom:link href="https://bioinformaticsonline.com/related/28922?offset=810" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	
<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/4946/crcri-bioinfomatics-walk-in-on-08102013</guid>
  <pubDate>Fri, 27 Sep 2013 10:59:53 -0500</pubDate>
  <link></link>
  <title><![CDATA[CRCRI Bioinfomatics Walk In on 08.10.2013]]></title>
  <description><![CDATA[
<p>Walk-in-Interview for recruitment of one Project Fellow for a period of 10 months purely on temporary basis is proposed to be held at Central Tuber Crops Research Institute, Sreekariyam, Thiruvananthapuram for a KSCSTE funded project entitled “PARTICIPATORY DEVELOPMENT OF A WEB BASED USER FRIENDLY CASSAVA EXPERT SYSTEM”</p>

<p>Salary: Rs. 10,000/- per month.</p>

<p>Age limit: 35 for men and 40 for women &amp; SC/ST.</p>

<p>Qualification: First class in M. Sc (Agriculture)/MCA/M.Sc (IT)/ M. Sc (Computer Application)/M.Sc (Bioinformatics)/M.Sc (Geoinformatics).</p>

<p>Desirable: Two years experience in web design and web programming.</p>

<p>Date &amp; time of interview: 08.10.2013, 10 am</p>

<p>Interested candidates may appear for an interview at this institute along with their application in plain paper containing the following particulars viz. (1) Name (2) Father/Husband/Guardian’s Name (3) date of birth &amp; age as on 01.10.2013 (4) Permanent address (5) Address for communication (6) Email address and Telephone No. with code (7) Qualification (8) National fellowship like ICAR/CSIR/UGC etc. if any (9) Whether SC/ST/OBC (10) Details of experience (Attested copies of degree certificate, proof of age, mark sheets). Original certificates should be produced for verification.</p>

<p>No TA/DA will be admissible to the candidates attending the test. The selected candidate will have to join immediately.</p>

<p>Advertisement: http://www.ctcri.org/careers/mithra_SRF.doc</p>
]]></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/5187/bioinformatics-algorithms-part-1-with-pavel-pevzner-phillip-e-c-compeau</guid>
	<pubDate>Mon, 30 Sep 2013 11:34:09 -0500</pubDate>
	<link>https://bioinformaticsonline.com/videolist/watch/5187/bioinformatics-algorithms-part-1-with-pavel-pevzner-phillip-e-c-compeau</link>
	<title><![CDATA[Bioinformatics Algorithms (Part 1)  with Pavel  Pevzner, Phillip E. C. Compeau,]]></title>
	<description><![CDATA[<iframe width="" height="" src="https://www.youtube-nocookie.com/embed/t5t_nfzdzEg" frameborder="0" allowfullscreen></iframe><p>The course Bioinformatics Algorithms (Part 1) by Pavel Pevzner, Phillip E. C. Compeau, and Nikolay Vyahhi from University of California, San Diego will be offered free of charge to everyone on the Coursera platform. Sign up at http://www.coursera.org/course/bioinformatics.</p>]]></description>
	
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/5255/walk-in-interview-indian-agricultural-statistics-research-institute</guid>
  <pubDate>Wed, 02 Oct 2013 15:40:17 -0500</pubDate>
  <link></link>
  <title><![CDATA[Walk-in-Interview @ Indian Agricultural Statistics Research Institute]]></title>
  <description><![CDATA[
<p>Indian Agricultural Statistics Research Institute<br />Library Avenue, Pusa, New Delhi – 110012</p>

<p>Walk-in-Interview</p>

<p>Walk-in-interview will be held on October 5, 2013 at 10:00 A.M. at IASRI, New Delhi for a project “A New Distributed Computing Framework for Data Mining” funded by Department of Electronics and Information Technology, Government of India for the following posts. The appointment will be on contractual basis upto 14th October, 2015 or till the termination of the project whichever is earlier and the incumbent shall not have any claim for regular appointment under ICAR.</p>

<p>Research Associate</p>

<p>    Ph.D. in Bioinformatics/ Agricultural Statistics/ Statistics/ Computer Science/ Computer Application or equivalent or</p>

<p>    Post-Graduation in Bioinformatics/ Agricultural Statistics/ Statistics/ Computer Science/ Computer Application or equivalent with 1st Division and at least two years of research experience</p>

<p>     Knowledge of Statistical Analysis /Bioinformatics tools for computational genomics.</p>

<p>     Knowledge of R/Perl programming language</p>

<p>Research Associate</p>

<p>    Ph.D. in Computer Science/ Computer Application / Bioinformatics/ Agricultural<br />    Statistics/ Statistics or equivalent or</p>

<p>    Post-Graduation in Computer Science/ Computer Application /Bioinformatics/ Agricultural Statistics/ Statistics or equivalent with 1st Division and at least two years of research experience</p>

<p>     Expertise in Java programming.<br />     Knowledge of system administration and networking under Linux environment.<br />     Knowledge of parallel programming and cluster computing.</p>

<p>Emoluments for Research Associate: Consolidated Rs:24000/- per month + HRA (for Ph.D. Degree holders) and Rs:23000/- per month + HRA (for Master’s Degree holders)</p>

<p>Age Limit: Age should be not more than 40 years (5 years relaxation for  SC/ST/women candidates and 3 years for OBC candidates as on date of interview).</p>

<p>Interested candidates are requested to appear for Walk-in-Interview on the date and time as specified above in Room No. 106, Training Cum Administrative Block of the Institute along with their application giving bio-data with attested copies of certificates, degrees, testimonials, etc. and one passport size photograph.</p>

<p>Original certificates/ Degrees are needed to be produced at the time of interview.</p>

<p>No T.A. /D.A. will be paid for appearing in the interview.</p>

<p>Advertisement: http://www.iasri.res.in/employment/employment.htm</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34482/ribbon-visualizing-complex-genome-alignments-and-structural-variation</guid>
	<pubDate>Wed, 29 Nov 2017 07:40:22 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34482/ribbon-visualizing-complex-genome-alignments-and-structural-variation</link>
	<title><![CDATA[Ribbon: Visualizing complex genome alignments and structural variation:]]></title>
	<description><![CDATA[<p>Ribbon can be used for long reads, short reads, paired-end reads, and assembly/genome alignments. Instructions for each data format are available by clicking on "instructions" in each tab on the right.</p>
<p>Local installation:</p>
<p>You can install Ribbon locally from Github by following the instructions here:&nbsp;<a href="https://github.com/MariaNattestad/ribbon" target="_blank">https://github.com/MariaNattestad/Ribbon</a></p><p>Address of the bookmark: <a href="http://genomeribbon.com/" rel="nofollow">http://genomeribbon.com/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/5422/shendure-lab</guid>
  <pubDate>Wed, 09 Oct 2013 14:21:58 -0500</pubDate>
  <link></link>
  <title><![CDATA[Shendure Lab]]></title>
  <description><![CDATA[
<p>The Shendure Lab is part of the Department of Genome Sciences at the University of Washington (Seattle, WA). The mission of the lab is to develop and apply new technologies in genomics and molecular biology. Most projects in the lab exploit new DNA sequencing technologies (Shendure et al., Nature Reviews Genetics 2004; Shendure &amp; Ji, Nature Biotechnology 2008; Shendure &amp; Lieberman Aiden, Nature Biotechnology 2012), and generally fall into one of six areas: 1) next-generation human genetics; 2) genome contiguity &amp; completeness; 3) massively parallel functional analysis; 4) molecular tagging; 5) synthetic biology; 6) translational genomics. Our interests in each of these areas are outlined briefly below, and a full list of publications is available via PubMed. http://www.ncbi.nlm.nih.gov/pubmed?cmd=search&amp;term=shendure<br />More http://krishna.gs.washington.edu/research.html</p>

<p>Lab page @ http://krishna.gs.washington.edu/index.html</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34571/mugsy-multiple-whole-genome-alignment-tool</guid>
	<pubDate>Fri, 08 Dec 2017 17:41:14 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34571/mugsy-multiple-whole-genome-alignment-tool</link>
	<title><![CDATA[Mugsy: multiple whole genome alignment tool]]></title>
	<description><![CDATA[<p><span>Mugsy is a multiple whole genome aligner. Mugsy uses Nucmer for pairwise alignment, a custom graph based segmentation procedure for identifying collinear regions, and the segment-based progressive multiple alignment strategy from Seqan::TCoffee. Mugsy accepts draft genomes in the form of multi-FASTA files and does not require a reference genome.</span></p>
<p>To cite Mugsy, use:</p>
<p>Angiuoli SV and Salzberg SL.&nbsp;<a href="http://bioinformatics.oxfordjournals.org/content/27/3/334">Mugsy: Fast multiple alignment of closely related whole genomes.</a><em>Bioinformatics</em>&nbsp;2011 27(3):334-4</p><p>Address of the bookmark: <a href="http://mugsy.sourceforge.net/" rel="nofollow">http://mugsy.sourceforge.net/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/5661/shankar-lab</guid>
  <pubDate>Wed, 16 Oct 2013 07:02:22 -0500</pubDate>
  <link></link>
  <title><![CDATA[Shankar Lab]]></title>
  <description><![CDATA[
<p>Research Interest:</p>

<p>(A) Regulatory System Analysis with respect to microRNAs</p>

<p>(B) Computational Epigenomics &amp; Regulomics:</p>

<p>(C) Computational issues with Next Generation Sequencing:</p>

<p>Department of Biotechnology, <br />Institute of Himalyan Bioresources Technology<br />CSIR, Palampur(Himachal Pradesh), India.<br />Email: ravishihbt.res.in; ravish9gmail.com</p>

<p>More @ http://scbb.ihbt.res.in/SCBB_dept/Lab_Member.php</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/5747/dbbrowser-attwood-lab</guid>
  <pubDate>Fri, 18 Oct 2013 10:48:19 -0500</pubDate>
  <link></link>
  <title><![CDATA[DbBrowser: Attwood Lab]]></title>
  <description><![CDATA[
<p>DbBrowser: Attwood Lab research concerns protein sequence analysis, primarily using the method of protein 'fingerprinting'. DbBrowser: Attwood Lab maintain a diagnostic fingerprint database (PRINTS), one of the founding partner of InterPro. We also design software to display sequence and structural data in visually-striking ways (e.g., Ambrosia, CINEMA); DbBrowser: Attwood Lab are building re-usable software components to create semantically integrated bioinformatics applications through UTOPIA, including a 'smart' PDF reader that links bioinformatics databases and tools directly with scientific articles (Utopia Documents); and have developed a number of tools for automatic annotation and text mining (e.g., MINOTAUR, PRECIS, METIS). </p>

<p>More @ http://www.bioinf.manchester.ac.uk/dbbrowser/index.php</p>
]]></description>
</item>

</channel>
</rss>