<?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/38886?offset=550</link>
	<atom:link href="https://bioinformaticsonline.com/related/38886?offset=550" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27328/platanus</guid>
	<pubDate>Fri, 13 May 2016 05:12:40 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27328/platanus</link>
	<title><![CDATA[Platanus]]></title>
	<description><![CDATA[<p>Platanus is a novel <em>de novo</em> sequence assembler that can reconstruct genomic sequences of<br> highly heterozygous diploids from massively parallel shotgun sequencing data.</p>
<p>The latest version is <a href="http://platanus.bio.titech.ac.jp/platanus/?page_id=14">1.2.4</a>.</p>
<p>To cite Platanus, please use the following:</p>
<p>Kajitani R, Toshimoto K, Noguchi H, Toyoda A, Ogura Y, Okuno M, Yabana M, Harada M, Nagayasu E, Maruyama H, Kohara Y, Fujiyama A, Hayashi T, Itoh T, &ldquo;Efficient de novo assembly of highly heterozygous genomes from whole-genome shotgun short reads&rdquo;.&nbsp;Genome Res. 2014 Aug;24(8):1384-95. doi: 10.1101/gr.170720.113. [<a href="http://www.ncbi.nlm.nih.gov/pubmed/24755901">abstract</a> |<a href="http://genome.cshlp.org/content/24/8/1384.long"> full text</a>]</p><p>Address of the bookmark: <a href="http://platanus.bio.titech.ac.jp/" rel="nofollow">http://platanus.bio.titech.ac.jp/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30140/cutadapt</guid>
	<pubDate>Wed, 14 Dec 2016 09:59:52 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30140/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>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&nbsp;<a href="http://dx.doi.org/10.14806/ej.17.1.200">DOI:10.14806/ej.17.1.200</a>&nbsp;.</p>
<p>More at&nbsp;https://github.com/marcelm/cutadapt</p><p>Address of the bookmark: <a href="http://cutadapt.readthedocs.io/en/stable/guide.html" rel="nofollow">http://cutadapt.readthedocs.io/en/stable/guide.html</a></p>]]></description>
	<dc:creator>Bulbul</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/32633/a-post-assembly-genome-improvement-toolkit-pagit-to-obtain-annotated-genomes-from-contigs</guid>
	<pubDate>Fri, 12 May 2017 10:50:29 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32633/a-post-assembly-genome-improvement-toolkit-pagit-to-obtain-annotated-genomes-from-contigs</link>
	<title><![CDATA[A Post-assembly genome-improvement toolkit (PAGIT) to obtain annotated genomes from contigs]]></title>
	<description><![CDATA[<p>PAGIT addresses the need for software to generate high quality draft genomes. It is based on a series of programs that we developed:</p>
<p><a href="https://sourceforge.net/projects/abacas/files/">ABACAS</a>, that is able to contiguate contigs from a de novo assembly against a closely related reference.</p>
<p><a href="https://sourceforge.net/projects/image2/files/">IMAGE</a>, an iterative approach for closing gaps in assembled genomes using mate pair information. It is able to close gaps left open by the assembler in a draft genome, even when using the same data sets as used by the original assembler.</p>
<p><a href="http://icorn.sourceforge.net/">iCORN</a>, that enables errors in the consensus sequence to be corrected by iteratively mapping reads to the current assembly. An improved version, especially correction Pacfic Bioscience assemblies (PacBio) can be found&nbsp;<a href="ftp://ftp.sanger.ac.uk/pub4/resources/software/pagit/ICORN2/icorn2.V0.95.tgz">here</a>.</p>
<p><a href="https://ratt.svn.sourceforge.net/svnroot/ratt">RATT</a>, a tool to transfer the annotation from a reference genome, or an earlier assembly, onto the latest assembly.</p>
<p>PAGIT bundles these software and makes them more accessible for users.</p><p>Address of the bookmark: <a href="http://www.sanger.ac.uk/science/tools/pagit" rel="nofollow">http://www.sanger.ac.uk/science/tools/pagit</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/35540/hinge-long-read-assembly-achieves-optimal-repeat-resolution</guid>
	<pubDate>Wed, 07 Feb 2018 09:40:22 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/35540/hinge-long-read-assembly-achieves-optimal-repeat-resolution</link>
	<title><![CDATA[HINGE: Long-Read Assembly Achieves Optimal Repeat Resolution]]></title>
	<description><![CDATA[<p>Software accompanying "HINGE: Long-Read Assembly Achieves Optimal Repeat Resolution"</p>
<ul>
<li>
<p>Preprint:&nbsp;<a href="http://biorxiv.org/content/early/2016/08/01/062117">http://biorxiv.org/content/early/2016/08/01/062117</a></p>
</li>
<li>
<p>Paper:&nbsp;<a href="http://genome.cshlp.org/content/27/5/747.full">http://genome.cshlp.org/content/27/5/747.full</a></p>
</li>
<li>
<p>An ipython notebook to reproduce results in the paper can be found in this&nbsp;<a href="https://github.com/govinda-kamath/HINGE-analyses">repository</a>.</p>
</li>
</ul>
<p>HINGE is an OLC(Overlap-Layout-Consensus) assembler. The idea of the pipeline is shown below.</p>
<p><a href="https://github.com/HingeAssembler/HINGE/blob/master/misc/High_level_overview.png" target="_blank"><img src="https://github.com/HingeAssembler/HINGE/raw/master/misc/High_level_overview.png" alt="image" style="border: 0px;"></a></p><p>Address of the bookmark: <a href="https://github.com/HingeAssembler/HINGE" rel="nofollow">https://github.com/HingeAssembler/HINGE</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/42626/spades-team-announce-new-version-spades-v315</guid>
	<pubDate>Fri, 15 Jan 2021 10:24:27 -0600</pubDate>
	<link>https://bioinformaticsonline.com/news/view/42626/spades-team-announce-new-version-spades-v315</link>
	<title><![CDATA[SPADes team announce new version SPADes v3.15]]></title>
	<description><![CDATA[<p>New SPAdes 3.15.0.0. announced by the SPADes team This release includes such new features as:&nbsp;<br />- CoronaSPAdes pipeline for the assembly of transcriptomic and metatranscriptomic data of full-length coronaviridae genomes;&nbsp;<br />- Meta-Viral and RNA-Viral pipelines for metagenomic and metatranscriptomic data defining viral genomes;&nbsp;<br />-New trusted contiguous use algorithm;&nbsp;<br />-Switched to the memory allocator mimalloc;&nbsp;<br />- PlasmidSPAdes and bgcSPAdes are now provided as an input assembly graph;&nbsp;<br />- Important improvements and corrections to the metaplasmid pipeline;&nbsp;<br />- Multiple performance improvements in procedures for simplification and repeat resolving.&nbsp;<br />Please, consider updating.</p><p>Check out more at&nbsp;https://cab.spbu.ru/software/spades/</p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44559/metagraph-ultra-scalable-framework-for-dna-search-alignment-assembly</guid>
	<pubDate>Sat, 08 Jun 2024 16:15:25 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44559/metagraph-ultra-scalable-framework-for-dna-search-alignment-assembly</link>
	<title><![CDATA[MetaGraph: Ultra Scalable Framework for DNA Search, Alignment, Assembly]]></title>
	<description><![CDATA[<p><span>The MetaGraph framework</span><span>&nbsp;is designed to work with a wide range of input data sets, indexing from a few samples up to the contents of entire archives with hundreds of thousands of records. The indexing workflow always follows the same principle, transforming single input samples into error-removed, refined sample graphs, which are then merged into a joint metagraph index. Each input sample is annotated in the joint index as a subgraph. This graph index enriched with metadata can then be used for downstream applications such as&nbsp;</span><a href="https://metagraph.ethz.ch/#query">sequence search</a><span>&nbsp;or&nbsp;</span><a href="https://metagraph.ethz.ch/#assembly">differential assembly</a><span>.</span></p>
<p><span>Searcg link&nbsp;https://metagraph.ethz.ch/search&nbsp;</span></p>
<p><span>Pre-print&nbsp;https://www.biorxiv.org/content/10.1101/2020.10.01.322164v4&nbsp;</span></p><p>Address of the bookmark: <a href="https://metagraph.ethz.ch/" rel="nofollow">https://metagraph.ethz.ch/</a></p>]]></description>
	<dc:creator>Abhi</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42033/seastar-systematic-evaluation-of-alternative-start-site-in-rna</guid>
	<pubDate>Thu, 13 Aug 2020 09:54:27 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42033/seastar-systematic-evaluation-of-alternative-start-site-in-rna</link>
	<title><![CDATA[SEASTAR: Systematic Evaluation of Alternative STArt site in RNA]]></title>
	<description><![CDATA[<p>SEASTAR (Systematic Evaluation of Alternative STArt site in RNA) is a software package for Transcription Start Site (TSS) identification and quantification using only RNA-seq data. It assembles novel TSSs based only on RNA-Seq data and merges them with known TSSs from a public database. This package enables high-quality TSS identification that is comparable to the highly sophisticated CAGE technology. This package is particularly useful for finding novel TSSs that contribute to transcriptome complexity along with identifying differential promoter utilization.</p>
<p>version 1.0.0 - updates several descriptions and tests. To achieve v0.9.4, one can visit&nbsp;<a href="https://github.com/zhyqin/SEASTAR-0.9.4">https://github.com/zhyqin/SEASTAR-0.9.4</a>&nbsp;for download.</p><p>Address of the bookmark: <a href="https://github.com/Xinglab/SEASTAR" rel="nofollow">https://github.com/Xinglab/SEASTAR</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/33960/mgra-breakpoint-graphs-and-ancestral-genome-reconstructions</guid>
	<pubDate>Tue, 25 Jul 2017 08:48:25 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/33960/mgra-breakpoint-graphs-and-ancestral-genome-reconstructions</link>
	<title><![CDATA[MGRA: Breakpoint graphs and ancestral genome reconstructions]]></title>
	<description><![CDATA[<p>MGRA (Multiple Genome Rearrangements and Ancestors) is a tool for reconstruction of ancestor genomes and evolutionary history of extant genomes.</p>
<p>It takes as an input a set of genomes represented as sequences of genes (or synteny blocks) and produces such sequences for ancestral genomes at the internal nodes of the phylogenetic tree.</p>
<p>The phylogenetic tree may be also specified completely or partially, in the latter case MGRA can reconstruct conserved ancestral regions (CARs) of the ancestral genome of interest.</p>
<p>Since version 2 MGRA supports gene insertion and deletions in addition to genome rearrangements and allows the input genomes to have different gene content.</p>
<p>It also can reconstruct most plausible phylogenetic tree based on the rearrangement characters.</p><p>Address of the bookmark: <a href="http://mgra.cblab.org/" rel="nofollow">http://mgra.cblab.org/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34377/genomicus-genome-browser-that-enables-users-to-navigate-in-genomes-in-several-dimensions</guid>
	<pubDate>Sat, 18 Nov 2017 16:10:16 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34377/genomicus-genome-browser-that-enables-users-to-navigate-in-genomes-in-several-dimensions</link>
	<title><![CDATA[Genomicus: genome browser that enables users to navigate in genomes in several dimensions]]></title>
	<description><![CDATA[<p>Genomicus is a genome browser that enables users to navigate in genomes in several dimensions: linearly along chromosome axes, transversaly across different species, and chronologicaly along evolutionary time.</p>
<p>Once a query gene has been entered, it is displayed in its genomic context in parallel to the genomic context of all its orthologous and paralogous copies in all the other sequenced metazoan genomes. Moreover, Genomicus stores and displays the predicted ancestral genome structure in all the ancestral species within the phylogenetic range of interest.</p>
<p>All the data on extant species displayed in this browser are from&nbsp;<a href="http://www.ensembl.org/">Ensembl</a>.</p><p>Address of the bookmark: <a href="http://genomicus.biologie.ens.fr/genomicus-90.01/cgi-bin/search.pl" rel="nofollow">http://genomicus.biologie.ens.fr/genomicus-90.01/cgi-bin/search.pl</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34567/jobtree-based-python-wrapper-to-run-the-genome-simulation-tool-suite-evolver</guid>
	<pubDate>Fri, 08 Dec 2017 16:26:32 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34567/jobtree-based-python-wrapper-to-run-the-genome-simulation-tool-suite-evolver</link>
	<title><![CDATA[jobTree based python wrapper to run the genome simulation tool suite Evolver]]></title>
	<description><![CDATA[<p><span>evolverSimControl</span><span>&nbsp;(</span><span>eSC</span><span>) can be used to simulate multi-chromosome genome evolution on an arbitrary phylogeny (</span><a href="http://evolution.genetics.washington.edu/phylip/newicktree.html">Newick format</a><span>). In addition to simply running evolver,&nbsp;</span><span>eSC</span><span>&nbsp;also automatically creates statistical summaries of the simulation as it runs including text and image files. Also included are convenience scripts to: check on a running simulation and see detailed status and logging information; extract fasta sequence files from the leaf nodes of a completed simulation; extract pairwise multiple alignment files (</span><a href="http://genome.ucsc.edu/FAQ/FAQformat.html#format5">.maf</a><span>) from leaf and branch nodes from a completed simulation and with the help of&nbsp;</span><a href="https://github.com/dentearl/mafTools/">mafJoin</a><span>, join them together into a single maf covering the entire simulation.</span></p><p>Address of the bookmark: <a href="https://github.com/dentearl/evolverSimControl" rel="nofollow">https://github.com/dentearl/evolverSimControl</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>