<?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/27076?offset=1160</link>
	<atom:link href="https://bioinformaticsonline.com/related/27076?offset=1160" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41896/kad-assessing-genome-assemblies-using-k-mer-copies-in-assemblies-and-k-mer-abundance-in-illumina-reads</guid>
	<pubDate>Fri, 19 Jun 2020 07:34:12 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41896/kad-assessing-genome-assemblies-using-k-mer-copies-in-assemblies-and-k-mer-abundance-in-illumina-reads</link>
	<title><![CDATA[KAD: Assessing genome assemblies using K-mer copies in assemblies and K-mer abundance in Illumina reads]]></title>
	<description><![CDATA[<p>KAD is designed for evaluating the accuracy of nucleotide base quality of genome assemblies. Briefly, abundance of k-mers are quantified for both sequencing reads and assembly sequences. Comparison of the two values results in a single value per k-mer, K-mer Abundance Difference (KAD), which indicates how well the assembly matches read data for each k-mer.</p>
<p><a href="https://render.githubusercontent.com/render/math?math=KAD=log_{2}\begin{pmatrix}\frac{c%2Bm}{m(n%2B1)}\end{pmatrix}" target="_blank"><img src="https://render.githubusercontent.com/render/math?math=KAD=log_{2}\begin{pmatrix}\frac{c%2Bm}{m(n%2B1)}\end{pmatrix}" alt="image" style="border: 0px;"></a></p>
<p>where,&nbsp;<em>c</em>&nbsp;is the count of a k-mer from reads,&nbsp;<em>m</em>&nbsp;is the mode of counts of read k-mers, and&nbsp;<em>n</em>&nbsp;is the copy of the k-mer in the assembly.</p><p>Address of the bookmark: <a href="https://github.com/liu3zhenlab/KAD" rel="nofollow">https://github.com/liu3zhenlab/KAD</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/14054/project-fellow-at-institute-of-himalayan-bioresource-technology</guid>
  <pubDate>Fri, 15 Aug 2014 06:50:08 -0500</pubDate>
  <link></link>
  <title><![CDATA[Project Fellow at Institute of Himalayan Bioresource Technology]]></title>
  <description><![CDATA[
<p>Research Associate/ Project FellowDate of posting:14 Aug</p>

<p>Eligibility : MSc, M Phil / Phd, BE/B.Tech<br />Location : Himachal Pradesh-other<br />Job Category : Govt Jobs, Research, Walkin<br />Last Date : 20 Aug 2014</p>

<p>Advertisement No.6/2014</p>

<p>Post : Project Fellow<br />Research Associate/ Project Fellow Jobs opportunity in CSIR-Institute of Himalayan Bioresource Technology<br />M.Sc. in Bioinformatics/Computer Science with 55% marks and (ii) M.Sc. Bioinformatics/ Computational biology/ P.G. Diploma in Bioinformatics/B.Tech. or higher Degree in Bioinformatics with 55% marks</p>

<p>Date of Interview: 29.08.2014.</p>

<p>More at http://www.ihbt.res.in/recruit/AdvtNo6_2014.pdf</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42477/hifiasm-a-haplotype-resolved-assembler-for-accurate-hifi-reads</guid>
	<pubDate>Thu, 24 Dec 2020 10:03:36 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42477/hifiasm-a-haplotype-resolved-assembler-for-accurate-hifi-reads</link>
	<title><![CDATA[Hifiasm: a haplotype-resolved assembler for accurate Hifi reads]]></title>
	<description><![CDATA[<p><span>Hifiasm is a fast haplotype-resolved de novo assembler for PacBio Hifi reads. It can assemble a human genome in several hours and works with the California redwood genome, one of the most complex genomes sequenced so far. Hifiasm can produce primary/alternate assemblies of quality competitive with the best assemblers. It also introduces a new graph binning algorithm and achieves the best haplotype-resolved assembly given trio data.</span></p><p>Address of the bookmark: <a href="https://github.com/chhylp123/hifiasm" rel="nofollow">https://github.com/chhylp123/hifiasm</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/videolist/watch/14338/biology-computers-collide-in-high-demand-field-of-bioinformatics</guid>
	<pubDate>Mon, 25 Aug 2014 00:56:10 -0500</pubDate>
	<link>https://bioinformaticsonline.com/videolist/watch/14338/biology-computers-collide-in-high-demand-field-of-bioinformatics</link>
	<title><![CDATA[Biology, Computers Collide in High-Demand Field of Bioinformatics]]></title>
	<description><![CDATA[<iframe width="" height="" src="https://www.youtube-nocookie.com/embed/fk0z7KOTyMo" frameborder="0" allowfullscreen></iframe>Dr. Shivas Amin calls bioinformatics a "collision of biology and computers." Students learn how to use computers and skills in math and biology to analyze genome and proteome projects to prepare for high-demand jobs in the life sciences. Learn more about Amin and hear from student Medina Baitemirova and alumnus Lukas Simon about the fast-growing field of bioinformatics.]]></description>
	
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/43260/bioinformatics-tools-for-telomere-to-telomere-assembly</guid>
	<pubDate>Tue, 17 Aug 2021 13:17:09 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/43260/bioinformatics-tools-for-telomere-to-telomere-assembly</link>
	<title><![CDATA[Bioinformatics tools for telomere to telomere assembly !]]></title>
	<description><![CDATA[<p>●&nbsp;<a href="https://github.com/arangrhie/merfin" target="_blank">Merfin</a>&nbsp;&ndash; k-mer-based assembly and variant calling evaluation for improved consensus accuracy (Arang Rhie)<br />●&nbsp;<a href="https://www.biorxiv.org/content/10.1101/2020.11.11.378133v1" target="_blank">PanGenie</a>&nbsp;&ndash; algorithm that leverages a pangenome reference built from haplotype-resolved genome assemblies in conjunction with k-mer count information from raw, short-read sequencing data to genotype a wide spectrum of genetic variation (Tobias Marschall)<br />●&nbsp;<a href="https://github.com/ConesaLab/SQANTI3" target="_blank">SQANTI3</a>&nbsp;&ndash; an automated pipeline for the classification of long-read transcripts that can assess the quality of data and the preprocessing pipeline (Roc&iacute;o Amor&iacute;n de Heged&uuml;s&nbsp;<a href="https://twitter.com/rocioadh" target="_blank">@rocioadh</a>)<br />●&nbsp;<a href="https://github.com/GenomeRIK/tama" target="_blank">tama</a>&nbsp;(Transcriptome Annotation by Modular Algorithms) &ndash; software designed for processing Iso-Seq data and other long-read transcriptome data (Richard Kuo&nbsp;<a href="https://twitter.com/GenomeRIK" target="_blank">@GenomeRIK</a>)<br />●&nbsp;<a href="https://github.com/PacificBiosciences/pbAA" target="_blank">pbaa</a>&nbsp;(PacBio Amplicon Analysis) &ndash; separates complex mixtures of amplicon targets from genomic samples to cluster and generate high-quality consensus sequences from HiFi reads (Zev Kronenberg&nbsp;<a href="https://twitter.com/zevkronenberg" target="_blank">@zevkronenberg</a>)<br />●&nbsp;<a href="https://github.com/yuanyuan929/bellerophon" target="_blank">bellerophon</a>&nbsp;&ndash; analyzes MHC typing and other low-complexity gene amplicon data; performs allele calling while detecting polymorphic sites within the sequences and removing potential chimeric sequence variants (Yuanyuan Cheng&nbsp;<a href="https://twitter.com/Yuanyuan929" target="_blank">@Yuanyuan929</a>)<br />●&nbsp;<a href="https://github.com/amwenger/svpack" target="_blank">svpack</a>&nbsp;&ndash; tools for filtering, comparing, and annotating structural variant (SV) calls in VCF format (Aaron Wenger)<br />●&nbsp;<a href="https://github.com/AntonBankevich/jumboDB" target="_blank">JumboDB</a>&nbsp;&ndash; tool for de Bruijn graph construction (Anton Bankevich&nbsp;<a href="https://twitter.com/AntonBankevich" target="_blank">@AntonBankevich</a>)<br />●&nbsp;<a href="https://github.com/ksahlin/ultra" target="_blank">uLTRA</a>&nbsp;&ndash; tool for splice alignment of long transcriptomic reads to a genome, guided by a database of exon annotations. (Kristoffer Sahlin&nbsp;<a href="https://twitter.com/krsahlin" target="_blank">@krsahlin</a>)<br />●&nbsp;<a href="https://www.biorxiv.org/content/10.1101/2021.01.25.428044v1.full.pdf" target="_blank">LeafGo</a>&nbsp;&ndash; workflow to rapidly produce high-quality de novo plant genomes (Luca Ermini&nbsp;<a href="https://twitter.com/ermini_luca" target="_blank">@ermini_luca</a>)</p><p>Reference:</p><p>https://www.pacb.com/blog/young-investigators-share-stellar-science-career-advice-and-bioinformatics-tools-at-smrt-leiden-2021/</p><p>&nbsp;</p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/14800/a-comprehensive-atlas-of-human-gene-activity-released</guid>
	<pubDate>Tue, 02 Sep 2014 14:20:24 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/14800/a-comprehensive-atlas-of-human-gene-activity-released</link>
	<title><![CDATA[A comprehensive atlas of human gene activity released !!!]]></title>
	<description><![CDATA[<div><div id="postDescription_4018558404"><p>A large international consortium of researchers has produced the first comprehensive, detailed map of the way&nbsp;<a href="http://www.hsph.harvard.edu/news/topic/genetics/" target="_blank">genes</a>&nbsp;work across the major cells and tissues of the human body. The findings describe the complex networks that govern gene activity, and the new information could play a crucial role in identifying the genes involved with disease.</p><p><img src="http://www.kurzweilai.net/images/Coexpression-clustering.jpg" alt="image" width="640" height="460" style="border: 0px; border: 0px;"></p><p>We are able to pinpoint the regions of the genome that can be active in a disease and in normal activity, whether it&rsquo;s in a brain cell, the skin, in blood stem cells or in hair follicles. This is a major advance that will greatly increase our ability to understand the causes of disease across the body.</p><p>The research is outlined in a series of papers published March 27, 2014, two in the journal&nbsp;<em>Nature</em>&nbsp;and 16 in other scholarly journals. The work is the result of years of concerted effort among 250 experts from more than 20 countries as part of&nbsp;<a href="http://fantom.gsc.riken.jp/" target="_blank">FANTOM 5 (Functional Annotation of the Mammalian Genome)</a>. The FANTOM project, led by the Japanese institution RIKEN, is aimed at building a complete library of human genes.</p><p>Researchers studied human and mouse cells using a new technology called Cap Analysis of Gene Expression (CAGE), developed at RIKEN, to discover how 95% of all human genes are switched on and off. These &ldquo;switches&rdquo; &mdash; called &ldquo;promoters&rdquo; and &ldquo;enhancers&rdquo; &mdash; are the regions of DNA that manage gene activity. The researchers mapped the activity of 180,000 promoters and 44,000 enhancers across a wide range of human cell types and tissues and, in most cases, found they were linked with specific cell types.</p><p>Referene : www.kurzweilai.net/first-comprehensive-atlas-of-human-gene-activity-released</p></div></div>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44595/squeezemeta-a-fully-automated-metagenomics-pipeline-from-reads-to-bins</guid>
	<pubDate>Sat, 06 Jul 2024 04:29:16 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44595/squeezemeta-a-fully-automated-metagenomics-pipeline-from-reads-to-bins</link>
	<title><![CDATA[SqueezeMeta: a fully automated metagenomics pipeline, from reads to bins]]></title>
	<description><![CDATA[<p dir="auto">SqueezeMeta is a full automatic pipeline for metagenomics/metatranscriptomics, covering all steps of the analysis. SqueezeMeta includes multi-metagenome support allowing the co-assembly of related metagenomes and the retrieval of individual genomes via binning procedures. Thus, SqueezeMeta features several unique characteristics:</p>
<ol dir="auto">
<li>Co-assembly procedure with read mapping for estimation of the abundances of genes in each metagenome</li>
<li>Co-assembly of a large number of metagenomes via merging of individual metagenomes</li>
<li>Includes binning and bin checking, for retrieving individual genomes</li>
<li>The results are stored in a database, where they can be easily exported and shared, and can be inspected anywhere using a web interface.</li>
<li>Internal checks for the assembly and binning steps inform about the consistency of contigs and bins, allowing to spot potential chimeras.</li>
<li>Metatranscriptomic support via mapping of cDNA reads against reference metagenomes</li>
</ol><p>Address of the bookmark: <a href="https://github.com/jtamames/SqueezeMeta" rel="nofollow">https://github.com/jtamames/SqueezeMeta</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/poll/view/14927/which-of-the-following-programming-language-is-best-for-a-bioinformatics-beginner</guid>
	<pubDate>Thu, 04 Sep 2014 07:51:16 -0500</pubDate>
	<link>https://bioinformaticsonline.com/poll/view/14927/which-of-the-following-programming-language-is-best-for-a-bioinformatics-beginner</link>
	<title><![CDATA[Which of the following programming language is best for a bioinformatics beginner?]]></title>
	<description><![CDATA[<p>I will be doing NGS in the course of my research work and I will like to learn a programming language which is compatible with most bioinformatics tools or software. I basically want to do de-novo assembly, map reads, align reads, and expression analysis. Recommendations welcomed. Which languages would you recommend to a student wishing to enter the world of bioinformatics?</p>]]></description>
	<dc:creator>Manisha Mishra</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40893/quorum-an-error-corrector-for-illumina-reads</guid>
	<pubDate>Tue, 04 Feb 2020 23:26:55 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40893/quorum-an-error-corrector-for-illumina-reads</link>
	<title><![CDATA[QuorUM: An Error Corrector for Illumina Reads]]></title>
	<description><![CDATA[<p><span>We produce trimmed and error-corrected reads that result in assemblies with longer contigs and fewer errors. We compared QuorUM against several published error correctors and found that it is the best performer in most metrics we use. QuorUM is efficiently implemented making use of current multi-core computing architectures and it is suitable for large data sets (1 billion bases checked and corrected per day per core)</span></p><p>Address of the bookmark: <a href="http://www.genome.umd.edu/" rel="nofollow">http://www.genome.umd.edu/</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/16160/research-scientist-%E2%80%93-bioinformatics-at-sidra-medical-and-research-center</guid>
  <pubDate>Wed, 10 Sep 2014 14:35:35 -0500</pubDate>
  <link></link>
  <title><![CDATA[Research Scientist – Bioinformatics at Sidra Medical and Research Center]]></title>
  <description><![CDATA[
<p>Sidra Medical and Research Center(Doha, Qatar) is looking for talented Research Scientists (Bioinformatics / NGS Data Analysis).</p>

<p>Research Scientists within the Bioinformatics Program are involved in research related to cutting edge genomics and analysis of omics data. The research will utilize concepts, theories and best practices obtained from bioinformatics discipline and applied to biological and other biomedical data for analysis. The role may also involve designing databases, algorithm and/or computation methods for analyzing genomics and other omics data.  The scientist will be working closely with the Translational Medicine Program within a state-of-the art research setting.</p>

<p>Please check the details of the opening and apply here: http://careers.sidra.org/sidra/Vacan...acancyID=60181</p>
]]></description>
</item>

</channel>
</rss>