<?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/43870?offset=30</link>
	<atom:link href="https://bioinformaticsonline.com/related/43870?offset=30" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43957/gfastats-the-swiss-army-knife-for-genome-assembly</guid>
	<pubDate>Thu, 08 Sep 2022 06:03:05 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43957/gfastats-the-swiss-army-knife-for-genome-assembly</link>
	<title><![CDATA[gfastats: The swiss army knife for genome assembly.]]></title>
	<description><![CDATA[<p><span>gfastats</span><span>&nbsp;is a single fast and exhaustive tool for&nbsp;</span><span>summary statistics</span><span>&nbsp;and simultaneous *fa* (fasta, fastq, gfa [.gz]) genome assembly file&nbsp;</span><span>manipulation</span><span>.&nbsp;</span><span>gfastats</span><span>&nbsp;also allows seamless fasta&lt;&gt;fastq&lt;&gt;gfa[.gz] conversion. It has been tested in genomes even &gt;100Gbp.</span></p><p>Address of the bookmark: <a href="https://github.com/vgl-hub/gfastats" rel="nofollow">https://github.com/vgl-hub/gfastats</a></p>]]></description>
	<dc:creator>Abhi</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/44801/magic-wormhole-the-easiest-way-to-send-files-securely</guid>
	<pubDate>Wed, 28 May 2025 06:37:17 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/44801/magic-wormhole-the-easiest-way-to-send-files-securely</link>
	<title><![CDATA[Magic Wormhole: The Easiest Way to Send Files Securely]]></title>
	<description><![CDATA[<p>In a world increasingly dependent on digital data exchange, secure and user-friendly file transfer solutions are more important than ever. Enter Magic Wormhole, a deceptively simple yet powerful tool that makes it trivial to send files and messages between computers&mdash;securely and without configuration. Whether you're transferring a PDF to a colleague or sending code snippets between your devices, Magic Wormhole has you covered.</p><p><strong>What is Magic Wormhole?</strong><br />Magic Wormhole is an open-source command-line tool that allows you to securely send files or text from one computer to another. Developed by Brian Warner, it aims to eliminate the usual hassle of file transfers: setting up SSH servers, dealing with firewall rules, cloud storage uploads, or even worrying about man-in-the-middle attacks.</p><p>Using a combination of PAKE (Password-Authenticated Key Exchange) protocols and end-to-end encryption, Magic Wormhole ensures that the only parties who can see your data are you and your recipient.</p><p>&ldquo;It uses PAKE to establish a secure channel between two computers that use the same one-time code.&rdquo;</p><p><strong>How Does It Work?</strong></p><p>One user runs a command like wormhole send file.txt.</p><p>The tool generates a human-readable, one-time code (like 7-horse-staple).</p><p>The other user types wormhole receive and enters the code.</p><p>The file is encrypted, transferred directly (or relayed if needed), and decrypted only on the recipient's side.</p><p>All of this happens over a secure channel, with no manual key exchange, configuration, or trust in a central authority.</p><blockquote><p><strong>Example Usage</strong><br /># Sender<br />wormhole send myfile.pdf<br />Sending 1.4 MB file named 'myfile.pdf'<br />Wormhole code is: 7-horse-staple</p><p># Receiver<br />wormhole receive<br />Please enter code: 7-horse-staple<br />Receiving file (1.4 MB) into: myfile.pdf</p><p><br />That&rsquo;s it! No email attachments, no cloud storage, no FTP setups.</p></blockquote><p>Why Use Magic Wormhole?<br />End-to-end encrypted transfers using modern cryptography.</p><p>Easy to use even for non-technical users.</p><p>Cross-platform: Works on Linux, macOS, and Windows.</p><p>No servers needed (except for a lightweight transit relay).</p><p>Works even behind NAT/firewalls.</p><p><strong>It&rsquo;s particularly ideal for:</strong></p><p>Quickly sharing secrets or passwords.</p><p>Distributing software packages securely.</p><p>Moving files between servers or VMs.</p><p><strong>Under the Hood</strong><br />Magic Wormhole is written in Python and uses:</p><p>SPAKE2 for key exchange.</p><p>Transit relay and Mailbox server for message delivery.</p><p>Twisted framework for asynchronous networking.</p><p>The communication process is decentralized and designed to minimize the trust placed in the relay infrastructure. Even if an attacker intercepts the transit server, they cannot decrypt your data.</p><p><strong>Installation</strong></p><p>You can install it easily with pip:</p><p>pip install magic-wormhole</p><p><br /><strong>There&rsquo;s also a Homebrew package for macOS users</strong>:</p><p>brew install magic-wormhole<br />Community and Ecosystem<br />Magic Wormhole is more than just a file transfer tool. It's part of a growing ecosystem that values user-centric cryptography. There are community-maintained libraries for other languages (e.g., Go, Rust), GUI frontends like wormhole-gui, and integration projects for mobile and web use.</p><p><strong>Limitations</strong></p><p>While Magic Wormhole is elegant and secure, it&rsquo;s primarily a command-line utility and not designed for high-volume or persistent file sharing. Transfers require both sender and receiver to be online at the same time. And since it&rsquo;s peer-to-peer, very large files may suffer performance issues.</p><p><strong>Conclusion</strong><br />Magic Wormhole is a breath of fresh air in the complex world of secure communication. It proves that cryptographic security doesn&rsquo;t need to come with a heavy user experience cost. If you&rsquo;re looking for a simple, secure, and delightful way to send files or messages, give Magic Wormhole a try.</p><p>Explore the documentation: https://magic-wormhole.readthedocs.io</p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/28168/sam-flags</guid>
	<pubDate>Wed, 29 Jun 2016 15:38:15 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/28168/sam-flags</link>
	<title><![CDATA[SAM flags]]></title>
	<description><![CDATA[<p>Decoding SAM flags</p>
<p>This utility makes it easy to identify what are the properties of a read based on its SAM flag value, or conversely, to find what the SAM Flag value would be for a given combination of properties.</p>
<p>To decode a given SAM flag value, just enter the number in the field below. The encoded properties will be listed under Summary below, to the right.</p><p>Address of the bookmark: <a href="https://broadinstitute.github.io/picard/explain-flags.html" rel="nofollow">https://broadinstitute.github.io/picard/explain-flags.html</a></p>]]></description>
	<dc:creator>Poonam Mahapatra</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/view/1906</guid>
	<pubDate>Sun, 11 Aug 2013 11:13:58 -0500</pubDate>
	<link>https://bioinformaticsonline.com/view/1906</link>
	<title><![CDATA[Compressive Genomics]]></title>
	<description><![CDATA[<p>The key to finding a solution is to notice that most&nbsp;<a href="http://www.i-programmer.info/news/181-algorithms/4537-a-new-dna-sequence-search-compressive-genomics.html">genomic</a>sequences differ by very little. It may well be that the number of complete genome sequences being stored is increasing rapidly, but the actual amount of new data is very small. In other words, a single DNA sequence isn't particularly compressible but a set of sequences shares so much in common that the redundancy can be used to store them in a much smaller storage space. (Source:e-article from&nbsp;Alex Armstrong)</p><p><a href="http://www.i-programmer.info/news/181-algorithms/4537-a-new-dna-sequence-search-compressive-genomics.html">http://www.i-programmer.info/news/181-algorithms/4537-a-new-dna-sequence-search-compressive-genomics.html</a></p><p><a href="http://en.wikipedia.org/wiki/Compression_of_Genomic_Re-Sequencing_Data">http://en.wikipedia.org/wiki/Compression_of_Genomic_Re-Sequencing_Data</a></p><p><a href="http://www.nature.com/nbt/journal/v30/n7/full/nbt.2241.html">http://www.nature.com/nbt/journal/v30/n7/full/nbt.2241.html</a></p><p><a href="http://bioinformatics.oxfordjournals.org/content/29/13/i283.full">http://bioinformatics.oxfordjournals.org/content/29/13/i283.full</a></p><p><a href="http://groups.csail.mit.edu/cb/cast/">http://groups.csail.mit.edu/cb/cast/</a></p>]]></description>
	<dc:creator>Rahul Agarwal</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27090/canu-assembling-large-genomes-with-single-molecule-sequencing-and-locality-sensitive-hashing</guid>
	<pubDate>Tue, 26 Apr 2016 11:38:10 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27090/canu-assembling-large-genomes-with-single-molecule-sequencing-and-locality-sensitive-hashing</link>
	<title><![CDATA[CANU: Assembling Large Genomes with Single-Molecule Sequencing and Locality Sensitive Hashing.]]></title>
	<description><![CDATA[<p>Canu is a fork of the&nbsp;<a href="http://wgs-assembler.sourceforge.net/wiki/index.php?title=Main_Page" title="Celera Assembler">Celera Assembler</a>&nbsp;designed for high-noise single-molecule sequencing (such as the PacBio RSII or Oxford Nanopore MinION). The software is currently alpha level, feel free to use and report issues encountered.</p>
<p>Canu is a hierachical assembly pipeline which runs in four steps:</p>
<ul>
<li>Detect overlaps in high-noise sequences using&nbsp;<a href="https://github.com/marbl/MHAP" title="MHAP">MHAP</a></li>
<li>Generate corrected sequence consensus</li>
<li>Trim corrected sequences</li>
<li>Assemble trimmed corrected sequences</li>
</ul>
<p>Read the&nbsp;<a href="http://canu.readthedocs.org/" title="docs">documentation</a></p>
<p>New release https://github.com/marbl/canu/releases</p><p>Address of the bookmark: <a href="https://github.com/marbl/canu" rel="nofollow">https://github.com/marbl/canu</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27323/cutadapt</guid>
	<pubDate>Fri, 13 May 2016 04:54:50 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27323/cutadapt</link>
	<title><![CDATA[cutadapt]]></title>
	<description><![CDATA[<p>Cutadapt finds and removes adapter sequences, primers, poly-A tails and other types of unwanted sequence from your high-throughput sequencing reads.</p>
<p>Cleaning your data in this way is often required: Reads from small-RNA sequencing contain the 3&rsquo; sequencing adapter because the read is longer than the molecule that is sequenced. Amplicon reads start with a primer sequence. Poly-A tails are useful for pulling out RNA from your sample, but often you don&rsquo;t want them to be in your reads.</p>
<p>Cutadapt helps with these trimming tasks by finding the adapter or primer sequences in an error-tolerant way. It can also modify and filter reads in various ways. Adapter sequences can contain IUPAC wildcard characters. Also, paired-end reads and even colorspace data is supported. If you want, you can also just demultiplex your input data, without removing adapter sequences at all.</p>
<p>Cutadapt comes with an extensive suite of automated tests and is available under the terms of the MIT license.</p>
<p>If you use cutadapt, please cite <a href="http://dx.doi.org/10.14806/ej.17.1.200">DOI:10.14806/ej.17.1.200</a> .</p><p>Address of the bookmark: <a href="https://cutadapt.readthedocs.io/en/stable/installation.html#quickstart" rel="nofollow">https://cutadapt.readthedocs.io/en/stable/installation.html#quickstart</a></p>]]></description>
	<dc:creator>Radha Agarkar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34292/automatic-filtering-trimming-error-removing-and-quality-control-for-fastq-data</guid>
	<pubDate>Mon, 13 Nov 2017 05:10:23 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34292/automatic-filtering-trimming-error-removing-and-quality-control-for-fastq-data</link>
	<title><![CDATA[Automatic Filtering, Trimming, Error Removing and Quality Control for fastq data]]></title>
	<description><![CDATA[<p><span>Automatic Filtering, Trimming, Error Removing and Quality Control for fastq data</span><br><code>AfterQC</code><span>&nbsp;can simply go through all fastq files in a folder and then output three folders:&nbsp;</span><span>good</span><span>,&nbsp;</span><span>bad</span><span>&nbsp;and&nbsp;</span><span>QC</span><span>&nbsp;folders, which contains good reads, bad reads and the QC results of each fastq file/pair.</span><br><span>Currently it supports processing data from HiSeq 2000/2500/3000/4000, Nextseq 500/550, MiniSeq...and other&nbsp;</span><a href="http://support.illumina.com/help/SequencingAnalysisWorkflow/Content/Vault/Informatics/Sequencing_Analysis/CASAVA/swSEQ_mCA_FASTQFiles.htm">Illumina 1.8 or newer formats</a></p><p>Address of the bookmark: <a href="https://github.com/OpenGene/AfterQC" rel="nofollow">https://github.com/OpenGene/AfterQC</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42472/maftools-summarize-analyze-and-visualize-maf-files</guid>
	<pubDate>Wed, 23 Dec 2020 05:29:33 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42472/maftools-summarize-analyze-and-visualize-maf-files</link>
	<title><![CDATA[maftools : Summarize, Analyze and Visualize MAF Files]]></title>
	<description><![CDATA[<p><span>With advances in Cancer Genomics,&nbsp;</span><a href="https://docs.gdc.cancer.gov/Data/File_Formats/MAF_Format/">Mutation Annotation Format</a><span>&nbsp;(MAF) is being widely accepted and used to store somatic variants detected.&nbsp;</span><a href="http://cancergenome.nih.gov/">The Cancer Genome Atlas</a><span>&nbsp;Project has sequenced over 30 different cancers with sample size of each cancer type being over 200.&nbsp;</span><a href="https://wiki.nci.nih.gov/display/TCGA/TCGA+MAF+Files">Resulting data</a><span>&nbsp;consisting of somatic variants are stored in the form of&nbsp;</span><a href="https://docs.gdc.cancer.gov/Data/File_Formats/MAF_Format/">Mutation Annotation Format</a><span>. This package attempts to summarize, analyze, annotate and visualize MAF files in an efficient manner from either TCGA sources or any in-house studies as long as the data is in MAF format.</span></p><p>Address of the bookmark: <a href="https://www.bioconductor.org/packages/release/bioc/vignettes/maftools/inst/doc/maftools.html" rel="nofollow">https://www.bioconductor.org/packages/release/bioc/vignettes/maftools/inst/doc/maftools.html</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36857/%E2%80%9Cone-code-to-find-them-all%E2%80%9D-a-perl-tool-to-conveniently-parse-repeatmasker-output-files</guid>
	<pubDate>Mon, 04 Jun 2018 03:45:15 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36857/%E2%80%9Cone-code-to-find-them-all%E2%80%9D-a-perl-tool-to-conveniently-parse-repeatmasker-output-files</link>
	<title><![CDATA[“One code to find them all”: a perl tool to conveniently parse RepeatMasker output files]]></title>
	<description><![CDATA[One code to find them all is a set of perl scripts to extract useful information from RepeatMasker about transposable elements, retrieve their sequences and get some quantitative information.

Assemble RepeatMasker hits into complete TE copies, including LTR-retrotransposon
Retrieve corresponding TE sequences, and flanking sequences, from the local fasta files
Compute summary statistics for each TE family (number of TE copies, genome coverage...)
Ambiguous cases such as nested TE can be assembled into copies automatically or manually
Allow for working with a TE user-defined library
Allow for working with only a user-chosen set of TE families


http://doua.prabi.fr/software/one-code-to-find-them-all<p>Address of the bookmark: <a href="http://doua.prabi.fr/software/one-code-to-find-them-all" rel="nofollow">http://doua.prabi.fr/software/one-code-to-find-them-all</a></p>]]></description>
	<dc:creator>Poonam Mahapatra</dc:creator>
</item>

</channel>
</rss>