<?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/42139?offset=50</link>
	<atom:link href="https://bioinformaticsonline.com/related/42139?offset=50" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/35635/ete-3-reconstruction-analysis-and-visualization-of-phylogenomic-data</guid>
	<pubDate>Mon, 19 Feb 2018 06:46:15 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/35635/ete-3-reconstruction-analysis-and-visualization-of-phylogenomic-data</link>
	<title><![CDATA[ETE 3: Reconstruction, Analysis, and Visualization of Phylogenomic Data]]></title>
	<description><![CDATA[<p><span>ETE v3, featuring numerous improvements in the underlying library of methods, and providing a novel set of standalone tools to perform common tasks in comparative genomics and phylogenetics. </span></p>
<p><span>The new features include </span></p>
<p><span>(i) building gene-based and supermatrix-based phylogenies using a single command, </span></p>
<p><span>(ii) testing and visualizing evolutionary models, </span></p>
<p><span>(iii) calculating distances between trees of different size or including duplications, and </span></p>
<p><span>(iv) providing seamless integration with the NCBI taxonomy database. </span></p>
<p><span>ETE is freely available at&nbsp;</span><a href="http://etetoolkit.org/" target="">http://etetoolkit.org</a></p><p>Address of the bookmark: <a href="http://etetoolkit.org" rel="nofollow">http://etetoolkit.org</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43804/agora-algorithm-for-gene-order-reconstruction-in-ancestors</guid>
	<pubDate>Mon, 28 Feb 2022 23:26:21 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43804/agora-algorithm-for-gene-order-reconstruction-in-ancestors</link>
	<title><![CDATA[AGORA: Algorithm for Gene Order Reconstruction in Ancestors]]></title>
	<description><![CDATA[<p dir="auto">AGORA stands for &ldquo;Algorithm for Gene Order Reconstruction in Ancestors&rdquo; and was developed by Matthieu Muffato in the DYOGEN Laboratory at the &Eacute;cole normale sup&eacute;rieure in Paris in 2008.</p>
<div>
<pre><code>    // | |     //   ) )  //   ) ) //   ) )  // | |
   //__| |    //        //   / / //___/ /  //__| |
  / ___  |   //  ____  //   / / / ___ (   / ___  |
 //    | |  //    / / //   / / //   | |  //    | |
//     | | ((____/ / ((___/ / //    | | //     | |
</code></pre>
</div>
<p dir="auto">AGORA is used to generate ancestral genomes for the&nbsp;<a href="https://www.genomicus.biologie.ens.fr/genomicus">Genomicus</a>&nbsp;online server for gene order comparison, and has been in constant use in the group since.</p><p>Address of the bookmark: <a href="https://github.com/DyogenIBENS/Agora" rel="nofollow">https://github.com/DyogenIBENS/Agora</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43055/infogenomer-integrative-reconstruction-of-cancer-genome-karyotypes</guid>
	<pubDate>Wed, 05 May 2021 01:02:18 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43055/infogenomer-integrative-reconstruction-of-cancer-genome-karyotypes</link>
	<title><![CDATA[InfoGenomeR: Integrative reconstruction of cancer genome karyotypes]]></title>
	<description><![CDATA[<p>InfoGenomeR is the Integrative Framework for Genome Reconstruction that uses a breakpoint graph to model the connectivity among genomic segments at the genome-wide scale. InfoGenomeR integrates cancer purity and ploidy, total CNAs, allele-specific CNAs, and haplotype information to identify the optimal breakpoint graph representing cancer genomes.</p>
<p><img src="https://github.com/YeonghunL/InfoGenomeR/raw/master/doc/overview.png" alt="image" style="border: 0px; border: 0px;"></p>
<p>More at&nbsp;https://www.nature.com/articles/s41467-021-22671-6</p><p>Address of the bookmark: <a href="https://github.com/dmcblab/InfoGenomeR" rel="nofollow">https://github.com/dmcblab/InfoGenomeR</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/19087/dcgor</guid>
	<pubDate>Sat, 08 Nov 2014 14:54:28 -0600</pubDate>
	<link>https://bioinformaticsonline.com/news/view/19087/dcgor</link>
	<title><![CDATA[dcGOR]]></title>
	<description><![CDATA[<p>An R package for analysing ontologies and protein domain annotations has been published in PLoS Computational Biology (http://dx.doi.org/10.1371/journal.pcbi.1003929). The package is distributed as part of CRAN (http://cran.r-project.org/package=dcGOR), and also at GitHub for version control.<br /><br />The dedicated website is available in http://supfam.org/dcGOR, from which several demos are also provided:<br /><br />1. Analysing SCOP domains: http://supfam.org/dcGOR/demo-Fang.html<br /><br />2. Analysing Pfam domains: http://supfam.org/dcGOR/demo-Basu.html<br /><br />3. Analysing InterPro domains: http://supfam.org/dcGOR/demo-Customisation.html<br /><br />&nbsp;</p>]]></description>
	<dc:creator>Martin Jones</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/news/view/27344/orffinder-with-smart-blast</guid>
	<pubDate>Tue, 17 May 2016 01:43:15 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/27344/orffinder-with-smart-blast</link>
	<title><![CDATA[ORFfinder with smart BLAST]]></title>
	<description><![CDATA[<p><span>ORF Finder</span></p><p><span><a href="http://www.ncbi.nlm.nih.gov/orffinder">ORFfinder</a><span>&nbsp;is a graphical analysis tool for finding open reading frames (ORFs). We&rsquo;ve been working on a few updates, and we&rsquo;d like to find out what you think about them. Read on to find out what you can do with the new ORFfinder.</span></span></p><p>Smart BLAST (https://ncbiinsights.ncbi.nlm.nih.gov/2015/07/29/smartblast/)</p><p>Select one or a group of ORFs and BLAST several databases at once, and use the newly developed&nbsp;<a href="http://blast.ncbi.nlm.nih.gov/smartblast/">SmartBLAST</a>&nbsp;to verify protein names.&nbsp;Looking for the traditional results from&nbsp;<a href="http://blast.ncbi.nlm.nih.gov/Blast.cgi">BLAST</a>? They&rsquo;re there too.</p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/27799/bbmapbbtools-package-multipurpose-tool-designed-for-converting-reads-or-other-nucleotide-data-between-different-formats</guid>
	<pubDate>Mon, 13 Jun 2016 05:47:21 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/27799/bbmapbbtools-package-multipurpose-tool-designed-for-converting-reads-or-other-nucleotide-data-between-different-formats</link>
	<title><![CDATA[BBMap/BBTools package: Multipurpose tool designed for converting reads or other nucleotide data between different formats.]]></title>
	<description><![CDATA[<div id="post_message_148585"><a href="https://sourceforge.net/projects/bbmap/" target="_blank">Reformat</a>is a member of the <a href="https://sourceforge.net/projects/bbmap/" target="_blank">BBMap/BBTools package</a>. It is a multipurpose tool designed for converting reads or other nucleotide data between different formats. It supports, and can inter-convert:<br /> <br /> fastq<br /> fasta<br /> fasta+qual<br /> sam<br /> scarf (an old Illumina format)<br /> bam (if samtools is installed)<br /> gzip<br /> zip<br /> ascii-33 (sanger)<br /> ascii-64 (old Illumina)<br /> paired files<br /> interleaved files<br /> <br /> It is multithreaded and can process data at over 500 megabytes per second, and can accept streams from standard in and write to standard out, allowing it to be easily dropped into the middle of a pipeline for format conversion. Reformat autodetects formats based on file extensions and content, making it very easy to use; and the autodetection can be overridden, allowing flexibility for people who don't like to follow naming conventions, or out-of-spec fastq files with qualities values like -17 or 120.<br /> <br /> The program has been gradually expanded, and can now perform various other functions. None of these will break pairing, if the input is paired.<br /> <br /> Quality trimming (either or both ends)<br /> Quality filtering<br /> Fixed-length trimming<br /> Generation of histograms (base composition, quality, etc)<br /> Subsampling (to a fraction of input reads, or an exact number of reads or bases)<br /> Changing fasta line-wrapping length<br /> Reverse-complementing (all reads or only read 2)<br /> Adding /1 and /2 suffix to read names<br /> GC-content filtering<br /> Length-filtering<br /> Testing for corrupted interleaved files<br /> <br /> Reformat is compatible with any platform that supports Java 1.7 or higher. It also has a bash shellscript for simpler invocation. Typical usage examples:<br /> <br /> Reformat fastq into fasta:<br /> <strong>reformat.sh in=x.fq out=y.fa</strong><br /> <br /> Interleave paired reads:<br /> <strong>reformat.sh in1=x1.fq in2=x2.fq out=y.fq</strong><br /> <br /> Note - you can actually use a shortcut if paired read files have the same name with a 1 and a 2. This is equivalent to the above command:<br /> <strong>reformat.sh in=x#.fq out=y.fq</strong><br /> <br /> De-interleave reads:<br /> <strong>reformat.sh in=x.fq out1=y1.fq out2=y2.fq</strong><br /> <br /> Verify that interleaving appears correct, assuming Illumina namimg conventions:<br /> <strong>reformat.sh in=x.fq vint</strong><br /> <br /> Convert ASCII-33 to ASCII-64:<br /> <strong>reformat.sh in=x.fq out=y.fq qin=33 qout=64</strong><br /> <br /> Quality-trim paired reads to Q10 on the left and right ends and discard reads shorter than 50bp after trimming:<br /> <strong>reformat.sh in1=x1.fq in2=x2.fq out1=y1.fq out2=y2.fq outsingle=singletons.fq qtrim=rl trimq=10 minlength=50</strong><br /> <br /> Subsample 10% of the first 20000 pairs in an interleaved file:<br /> <strong>reformat.sh in=x.fq out=y.fq reads=20000 samplerate=0.1 int=t</strong><br /> (in this case "int=t" overrides interleaving autodetection, to ensure reads are treated as pairs)<br /> <br /> Pipe in a gzipped sam file and pipe out fasta:<br /> <strong>reformat.sh in=stdin.sam.gz out=stdout.fa</strong><br /> <br /> Reverse-complement reads:<br /> <strong>reformat.sh in=x.fq out=y.fq rcomp</strong><br /> <br /> For reformatting a file with very long sequences, Reformat will need more memory; just add the additional flag "-Xmx2g". For example, to change the line-wrapping length on the human genome (which has individual sequences over 200Mbp long) to 70 characters:<br /> <strong>reformat.sh -Xmx2g in=HG19.fa.gz out=HG19_wrapped.fa.gz fastawrap=70</strong><br /> <br /> For additional functions, please run the shellscript with no arguments, or just read it with a text editor. If you have any questions, please post them in this thread.<br /> <br /> For people using a non-bash terminal, you may need to type "bash reformat.sh" instead of just "reformat.sh".<br /> For users of Windows or other platforms that do not support bash shellscripts, replace "reformat.sh" with "java -ea -Xmx200m /path/to/bbmap/current/ jgi.ReformatReads"<br /> for example,<br /> <strong>java -ea -Xmx200m C:\bbmap\current\ jgi.ReformatReads in=x.fq out=y.fa</strong><br /> <br /> Reformat can be downloaded with BBTools here:<br /> <a href="https://sourceforge.net/projects/bbmap/" target="_blank">https://sourceforge.net/projects/bbmap/</a></div>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30680/easybuild</guid>
	<pubDate>Fri, 27 Jan 2017 16:00:43 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30680/easybuild</link>
	<title><![CDATA[EasyBuild]]></title>
	<description><![CDATA[<p><a href="https://github.com/hpcugent/easybuild">EasyBuild</a><span>&nbsp;is a software build and installation framework that allows you to manage (scientific) software on High Performance Computing (HPC) systems in an efficient way.</span><br><span>A full list of supported software packages is available&nbsp;</span><a href="http://easybuild.readthedocs.io/en/latest/version-specific/Supported_software.html">here</a><span>.</span></p><p>Address of the bookmark: <a href="https://hpcugent.github.io/easybuild/" rel="nofollow">https://hpcugent.github.io/easybuild/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34678/svfinder-tool-for-detecting-genomic-rearrangement-form-dna-seq-data</guid>
	<pubDate>Thu, 14 Dec 2017 15:51:40 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34678/svfinder-tool-for-detecting-genomic-rearrangement-form-dna-seq-data</link>
	<title><![CDATA[SVfinder: Tool for detecting genomic rearrangement form DNA-seq data]]></title>
	<description><![CDATA[<p><span>SVfinder provides genome-wide detection of structural variants from next generation paired-end sequencing reads.</span></p><p>Address of the bookmark: <a href="https://github.com/cauyrd/SVfinder" rel="nofollow">https://github.com/cauyrd/SVfinder</a></p>]]></description>
	<dc:creator>Robert M Willioms</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36012/gmol-an-interactive-tool-for-3d-genome-structure-visualization</guid>
	<pubDate>Wed, 21 Mar 2018 12:25:20 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36012/gmol-an-interactive-tool-for-3d-genome-structure-visualization</link>
	<title><![CDATA[GMOL: An Interactive Tool for 3D Genome Structure Visualization]]></title>
	<description><![CDATA[<p><span>GMOL was developed based upon our multi-scale approach that allows a user to scale between six separate levels within the genome. With GMOL, a user can choose any unit at any scale and scale it up or down to visualize its structure and retrieve corresponding genome sequences.</span></p><p>Address of the bookmark: <a href="https://www.nature.com/articles/srep20802" rel="nofollow">https://www.nature.com/articles/srep20802</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>