<?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/44599?offset=10</link>
	<atom:link href="https://bioinformaticsonline.com/related/44599?offset=10" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37957/base-a-practical-de-novo-assembler-for-large-genomes-using-long-ngs-reads</guid>
	<pubDate>Fri, 19 Oct 2018 07:25:21 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37957/base-a-practical-de-novo-assembler-for-large-genomes-using-long-ngs-reads</link>
	<title><![CDATA[BASE: a practical de novo assembler for large genomes using long NGS reads]]></title>
	<description><![CDATA[<p><span>new&nbsp;</span><em>de novo</em><span>&nbsp;assembler called BASE. It enhances the classic seed-extension approach by indexing the reads efficiently to generate adaptive seeds that have high probability to appear uniquely in the genome. Such seeds form the basis for BASE to build extension trees and then to use reverse validation to remove the branches based on read coverage and paired-end information, resulting in high-quality consensus sequences of reads sharing the seeds. Such consensus sequences are then extended to contigs.</span></p><p>Address of the bookmark: <a href="https://github.com/dhlbh/BASE" rel="nofollow">https://github.com/dhlbh/BASE</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/39867/gepard-allows-the-calculation-of-dotplots-even-for-large-sequences-like-chromosomes-or-bacterial-genomes</guid>
	<pubDate>Mon, 26 Aug 2019 11:38:30 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/39867/gepard-allows-the-calculation-of-dotplots-even-for-large-sequences-like-chromosomes-or-bacterial-genomes</link>
	<title><![CDATA[Gepard: allows the calculation of dotplots even for large sequences like chromosomes or bacterial genomes]]></title>
	<description><![CDATA[<p>Gepard (German: "cheetah", Backronym for "GEnome PAir - Rapid Dotter") allows the calculation of dotplots even for large sequences like chromosomes or bacterial genomes. Reference: Krumsiek J, Arnold R, Rattei T. Gepard: A rapid and sensitive tool for creating dotplots on genome scale. Bioinformatics 2007; 23(8): 1026-8. PMID:&nbsp;<a href="http://www.ncbi.nlm.nih.gov/pubmed/17309896" target="_blank">17309896</a></p>
<p><a href="http://cube.univie.ac.at/gepard">http://cube.univie.ac.at/gepard</a></p><p>Address of the bookmark: <a href="https://github.com/univieCUBE/gepard" rel="nofollow">https://github.com/univieCUBE/gepard</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40715/mutatrix-a-population-genome-simulator-which-generates-simulated-genomes</guid>
	<pubDate>Tue, 28 Jan 2020 04:06:58 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40715/mutatrix-a-population-genome-simulator-which-generates-simulated-genomes</link>
	<title><![CDATA[mutatrix: a population genome simulator which generates simulated genomes.]]></title>
	<description><![CDATA[<p><span>genome simulation across a population with zeta-distributed allele frequency, snps, insertions, deletions, and multi-nucleotide polymorphisms</span></p>
<p><span>More at&nbsp;<a href="https://github.com/ekg/mutatrix">https://github.com/ekg/mutatrix</a></span></p>
<pre>./mutatrix -S sample -P test/ -p 2 -n 10 reference.fasta</pre><p>Address of the bookmark: <a href="https://github.com/ekg/mutatrix" rel="nofollow">https://github.com/ekg/mutatrix</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42941/csa-a-high-throughput-chromosome-scale-assembly-pipeline-for-vertebrate-genomes</guid>
	<pubDate>Wed, 10 Mar 2021 06:13:49 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42941/csa-a-high-throughput-chromosome-scale-assembly-pipeline-for-vertebrate-genomes</link>
	<title><![CDATA[CSA: A high-throughput chromosome-scale assembly pipeline for vertebrate genomes]]></title>
	<description><![CDATA[<p>The pipeline can use information from scaffolded assemblies (for example from HiC or 10X Genomics), or even from diverged (~65-100 Mya) reference genomes for ordering the contigs and thus support the assembly process. This typically results in improved contig N50 when compared to current state of the art methods.</p>
<p><img src="https://github.com/HMPNK/CSA2.6/raw/master/Fig1.png" alt="image" style="border: 0px;"></p>
<p>For smaller vertebrate genomes (~1 Gbp) chromosome scale assemblies can be achieved within 12h on high-end Desktop computers (Intel i7, 12 CPU threads, 128 GB RAM). Larger mammalian genomes (~3Gbp) can be processed within 15-18 h on server equipment (Xeon, 96 CPU threads, 1TB RAM).</p><p>Address of the bookmark: <a href="https://github.com/HMPNK/CSA2.6" rel="nofollow">https://github.com/HMPNK/CSA2.6</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42357/irscope-an-online-program-to-visualize-the-junction-sites-of-chloroplast-genomes</guid>
	<pubDate>Wed, 25 Nov 2020 19:44:46 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42357/irscope-an-online-program-to-visualize-the-junction-sites-of-chloroplast-genomes</link>
	<title><![CDATA[IRscope: an online program to visualize the junction sites of chloroplast genomes]]></title>
	<description><![CDATA[<p><span>eMPRess, a software program for phylogenetic tree reconciliation under the duplication-transfer-loss model that systematically addresses the problems of choosing event costs and selecting representative solutions, enabling users to make more robust inferences.</span></p><p>Address of the bookmark: <a href="https://sites.google.com/g.hmc.edu/empress/home" rel="nofollow">https://sites.google.com/g.hmc.edu/empress/home</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44318/proksee-in-depth-characterization-and-visualization-of-bacterial-genomes</guid>
	<pubDate>Tue, 09 May 2023 19:38:52 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44318/proksee-in-depth-characterization-and-visualization-of-bacterial-genomes</link>
	<title><![CDATA[Proksee: in-depth characterization and visualization of bacterial genomes]]></title>
	<description><![CDATA[<p><span>Proksee is an expert system for genome assembly, annotation and visualization. To begin using Proksee, provide a complete genome sequence, sequencing reads or a CGView/Proksee map JSON file.</span></p><p>Address of the bookmark: <a href="https://proksee.ca/" rel="nofollow">https://proksee.ca/</a></p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44768/tritex-a-computational-pipeline-for-chromosome-scale-assembly-of-plant-genomes</guid>
	<pubDate>Fri, 14 Feb 2025 10:53:48 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44768/tritex-a-computational-pipeline-for-chromosome-scale-assembly-of-plant-genomes</link>
	<title><![CDATA[TRITEX, a computational pipeline for chromosome-scale assembly of plant genomes]]></title>
	<description><![CDATA[<p><span>This is the documentation of TRITEX, a computational pipeline for chromosome-scale assembly of plant genomes. It was developed in the research group Domestication Genomics at the Leibniz Institute of Plant Genetics and Crop Research (IPK) Gatersleben.</span></p><p>Address of the bookmark: <a href="https://tritexassembly.bitbucket.io/" rel="nofollow">https://tritexassembly.bitbucket.io/</a></p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/videolist/watch/3925/genome-annotation</guid>
	<pubDate>Sun, 25 Aug 2013 10:53:01 -0500</pubDate>
	<link>https://bioinformaticsonline.com/videolist/watch/3925/genome-annotation</link>
	<title><![CDATA[Genome Annotation]]></title>
	<description><![CDATA[<iframe width="" height="" src="https://www.youtube-nocookie.com/embed/on4TMnuYTaU" frameborder="0" allowfullscreen></iframe>Dr. Rob Edwards describes some of the problems, challenges, and approches in genome annotation, with a particular emphasis on how the Fellowship for the Interpretation of Genomes (FIG) developed subsystems using the SEED database available at http://www.theseed.org/]]></description>
	
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/32868/pollux-platform-independent-error-correction-of-single-and-mixed-genomes</guid>
	<pubDate>Fri, 19 May 2017 09:41:27 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32868/pollux-platform-independent-error-correction-of-single-and-mixed-genomes</link>
	<title><![CDATA[Pollux: platform independent error correction of single and mixed genomes]]></title>
	<description><![CDATA[<p><span>Pollux: General-purpose error corrector that corrects errors introduced by Illumina, Ion Torrent, and Roche 454 sequencing technologies and can be applied to single- or mixed-genome data. In addition to correcting substitution errors, we locate and correct insertion, deletion, and homopolymer errors while remaining sensitive to low coverage areas of sequencing projects. Using published data sets, we correct 94% of Illumina MiSeq errors, 88% of Ion Torrent PGM errors, 85% of Roche 454 GS Junior errors. Introduced errors are 20 to 70 times more rare than successfully corrected errors. Furthermore, we show that the quality of assemblies improves when reads are corrected by our software.</span></p>
<p><span>https://bmcbioinformatics.biomedcentral.com/articles/10.1186/s12859-014-0435-6</span></p><p>Address of the bookmark: <a href="https://github.com/emarinier/pollux" rel="nofollow">https://github.com/emarinier/pollux</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36597/gappadder-a-sensitive-approach-for-closing-gaps-on-draft-genomes-with-short-sequence-reads</guid>
	<pubDate>Mon, 14 May 2018 05:25:48 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36597/gappadder-a-sensitive-approach-for-closing-gaps-on-draft-genomes-with-short-sequence-reads</link>
	<title><![CDATA[GAPPadder: A Sensitive Approach for Closing Gaps on Draft Genomes with Short Sequence Reads]]></title>
	<description><![CDATA[<p><span>This software is provided ``as is&rdquo; without warranty of any kind. In no event shall the author be held responsible for any damage resulting from the use of this software. The program package, including source codes, executables, and this documentation, is distributed free of charge. If you use this program in a publication, please cite the following reference:</span><br><span>Chong Chu, Xin Li, and Yufeng Wu. "GAPPadder: A Sensitive Approach for Closing Gaps on Draft Genomes with Short Sequence Reads." bioRxiv (2017): 125534.</span></p><p>Address of the bookmark: <a href="https://github.com/Reedwarbler/GAPPadder" rel="nofollow">https://github.com/Reedwarbler/GAPPadder</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>