<?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/41464?offset=360</link>
	<atom:link href="https://bioinformaticsonline.com/related/41464?offset=360" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/2518/genome-browsers</guid>
	<pubDate>Fri, 16 Aug 2013 19:04:47 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/2518/genome-browsers</link>
	<title><![CDATA[Genome Browsers]]></title>
	<description><![CDATA[<p>Genome Browser is the platform/database used for searching and retreiving sequences and annotation of genomes belong to various eukaryotes, prokaryotes, etc.</p><p>Following are the weblink for different available browsers:</p><p><a href="http://www.ensembl.org/index.html">http://www.ensembl.org/index.html</a></p><p><a href="http://ensemblgenomes.org/">http://ensemblgenomes.org/</a></p><p><a href="http://genome.ucsc.edu/">http://genome.ucsc.edu/</a></p><p><a href="http://www.ncbi.nlm.nih.gov/genome">http://www.ncbi.nlm.nih.gov/genome</a></p><p><a href="http://www.ebi.ac.uk/genomes/">http://www.ebi.ac.uk/genomes/</a></p><p><a href="http://flybase.org/">http://flybase.org/</a></p><p><a href="http://cmr.jcvi.org/tigr-scripts/CMR/CmrHomePage.cgi">http://cmr.jcvi.org/tigr-scripts/CMR/CmrHomePage.cgi</a></p><p><a href="http://www.sanger.ac.uk/resources/databases/">http://www.sanger.ac.uk/resources/databases/</a></p>]]></description>
	<dc:creator>Rahul Agarwal</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/9400/largest-genome-sequenced</guid>
	<pubDate>Fri, 21 Mar 2014 13:57:19 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/9400/largest-genome-sequenced</link>
	<title><![CDATA[Largest Genome Sequenced]]></title>
	<description><![CDATA[<p>The enormous size of the <strong>loblolly pine genome</strong> having <strong>22 billion base pairs</strong> compared to only 3 billion in the human genome. In other words, it is&nbsp;<strong>seven times</strong> larger than a human&rsquo;s and also the largest and the most complete&nbsp;<strong>conifer<a href="http://en.wikipedia.org/wiki/Pinophyta" target="_blank"></a></strong>&nbsp;genome ever sequenced.</p>
<p><strong>Related Paper:</strong></p>
<p>http://genomebiology.com/2014/15/3/R59/abstract</p>
<p>&nbsp;</p><p>Address of the bookmark: <a href="http://www.news.ucdavis.edu/search/news_detail.lasso?id=10859" rel="nofollow">http://www.news.ucdavis.edu/search/news_detail.lasso?id=10859</a></p>]]></description>
	<dc:creator>Rahul Agarwal</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44768/tritex-a-computational-pipeline-for-chromosome-scale-assembly-of-plant-genomes</guid>
	<pubDate>Fri, 14 Feb 2025 10:53:48 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44768/tritex-a-computational-pipeline-for-chromosome-scale-assembly-of-plant-genomes</link>
	<title><![CDATA[TRITEX, a computational pipeline for chromosome-scale assembly of plant genomes]]></title>
	<description><![CDATA[<p><span>This is the documentation of TRITEX, a computational pipeline for chromosome-scale assembly of plant genomes. It was developed in the research group Domestication Genomics at the Leibniz Institute of Plant Genetics and Crop Research (IPK) Gatersleben.</span></p><p>Address of the bookmark: <a href="https://tritexassembly.bitbucket.io/" rel="nofollow">https://tritexassembly.bitbucket.io/</a></p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/41578/samhar-covid19-hackathon</guid>
	<pubDate>Fri, 17 Apr 2020 06:47:10 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/41578/samhar-covid19-hackathon</link>
	<title><![CDATA[SAMHAR-COVID19 Hackathon]]></title>
	<description><![CDATA[<p>Centre for Development of Advanced Computing (C-DAC) under the aegis of the National Supercomputing Mission (NSM), a Ministry of Electronics &amp; Information Technology (MeitY) and Department of Science &amp; Technology (DST) initiative, in association with NVIDIA &amp; OpenACC, announces the&nbsp;SAMHAR-COVID19 Hackathon.</p><p>Pandemic outbreak such as Coronavirus outbreak can create huge challenges for the Government and Public Health Officials to gather information quickly and coordinate a response. In such a situation, Artificial Intelligence (AI) can play a huge role in predicting, minimizing and stalling its spread of the virus.</p><p>C-DAC has embarked on a program&nbsp;SAMHAR-COVID19&nbsp;(Supercomputing using&nbsp;AI,&nbsp;ML,&nbsp;Healthcare&nbsp;Analytics based&nbsp;Research for combating COVID19). This opportunity will provide researchers to find solutions for Identifying, Tracking and Forecasting outbreaks of COVID19 and Facilitating Drug Discovery as well.</p><div><div><div><ul>
<li><span>Participants can update submissions multiple times till the Registration End date.</span></li>
<li><span>Each entry can be submitted by a Team comprising of minimum 3 and maximum 5 members (Including the Team Lead).</span></li>
<li><span>Participants will have to share the complete work activities with C-DAC. And C-DAC will have right to use the submitted application/solution for SAMHAR-COVID19 programs.</span></li>
<li><span>The Award will be given to the&nbsp;<span>Selected/Winning Entry</span>&nbsp;irrespective of the number of members in the Team (members may choose to distribute the amount among themselves).</span></li>
<li><span>The decision of the&nbsp;<span>Eminent Jury</span>&nbsp;on the&nbsp;<span>I<span>3</span>&nbsp;Award</span>&nbsp;will be final and binding.</span></li>
<li><span>Award can be for the Team/Company/Institution, as submitted in the Application and cannot be changed later.</span></li>
<li><span>Submissions will be considered void if they are in whole or part ill-eligible, incomplete, damaged, altered, counterfeit, obtained through fraud or late submission.</span></li>
<li></li>
</ul></div></div></div><p>More at&nbsp;<a href="https://samhar-covid19hackathon.cdac.in/">https://samhar-covid19hackathon.cdac.in/</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/35418/karyoploter-plot-whole-genomes-with-arbitrary-data</guid>
	<pubDate>Fri, 02 Feb 2018 03:24:28 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/35418/karyoploter-plot-whole-genomes-with-arbitrary-data</link>
	<title><![CDATA[karyoploteR: plot whole genomes with arbitrary data]]></title>
	<description><![CDATA[<p><span><a href="http://bioconductor.org/packages/karyoploteR">karyoploteR</a></span><span>&nbsp;is an R package to create karyoplots, that is, representations of whole genomes with arbitrary data plotted on them. It is inspired by the R base graphics system and does not depend on other graphics packages. The aim of karyoploteR is to offer the user an easy way to plot data along the genome to get broad genome-wide view to facilitate the identification of genome wide relations and distributions.</span></p><p>Address of the bookmark: <a href="https://bernatgel.github.io/karyoploter_tutorial/" rel="nofollow">https://bernatgel.github.io/karyoploter_tutorial/</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36271/heap-a-highly-sensitive-and-accurate-snp-detection-tool-for-low-coverage-high-throughput-sequencing-data</guid>
	<pubDate>Thu, 19 Apr 2018 08:06:03 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36271/heap-a-highly-sensitive-and-accurate-snp-detection-tool-for-low-coverage-high-throughput-sequencing-data</link>
	<title><![CDATA[Heap: a highly sensitive and accurate SNP detection tool for low-coverage high-throughput sequencing data]]></title>
	<description><![CDATA[<p><span>Heap, that enables robustly sensitive and accurate calling of SNPs, particularly with a low coverage NGS data, which must be aligned to the reference genome sequences in advance. To reduce false positive SNPs, Heap determines genotypes and calls SNPs at each site except for sites at the both end of reads or containing a minor allele supported by only one read. Performance comparison with existing tools showed that Heap achieved the highest F-scores with low coverage (7X) restriction-site associated DNA sequencing reads of sorghum and rice individuals. This will facilitate cost-effective GWAS and GP studies in this NGS era. Code and documentation of Heap are freely available from&nbsp;</span><a href="https://github.com/meiji-bioinf/heap">https://github.com/meiji-bioinf/heap</a><span>&nbsp;and our web site (</span><a href="http://bioinf.mind.meiji.ac.jp/lab/en/tools.html">http://bioinf.mind.meiji.ac.jp/lab/en/tools.html</a><span>).</span></p><p>Address of the bookmark: <a href="https://github.com/meiji-bioinf/heap" rel="nofollow">https://github.com/meiji-bioinf/heap</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37259/epiviz-an-interactive-visualization-tool-for-functional-genomics-data</guid>
	<pubDate>Mon, 09 Jul 2018 05:27:39 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37259/epiviz-an-interactive-visualization-tool-for-functional-genomics-data</link>
	<title><![CDATA[Epiviz: an interactive visualization tool for functional genomics data.]]></title>
	<description><![CDATA[<p><span>Epiviz is an interactive visualization tool for functional genomics data. It supports genome navigation like other genome browsers, but allows multiple visualizations of data within genomic regions using scatterplots, heatmaps and other user-supplied visualizations. It also includes data from the&nbsp;</span><a href="http://barcode.luhs.org/" target="_blank">Gene Expression Barcode project</a><span>&nbsp;for transcriptome visualization. It has a flexible plugin framework so users can add</span><a href="http://d3js.org/" target="_blank">d3</a><span>&nbsp;visualizations. You can see a video tour&nbsp;</span><a href="http://youtu.be/099c4wUxozA" target="_blank">here</a><span>.</span></p>
<p><span>https://bioconductor.org/packages/release/bioc/html/epivizr.html</span></p>
<p><span>https://github.com/epiviz</span></p>
<p><span>https://github.com/epiviz/epiviz</span></p><p>Address of the bookmark: <a href="https://epiviz.github.io/" rel="nofollow">https://epiviz.github.io/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37835/variantbam-filtering-and-profiling-of-next-generational-sequencing-data-using-region-specific-rules</guid>
	<pubDate>Thu, 04 Oct 2018 16:30:44 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37835/variantbam-filtering-and-profiling-of-next-generational-sequencing-data-using-region-specific-rules</link>
	<title><![CDATA[VariantBam: Filtering and profiling of next-generational sequencing data using region-specific rules]]></title>
	<description><![CDATA[<p>VariantBam is a tool to extract/count specific sets of sequencing reads from next-generational sequencing files. To save money, disk space and I/O, one may not want to store an entire BAM on disk. In many cases, it would be more efficient to store only those read-pairs or reads who intersect some region around the variant locations. Alternatively, if your scientific question is focused on only one aspect of the data (e.g. breakpoints), many reads can be removed without losing the information relevant to the problem.</p>
<h5>&nbsp;</h5><p>Address of the bookmark: <a href="https://github.com/broadinstitute/VariantBam" rel="nofollow">https://github.com/broadinstitute/VariantBam</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38593/excavator-detecting-copy-number-variants-from-whole-exome-sequencing-data</guid>
	<pubDate>Fri, 04 Jan 2019 10:10:48 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38593/excavator-detecting-copy-number-variants-from-whole-exome-sequencing-data</link>
	<title><![CDATA[EXCAVATOR: detecting copy number variants from whole-exome sequencing data]]></title>
	<description><![CDATA[<p><span>EXCAVATOR, for the detection of copy number variants (CNVs) from whole-exome sequencing data. EXCAVATOR combines a three-step normalization procedure with a novel heterogeneous hidden Markov model algorithm and a calling method that classifies genomic regions into five copy number states. We validate EXCAVATOR on three datasets and compare the results with three other methods. These analyses show that EXCAVATOR outperforms the other methods and is therefore a valuable tool for the investigation of CNVs in largescale projects, as well as in clinical research and diagnostics. EXCAVATOR is freely available at&nbsp;</span><span><a href="http://sourceforge.net/projects/excavatortool/" target="_blank"><span>http://sourceforge.net/projects/excavatortool/</span></a></span><span>.</span><br><br><br><span>EXCAVATOR is a novel software package for the detection of copy number variants (CNVs) from whole-exome sequencing data.</span><br><span>EXCAVATOR has been published on Genome Biology (</span><a href="http://genomebiology.com/2013/14/10/R120/abstract" target="_blank">http://genomebiology.com/2013/14/10/R120/abstract<span></span></a><span>).</span></p><p>Address of the bookmark: <a href="https://sourceforge.net/projects/excavatortool/" rel="nofollow">https://sourceforge.net/projects/excavatortool/</a></p>]]></description>
	<dc:creator>Radha Agarkar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38829/nquire-a-statistical-framework-for-ploidy-estimation-using-ngs-short-read-data</guid>
	<pubDate>Thu, 31 Jan 2019 05:12:19 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38829/nquire-a-statistical-framework-for-ploidy-estimation-using-ngs-short-read-data</link>
	<title><![CDATA[nQuire: A statistical framework for ploidy estimation using NGS short-read data]]></title>
	<description><![CDATA[<p>nQuire implements a set of commands to estimate ploidy level of individuals from species, where recent polyploidization occurred and intraspecific ploidy variation is observed. Specifically, nQuire uses next-generation sequencing data to distinguish between diploids, triploids and tetraploids, on the basis of frequency distributions at variant sites where only two bases are segregating.</p>
<p>For more background see also the publication at&nbsp;<a href="https://bmcbioinformatics.biomedcentral.com/articles/10.1186/s12859-018-2128-z">BMC Bioinformatics</a>.</p>
<p>https://github.com/clwgg/nQuire</p><p>Address of the bookmark: <a href="https://github.com/clwgg/nQuire" rel="nofollow">https://github.com/clwgg/nQuire</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>