<?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/30234?offset=810</link>
	<atom:link href="https://bioinformaticsonline.com/related/30234?offset=810" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/44219/chromosome-breakpoint-a-breakup-to-remember</guid>
	<pubDate>Tue, 07 Mar 2023 13:31:54 -0600</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/44219/chromosome-breakpoint-a-breakup-to-remember</link>
	<title><![CDATA[Chromosome breakpoint - a breakup to remember]]></title>
	<description><![CDATA[<div><div><div><div><div><div><div><div><div><div><p>Chromosome breakpoint refers to the physical location where a chromosome is broken and rearranged. Chromosome breakage can occur spontaneously or be induced by environmental factors such as radiation, chemicals, or viruses. The rearrangement of genetic material resulting from a chromosome breakpoint can have important consequences, including the development of genetic diseases, chromosomal abnormalities, or cancer.</p><p>Chromosome breakpoints can occur in two ways: interstitial or terminal. Interstitial breakpoints occur within the chromosome, while terminal breakpoints occur at the end of the chromosome. Terminal breakpoints can lead to the loss of genetic material, whereas interstitial breakpoints can result in the duplication or deletion of genetic material.</p><p>Chromosome breakpoints can be detected using a variety of techniques, including cytogenetic analysis, fluorescence in situ hybridization (FISH), and molecular methods such as polymerase chain reaction (PCR) and next-generation sequencing (NGS). These techniques can also help identify the exact location of the breakpoint and the nature of the rearrangement, such as translocations, inversions, deletions, or duplications.</p><p>Translocations are one of the most common types of chromosome rearrangements caused by breakpoints. In a translocation, genetic material is exchanged between two different chromosomes, resulting in a balanced or unbalanced distribution of genetic material. Unbalanced translocations can cause genetic diseases or developmental abnormalities, while balanced translocations can be inherited without any apparent phenotypic effects.</p><p>Inversions occur when a chromosome segment is inverted, resulting in a change in the order of genetic material. Inversions can be pericentric, involving the centromere, or paracentric, not involving the centromere. Inversions can cause genetic diseases or phenotypic effects if they disrupt the function of essential genes or regulatory elements.</p><p>Deletions and duplications are caused by interstitial breakpoints that result in the loss or gain of genetic material. Deletions can cause genetic diseases or developmental abnormalities if they involve essential genes or regulatory elements. Duplications can also have phenotypic effects, depending on the location and size of the duplicated segment.</p><p>Chromosome breakpoints can also be involved in the formation of complex chromosomal rearrangements, such as ring chromosomes or dicentric chromosomes. These complex rearrangements can have important clinical implications, as they can cause genetic diseases or cancer.</p><p>In conclusion, chromosome breakpoints are important genetic events that can lead to the rearrangement of genetic material and have important clinical implications. The detection and characterization of chromosome breakpoints using cytogenetic, molecular, and genomic methods are essential for the diagnosis, prognosis, and treatment of genetic diseases and cancer. Further research is needed to understand the molecular mechanisms underlying chromosome breakage and to develop new therapies targeting these events.</p></div></div></div></div></div></div></div></div></div></div>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/12593/visiting-scientist-computational-genomics-two-positions</guid>
  <pubDate>Mon, 07 Jul 2014 22:53:41 -0500</pubDate>
  <link></link>
  <title><![CDATA[Visiting Scientist - Computational Genomics (two positions)]]></title>
  <description><![CDATA[
<p>Scientific/Managerial &amp; International Recruitment</p>

<p>ICRISAT seeks applications from Indian nationals Visiting Scientist-Computational Genomics (2 positions), to be part of a team of Centre of Excellence in Genomics (CEG), (www.icrisat.org/ceg) to work on legume genomics projects.  The positions will be based at ICRISAT’s Headquarters in Patancheru, Hyderabad, India.</p>

<p>ICRISAT is a non-profit, non-political organization that conducts agricultural research for development in Asia and sub-Saharan Africa with a wide array of partners throughout the world. Covering 6.5 million square kilometers of land in 55 countries, the semi-arid tropics is home to over 2 billion people, with 650 million of these are the poorest of the poor. ICRISAT and its partners help empower those living in the semi-arid tropics, especially smallholder farmers, to overcome poverty, hunger, malnutrition and a degraded environment through more efficient and profitable agriculture. ICRISAT is headquartered in Greater Hyderabad, Andhra Pradesh, India and belongs to the Consortium of Centers supported by the Consultative Group on International Agricultural Research (CGIAR).</p>

<p>The Job: Responsibilities for these positions include:</p>

<p>    Analyzing and handling large-scale next generation sequencing DNA and RNA data<br />    Data mining and development of pipelines and troubleshooting<br />    Genome diversity analysis such as SNPs, Indels, Structural Variations, population structure<br />    Genome wide association study (GWAS) related analysis- LD analysis, hapmap and trait mapping<br />    Expression analysis based on RNA-Seq data, annotation, gene ontology and metabolic pathway analysis<br />    Epigenome analysis, small RNA identification<br />    Gene family analysis, sequence level protein analysis, orthology/paralogy and molecular modelling<br />    Compiling and analysis of results, writing reports and research papers</p>

<p>The Person:  Ph.D. or MSc/MTech/PGDCA with two years research experience in Biotechnology, Computational biology, Agricultural/ Plant Biotechnology, Genetics, Molecular Biology or related discipline. Good knowledge of programming/scripting in at least two of following languages: Perl, C, C++, R, Shell Scripting and Python is plus.</p>

<p>How to apply: Please apply latest by 20 July 2014.  The application should include the name of the position applied for, a letter of motivation, a full Curriculum Vita (CV), and the names and contact information of three references that are knowledgeable of the candidate’s professional qualifications and work experience. Technical details and more information about these positions can be obtained from R.K.VARSHNEY@CGIAR.ORG. All applications will be acknowledged, however only short listed candidates will be contacted.</p>

<p>Apply here https://recruit.zoho.com/ats/Portal.na?digest=T642sgLYWZOStExJ77cPrcM*sIMGZETWw4yPxngbmHA-</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42421/geo2r-compare-two-or-more-groups-of-samples</guid>
	<pubDate>Sun, 20 Dec 2020 11:49:41 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42421/geo2r-compare-two-or-more-groups-of-samples</link>
	<title><![CDATA[GEO2R: compare two or more groups of Samples]]></title>
	<description><![CDATA[<p><span>GEO2R to compare two or more groups of Samples in order to identify genes that are differentially expressed across experimental conditions.</span></p><p>Address of the bookmark: <a href="https://www.ncbi.nlm.nih.gov/geo/geo2r/" rel="nofollow">https://www.ncbi.nlm.nih.gov/geo/geo2r/</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/11030/r-programming-and-jobs-website</guid>
	<pubDate>Sun, 25 May 2014 14:43:57 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/11030/r-programming-and-jobs-website</link>
	<title><![CDATA[R programming and Jobs website]]></title>
	<description><![CDATA[<p>Welcome to the R Jobs section of ProgrammingR.com. If your organization has an R employment opportunity that you would like to have posted here, submit it via the <a href="http://www.programmingr.com/contact" title="contact page">contact page</a>. Prospective employees: use the contact information provided in the position listing to apply or contact the hiring organization.</p><p>Address of the bookmark: <a href="http://www.programmingr.com/category/stype/r-job-listings/" rel="nofollow">http://www.programmingr.com/category/stype/r-job-listings/</a></p>]]></description>
	<dc:creator>Pragati Singh</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/videolist/watch/11311/stephen-friend-the-hunt-for-unexpected-genetic-heroes</guid>
	<pubDate>Sat, 31 May 2014 14:31:47 -0500</pubDate>
	<link>https://bioinformaticsonline.com/videolist/watch/11311/stephen-friend-the-hunt-for-unexpected-genetic-heroes</link>
	<title><![CDATA[Stephen Friend: The hunt for "unexpected genetic heroes"]]></title>
	<description><![CDATA[<iframe width="" height="" src="https://www.youtube-nocookie.com/embed/Yagdvqn2YMU" frameborder="0" allowfullscreen></iframe>What can we learn from people with the genetics to get sick — who don't? With most inherited diseases, only some family members will develop the disease, while others who carry the same genetic risks dodge it. Stephen Friend suggests we start studying those family members who stay healthy. Hear about the Resilience Project, a massive effort to collect genetic materials that may help decode inherited disorders.

TEDTalks is a daily video podcast of the best talks and performances from the TED Conference, where the world's leading thinkers and doers give the talk of their lives in 18 minutes (or less). Look for talks on Technology, Entertainment and Design -- plus science, business, global issues, the arts and much more.
Find closed captions and translated subtitles in many languages at http://www.ted.com/translate

Follow TED news on Twitter: http://www.twitter.com/tednews
Like TED on Facebook: https://www.facebook.com/TED

Subscribe to our channel: http://www.youtube.com/user/TEDtalksDirector]]></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/opportunity/view/12896/inspire-faculty-scheme-a-component-of-%E2%80%9Cassured-opportunity-for-research-career-aorc%E2%80%9D-under-inspire</guid>
  <pubDate>Sat, 19 Jul 2014 14:59:30 -0500</pubDate>
  <link></link>
  <title><![CDATA[INSPIRE Faculty Scheme: a component of “Assured Opportunity for Research Career (AORC)” under INSPIRE.]]></title>
  <description><![CDATA[
<p>Ministry of Science and Technology, Department of Science and Technology</p>

<p>7th ADVERTISEMENT – 2014 (2)</p>

<p>INSPIRE Faculty Scheme: a component of “Assured Opportunity for Research Career (AORC)” under INSPIRE.</p>

<p>The Department of Science and Technology, Government of India, has launched the “Innovation in Science Pursuit for Inspired Research (INSPIRE)” [http://www.inspire-dst.gov.in] program in 2008.</p>

<p>The program aims to attract talent for study of science and careers with research. INSPIRE includes many components. The importance of Assured Career Opportunity in R&amp;D sector has been recognized.</p>

<p>INSPIRE Faculty Scheme opens up an “Assured Opportunity for Research Career (AORC)” for young researchers in the age group of 27-32 years. It offers a contractual research awards to young achievers and opportunity for independent research in the near term and emerge as a future leader in the long term.</p>

<p>Eligibility</p>

<p>Essential Indian citizens and people of Indian origin including NRI/PIO status with PhD (in science, mathematics, engineering, pharmacy, medicine, and agriculture related subjects) from any recognized university in the world,</p>

<p>Those who have submitted their PhD Theses and are awaiting award of the degree are also<br />eligible. However, the award will be conveyed only after confirmation of the awarding the<br />PhD degree.</p>

<p>The upper age limit as on 1st July 2014 should be 32 years for considering support for a<br />period of 5 years. However, for SC and ST candidates, upper age limit will be 35 years.</p>

<p>Publication(s) in highly reputed Journals demonstrating research potential of the candidate.</p>

<p>Desirable</p>

<p>Candidates who are within top 1% at the School Leaving Examination, IIT-JEE rank, 1st Rank Holder either in graduation or post-graduation level university examination (which are used presently for identifying INSPIRE Scholars at under-graduate level and INSPIRE Fellows for doctoral degree)</p>

<p>More at http://www.inspire-dst.gov.in/faculty_scheme.html</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/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>