BOL: Related items

Baumbach Lab

Wed, 21 Aug 2013 10:56:35 -0500

The Computational Biology research group was established in October 2012 at the Department of Mathematics and Computer Science (IMADA) at the University of Southern Denmark (SDU). It emerged from the Computational Systems Biology group, founded in March 2010 at the Max Planck Institute for Informatics (MPII) and the Cluster of Excellence for Multimodel Computing and Interaction (MMCI) at Saarland University, Saarbrücken, Germany.

The group is headed by Prof. Dr. Jan Baumbach and currently hosts nine PhD students and one postdoctoral fellow at both, IMADA/SDU and MMCI/MPII.

More at >> http://www.baumbachlab.net/

BioKit: a set of tools dedicated to bioinformatics, data visualisation

Neel — Tue, 18 Jun 2024 02:04:39 -0500

BioKit is a set of tools dedicated to bioinformatics, data visualisation (biokit.viz), access to online biological data (e.g. UniProt, NCBI thanks to bioservices). It also contains more advanced tools related to data analysis (e.g., biokit.stats). Since R is quite common in bioinformatics, we also provide a convenient module to run R inside your Python scripts or shell (:mod:biokit.rtools module).

Address of the bookmark: https://biokit.readthedocs.io/en/latest/index.html

Look up a biological numbers

Jitendra Narayan — Fri, 23 Aug 2013 03:27:45 -0500

Did you ever need to look up a number like the volume of a cell or the cellular concentration of ATP, only to find yourself spending much more time than you wanted on the Internet or flipping through textbooks - all without much success?

Well, it didn’t happen only to you. It is often surprising how difficult it can be to find concrete biological numbers, even for properties that have been measured numerous times. To help solve this for one and all, BioNumbers (the database of key numbers in molecular biology) was created. Along with the numbers, you'll find the relevant references to the original literature, useful comments, and related numbers.

To cite BioNumbers please refer to: Milo et al. Nucl. Acids Res. (2010) 38: D750-D753. When using a specific entry from the database it is highly recommended that you also specify the BioNumbers 6 digit ID, e.g. "BNID 100986, Milo et al 2010".

Address of the bookmark: http://bionumbers.hms.harvard.edu/

Public Databases for Bioinformatics !

Jit — Tue, 23 Mar 2021 05:32:15 -0500

https://www.nature.com/articles/s41467-020-17155-y

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"

For use case 1 we obtained the following ENCODE and ROADMAP datasets https://www.encodeproject.org/files/ENCFF446WOD/@@download/ENCFF446WOD.bed.gz, https://www.encodeproject.org/files/ENCFF546PJU/@@download/ENCFF546PJU.bam, https://www.encodeproject.org/files/ENCFF059BEU/@@download/ENCFF059BEU.bam. Blacklisted regions were obtained from http://mitra.stanford.edu/kundaje/akundaje/release/blacklists/hg38-human/hg38.blacklist.bed.gz. The human genome version hg38 was obtained from http://hgdownload.cse.ucsc.edu/goldenPath/hg38/bigZips/hg38.fa.gz.

For use case 2 we used the set of narrowPeak files summarized in https://github.com/wkopp/janggu_usecases/tree/master/extra/urls.txt (archived version v1.0.1). The human genome version hg19 was obtained from http://hgdownload.cse.ucsc.edu/goldenPath/hg19/bigZips/hg19.fa.gz

For use case 3 we used the ENCODE datasets https://www.encodeproject.org/files/ENCFF591XCX/@@download/ENCFF591XCX.bam, https://www.encodeproject.org/files/ENCFF736LHE/@@download/ENCFF736LHE.bigWig, https://www.encodeproject.org/files/ENCFF177HHM/@@download/ENCFF177HHM.bam as we as the GENCODE annotation v29 from ftp://ftp.ebi.ac.uk/pub/databases/gencode/Gencode_human/release_29/gencode.v29.annotation.gtf.gz.

Address of the bookmark: http://mitra.stanford.edu/

Ancestor at work !!!

Jit — Sun, 25 Aug 2013 19:45:28 -0500

When they will learn Bioinformatics :)

Chang lab

Tue, 24 Sep 2013 17:25:49 -0500

The Chang lab is focused on how the activities of hundreds or even thousands of genes (gene parties) are coordinated to achieve biological meaning. We have pioneered methods to predict, dissect, and control large-scale gene regulatory programs; these methods have provided insights into human development, cancer, and aging. A particular interest is how cells know and remember their locations in the body, particularly with the help of long noncoding RNAs.

More at http://changlab.stanford.edu/index.html

jobTree based python wrapper to run the genome simulation tool suite Evolver

Jit — Fri, 08 Dec 2017 16:26:32 -0600

evolverSimControl (eSC) can be used to simulate multi-chromosome genome evolution on an arbitrary phylogeny (Newick format). In addition to simply running evolver, eSC 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 (.maf) from leaf and branch nodes from a completed simulation and with the help of mafJoin, join them together into a single maf covering the entire simulation.

Address of the bookmark: https://github.com/dentearl/evolverSimControl

Genetics for Fun and Profit: Andrew Hessel at TEDxVilnius

Sun, 01 Sep 2013 19:15:06 -0500

Andrew Hessel co-chairs the Bioinformatics and Biotechnology track at the Singularity University, an institution founded by futurist Ray Kurzweil and X Prize Foundation CEO Peter Diamandis, with sponsorship from world-leading organizations that include Google, Autodesk, and NASA. He is also the founder of the Pink Army Cooperative, a venture aiming to make open source personalized cancer therapies. His work has been featured in The New York Times, Futurist Magazine, H+, and Wired News. In the spirit of ideas worth spreading, TEDx is a program of local, self-organized events that bring people together to share a TED-like experience. At a TEDx event, TEDTalks video and live speakers combine to spark deep discussion and connection in a small group. These local, self-organized events are branded TEDx, where x = independently organized TED event. The TED Conference provides general guidance for the TEDx program, but individual TEDx events are self-organized.* (*Subject to certain rules and regulations)

Magic-BLAST: a tool for mapping large next-generation RNA or DNA sequencing runs against a whole genome or transcriptome.

Jit — Tue, 26 Dec 2017 22:23:39 -0600

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.

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 (http://www.ncbi.nlm.nih.gov/pubmed/26109056), 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.

Address of the bookmark: https://ncbi.github.io/magicblast/

PostDocs positions in computer science in HELSINKI, FINLAND

Fri, 06 Sep 2013 10:11:19 -0500

Several university departments in the Helsinki region, Finland, are looking for postdoctoral researchers in the field of computer science and information technology. Jobs are available at:
· Helsinki Institute for Information Technology HIIT, Aalto University and University of Helsinki, http://www.hiit.fi
· Department of Computer Science, University of Helsinki, http://www.cs.helsinki.fi
· Department of Information and Computer Science, Aalto University, http://ics.aalto.fi
· Department of Computer Science and Engineering, Aalto University, http://cse.aalto.fi
· Department of Mathematics and Statistics, University of Helsinki, http://mathstat.helsinki.fi/english/

Why Helsinki?
The collaborating Aalto University and University of Helsinki form a leading hub of computer science and modelling, including Machine learning, Data mining, Algorithms, Computational Logic, Cloud computing, Distributed computing, Human-centric ubiquitous ICT, Bioinformatics, etc.
Helsinki region is a safe, pleasant and attractive place to live in, with well-functioning services such as public transport etc. Finland has a comprehensive social security and health care system, including exceptionally good parental leaves, and children's day care services.

Positions are offered in:
Algorithm engineering (String Algorithms group)
Algorithmic bioinformatics (Genome-Scale Algorithmics group)
Automated reasoning and search, especially propositional logic (Computational Logic group)
Computational astrophysics and/or data analysis (Computational Methods and Data Analysis for Astrophysics group)
Computational biology and statistical methods in bioinformatics (Computational Systems Biology group)
Computational creativity and data mining (Discovery group)
Dynamic and large-scale networked systems (Data Communications Software group)
Intelligent multimodal information access (Content-Based Image and Information Retrieval Group)
Machine learning and neuroscience (Statistical Machine Learning group)
Machine learning for structured data (Kernel Machines, Pattern Analysis and Computational Biology group)
Machine learning methods for infectious disease epidemiology (Bayesian Statistics Group)
Probabilistic modeling and machine learning (Complex Systems Computation group)
Statistical machine learning (Statistical Machine Learning group)
Analysing ubiquitous sensor data (HIIT-Wide Focus Area)
Interactive visualization (HIIT-Wide Focus Area)
Affective computing and BCI (HIIT-Wide Focus Area)
Intelligent user interfaces and/or recommender systems (HIIT-Wide Focus Area)
Information retrieval and HCI (HIIT-Wide Focus Area)
Machine learning and data analysis, especially information retrieval, HCI, text and context data (HIIT-Wide Focus Area)
Probabilistic modeling and data analysis for bioinformatics (HIIT-Wide Focus Area)

More at http://www.hiit.fi/postdoc-call-2013