<?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/29485?offset=970</link>
	<atom:link href="https://bioinformaticsonline.com/related/29485?offset=970" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	
<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/20271/research-associate-tata-memorial-centre-advanced-centre-for-treatment-research-and-education-in-cancer-kharghar-navi-mumbai</guid>
  <pubDate>Thu, 08 Jan 2015 20:53:57 -0600</pubDate>
  <link></link>
  <title><![CDATA[Research Associate	@ TATA MEMORIAL CENTRE ADVANCED CENTRE FOR TREATMENT, RESEARCH AND EDUCATION IN CANCER KHARGHAR, NAVI MUMBAI]]></title>
  <description><![CDATA[
<p>TATA MEMORIAL CENTRE ADVANCED CENTRE FOR TREATMENT, RESEARCH AND EDUCATION IN CANCER KHARGHAR, NAVI MUMBAI – 410210</p>

<p>Website: www.actrec.gov.in; Ph: 27405000</p>

<p>No. ACTREC/Advt./ 66 /2014 23rd December, 2014<br />Research Associate	</p>

<p>International Cancer Genome Consortium (ICGC) - India Project (IRB Project No. 3 A/c. No. 2408)</p>

<p>Dr. Rajiv Sarin</p>

<p>Duration of the Project: One year Extendable up to Three years.</p>

<p>Consolidated Salary: Rs. 42,000/- p.m.</p>

<p>Application last date: 8th January, 2015.</p>

<p>Interview Date &amp; Time: 21st January, 2015, at 11.00 a.m.</p>

<p>Venue: Conference Room, 3rd floor, Khanolkar Shodhika, ACTREC.</p>

<p>Essential Qualifications and Experience:</p>

<p>Ph.D (any branch of Life Sciences)</p>

<p>The candidate must have at least one year experience after Ph.D., preferably in Genomics and Molecular Biology.</p>

<p>Candidates fulfilling these requirements should pre register themselves by sending their application in the prescribed format with recent CV and contact details of 2 referees by e-mail to icgc@actrec.gov.in latest 8th January, 2015 by 10.00 a.m.</p>

<p>Candidates shortlisted for the interview will be intimated by email on or before 9th January, 2015.</p>

<p>The interviews would be held on 21st January 2015 and will be only for the pre registered candidates who have been shortlisted.<br />No T.A./D.A. will be admissible for attending the interview.</p>

<p>At the time of Interview the candidate should bring original certificates along with CV with contact details of 2 referees and submit the photocopies (attested) of the certificates, with a recent passport size photograph.</p>

<p>Advertisement: www.actrec.gov.in/data%20files/2014/Walk-in-Research-Fellow-26-12-14.doc</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/39726/jackalope-a-swift-versatile-phylogenomic-and-high-throughput-sequencing-simulator</guid>
	<pubDate>Fri, 26 Jul 2019 00:58:12 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/39726/jackalope-a-swift-versatile-phylogenomic-and-high-throughput-sequencing-simulator</link>
	<title><![CDATA[jackalope: A swift, versatile phylogenomic and high-throughput sequencing simulator]]></title>
	<description><![CDATA[<p><code>jackalope</code> simply and efficiently simulates (i) variants from reference genomes and (ii) reads from both Illumina and Pacific Biosciences (PacBio) platforms. It can either read reference genomes from FASTA files or simulate new ones. Genomic variants can be simulated using summary statistics, phylogenies, Variant Call Format (VCF) files, and coalescent simulations&mdash;the latter of which can include selection, recombination, and demographic fluctuations. <code>jackalope</code> can simulate single, paired-end, or mate-pair Illumina reads, as well as reads from Pacific Biosciences These simulations include sequencing errors, mapping qualities, multiplexing, and optical/PCR duplicates. All outputs can be written to standard file formats.</p>
<p><span>A swift, versatile phylogenomic and high-throughput sequencing simulator </span> <span><a href="https://jackalope.lucasnell.com">https://jackalope.lucasnell.com</a></span></p><p>Address of the bookmark: <a href="https://github.com/lucasnell/jackalope" rel="nofollow">https://github.com/lucasnell/jackalope</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/videolist/watch/20454/comparative-genomics-in-ensembl</guid>
	<pubDate>Wed, 21 Jan 2015 08:31:11 -0600</pubDate>
	<link>https://bioinformaticsonline.com/videolist/watch/20454/comparative-genomics-in-ensembl</link>
	<title><![CDATA[Comparative Genomics in Ensembl]]></title>
	<description><![CDATA[<iframe width="" height="" src="https://www.youtube-nocookie.com/embed/dDRdCnZOMCM" frameborder="0" allowfullscreen></iframe>The Ensembl browser provides viewable whole-genome alignments, homologues and phylogenetic gene trees, protein families, and ancestral sequences.  Learn how to view and export these data in this video.]]></description>
	
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41009/genomics-public-data-links</guid>
	<pubDate>Thu, 13 Feb 2020 00:20:00 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41009/genomics-public-data-links</link>
	<title><![CDATA[genomics public data links !]]></title>
	<description><![CDATA[<p>List of publically available databases on google server.</p>
<p>More at <a href="https://software.broadinstitute.org/gatk/download/bundle">https://software.broadinstitute.org/gatk/download/bundle</a></p>
<p><a href="ftp://ftp.ncbi.nlm.nih.gov/snp/organisms/human_9606/VCF/GATK/">ftp://ftp.ncbi.nlm.nih.gov/snp/organisms/human_9606/VCF/GATK/</a>.</p>
<p><a href="ftp://ftp.broadinstitute.org/bundle/hg38/hg38bundle/">ftp://ftp.broadinstitute.org/bundle/hg38/hg38bundle/</a></p><p>Address of the bookmark: <a href="https://console.cloud.google.com/storage/browser/genomics-public-data/resources/broad/hg38/v0?pli=1" rel="nofollow">https://console.cloud.google.com/storage/browser/genomics-public-data/resources/broad/hg38/v0?pli=1</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/20471/bioinformatics-scripts</guid>
	<pubDate>Thu, 22 Jan 2015 22:29:39 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/20471/bioinformatics-scripts</link>
	<title><![CDATA[Bioinformatics Scripts]]></title>
	<description><![CDATA[<p>Some of the useful bioinformatics scripts.</p>
<p>For example ... contig-stats.pl is a Perl script that will automatically describe features of a sequence assembly.</p>
<p>http://milkweedgenome.org/?q=scripts</p><p>Address of the bookmark: <a href="http://milkweedgenome.org/?q=scripts" rel="nofollow">http://milkweedgenome.org/?q=scripts</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/35899/reference-free-prediction-of-rearrangement-breakpoint-reads</guid>
	<pubDate>Thu, 08 Mar 2018 05:05:25 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/35899/reference-free-prediction-of-rearrangement-breakpoint-reads</link>
	<title><![CDATA[Reference-free prediction of rearrangement breakpoint reads]]></title>
	<description><![CDATA[<p><span>lideSort-BPR (&nbsp;</span><span>b</span><span>&nbsp;reak&nbsp;</span><span>p</span><span>&nbsp;oint&nbsp;</span><span>r</span><span>&nbsp;eads) is based on a fast algorithm for all-against-all comparisons of short reads and theoretical analyses of the number of neighboring reads. When applied to a dataset with a sequencing depth of 100&times;, it finds &sim;88% of the breakpoints correctly with no false-positive reads. Moreover, evaluation on a real prostate cancer dataset shows that the proposed method predicts more fusion transcripts correctly than previous approaches, and yet produces fewer false-positive reads. To our knowledge, this is the first method to detect breakpoint reads without using a reference genome.</span></p>
<p><span>https://github.com/ewijaya/slidesort-bpr</span></p><p>Address of the bookmark: <a href="https://code.google.com/archive/p/slidesort-bpr/" rel="nofollow">https://code.google.com/archive/p/slidesort-bpr/</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/20504/chromevol</guid>
	<pubDate>Sun, 25 Jan 2015 00:33:11 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/20504/chromevol</link>
	<title><![CDATA[ChromEvol]]></title>
	<description><![CDATA[<p>Chromosome number is a remarkably dynamic feature of eukaryotic evolution. Chromosome numbers can change by a duplication of the whole genome (a process termed polyploidy), or by single chromosome changes (ascending dysploidy via, e.g., chromosome fission or descending dysploidy via, e.g., chromosome fusion).<br> Of the various mechanisms of chromosome number change, polyploidy has received significant attention because of the impact such an event may have on the organism.<br> ChromEvol implements a series of likelihood models for the evolution of chromosome numbers. By comparing the fit of the different models to biological data, it may be possible to gain insight regarding the pathways by which the evolution of chromosome number proceeds. For each model, the program estimates the rates for the possible transitions assumed by the model, infers the set of ancestral chromosome numbers, and estimates the location along the tree for which polyploidy events (and other chromosome number changes) occurred. For further methodological details, see the publications and manual on the Downloads page.</p>
<p>http://www.tau.ac.il/~itaymay/cp/chromEvol/about.html</p><p>Address of the bookmark: <a href="http://www.tau.ac.il/~itaymay/cp/chromEvol/downloads.html" rel="nofollow">http://www.tau.ac.il/~itaymay/cp/chromEvol/downloads.html</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/33820/circular-visualization-in-r</guid>
	<pubDate>Wed, 05 Jul 2017 04:11:30 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/33820/circular-visualization-in-r</link>
	<title><![CDATA[Circular Visualization in R]]></title>
	<description><![CDATA[<p>This is the documentation of the&nbsp;<a href="https://cran.r-project.org/package=circlize"><span>circlize</span></a>&nbsp;package. Examples in the book are generated under version 0.4.1.</p>
<p>If you use&nbsp;<span>circlize</span>&nbsp;in your publications, I would be appreciated if you can cite:</p>
<p>Gu, Z. (2014) circlize implements and enhances circular visualization in R. Bioinformatics. DOI:&nbsp;<a href="https://doi.org/10.1093/bioinformatics/btu393">10.1093/bioinformatics/btu393</a></p><p>Address of the bookmark: <a href="http://zuguang.de/circlize_book/book/" rel="nofollow">http://zuguang.de/circlize_book/book/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/20672/jrfra-structuralcomputational-biology-at-icgeb</guid>
  <pubDate>Thu, 29 Jan 2015 11:52:40 -0600</pubDate>
  <link></link>
  <title><![CDATA[JRF/RA Structural/Computational Biology at ICGEB]]></title>
  <description><![CDATA[
<p>Research Associate and JRF positions in the Structural and Computational Biology Group starting 1st March 2015. Collaborative projects include work on:</p>

<p>a) bioinformatics, systems and computational biology <br />b) malaria <br />c) drug discovery <br />d) genomics <br />e) microbiology <br />f) metabolic disorders <br />g) molecular medicine</p>

<p>Eligibility: Applicants must have one of the following :</p>

<p>1) INSPIRE award for undertakig either PhD or Postdoctoral research; <br />2) SPM award for PhD; <br />3) JRF for pursuing PhD from CSIR/DBT/ICMR</p>

<p>Interest and experience in Biochemistry/Bioinformatics/Biophysics/ Chemistry/Genomics/Molecular Biology/ is essential.</p>

<p>Submit curriculum vitae to sb.icgeb@gmail.com by 20 February 2015</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36368/d3-javascript-for-visualization</guid>
	<pubDate>Mon, 23 Apr 2018 08:42:22 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36368/d3-javascript-for-visualization</link>
	<title><![CDATA[D3 javascript for visualization !]]></title>
	<description><![CDATA[<p><span>Welcome to the&nbsp;</span><span>D3 gallery</span><span>! More examples are available on&nbsp;</span><a href="http://bl.ocks.org/mbostock">bl.ocks.org/mbostock</a><span>. If you want to share an example and don't have your own hosting, consider using&nbsp;</span><a href="http://gist.github.com/">Gist</a><span>&nbsp;and&nbsp;</span><a href="http://bl.ocks.org/">bl.ocks.org</a><span>. If you want to share or view live examples try&nbsp;</span><a href="https://vida.io/explore">vida.io</a><span>.</span></p><p>Address of the bookmark: <a href="https://github.com/d3/d3/wiki/Gallery" rel="nofollow">https://github.com/d3/d3/wiki/Gallery</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>