<?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/36395?offset=100</link>
	<atom:link href="https://bioinformaticsonline.com/related/36395?offset=100" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30336/finding-patterns-in-biological-sequences</guid>
	<pubDate>Thu, 22 Dec 2016 10:30:49 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30336/finding-patterns-in-biological-sequences</link>
	<title><![CDATA[Finding Patterns in Biological Sequences]]></title>
	<description><![CDATA[<p>In this report we provide an overview of known techniques for discovery of patterns of biological sequences (DNA and proteins). We also provide biological motivation, and methods of biological verification of such patterns. Finally we list publicly available tools and databases for pattern discovery. On-line supplement is available through http://genetics.uwaterloo.ca/&sim;tvinar/cs798g/motif.</p><p>Address of the bookmark: <a href="http://engr.case.edu/li_jing/papers/00798gpattern.pdf" rel="nofollow">http://engr.case.edu/li_jing/papers/00798gpattern.pdf</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/32018/tmap-torrent-mapping-alignment-program-general-notes</guid>
	<pubDate>Sun, 02 Apr 2017 15:53:47 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32018/tmap-torrent-mapping-alignment-program-general-notes</link>
	<title><![CDATA[TMAP - torrent mapping alignment program General Notes]]></title>
	<description><![CDATA[<p>TMAP - torrent mapping alignment program <a href="https://github.com/iontorrent/TS/tree/master/Analysis/TMAP#general-notes"></a>General Notes</p>
<p>TMAP is a fast and accurate alignment software for short and long nucleotide sequences produced by next-generation sequencing technologies.</p>
<ul>
<li>
<p>The latest TMAP is unsupported. To use a supported version, please see the TMAP version associated with a Torrent Suite release below.</p>
</li>
<li>
<p>Get the latest source code:</p>
<div>
<pre>git clone git://github.com/iontorrent/TMAP.git
 <span>cd</span> TMAP
 git submodule init
 git submodule update</pre>
</div>
</li>
</ul>
<p>https://github.com/iontorrent/TS/tree/master/Analysis/TMAP</p><p>Address of the bookmark: <a href="https://github.com/iontorrent/TS/tree/master/Analysis/TMAP" rel="nofollow">https://github.com/iontorrent/TS/tree/master/Analysis/TMAP</a></p>]]></description>
	<dc:creator>Poonam Mahapatra</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36111/d3networktools-for-creating-d3-javascript-network-tree-dendrogram-and-sankey-graphs-from-r</guid>
	<pubDate>Fri, 06 Apr 2018 12:10:45 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36111/d3networktools-for-creating-d3-javascript-network-tree-dendrogram-and-sankey-graphs-from-r</link>
	<title><![CDATA[d3Network:Tools for creating D3 JavaScript network, tree, dendrogram, and Sankey graphs from R.]]></title>
	<description><![CDATA[<p><a href="http://bost.ocks.org/mike/">Mike Bostock</a><span>&rsquo;s&nbsp;</span><a href="http://d3js.org/">D3.js</a><span>&nbsp;is great for creating&nbsp;</span><a href="http://bl.ocks.org/mbostock/4062045">interactive network graphs</a><span>&nbsp;with JavaScript. The&nbsp;</span><a href="https://github.com/christophergandrud/d3Network">d3Network</a><span>&nbsp;package makes it easy to create these network graphs from&nbsp;</span><a href="http://www.r-project.org/">R</a><span>. The main idea is that you should able to take an R data frame with information about the relationships between members of a network and create full network graphs with one command.</span></p><p>Address of the bookmark: <a href="http://christophergandrud.github.io/d3Network/" rel="nofollow">http://christophergandrud.github.io/d3Network/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36510/scallop-reference-based-transcriptome-assembler-for-rna-seq</guid>
	<pubDate>Tue, 08 May 2018 04:23:27 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36510/scallop-reference-based-transcriptome-assembler-for-rna-seq</link>
	<title><![CDATA[Scallop: reference-based transcriptome assembler for RNA-seq]]></title>
	<description><![CDATA[<p>Scallop is an accurate reference-based transcript assembler. Scallop features its high accuracy in assembling multi-exon transcripts as well as lowly expressed transcripts. Scallop achieves this improvement through a novel algorithm that can be proved preserving all phasing paths from reads and paired-end reads, while also achieves both transcripts parsimony and coverage deviation minimization.</p>
<p>Scallop paper has been published at&nbsp;<a href="https://www.nature.com/articles/nbt.4020"><span>Nature Biotechnology</span></a>. The datasets and scripts used in this paper to compare the performance of Scallop and other assemblers are available at&nbsp;<a href="https://github.com/Kingsford-Group/scalloptest"><span>scalloptest</span></a>.</p>
<p>Please also checkout the&nbsp;<span>podcast</span>&nbsp;about Scallop (thanks&nbsp;<a href="https://ro-che.info/">Roman Cheplyaka</a>&nbsp;for the interview). It is available at both&nbsp;<a href="https://bioinformatics.chat/scallop">the bioinformatics chat</a>&nbsp;and&nbsp;<a href="https://itunes.apple.com/us/podcast/the-bioinformatics-chat/id1227281398">iTunes</a>.</p>
<p>&nbsp;</p>
<p>https://github.com/Kingsford-Group/scallop</p><p>Address of the bookmark: <a href="https://github.com/Kingsford-Group/scallop" rel="nofollow">https://github.com/Kingsford-Group/scallop</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37520/mmgenome-tools-for-extracting-individual-genomes-from-metagneomes</guid>
	<pubDate>Thu, 09 Aug 2018 17:41:17 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37520/mmgenome-tools-for-extracting-individual-genomes-from-metagneomes</link>
	<title><![CDATA[mmgenome: Tools for extracting individual genomes from metagneomes]]></title>
	<description><![CDATA[<p>The mmgenome toolbox enables reproducible extraction of individual genomes from metagenomes. It builds on the&nbsp;<a href="http://madsalbertsen.github.io/multi-metagenome/">multi-metagenome</a>&nbsp;concept, but wraps most of the process of extracting genomes in simple R functions. Thereby making the whole process of binning easy and at the same time reproducible through the Rmarkdown format.</p>
<p>The mmgenome R package also facilitates effortless integration with additional data sources and hence should not be seen as "yet another binning method", but rather a package to integrate different binning strategies.</p>
<p>All functions in the mmgenome R package has associated documentation, check it out in R by e.g.&nbsp;<code>?mmplot</code>.</p><p>Address of the bookmark: <a href="https://github.com/MadsAlbertsen/mmgenome" rel="nofollow">https://github.com/MadsAlbertsen/mmgenome</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/43670/useful-bioinformatics-analysis-tools</guid>
	<pubDate>Thu, 23 Dec 2021 23:10:02 -0600</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/43670/useful-bioinformatics-analysis-tools</link>
	<title><![CDATA[Useful Bioinformatics Analysis Tools !]]></title>
	<description><![CDATA[<h3><a href="http://sun.aei.polsl.pl/REFRESH/index.php?page=projects&amp;project=cometa&amp;subpage=about">CoMeta</a></h3><p><strong>Classificier of reads from metagenomic sequencing experiments.</strong></p><p><span>&bull;&nbsp;&nbsp;Kawulok, J., Deorowicz, S.,&nbsp;</span><em>CoMeta: Classification of Metagenomes Using k-mers</em><span>,&nbsp;</span><a href="http://journals.plos.org/plosone/article?id=10.1371/journal.pone.0121453">PLOS ONE,&nbsp;</a><span>2015; 10(4):1&ndash;23,</span></p><h3><a href="http://sun.aei.polsl.pl/REFRESH/index.php?page=projects&amp;project=CoMSA&amp;subpage=about">CoMSA</a></h3><p><strong>Compressor of multiple sequence alignments of proteins.</strong></p><p><span>&bull;&nbsp;&nbsp;Deorowicz, S., Walczyszyn, J., Debudaj-Grabysz, A.,&nbsp;</span><em>CoMSA: compression of protein multiple sequence alignment files</em><span>,&nbsp;</span><a href="https://doi.org/10.1093/bioinformatics/bty619">Bioinformatics,&nbsp;</a><span>2019; 35(2):22&ndash;234,</span></p><h3><a href="http://sun.aei.polsl.pl/REFRESH/index.php?page=projects&amp;project=dsrc&amp;subpage=about">DSRC</a></h3><p><strong>Compressor of sequencing reads.</strong></p><p><span>&bull;&nbsp;&nbsp;Roguski, L., Deorowicz, S.,&nbsp;</span><em>DSRC 2: Industry-oriented compression of FASTQ files</em><span>,&nbsp;</span><a href="http://bioinformatics.oxfordjournals.org/content/30/15/2213">Bioinformatics,&nbsp;</a><span>2014; 30(15):2213&ndash;2215,</span><br /><span>&bull;&nbsp;&nbsp;Deorowicz, S., Grabowski, Sz.,&nbsp;</span><em>Compression of DNA sequences in FASTQ format</em><span>,&nbsp;</span><a href="http://bioinformatics.oxfordjournals.org/">Bioinformatics,&nbsp;</a><span>2011; 27(6):860&ndash;862,</span></p><h3><a href="http://sun.aei.polsl.pl/REFRESH/index.php?page=projects&amp;project=famsa&amp;subpage=about">FAMSA</a></h3><p><strong>Multiple sequence alignment designed for huge families of proteins (even containing hundreds of thousands of sequences).</strong></p><p><span>&bull;&nbsp;&nbsp;Deorowicz, S., Debudaj-Grabysz, A., Gudys, A.,&nbsp;</span><em>FAMSA: Fast and accurate multiple sequence alignment of huge protein families</em><span>,&nbsp;</span><a href="http://www.nature.com/articles/srep33964">Scientific Reports,&nbsp;</a><span>2016; 6(33964):</span></p><h3><a href="http://sun.aei.polsl.pl/REFRESH/index.php?page=projects&amp;project=fastore&amp;subpage=about">FaStore</a></h3><p><strong>Compressor of FASTQ files.</strong></p><p><span>&bull;&nbsp;&nbsp;Roguski, L., Ochoa, I., Hernaez, M., Deorowicz, S.,&nbsp;</span><em>FaStore - a space-saving solution for raw sequencing data</em><span>,&nbsp;</span><a href="https://doi.org/10.1093/bioinformatics/bty205">Bioinformatics,&nbsp;</a><span>2018; 34(16):2748&ndash;2756,</span></p><h3><a href="http://sun.aei.polsl.pl/REFRESH/index.php?page=projects&amp;project=fqsqueezer&amp;subpage=about">FQSqueezer</a></h3><p><strong>Experimental high-end compressor of FASTQ files.</strong></p><p><span>&bull;&nbsp;&nbsp;Deorowicz, S.,&nbsp;</span><em>FQSqueezer: k-mer-based compression of sequencing data</em><span>,&nbsp;</span><a href="https://www.nature.com/articles/s41598-020-57452-6">Scientific Reports,&nbsp;</a><span>2020; 10(578):</span></p><h3><a href="http://sun.aei.polsl.pl/REFRESH/index.php?page=projects&amp;project=gdc&amp;subpage=about">GDC</a></h3><p><strong>Compressor of collections of genome sequences.</strong></p><p><span>&bull;&nbsp;&nbsp;Deorowicz, S., Danek, A., Niemiec, M.,&nbsp;</span><em>GDC 2: Compression of large collections of genomes</em><span>,&nbsp;</span><a href="http://www.nature.com/srep/2015/150625/srep11565/full/srep11565.html">Scientific Reports,&nbsp;</a><span>2015; 5(11565):1&ndash;12,</span><br /><span>&bull;&nbsp;&nbsp;Deorowicz, S., Grabowski, Sz.,&nbsp;</span><em>Robust relative compression of genomes with random access</em><span>,&nbsp;</span><a href="http://sun.aei.polsl.pl/REFRESH/bioinformatics.oxfordjournals.org/content/27/21/2979.abstract">Bioinformatics,&nbsp;</a><span>2011; 27(21):2979&ndash;2986,</span></p><h3><a href="http://sun.aei.polsl.pl/REFRESH/index.php?page=projects&amp;project=gtc&amp;subpage=about">GTC</a></h3><p><strong>Genotype databases compressor with support for fast queries.</strong></p><p><span>&bull;&nbsp;&nbsp;Danek, A., Deorowicz, S.,&nbsp;</span><em>GTC: how to maintain huge genotype collections in a compressed form</em><span>,&nbsp;</span><a href="https://doi.org/10.1093/bioinformatics/bty023">Bioinformatics,&nbsp;</a><span>2018; 34(11):1834&ndash;1840,</span></p><h3><a href="http://sun.aei.polsl.pl/REFRESH/index.php?page=projects&amp;project=gtshark&amp;subpage=about">GTShark</a></h3><p><strong>Genotypes compressor.</strong></p><p><span>&bull;&nbsp;&nbsp;Deorowicz, S., Danek, A.,&nbsp;</span><em>GTShark: Genotype compression in large projects</em><span>,&nbsp;</span><a href="https://doi.org/10.1093/bioinformatics/btz508">Bioinformatics,&nbsp;</a><span>2019; 35(22):4791&ndash;4793,</span></p><h3><a href="http://sun.aei.polsl.pl/REFRESH/index.php?page=projects&amp;project=kmc&amp;subpage=about">KMC</a></h3><p><strong>Memory frugal&nbsp;<em>k</em>-mer counter.</strong></p><p><span>&bull;&nbsp;&nbsp;Kokot, M., Długosz, M., Deorowicz, S.,&nbsp;</span><em>KMC 3: counting and manipulating k -mer statistics</em><span>,&nbsp;</span><a href="https://doi.org/10.1093/bioinformatics/btx304">Bioinformatics,&nbsp;</a><span>2017; 33(17):2759&ndash;2761,</span><br /><span>&bull;&nbsp;&nbsp;Deorowicz, S., Kokot, M., Grabowski, Sz., Debudaj-Grabysz, A.,&nbsp;</span><em>KMC 2: Fast and resource-frugal k-mer counting</em><span>,&nbsp;</span><a href="https://doi.org/10.1093/bioinformatics/btv022">Bioinformatics,&nbsp;</a><span>2015; 31(10):1569&ndash;1576,</span><br /><span>&bull;&nbsp;&nbsp;Deorowicz, S., Debudaj-Grabysz, A., Grabowski, Sz.,&nbsp;</span><em>Disk-based k-mer counting on a PC</em><span>,&nbsp;</span><a href="http://www.biomedcentral.com/1471-2105/14/160">BMC Bioinformatics,&nbsp;</a><span>2013; 14():Article no. 160,</span></p><h3><a href="http://sun.aei.polsl.pl/REFRESH/index.php?page=projects&amp;project=kmer-db&amp;subpage=about">Kmer-db</a></h3><p><strong>Tool for estimation of evolutionary distances in a collection of genomes.</strong></p><p><span>&bull;&nbsp;&nbsp;Deorowicz, S., Gudys, A., Dlugosz, M., Kokot, M., Danek, A.,&nbsp;</span><em>Kmer-db: instant evolutionary distance estimation</em><span>,&nbsp;</span><a href="https://doi.org/10.1093/bioinformatics/bty610">Bioinformatics,&nbsp;</a><span>2019; 35(1):133&ndash;136,</span></p><h3><a href="http://sun.aei.polsl.pl/REFRESH/index.php?page=projects&amp;project=mugi&amp;subpage=about">MuGI</a></h3><p><strong>Index allowing queries for a collection of multiple genome sequences.</strong></p><p><span>&bull;&nbsp;&nbsp;Danek, A., Deorowicz, S., Grabowski, Sz.,&nbsp;</span><em>Indexes of Large Genome Collections on a PC</em><span>,&nbsp;</span><a href="http://journals.plos.org/plosone/article?id=10.1371/journal.pone.0109384">PLOS ONE,&nbsp;</a><span>2014; 9(10):e109384,</span></p><h3><a href="http://sun.aei.polsl.pl/REFRESH/index.php?page=projects&amp;project=orcom&amp;subpage=about">ORCOM</a></h3><p><strong>Experimental compressor of sequencing reads.</strong></p><p><span>&bull;&nbsp;&nbsp;Grabowski, Sz., Deorowicz, S., Roguski, L.,&nbsp;</span><em>Disk-based compression of data from genome sequencing</em><span>,&nbsp;</span><a href="http://bioinformatics.oxfordjournals.org/content/early/2014/12/22/bioinformatics.btu844.abstract">Bioinformatics,&nbsp;</a><span>2014; 31(9):1389&ndash;1395,</span></p><h3><a href="http://sun.aei.polsl.pl/REFRESH/index.php?page=projects&amp;project=pgsa&amp;subpage=about">PgSA</a></h3><p><strong>Index allowing queries for a collection of sequencing reads.</strong></p><p><span>&bull;&nbsp;&nbsp;Kowalski, T., Grabowski, Sz., Deorowicz, S.,&nbsp;</span><em>Indexing arbitrary-length k-mers in sequencing reads</em><span>,&nbsp;</span><a href="http://journals.plos.org/plosone/article?id=10.1371/journal.pone.0133198">PLOS ONE,&nbsp;</a><span>2015; 10(7):1&ndash;16,</span></p><h3><a href="http://sun.aei.polsl.pl/REFRESH/index.php?page=projects&amp;project=quickprobs&amp;subpage=about">QuickProbs</a></h3><p><strong>Multiple sequence alignment designed especially for GPU.</strong></p><p><span>&bull;&nbsp;&nbsp;Gudys, A., Deorowicz, S.,&nbsp;</span><em>QuickProbs 2: towards rapid construction of high-quality alignments of large protein families</em><span>,&nbsp;</span><a href="http://www.nature.com/articles/srep41553">Scientific Reports,&nbsp;</a><span>2017; 7(41553):</span><br /><span>&bull;&nbsp;&nbsp;Gudys, A., Deorowicz, S.,&nbsp;</span><em>QuickProbs &ndash; A Fast Multiple Sequence Alignment Algorithm Designed for Graphics Processors</em><span>,&nbsp;</span><a href="http://www.plosone.org/article/info%3Adoi%2F10.1371%2Fjournal.pone.0088901">PLOS ONE,&nbsp;</a><span>2014; 9(2):e88901,</span></p><h3><a href="http://sun.aei.polsl.pl/REFRESH/index.php?page=projects&amp;project=reckoner&amp;subpage=about">RECKONER</a></h3><p><strong>Read error corrector.</strong></p><p><span>&bull;&nbsp;&nbsp;Maciej Długosz, M., Deorowicz, S.,&nbsp;</span><em>RECKONER: read error corrector based on KMC</em><span>,&nbsp;</span><a href="https://academic.oup.com/bioinformatics/article-abstract/33/7/1086/2843893/RECKONER-read-error-corrector-based-on-KMC">Bioinformatics,&nbsp;</a><span>2017; 33(7):1086&ndash;1089,</span></p><h3><a href="http://sun.aei.polsl.pl/REFRESH/index.php?page=projects&amp;project=tgc&amp;subpage=about">TGC</a></h3><p><strong>Compressor of collections of genomes given in Variant Call Format (VCF) files.</strong></p><p><span>&bull;&nbsp;&nbsp;Deorowicz, S., Danek, A., Grabowski, Sz.,&nbsp;</span><em>Genome compression: a novel approach for large collections</em><span>,&nbsp;</span><a href="http://bioinformatics.oxfordjournals.org/content/early/2013/08/29/bioinformatics.btt460">Bioinformatics,&nbsp;</a><span>2013; 29(20):2572&ndash;2578,</span></p><h3><a href="http://sun.aei.polsl.pl/REFRESH/index.php?page=projects&amp;project=vcfshark&amp;subpage=about">VCFShark</a></h3><p><strong>Compressor of VCF files.</strong></p><p><span>&bull;&nbsp;&nbsp;Deorowicz, S., Danek, A.,&nbsp;</span><em>GTShark: Genotype compression in large projects</em><span>,&nbsp;</span><a href="https://www.biorxiv.org/content/10.1101/2020.12.18.423437v1">biorxiv.org,&nbsp;</a><span>2020; ():</span></p><h3><a href="http://sun.aei.polsl.pl/REFRESH/index.php?page=projects&amp;project=whisper&amp;subpage=about">Whisper</a></h3><p><strong>Experimental mapper of whole genome sequencing data.</strong></p><p><span>&bull;&nbsp;&nbsp;Deorowicz, S., Gudys, A.,&nbsp;</span><em>Whisper 2: indel-sensitive short read mapping</em><span>,&nbsp;</span><a href="https://doi.org/10.1101/2019.12.18.881292">bioRxiv.org,&nbsp;</a><span>2019; :</span><br /><span>&bull;&nbsp;&nbsp;Deorowicz, S., Debudaj-Grabysz, A., Gudys, A., Grabowski, Sz.,&nbsp;</span><em>Whisper: read sorting allows robust robust mapping of DNA sequencing data</em><span>,&nbsp;</span><a href="https://doi.org/10.1093/bioinformatics/bty927">Bioinformatics,&nbsp;</a><span>2019; 35(12):2043&ndash;2050,</span><br /><span>&bull;&nbsp;&nbsp;Deorowicz, S., Debudaj-Grabysz, A., Gudys, A., Grabowski, Sz.,&nbsp;</span><em>Robust mapping of whole genome sequencing data</em><span>,&nbsp;</span><a href="https://meetings.cshl.edu/abstracts.aspx?meet=GENOME&amp;year=17">Poster at The Biology of Genomes Conference,&nbsp;</a><span>2017;</span></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/44002/interesting-bioinformatics-resources</guid>
	<pubDate>Fri, 11 Nov 2022 06:30:46 -0600</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/44002/interesting-bioinformatics-resources</link>
	<title><![CDATA[Interesting Bioinformatics Resources !]]></title>
	<description><![CDATA[<p>1. a reproducible workflow.&nbsp;<a href="https://www.youtube.com/watch?v=s3JldKoA0zw">https://www.youtube.com/watch?v=s3JldKoA0zw</a>&nbsp;This two minute video will change your mind on reproducible research&nbsp;</p><p>2. Parallel sequencing lives, or what makes large sequencing projects successful&nbsp;<a href="https://academic.oup.com/gigascience/article/6/11/gix100/4557140?login=false">https://academic.oup.com/gigascience/article/6/11/gix100/4557140?login=false</a></p><p>3. Common-sense approaches to sharing tabular data alongside publication&nbsp;<a href="https://www.sciencedirect.com/science/article/pii/S2666389921002300">https://www.sciencedirect.com/science/article/pii/S2666389921002300</a></p><p>4. A Reproducible Data Analysis Workflow with R Markdown, Git, Make, and Docker&nbsp;<a href="https://psyarxiv.com/8xzqy/">https://psyarxiv.com/8xzqy/</a></p><p>5. Practical Computational Reproducibility in the Life Sciences&nbsp;<a href="https://www.cell.com/cell-systems/fulltext/S2405-4712(18)30140-6">https://www.cell.com/cell-systems/fulltext/S2405-4712(18)30140-6</a></p><p>6. A video by Dr.Keith A. Baggerly from MD Anderson [The Importance of Reproducible Research in High-Throughput Biology](<a href="https://www.youtube.com/watch?v=7gYIs7uYbMo">https://www.youtube.com/watch?v=7gYIs7uYbMo</a>) highly recommended.</p><p>7. Ten Simple Rules for Reproducible Computational Research&nbsp;<a href="http://journals.plos.org/ploscompbiol/article?id=10.1371/journal.pcbi.1003285">http://journals.plos.org/ploscompbiol/article?id=10.1371/journal.pcbi.1003285</a>)</p><p>8. Good Enough Practices in Scientific Computing&nbsp;<a href="http://arxiv.org/abs/1609.00037">http://arxiv.org/abs/1609.00037</a>&nbsp;</p><p>9. Best Practices for Scientific Computing&nbsp;<a href="https://journals.plos.org/plosbiology/article?id=10.1371/journal.pbio.1001745">https://journals.plos.org/plosbiology/article?id=10.1371/journal.pbio.1001745</a></p><p>10. A Quick Guide to Organizing Computational Biology Projects&nbsp;<a href="http://journals.plos.org/ploscompbiol/article?id=10.1371/journal.pcbi.100042">http://journals.plos.org/ploscompbiol/article?id=10.1371/journal.pcbi.100042</a>&nbsp; A must read for computational biologists!</p><p>11. Reproducibility of computational workflows is automated using continuous analysis&nbsp;<a href="https://www.nature.com/articles/nbt.3780">https://www.nature.com/articles/nbt.3780</a></p><p>12. Five selfish reasons to work reproducibly&nbsp;<a href="https://genomebiology.biomedcentral.com/articles/10.1186/s13059-015-0850-7">https://genomebiology.biomedcentral.com/articles/10.1186/s13059-015-0850-7</a></p>]]></description>
	<dc:creator>Abhi</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/44618/important-bioinformatics-tools</guid>
	<pubDate>Tue, 30 Jul 2024 05:03:29 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/44618/important-bioinformatics-tools</link>
	<title><![CDATA[Important Bioinformatics Tools !]]></title>
	<description><![CDATA[<p><span>1. Ktrim: An extra-fast, accurate adapter trimmer for sequencing data. It processes FASTQ files from multiple lanes with minimal mismatching and over-trimming of adapters.</span><span><br /></span><span><br /></span><span>2. BWA MEM: A reliable alignment tool (particularly for mapping ALT contigs and HLA genes, which are not fully addressed in BWA-MEM2).</span><span><br /></span><span><br /></span><span>3. Sambamba markdup: Quickly marks or removes duplicate reads using Picard's criteria.</span><span><br /></span><span><br /></span><span>4. ichorCNA: Estimates the tumor DNA fraction in cell-free DNA from ultra-low-pass whole genome sequencing (0.1x coverage) based on copy number alterations (CNA).</span><span><br /></span><span><br /></span><span>5. Fragle: A deep learning method for quantifying ctDNA levels from cell-free DNA fragmentomic profiles. It detects TF as low as ~1% ctDNA and works with targeted genomic panel sequencing data.</span><span><br /></span><span><br /></span><span>6. AlfredQC: A quality control tool for high-throughput sequencing data. It assesses metrics like read quality scores, GC content, and duplication rates, visualized through detailed plots and summary statistics.</span><span><br /></span><span><br /></span><span>7. Mosdepth: A fast tool for calculating sequencing coverage depth, offering a quicker alternative to samtools/sambamba depth by processing BAM and CRAM files.</span><span><br /></span><span><br /></span><span>8. Bedtools: A versatile toolkit for genomics, enabling operations like intersect, merge, count, and shuffle on genomic intervals across formats such as BAM, BED, GFF/GTF, and VCF.</span><span><br /></span><span><br /></span><span>9. Datamash: A command-line tool for basic numeric, textual, and statistical operations on input data streams. It supports operations such as grouping, sorting, transposing, and performing arithmetic calculations on tabular data.</span><span><br /></span><span><br /></span><span>10.</span><span> </span><a href="http://gwf.app/" target="_self">gwf.app</a><span>: A pragmatic alternative to Snakemake. Developed at</span><span> </span><a href="https://www.linkedin.com/company/aarhus-university-denmark-/" target="_self"><span>Aarhus University</span></a><span>, this flexible, generic workflow tool builds and runs large scientific workflows.</span></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/fun/view/4196/chemical-elements-of-bioinformatics</guid>
	<pubDate>Tue, 03 Sep 2013 16:35:39 -0500</pubDate>
	<link>https://bioinformaticsonline.com/fun/view/4196/chemical-elements-of-bioinformatics</link>
	<title><![CDATA[Chemical Elements of Bioinformatics]]></title>
	<description><![CDATA[<p>You must be familiar with periodic table and colour pattern, but this time you are going to amaze by new elements table by Eagle genomics. Just check it out and have fun :)</p><p><a href="http://elements.eaglegenomics.com/">http://elements.eaglegenomics.com/</a></p>]]></description>
	<dc:creator>Rahul Agarwal</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34400/ioniser-tools-for-the-quality-assessment-of-data-produced-by-oxford-nanopore%E2%80%99s-minion-sequencer</guid>
	<pubDate>Thu, 23 Nov 2017 10:24:19 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34400/ioniser-tools-for-the-quality-assessment-of-data-produced-by-oxford-nanopore%E2%80%99s-minion-sequencer</link>
	<title><![CDATA[IONiseR:  tools for the quality assessment of data produced by Oxford Nanopore’s MinION sequencer]]></title>
	<description><![CDATA[<p>This package is intended to provide tools for the quality assessment of data produced by Oxford Nanopore&rsquo;s MinION sequencer. It includes a functions to generate a number plots for examining the statistics that we think will be useful for this task.</p>
<p>However, nanopore sequencing is an emerging and rapidly developing technology. It is not clear what will be most informative. We hope that&nbsp;<code>IONiseR</code>&nbsp;will provide a framework for visualisation of metrics that we haven&rsquo;t thought of, and welcome feedback at&nbsp;<a href="mailto:mike.smith@embl.de" target="_blank">mike.smith@embl.de</a>.</p>
<p>If you&rsquo;re not interested in the quality assement of the raw or event level data, and want to jump straight to the getting FASTQ format files from fast5 files you can go straight to the final section of this document.</p><p>Address of the bookmark: <a href="https://www.bioconductor.org/packages/devel/bioc/vignettes/IONiseR/inst/doc/IONiseR.html" rel="nofollow">https://www.bioconductor.org/packages/devel/bioc/vignettes/IONiseR/inst/doc/IONiseR.html</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>