<?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/28997?offset=560</link>
	<atom:link href="https://bioinformaticsonline.com/related/28997?offset=560" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/videolist/watch/4959/evolution-and-cancer</guid>
	<pubDate>Fri, 27 Sep 2013 11:28:49 -0500</pubDate>
	<link>https://bioinformaticsonline.com/videolist/watch/4959/evolution-and-cancer</link>
	<title><![CDATA[Evolution and Cancer]]></title>
	<description><![CDATA[<iframe width="" height="" src="https://www.youtube-nocookie.com/embed/j3uKOcNwYBw" frameborder="0" allowfullscreen></iframe>Air date:  Wednesday, January 04, 2012, 3:00:00 PM
Time displayed is Eastern Time, Washington DC Local  
 
Category:  Wednesday Afternoon Lectures  
Description:  There is a broad consensus that cancer is the result of somatic cells having serially gained, by a series of mutations, the ability to grow independently, to recruit resources from the circulation and the stroma, to invade local tissues, and to found anatomically distant metastases, ultimately killing the host. From the point of view of the cancer-causing somatic cell population, this is evolution driven by mutation and selection. Genomics has resulted in a parallel consensus that the central functions of all eukaryotes are highly conserved, not only at the level of individual protein functions, but also complex biological pathways and systems. These ideas motivated a comparison between results of molecular genetic studies of experimental evolution in yeast and the molecular genetic phenomena associated with tumorigenesis and tumor progression. We find some very striking similarities, including recurring genomic rearrangements, alterations of the regulation of specific growth-promoting genes, population-genetic features that affect the fitness trajectories of growth rate variants in evolving populations, and physiological and metabolic similarities derived from the conservation of the basic plan of growth and cell multiplication among all eukaryotes. It is hoped that some of the insights from yeast will aid the interpretation of sequence changes found in tumors, especially in the urgent necessity to distinguish 'driver' from 'passenger' mutations." 

David Botstein's fundamental contributions to modern genetics include the development of genetic methods for understanding biological functions and the discovery of the functions of many yeast and bacterial genes. In 1980, Botstein and three colleagues proposed a method for mapping human genes that laid the groundwork for the Human Genome Project. The basic principle of the mapping scheme was to develop, by recombinant DNA techniques, random single-copy DNA probes capable of detecting DNA sequence polymorphisms when hybridized to restriction digests, or specific fragments, of an individual's DNA. The method was used in subsequent years to identify several human disease genes, such as Huntington's and BRCA1. Variations of this method enabled the sequencing phase of the Human Genome Project. 

In the 1990s Botstein, having moved to Stanford University School of Medicine, collaborated with Patrick O. Brown of Stanford in exploiting DNA microarrays to study genome-wide gene expression patterns in yeast and in human cancers. This required developing a new statistical method and graphical interface, widely used today to interpret genomic data. Botstein also has helped to create, with Michael Ashburner and Gerald Rubin, a bioinformatics initiative to unify the representation of gene and gene product attributes across all species, called Gene Ontology. He graduated from Harvard College and earned his doctorate from the University of Michigan. He worked at Massachusetts Institute of Technology from 1967 to 1988; served as vice president for science at Genentech from 1988 to 1990; chaired the Department of Genetics at the Stanford University School of Medicine from 1990 to 2003; and joined the Princeton University faculty in 2003. He has sat on numerous editorial boards and was the founding editor of Molecular Biology of the Cell. Among recent major awards, Bostein won the Peter Gruber Foundation Prize in Genetics in 2003, the Apple Science Innovator Award in 2008, and the Albany Medical Center Prize in 2010. 

The NIH Wednesday Afternoon Lecture Series includes weekly scientific talks by some of the top researchers in the biomedical sciences worldwide. 

For more information, visit: The NIH Director's Wednesday Afternoon Lecture Series  
Author:  Dr. David Botstein, Princeton University  
Runtime:  00:59:58  

Permanent link:  http://videocast.nih.gov/launch.asp?17046]]></description>
	
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/36870/understanding-liftover</guid>
	<pubDate>Wed, 06 Jun 2018 10:00:20 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/36870/understanding-liftover</link>
	<title><![CDATA[Understanding liftOver !]]></title>
	<description><![CDATA[<p>LiftOver is a necesary step to bring all genetical analysis to the same reference build. LiftOver can have three use cases:</p><p>(1) <a href="https://genome.sph.umich.edu/wiki/LiftOver#Lift_genome_positions">Convert genome position from one genome assembly to another genome assembly</a></p><p>In most scenarios, we have known genome positions in NCBI build 36 (UCSC hg 18) and hope to lift them over to NCBI build 37 (UCSC hg19).</p><p>(2) <a href="https://genome.sph.umich.edu/wiki/LiftOver#Lift_dbSNP_rs_numbers">Convert dbSNP rs number from one build to another</a></p><p>(3) <a href="https://genome.sph.umich.edu/wiki/LiftOver#Lift_Merlin.2FPLINK_format">Convert both genome position and dbSNP rs number over different versions</a></p><p>Run:</p><pre>liftOver input.bed hg18ToHg19.over.chain.gz output.bed unlifted.bed</pre><p>The outformat is as follow:</p><pre>Deleted in new:
    Sequence intersects no chains
Partially deleted in new:
    Sequence insufficiently intersects one chain
Split in new:
    Sequence insufficiently intersects multiple chains
Duplicated in new:
    Sequence sufficiently intersects multiple chains
Boundary problem:
    Missing start or end base in an exon</pre><p>For example:</p><p>If you liftOver <span>chr4:6497-6497 from <span>hg19 to GRch38 </span>and it return "deleted in new". </span></p><p>It means chr4:6497-6497 is part of a genomic contig on hg19 that is not anymore mapped on GRch38 because the new assembly is now better built without including this contig.</p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/5253/pre-or-postdoctoral-research-fellowship-in-structural-bioinformatics-in-padova</guid>
  <pubDate>Wed, 02 Oct 2013 15:12:22 -0500</pubDate>
  <link></link>
  <title><![CDATA[Pre- or postdoctoral research fellowship in Structural Bioinformatics in Padova]]></title>
  <description><![CDATA[
<p>University of Padova (URL: http://protein.bio.unipd.it/)</p>

<p>A research fellowship is available at the BioComputing Laboratory, University of Padova (URL: http://protein.bio.unipd.it/). A highly motivated and creative candidate is sought to work on structural bioinformatics. Specifically, the project entails the development of novel methods, tools and databases for the analysis of protein structures. The BioComputing Laboratory is a group of a dozen people working on several aspects of prediction of protein structure &amp; function employing techniques at the intersection between biology, medicine, chemistry, physics &amp; computer science. Our aim is to integrate the development of novel methods and their application to biologically relevant problems. We are looking for candidates with a solid Bioinformatics background, programming experience (Python, Perl, C++ and/or Java) and good knowledge of molecular biology (protein structure/function, signalling pathways). Candidates should have a degree with top marks, optionally hold a PhD, and be highly motivated to work on interdisciplinary research. Good knowledge of English, an open-minded spirit, being collaborative and creative are crucial. The fellowship, which should start in late 2013, is initially for one year. It will be commensurate to experience, can be extended depending on performance and may lead to a PhD degree. The successful candidate will be located at the BioComputing Laboratory, University of Padova. Travel support for conferences and/or research visits abroad may be provided. To apply, please send your CV, a brief description of your research background and the names of two (or more) references to Prof. Silvio Tosatto (Email: silvio.tosatto@unipd.it). </p>

<p>Contact Person (Referent): Silvio Tosatto<br />Ref. E-Mail: silvio.tosatto@unipd.it<br />Tel: +39 049 827 6269<br />Fax: +39 049 827 6260<br />Group Web Page: http://protein.bio.unipd.it/</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/opportunity/view/7217/contract-faculty-bioinformatics-at-maulana-azad-national-institute-of-technology</guid>
  <pubDate>Thu, 12 Dec 2013 20:46:52 -0600</pubDate>
  <link></link>
  <title><![CDATA[Contract Faculty-Bioinformatics at Maulana Azad National Institute of Technology]]></title>
  <description><![CDATA[
<p>Contract Faculty-Bioinformatics at Maulana Azad National Institute of Technology</p>

<p>Job Description:F.No.11/10(1)/929 Qualifications: Candidates should have Ph.D. degree. If Ph.D. candidates are not available at least Post Graduate degree with GATE/NET qualification is a must. Walk-in-Interview on 19.12.2013 at 2.30 P.M. to 5.30 P.M .. at Maulana Azad National Institute of Technology: Bhopal For more details,please visit website:http://www.manit.ac.in/manitbhopal/Year2013/Recruitment/Contract_faculty/contract%20faculty%202013-2014.pdf</p>

<p>For more @ http://www.manit.ac.in/manitbhopal/Year2013/Recruitment/Contract_faculty/contract%20faculty%202013-2014.pdf</p>

<p>Web address @ :http://www.manit.ac.in</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34377/genomicus-genome-browser-that-enables-users-to-navigate-in-genomes-in-several-dimensions</guid>
	<pubDate>Sat, 18 Nov 2017 16:10:16 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34377/genomicus-genome-browser-that-enables-users-to-navigate-in-genomes-in-several-dimensions</link>
	<title><![CDATA[Genomicus: genome browser that enables users to navigate in genomes in several dimensions]]></title>
	<description><![CDATA[<p>Genomicus is a genome browser that enables users to navigate in genomes in several dimensions: linearly along chromosome axes, transversaly across different species, and chronologicaly along evolutionary time.</p>
<p>Once a query gene has been entered, it is displayed in its genomic context in parallel to the genomic context of all its orthologous and paralogous copies in all the other sequenced metazoan genomes. Moreover, Genomicus stores and displays the predicted ancestral genome structure in all the ancestral species within the phylogenetic range of interest.</p>
<p>All the data on extant species displayed in this browser are from&nbsp;<a href="http://www.ensembl.org/">Ensembl</a>.</p><p>Address of the bookmark: <a href="http://genomicus.biologie.ens.fr/genomicus-90.01/cgi-bin/search.pl" rel="nofollow">http://genomicus.biologie.ens.fr/genomicus-90.01/cgi-bin/search.pl</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/5623/yau-group</guid>
  <pubDate>Tue, 15 Oct 2013 13:05:15 -0500</pubDate>
  <link></link>
  <title><![CDATA[Yau Group]]></title>
  <description><![CDATA[
<p>Yau Group are a new research group based at the Wellcome Trust Centre for Human Genetics and the Department of Statistics at the University of Oxford.</p>

<p>Yau Group develops statistical and computational methods for the analysis of genomic datasets with a particular interest in cancer sequencing applications and the use of Bayesian Statistics.</p>

<p>Yau Group are currently have projects in somatic mutation analysis of heterogeneous cancers, data fusion or integration techniques and single cell genomics.</p>

<p>More @ http://www.well.ox.ac.uk/~cyau/index.html</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34519/bandage-interactive-visualization-of-de-novo-genome-assemblies</guid>
	<pubDate>Mon, 04 Dec 2017 10:09:37 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34519/bandage-interactive-visualization-of-de-novo-genome-assemblies</link>
	<title><![CDATA[Bandage: interactive visualization of de novo genome assemblies]]></title>
	<description><![CDATA[<p>Bandage (a Bioinformatics Application for Navigating&nbsp;<em>De&nbsp;novo</em>&nbsp;Assembly Graphs Easily) is a tool for visualizing assembly graphs with connections. Users can zoom in to specific areas of the graph and interact with it by moving nodes, adding labels, changing colors and extracting sequences. BLAST searches can be performed within the Bandage graphical user interface and the hits are displayed as highlights in the graph. By displaying connections between contigs, Bandage presents new possibilities for analyzing&nbsp;<em>de novo</em>&nbsp;assemblies that are not possible through investigation of contigs alone.</p>
<p><strong>Availability and implementation:</strong>&nbsp;Source code and binaries are freely available at&nbsp;<a href="https://github.com/rrwick/Bandage" target="pmc_ext">https://github.com/rrwick/Bandage</a>. Bandage is implemented in C++ and supported on Linux, OS X and Windows. A full feature list and screenshots are available at&nbsp;<a href="http://rrwick.github.io/Bandage" target="pmc_ext">http://rrwick.github.io/Bandage</a>.</p><p>Address of the bookmark: <a href="http://rrwick.github.io/Bandage/" rel="nofollow">http://rrwick.github.io/Bandage/</a></p>]]></description>
	<dc:creator>Shruti Paniwala</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/7218/associate-professor-centre-for-bioinformatics-at-maharshi-dayanand-university-rohtak</guid>
  <pubDate>Thu, 12 Dec 2013 20:49:59 -0600</pubDate>
  <link></link>
  <title><![CDATA[Associate Professor - Centre for Bioinformatics at Maharshi Dayanand University, Rohtak]]></title>
  <description><![CDATA[
<p>ADVERTISEMENT No. PR-54/2013</p>

<p>No. of Posts and Specialization: 1(UR)</p>

<p>Educational Qualification:</p>

<p>(i) Good academic record with a Ph.D. Degree in the concerned /allied /relevant disciplines.</p>

<p>(ii) The Ph.D. Degree shall be a mandatory qualification for all candidates to be appointed as Associate Professor through direct recruitment.</p>

<p>(iii) A Master‟s Degree with at least 55% marks (or an equivalent grade in a point scale wherever grading system is followed).</p>

<p>(iv) A minimum of eight years of experience of teaching and /or research in an academic /research position equivalent to that of Assistant Professor in a University, College or Accredited Research Institution/Industry excluding the period of Ph.D research with evidence of published work and a minimum of 5 publications as books and /or research papers in refereed journals only/policy papers.</p>

<p>(v) Contribution to educations innovation, design of new curricula and courses and technology-mediated teaching learning process with evidence of having guided doctoral candidates and research students.</p>

<p>(vi) A minimum score as stipulated in the Academic Performance Indicator (API) based performance Based Appraisal System (PBAS), set out in this notification in as mentioned in the advertisement.</p>

<p>Send your application to the A.R (Estt.Teaching), M.D.University, Rohtak on or before December 23, 2013.</p>

<p>For more details: http://www.mdurohtak.ac.in/pdf/Notices_Pdf/new_notice/Teaching%20Vacancy%20%28ADVT.%20No.%20PR-54%20of%202013%29.pdf</p>

<p>Last Apply Date: 23 Dec 2013</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34620/mash-fast-genome-and-metagenome-distance-estimation-using-minhash</guid>
	<pubDate>Tue, 12 Dec 2017 17:30:12 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34620/mash-fast-genome-and-metagenome-distance-estimation-using-minhash</link>
	<title><![CDATA[Mash: fast genome and metagenome distance estimation using MinHash]]></title>
	<description><![CDATA[<p>Mash is normally distributed as a dependency-free binary for Linux or OSX (see&nbsp;<a href="https://github.com/marbl/Mash/releases">https://github.com/marbl/Mash/releases</a>). This source distribution is intended for other operating systems or for development. Mash requires c++11 to build, which is available in and GCC &gt;= 4.8 and OSX &gt;= 10.7.</p>
<p>See&nbsp;<a href="http://mash.readthedocs.org/">http://mash.readthedocs.org</a>&nbsp;for more information.</p><p>Address of the bookmark: <a href="https://github.com/marbl/Mash/releases" rel="nofollow">https://github.com/marbl/Mash/releases</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>