<?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/10741?offset=860</link>
	<atom:link href="https://bioinformaticsonline.com/related/10741?offset=860" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44375/phyloherb-a-high%E2%80%90throughput-phylogenomic-pipeline-for-processing-genome-skimming-data</guid>
	<pubDate>Wed, 06 Sep 2023 00:14:28 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44375/phyloherb-a-high%E2%80%90throughput-phylogenomic-pipeline-for-processing-genome-skimming-data</link>
	<title><![CDATA[PhyloHerb: A high‐throughput phylogenomic pipeline for processing genome skimming data]]></title>
	<description><![CDATA[<p dir="auto"><span>Phylo</span>genomic Analysis Pipeline for&nbsp;<span>Herb</span>arium Specimens</p>
<p dir="auto"><span>What is PhyloHerb</span>: PhyloHerb is a wrapper program to process&nbsp;<span>genome skimming</span>&nbsp;data collected from plant materials. The outcomes include the plastid genome (plastome) assemblies, mitochondrial genome assemblies, nuclear ribosomal DNAs (NTS+ETS+18S+ITS1+5.8S+ITS2+28S), alignments of gene and intergenic regions, and a species tree. It is designed to be a high throughput program dealing with lower quality data. Examples include&nbsp;<span>low-coverage (5x cpDNA) plastome phylogeny, recycling plastid genes from target enrichment data, retrieving low-copy nuclear genes from medium coverage (5x nucDNA) genome skimming</span>.</p>
<p dir="auto"><span>License</span>: GNU General Public License</p>
<p dir="auto"><span>Citation</span>:</p>
<ul dir="auto">
<li>Cai, Liming, Hongrui Zhang, and Charles C. Davis. 2022. PhyloHerb: A high‐throughput phylogenomic pipeline for processing genome‐skimming data. Applications in Plant Sciences 10(3): 1&ndash;9.&nbsp;<a href="https://doi.org/10.1002/aps3.11475">https://doi.org/10.1002/aps3.11475</a></li>
</ul><p>Address of the bookmark: <a href="https://github.com/lmcai/PhyloHerb/" rel="nofollow">https://github.com/lmcai/PhyloHerb/</a></p>]]></description>
	<dc:creator>Abhi</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44873/bakrep-denglish-blend-of-bakterien-repository-simplifies-access-to-this-data</guid>
	<pubDate>Wed, 13 Aug 2025 02:31:28 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44873/bakrep-denglish-blend-of-bakterien-repository-simplifies-access-to-this-data</link>
	<title><![CDATA[BakRep (Denglish blend of Bakterien &amp; Repository) simplifies access to this data]]></title>
	<description><![CDATA[<p>2,438,386 bacterial genomes at your fingertips consistently processed &amp; characterized, enriched with metadata, accessible via a flexible search engine.</p>
<p>BakRep (Denglish blend of Bakterien &amp; Repository) simplifies access to this data. It integrates enriched genomic information with metadata accessible via a flexible search-engine.</p>
<h1>Key features</h1>
<ul>
<li>Assembly statistics: ensure data quality with genome-based key metrics</li>
<li>Taxonomic classification: robust, purely genome-based classifications (<a href="https://gtdb.ecogenomic.org/" target="_blank">GTDB</a>)</li>
<li><a href="https://pubmlst.org/">MLST</a>: subtyping for deeper insights into genetic variation</li>
<li>Annotation: comprehensive &amp; taxonomy-independent (<a href="https://bakta.computational.bio/" target="_blank">Bakta</a>)</li>
<li>Metadata: full original submission records</li>
</ul>
<div>&nbsp;</div><p>Address of the bookmark: <a href="https://bakrep.computational.bio/" rel="nofollow">https://bakrep.computational.bio/</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/37586/julia-programming-language-a-python-and-r-rival</guid>
	<pubDate>Sat, 25 Aug 2018 04:46:39 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/37586/julia-programming-language-a-python-and-r-rival</link>
	<title><![CDATA[Julia Programming Language, a Python and R rival]]></title>
	<description><![CDATA[<p>Big data has grown to become one of the most lucrative fields. In fact, data scientists are some of the most sought people. They are usually hired to analyze, control and parse large chunks of data. Implementing these actions using traditional techniques is not a walk in the park. This is why most data scientists prefer using programming languages such as R and Python. However, there is one more programming language that can do the job. That is Julia programming language.</p><p>What Is Julia Language?</p><p>Julia is a programming language that came into the limelight in 2012. It is a general-purpose programming language that was designed for solving scientific computations. Julia was meant to be an alternative to Python, R and other programming languages that were mainly used for manipulating data. This is because it has numerous features that can minimize the complexities of numerical computations.&nbsp;</p><p>Julia optimizes on the best features of Python and R while at the same time overlooks their weaknesses. This explains why it is viewed as an alternative to these programming languages. For instance, it utilizes the readability and simplicity of Python then performs faster.</p><p>Julia is the most preferred programming language for data scientists and mathematicians. This is because its core features are similar to the ones that are used on most data software. Also, the language is ideal for these two subjects because its syntax is similar to the standard mathematical formulas.</p><p>Key Features Of Julia Language<br />Uses JIT Compilation<br />Parallelism<br />Dynamic Typing<br />Simple Syntax<br />Allows Metaprogramming<br />Accessible to Libraries<br />-1-Array Indexing</p><p>Julia Vs Python And R Programming Languages<br />1. Speed<br />Julia is faster than both Python and R. This is a very critical aspect that is given special attention in the big data programming. The high speed of Julia is because of JIT compilers. You will need to install external libraries on Python to achieve similar speed.</p><p>2. Syntax<br />Julia has a math-friendly syntax. The syntax of this programming language is similar to the mathematical formulas hence can be used to perform mathematical and scientific computations. This syntax makes it easier to learn than Python.</p><p>3. Parallelism<br />Although both Python and R use parallelism, Julia uses a top-level parallelism. Julia allows the processor to perform to the optimum level than what Python and R can achieve.</p><p>4. Versatility<br />Julia programming language is more versatile than Python and R. It allows a programmer to move from different codes and functions with ease.</p><p>The only area that Python and R are superior to Julia is in terms of community. Given that Julia is a new programming language, it has a small community as compared to others which have been around for years.</p><p>In overall Julia programming language is a better alternative that you can use to handle Big data projects. Despite having a small community, it is one of those programming languages that you can easily learn.</p>]]></description>
	<dc:creator>Radha Agarkar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38634/eyechrom-visualizing-chromosome-count-data-from-plants</guid>
	<pubDate>Tue, 08 Jan 2019 10:20:54 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38634/eyechrom-visualizing-chromosome-count-data-from-plants</link>
	<title><![CDATA[EyeChrom: Visualizing Chromosome Count Data From Plants]]></title>
	<description><![CDATA[<p><span>It's goal is to show chromosmal data per genus. Select the genus, and the plot will show the records found for it in the Chromosome Counts Database. note: Report an issue via Gihub: github.com/roszenil/CCDBcurator and github.com/RodrigoRivero/EyeChrom</span></p>
<p>https://bsapubs.onlinelibrary.wiley.com/doi/pdf/10.1002/aps3.1207</p><p>Address of the bookmark: <a href="http://eyechrom.com:3838/EyeChrom/" rel="nofollow">http://eyechrom.com:3838/EyeChrom/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41328/deephic-a-generative-adversarial-network-for-enhancing-hi-c-data-resolution</guid>
	<pubDate>Tue, 03 Mar 2020 01:12:47 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41328/deephic-a-generative-adversarial-network-for-enhancing-hi-c-data-resolution</link>
	<title><![CDATA[DeepHiC: A Generative Adversarial Network for Enhancing Hi-C Data Resolution]]></title>
	<description><![CDATA[<p><strong>DeepHiC</strong> is a GAN-based model for enhancing Hi-C data resolution. We developed this server for helping researchers to enhance their own low-resolution data by a few steps of clicks. <em>Ab initio</em> training could be performed according to our published <a href="https://github.com/omegahh/DeepHiC">code</a>. We provided trained models for various depth of low-coverage sequencing Hi-C data. The depth of input data is estimated by its distribution comparing with those of the downsampled Hi-C data we used in training</p><p>Address of the bookmark: <a href="http://sysomics.com/deephic" rel="nofollow">http://sysomics.com/deephic</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43374/reference-sequence-resource</guid>
	<pubDate>Wed, 15 Sep 2021 21:15:22 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43374/reference-sequence-resource</link>
	<title><![CDATA[Reference Sequence Resource!]]></title>
	<description><![CDATA[<p><span>The ENCODE project uses Reference Genomes from&nbsp;</span><a href="http://www.ncbi.nlm.nih.gov/genome/browse/reference/">NCBI</a><span>&nbsp;or&nbsp;</span><a href="http://hgdownload.cse.ucsc.edu/downloads.html">UCSC</a><span>&nbsp;to provide a consistent framework for mapping high-throughput sequencing data.&nbsp;In general, ENCODE data are mapped consistently to 2 human (GRCH38, hg19) and 2 mouse (mm9/mm10) genomes for historical comparability.&nbsp;</span><em>Drosophia melanogaster</em><span>&nbsp;experiments are mapped to either dm3 or dm6 and&nbsp;</span><em>Caenorhabdilis elegans&nbsp;</em><span>experiments are mapped to ce10 or ce11.&nbsp;T</span></p><p>Address of the bookmark: <a href="https://www.encodeproject.org/data-standards/reference-sequences/" rel="nofollow">https://www.encodeproject.org/data-standards/reference-sequences/</a></p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/17515/ngs-online-training</guid>
  <pubDate>Sat, 27 Sep 2014 07:42:29 -0500</pubDate>
  <link></link>
  <title><![CDATA[NGS Online Training]]></title>
  <description><![CDATA[
<p>ArrayGen Technologies announces to provide online NGS training through out the globe. Now analyze your own NGS datasets from anywhere.For more information contact us at training@arraygen.com</p>

<p>Please visit our site at www.arraygen.com</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/11175/next-generation-sequencingngs-books</guid>
	<pubDate>Fri, 30 May 2014 04:48:04 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/11175/next-generation-sequencingngs-books</link>
	<title><![CDATA[Next generation sequencing(NGS) books]]></title>
	<description><![CDATA[<p>Employing different technologies, the purpose of NGS platform is to decode the identity or modification on the nucleotides. NGS platforms evolve quickly and capture the main stream.</p>
<p>This bookmark is created to provide NGS online books links.</p><p>Address of the bookmark: <a href="http://en.wikibooks.org/wiki/Next_Generation_Sequencing_%28NGS%29/Print_version" rel="nofollow">http://en.wikibooks.org/wiki/Next_Generation_Sequencing_%28NGS%29/Print_version</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/poll/view/23590/will-minion-nanopore-sequencing-increase-the-number-of-next-generation-sequencing-projects</guid>
	<pubDate>Tue, 04 Aug 2015 05:14:07 -0500</pubDate>
	<link>https://bioinformaticsonline.com/poll/view/23590/will-minion-nanopore-sequencing-increase-the-number-of-next-generation-sequencing-projects</link>
	<title><![CDATA[Will MinION Nanopore sequencing increase the number of Next Generation Sequencing projects?]]></title>
	<description><![CDATA[<p>Will MinION Nanopore sequencing increase the number of Next Generation Sequencing projects?</p>]]></description>
	<dc:creator>Strand</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/17966/internship-program-for-bioinformatics-biotechnology-professionals-no-of-vacancy-2</guid>
  <pubDate>Wed, 08 Oct 2014 01:10:08 -0500</pubDate>
  <link></link>
  <title><![CDATA[Internship Program for Bioinformatics / Biotechnology Professionals (No. Of Vacancy: 2)]]></title>
  <description><![CDATA[
<p>ArrayGen is offering an Internship Program for Post graduate Bioinformatics / Biotechnology students and professionals. ArrayGen Technologies provide an excellent opportunity to gain research experience and explore if a scientific career is right for you. Currently we offer positions to outstanding students interested in Next Generation Sequencing (NGS) data analysis. Applications are accepted throughout the year. Accepted students will be listed on web with their schedules. Accepted students can attend our future workshops and trainings freely at the specified venue.</p>
]]></description>
</item>

</channel>
</rss>