<?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/36512?offset=440</link>
	<atom:link href="https://bioinformaticsonline.com/related/36512?offset=440" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43856/puffaligner-a-fast-efficient-and-accurate-aligner-based-on-the-pufferfish-index</guid>
	<pubDate>Thu, 21 Apr 2022 05:41:39 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43856/puffaligner-a-fast-efficient-and-accurate-aligner-based-on-the-pufferfish-index</link>
	<title><![CDATA[PuffAligner: a fast, efficient and accurate aligner based on the Pufferfish index]]></title>
	<description><![CDATA[<p><span>PuffAligner, a fast, accurate and versatile aligner built on top of the Pufferfish index. PuffAligner is able to produce highly sensitive alignments, similar to those of Bowtie2, but much more quickly. While exhibiting similar speed to the ultrafast STAR aligner, PuffAligner requires considerably less memory to construct its index and align reads. PuffAligner strikes a desirable balance with respect to the time, space and accuracy tradeoffs made by different alignment tools and provides a promising foundation on which to test new alignment ideas over large collections of sequences.</span></p><p>Address of the bookmark: <a href="https://github.com/COMBINE-lab/pufferfish/tree/cigar-strings" rel="nofollow">https://github.com/COMBINE-lab/pufferfish/tree/cigar-strings</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44904/termal-a-fast-and-interactive-terminal-based-viewer-for-multiple-sequence-alignments</guid>
	<pubDate>Mon, 22 Sep 2025 23:51:02 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44904/termal-a-fast-and-interactive-terminal-based-viewer-for-multiple-sequence-alignments</link>
	<title><![CDATA[Termal: a fast and interactive terminal-based viewer for multiple sequence alignments]]></title>
	<description><![CDATA[<p>termal, a fast, interactive, terminal-based viewer for multiple sequence alignments (MSAs), designed for use on remote systems such as high-performance computing (HPC) clusters.</p>
<p>https://academic.oup.com/bioinformaticsadvances/advance-article/doi/10.1093/bioadv/vbaf208/8257678?login=true</p><p>Address of the bookmark: <a href="https://github.com/sib-swiss/termal" rel="nofollow">https://github.com/sib-swiss/termal</a></p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37800/heatmapper-web-enabled-heat-mapping-for-all</guid>
	<pubDate>Mon, 01 Oct 2018 08:34:41 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37800/heatmapper-web-enabled-heat-mapping-for-all</link>
	<title><![CDATA[Heatmapper: web-enabled heat mapping for all]]></title>
	<description><![CDATA[<p><span>Heatmapper is a freely available web server that allows users to interactively visualize their data in the form of heat maps through an easy-to-use graphical interface. Heatmapper is a versatile tool that allows users to easily create a wide variety of heat maps for many different data types and applications. Heatmapper allows users to generate, cluster and visualize: </span></p>
<p><span>1)&nbsp;</span><span>expression-based heat maps</span><span>&nbsp;from transcriptomic, proteomic and metabolomic experiments; 2)&nbsp;</span><span>pairwise distance maps</span><span>; </span></p>
<p><span>3)&nbsp;</span><span>correlation maps</span><span>; </span></p>
<p><span>4)&nbsp;</span><span>image overlay heat maps</span><span>; </span></p>
<p><span>5)&nbsp;</span><span>latitude and longitude heat maps</span><span>&nbsp;and </span></p>
<p><span>6)&nbsp;</span><span>geopolitical (choropleth) heat maps</span><span>. </span></p>
<p><span>Heatmapper offers a number of simple and intuitive customization options for easy adjustments to each heat map&rsquo;s appearance and plotting parameters. Heatmapper also allows users to interactively explore their numeric data values by hovering their cursor over each heat map, or by using a searchable/sortable data table view.</span></p>
<p><span>Ref&nbsp;https://www.ncbi.nlm.nih.gov/pubmed/27190236</span></p><p>Address of the bookmark: <a href="http://www2.heatmapper.ca/" rel="nofollow">http://www2.heatmapper.ca/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/11144/scientists-map-17294-proteins-produced-in-human-body</guid>
	<pubDate>Thu, 29 May 2014 01:57:55 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/11144/scientists-map-17294-proteins-produced-in-human-body</link>
	<title><![CDATA[Scientists map 17,294 proteins produced in human body]]></title>
	<description><![CDATA[<p>Indian scientists missed the genomic profiling bus, but they've more than made up for it by creating the first human proteome map which is an extension of the genomic study. Till now, here is no direct equivalent for the human proteome. But recently two groups present mass spectrometry-based analysis of human tissues, body fluids and cells mapping the large majority of the human proteome.</p><p>The Indian scientists working in Bangalore, along with their American counterparts, have mapped more than 17,000 proteins in 30 organs of the human body. Just like the human genome was sequenced around the turn of the millennium, this is an equivalent mapping of the human proteome.<br /><br />The researcher estimated there are around 20,500 proteins in the human body. These scientists have profiled around 17,294, which account for around 84% of the total proteins. Apart from this, the team also traced around 2,500 of 3,000 proteins that had been categorised as "missing proteins".</p><p>The work, done by group of Indian scientists, and Johns Hopkins University, published in the renowned journal Nature ( http://www.nature.com/nature/journal/v509/n7502/full/nature13302.html ). Of the 72 people who worked on the project, 46 are Indians.</p><p>Reference:</p><p>http://www.nature.com/nature/journal/v509/n7502/full/nature13302.html</p><p>http://www.proteinatlas.org/ -The antibody-based Human Protein Atlas programme</p><p>http://www.humanproteomemap.org/ -Proteogenomic analysis by identifying translated proteins from annotated pseudogenes, non-coding RNAs and untranslated regions.</p><p>https://www.proteomicsdb.org/ -Assembled protein evidence for 18,097 genes in ProteomicsDB</p><p>&nbsp;</p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27430/mosaik-a-hash-based-algorithm-for-accurate-next-generation-sequencing-short-read-mapping</guid>
	<pubDate>Fri, 20 May 2016 18:53:49 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27430/mosaik-a-hash-based-algorithm-for-accurate-next-generation-sequencing-short-read-mapping</link>
	<title><![CDATA[MOSAIK: A Hash-Based Algorithm for Accurate Next-Generation Sequencing Short-Read Mapping]]></title>
	<description><![CDATA[<p><span>MOSAIK is a stable, sensitive and open-source program for mapping second and third-generation sequencing reads to a reference genome. Uniquely among current mapping tools, MOSAIK can align reads generated by all the major sequencing technologies, including Illumina, Applied Biosystems SOLiD, Roche 454, Ion Torrent and Pacific BioSciences SMRT. Indeed, MOSAIK was the only aligner to provide consistent mappings for all the generated data (sequencing technologies, low-coverage and exome) in the 1000 Genomes Project. To provide highly accurate alignments, MOSAIK employs a hash clustering strategy coupled with the Smith-Waterman algorithm. This method is well-suited to capture mismatches as well as short insertions and deletions. To support the growing interest in larger structural variant (SV) discovery, MOSAIK provides explicit support for handling known-sequence SVs, e.g. mobile element insertions (MEIs) as well as generating outputs tailored to aid in SV discovery.</span></p><p>Address of the bookmark: <a href="http://journals.plos.org/plosone/article?id=10.1371/journal.pone.0090581" rel="nofollow">http://journals.plos.org/plosone/article?id=10.1371/journal.pone.0090581</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/39453/fuma-gwas-functional-mapping-and-annotation-of-genome-wide-association-studies</guid>
	<pubDate>Sat, 01 Jun 2019 03:11:16 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/39453/fuma-gwas-functional-mapping-and-annotation-of-genome-wide-association-studies</link>
	<title><![CDATA[FUMA GWAS: Functional Mapping and Annotation of Genome-Wide Association Studies]]></title>
	<description><![CDATA[<p><span>FUMA is a platform that can be used to annotate, prioritize, visualize and interpret GWAS results.&nbsp;</span><br><span>The&nbsp;</span><a href="https://fuma.ctglab.nl/snp2gene">SNP2GENE</a><span>&nbsp;function takes GWAS summary statistics as an input, and provides extensive functional annotation for all SNPs in genomic areas identified by lead SNPs.&nbsp;</span><br><span>The&nbsp;</span><a href="https://fuma.ctglab.nl/gene2func">GENE2FUNC</a><span>&nbsp;function takes a list of gene IDs (as identified by SNP2GENE or as provided manually) and annotates genes in biological context&nbsp;</span></p><p>Address of the bookmark: <a href="https://fuma.ctglab.nl/" rel="nofollow">https://fuma.ctglab.nl/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/fun/view/14036/introduction-to-programming-write-short-programs-that-generate-graphics-and-animation</guid>
	<pubDate>Thu, 14 Aug 2014 23:29:04 -0500</pubDate>
	<link>https://bioinformaticsonline.com/fun/view/14036/introduction-to-programming-write-short-programs-that-generate-graphics-and-animation</link>
	<title><![CDATA[Introduction to programming. Write short programs that generate graphics and animation.]]></title>
	<description><![CDATA[<p>Introduction to programming. Write short programs that generate graphics and animation.</p><p>http://funprogramming.org/</p>]]></description>
	<dc:creator>Ram Yash Pal</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/39683/gffcompare-program-for-processing-gtfgff-files</guid>
	<pubDate>Tue, 09 Jul 2019 13:35:13 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/39683/gffcompare-program-for-processing-gtfgff-files</link>
	<title><![CDATA[GffCompare: Program for processing GTF/GFF files]]></title>
	<description><![CDATA[<p>The program gffcompare can be used to compare, merge, annotate and estimate accuracy of one or more GFF files (the &ldquo;query&rdquo; files), when compared with a reference annotation (also provided as GFF).</p><p>Address of the bookmark: <a href="https://ccb.jhu.edu/software/stringtie/gffcompare.shtml" rel="nofollow">https://ccb.jhu.edu/software/stringtie/gffcompare.shtml</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34443/opera-an-optimal-genome-scaffolding-program</guid>
	<pubDate>Mon, 27 Nov 2017 10:18:20 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34443/opera-an-optimal-genome-scaffolding-program</link>
	<title><![CDATA[Opera: An optimal genome scaffolding program]]></title>
	<description><![CDATA[<p><span>Opera (Optimal Paired-End Read Assembler) is a sequence assembly program (</span><a href="http://en.wikipedia.org/wiki/Sequence_assembly" target="_blank">http://en.wikipedia.org/wiki/Sequence_assembly&nbsp;<img src="https://a.fsdn.com/con/img/icons/external_asset.png" alt="image" style="border: 0px;"></a><span>). It uses information from paired-end or long reads to optimally order and orient contigs assembled from shotgun-sequencing reads.</span><br><br><span>An updated version called OPERA-LG has been re-engineered with features for the assembly of large and complex genomes.</span><br><br><span>Song Gao, Denis Bertrand, Burton K. H. Chia and Niranjan Nagarajan. OPERA-LG: efficient and exact scaffolding of large, repeat-rich eukaryotic genomes with performance guarantees. Genome Biology, May 2016, doi: 10.1186/s13059-016-0951-y.</span><br><br><span>Song Gao, Wing-Kin Sung, Niranjan Nagarajan. Opera: reconstructing optimal genomic scaffolds with high-throughput paired-end sequences. Journal of Computational Biology, Sept. 2011, doi:10.1089/cmb.2011.0170.</span></p>
<p><span>https://genomebiology.biomedcentral.com/articles/10.1186/s13059-016-0951-y</span></p><p>Address of the bookmark: <a href="https://sourceforge.net/projects/operasf/" rel="nofollow">https://sourceforge.net/projects/operasf/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38625/croco-a-program-to-detect-potential-cross-contaminations-in-hts-assembled-transcriptomes-using-expression-level-quantification</guid>
	<pubDate>Mon, 07 Jan 2019 18:17:44 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38625/croco-a-program-to-detect-potential-cross-contaminations-in-hts-assembled-transcriptomes-using-expression-level-quantification</link>
	<title><![CDATA[CroCo: A program to detect potential cross contaminations in HTS assembled transcriptomes using expression level quantification]]></title>
	<description><![CDATA[<p>CroCo is a program to detect cross contamination events in assembled transcriptomes using sequencing reads to determine the true origin of every transcripts.<br>Such cross contaminations can be expected if several RNA-Seq experiments were prepared during the same period at the same lab, or by the same people, or if they were processed or sequenced by the same sequencing service facility.<br>Our approach first determines a subset of transcripts that are suspiciously similar across samples using a pairwise BLAST procedure. CroCo then combine all transcriptomes into a metatranscriptome and quantifies the "expression level" of all transcripts successively using every sample read data (e.g. several species sequenced by the same lab for a particular study) while allowing read multi-mappings.<br>Several mapping tools implemented in CroCo can be used to estimate expression level (default is RapMap).<br>This information is then used to categorize each transcript in the following 5 categories :</p>
<p><br>clean: the transcript origin is from the focal sample.</p>
<p>cross contamination: the transcript origin is from an alien sample of the same experiment.</p>
<p>dubious: expression levels are too close between focal and alien samples to determine the true origin of the transcript.</p>
<p>low coverage: expression levels are too low in all samples, thus hampering our procedure (which relies on differential expression) to confidently assign it to any category.</p>
<p>over expressed: expression levels are very high in at least 3 samples and CroCo will not try to categorize it. Indeed, such a pattern does not correspond to expectations for cross contaminations, but often reflect highly conserved genes such as ribosomal gene, or external contamination shared by several samples (e.g. Escherichia coli contaminations).</p><p>Address of the bookmark: <a href="https://gitlab.mbb.univ-montp2.fr/mbb/CroCo" rel="nofollow">https://gitlab.mbb.univ-montp2.fr/mbb/CroCo</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>