<?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/38304?offset=450</link>
	<atom:link href="https://bioinformaticsonline.com/related/38304?offset=450" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34404/sima-c-implementation-simultaneous-multiple-alignment-of-lcms-peak-lists</guid>
	<pubDate>Thu, 23 Nov 2017 17:15:52 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34404/sima-c-implementation-simultaneous-multiple-alignment-of-lcms-peak-lists</link>
	<title><![CDATA[SIMA C++ Implementation: Simultaneous Multiple Alignment of LC/MS Peak Lists]]></title>
	<description><![CDATA[<p style="text-align: justify;">This is the c++ implementation for SIMA - Simultaneous Multiple Alignment of LC/MS Peak Lists. The package contains C++ source code as well as two binary files. The latter were tested under various operating systems, including Windows XP SP3 32bit, Windows Vista 32bit, Windows 2008 Server, Windows 7 32bit and 64bit, Ubuntu 10.04 64bit, Ubuntu 10.10 64bit, and gentoo AMD64.</p>
<p style="text-align: justify;">The corresponding publication can be found here:</p>
<p style="text-align: justify;">B. Voss*, M. Hanselmann*, B.Y. Renard, M.S. Lindner, U. K&ouml;the, M. Kirchner, F.A. Hamprecht (2011). SIMA: Simultaneous Muliple Alignment of LC/MS Peak Lists, Bioinformatics 27(7):987-993.&nbsp;<a href="http://dx.doi.org/10.1093/bioinformatics/btr051">[doi]</a>&nbsp;<a href="https://hciweb.iwr.uni-heidelberg.de/sites/default/files/node/files/517307327/hanselmann_11_sima.pdf">[techreport]</a></p><p>Address of the bookmark: <a href="https://hciweb.iwr.uni-heidelberg.de/hci/softwares/sima" rel="nofollow">https://hciweb.iwr.uni-heidelberg.de/hci/softwares/sima</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43859/mumco-is-a-simple-bash-script-that-uses-whole-genome-alignment-information-provided-by-mummer-v4-to-detect-variants</guid>
	<pubDate>Wed, 27 Apr 2022 04:34:12 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43859/mumco-is-a-simple-bash-script-that-uses-whole-genome-alignment-information-provided-by-mummer-v4-to-detect-variants</link>
	<title><![CDATA[MUM&amp;Co is a simple bash script that uses Whole Genome Alignment information provided by MUMmer (v4) to detect variants.]]></title>
	<description><![CDATA[<p dir="auto">MUM&amp;Co is able to detect:<br>Deletions, insertions, tandem duplications and tandem contractions (&gt;=50bp &amp; &lt;=150kb)<br>Inversions (&gt;=1kb) and translocations (&gt;=10kb)</p><p>Address of the bookmark: <a href="https://github.com/SAMtoBAM/MUMandCo" rel="nofollow">https://github.com/SAMtoBAM/MUMandCo</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/35400/zpicture-a-dynamic-blastz-alignment-visualization</guid>
	<pubDate>Tue, 30 Jan 2018 16:03:08 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/35400/zpicture-a-dynamic-blastz-alignment-visualization</link>
	<title><![CDATA[zPicture: A dynamic blastz alignment visualization]]></title>
	<description><![CDATA[<p><span>zPicture is a dynamic alignment and&nbsp;</span><span>visualization</span><span>&nbsp;tool that is based on blastz alignment program utilized by PipMaker. zPicture alignments can be automatically submitted to rVista 2.0 to identify conserved transcription factor binding sites.</span></p><p>Address of the bookmark: <a href="https://zpicture.dcode.org/" rel="nofollow">https://zpicture.dcode.org/</a></p>]]></description>
	<dc:creator>Archana Malhotra</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36935/assemblytics-delta-file-to-analyze-alignments-of-an-assembly-to-another-assembly-or-a-reference-genome</guid>
	<pubDate>Thu, 14 Jun 2018 07:31:00 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36935/assemblytics-delta-file-to-analyze-alignments-of-an-assembly-to-another-assembly-or-a-reference-genome</link>
	<title><![CDATA[assemblytics: delta file to analyze alignments of an assembly to another assembly or a reference genome]]></title>
	<description><![CDATA[Download and install MUMmer
Align your assembly to a reference genome using nucmer (from MUMmer package)
$ nucmer -maxmatch -l 100 -c 500 REFERENCE.fa ASSEMBLY.fa -prefix OUT
Consult the MUMmer manual if you encounter problems

Optional: Gzip the delta file to speed up upload (usually 2-4X faster)
$ gzip OUT.delta
Then use the OUT.delta.gz file for upload.
Upload the .delta or delta.gz file (view example) to Assemblytics
Important: Use only contigs rather than scaffolds from the assembly. This will prevent false positives when the number of Ns in the scaffolded sequence does not match perfectly to the distance in the reference.

The unique sequence length required represents an anchor for determining if a sequence is unique enough to safely call variants from, which is an alternative to the mapping quality filter for read alignment.

http://assemblytics.com/<p>Address of the bookmark: <a href="http://assemblytics.com/" rel="nofollow">http://assemblytics.com/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/39837/cactus-a-reference-free-whole-genome-multiple-alignment-program</guid>
	<pubDate>Mon, 12 Aug 2019 07:52:33 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/39837/cactus-a-reference-free-whole-genome-multiple-alignment-program</link>
	<title><![CDATA[Cactus: a reference-free whole-genome multiple alignment program]]></title>
	<description><![CDATA[<p>Cactus is a reference-free whole-genome multiple alignment program. The principal algorithms are described here:&nbsp;<a href="https://doi.org/10.1101/gr.123356.111">https://doi.org/10.1101/gr.123356.111</a></p>
<p><span>Cactus uses substantial resources. For primate-sized genomes (3 gigabases each), you should expect Cactus to use approximately 120 CPU-days of compute per genome, with about 120 GB of RAM used at peak. The requirements scale roughly quadratically, so aligning two 1-megabase bacterial genomes takes only 1.5 CPU-hours and 14 GB RAM.</span>&nbsp;</p><p>Address of the bookmark: <a href="https://github.com/ComparativeGenomicsToolkit/cactus" rel="nofollow">https://github.com/ComparativeGenomicsToolkit/cactus</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41910/the-wavefront-alignment-wfa-algorithm</guid>
	<pubDate>Sun, 28 Jun 2020 10:17:50 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41910/the-wavefront-alignment-wfa-algorithm</link>
	<title><![CDATA[The wavefront alignment (WFA) algorithm]]></title>
	<description><![CDATA[<p><span>The wavefront alignment (WFA) algorithm is an exact gap-affine algorithm that takes advantage of</span><br><span>homologous regions between the sequences to accelerate the alignment process. As opposed to traditional dynamic programming algorithms that run in quadratic time, the WFA runs in time O(ns), proportional to the read length n and the alignment score s, using O(s^2) memory. Moreover, the WFA exhibits simple data dependencies that can be easily vectorized, even by the automatic features of modern compilers, for different architectures, without the need to adapt the code.</span></p><p>Address of the bookmark: <a href="https://github.com/smarco/WFA" rel="nofollow">https://github.com/smarco/WFA</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34420/rita-rapid-identification-of-high-confidence-taxonomic-assignments-for-metagenomic-data</guid>
	<pubDate>Mon, 27 Nov 2017 08:25:33 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34420/rita-rapid-identification-of-high-confidence-taxonomic-assignments-for-metagenomic-data</link>
	<title><![CDATA[RITA: Rapid identification of high-confidence taxonomic assignments for metagenomic data]]></title>
	<description><![CDATA[<p>RITA is a standalone software package and Web server for taxonomic assignment of metagenomic sequence reads. By combining homology predictions from BLAST or UBLAST with compositional classifications from a Naive Bayes classifier, RITA is able to achieve very high accuracy on short reads. Unlike other hybrid approaches which combine these predictions for all sequences to be classified, RITA uses a pipeline to first identify cases where both types of classifier are in agreement, which constitute the highest-confidence set. Sequences not classified in this manner are subjected to a series of downstream classification steps.</p>
<p>This work has been accepted for publication:</p>
<p>MacDonald NJ, Parks DH, and Beiko RG. Rapid identification of taxonomic assignments. Accepted to&nbsp;<em>Nucleic Acids Research</em>&nbsp;April 4, 2012.</p>
<p>If you have any questions or bug reports, please let us know at &lt;beiko@cs.dal.ca&gt;.</p><p>Address of the bookmark: <a href="http://kiwi.cs.dal.ca/Software/RITA" rel="nofollow">http://kiwi.cs.dal.ca/Software/RITA</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/35272/biocircosjs-is-an-open-source-interactive-javascript-library-to-interactive-display-biological-data-on-the-web</guid>
	<pubDate>Fri, 19 Jan 2018 15:03:51 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/35272/biocircosjs-is-an-open-source-interactive-javascript-library-to-interactive-display-biological-data-on-the-web</link>
	<title><![CDATA[BioCircos.js is an open source interactive Javascript library to interactive display biological data on the web]]></title>
	<description><![CDATA[<p><a href="http://bioinfo.ibp.ac.cn/biocircos/index.php">BioCircos.js</a>&nbsp;is an open source interactive&nbsp;<code>Javascript</code>&nbsp;library which provides an easy way to interactive display biological data on the web. It implements a raster-based&nbsp;<code>SVG</code>&nbsp;visualization using the open source Javascript framework jquery.js. BioCircos.js is multiplatform and works in all major internet browsers (<strong>Internet Explorer</strong>,&nbsp;<strong>Mozilla Firefox</strong>,&nbsp;<strong>Google Chrome</strong>,&nbsp;<strong>Safari</strong>,&nbsp;<strong>Opera</strong>). Its speed is determined by the client&rsquo;s hardware and internet browser. For smoothest user experience, we recommend&nbsp;<strong>Google Chrome</strong>.</p>
<p>BioCircos.js provides&nbsp;<strong>SNP</strong>,&nbsp;<strong>CNV</strong>,&nbsp;<strong>HEATMAP</strong>,&nbsp;<strong>LINK</strong>,&nbsp;<strong>LINE</strong>,&nbsp;<strong>SCATTER</strong>,&nbsp;<strong>ARC</strong>,&nbsp;<strong>TEXT</strong>, and&nbsp;<strong>HISTGRAM</strong>modules to display genome-wide genetic variations (SNPs, CNVs and chromosome rearrangement), gene expression and biomolecule interactions. BioCircos.js also provides&nbsp;<strong>BACKGROUND</strong>&nbsp;module to display background and axis circles. Tooltips showing detailed information of SVG elements are also provided.</p>
<p><a href="http://bioinfo.ibp.ac.cn/biocircos/document/demo/pages/paper01.html">Demo</a></p><p>Address of the bookmark: <a href="http://bioinfo.ibp.ac.cn/biocircos/document/index.html" rel="nofollow">http://bioinfo.ibp.ac.cn/biocircos/document/index.html</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37205/afterqc-automatic-filtering-trimming-error-removing-and-quality-control-for-fastq-data</guid>
	<pubDate>Fri, 29 Jun 2018 03:26:03 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37205/afterqc-automatic-filtering-trimming-error-removing-and-quality-control-for-fastq-data</link>
	<title><![CDATA[AfterQC: Automatic Filtering, Trimming, Error Removing and Quality Control for fastq data]]></title>
	<description><![CDATA[Automatic Filtering, Trimming, Error Removing and Quality Control for fastq data
AfterQC can simply go through all fastq files in a folder and then output three folders: good, bad and QC folders, which contains good reads, bad reads and the QC results of each fastq file/pair.
Currently it supports processing data from HiSeq 2000/2500/3000/4000, Nextseq 500/550, MiniSeq...and other Illumina 1.8 or newer formats

The author has reimplemented this tool in C++ with multithreading support to make it much faster. The new tool is called fastp and can be found at: https://github.com/OpenGene/fastp . If you prefer a C++ based tool, please use fastp instead.

https://github.com/OpenGene/AfterQC<p>Address of the bookmark: <a href="https://github.com/OpenGene/AfterQC" rel="nofollow">https://github.com/OpenGene/AfterQC</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40546/clincnv-detection-of-copy-number-changes-in-germlinetriosomatic-contexts-in-ngs-data</guid>
	<pubDate>Thu, 16 Jan 2020 23:16:02 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40546/clincnv-detection-of-copy-number-changes-in-germlinetriosomatic-contexts-in-ngs-data</link>
	<title><![CDATA[ClinCNV: Detection of copy number changes in Germline/Trio/Somatic contexts in NGS data]]></title>
	<description><![CDATA[<p><span>ClinCNV detects CNVs in germline and somatic context in NGS data (targeted and whole-genome). We work in cohorts, so it makes sense to try&nbsp;</span><code>ClinCNV</code><span>&nbsp;if you have more than 10 samples (recommended amount - 40 since we estimate variances from the data). By "cohort" we mean samples sequenced with the same enrichment kit with approximately the same depth (ie 1x WGS and 30x WGS better be analysed in separate runs of ClinCNV). Of course it is better if your samples were sequenced within the same sequencing facility.</span></p><p>Address of the bookmark: <a href="https://github.com/imgag/ClinCNV" rel="nofollow">https://github.com/imgag/ClinCNV</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>

</channel>
</rss>