<?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/34704?offset=10</link>
	<atom:link href="https://bioinformaticsonline.com/related/34704?offset=10" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37574/simlord-a-read-simulator-for-third-generation-sequencing-reads</guid>
	<pubDate>Wed, 22 Aug 2018 10:40:27 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37574/simlord-a-read-simulator-for-third-generation-sequencing-reads</link>
	<title><![CDATA[SimLoRD: A read simulator for third generation sequencing reads]]></title>
	<description><![CDATA[<p>SimLoRD is a read simulator for third generation sequencing reads and is currently focused on the Pacific Biosciences SMRT error model.</p>
<p>Reads are simulated from both strands of a provided or randomly generated reference sequence.</p>
<div id="rst-header-features">
<ul>
<li>The reference can be read from a FASTA file or randomly generated with a given GC content. It can consist of several chromosomes, whose structure is respected when drawing reads. (Simulation of genome rearrangements may be incorporated at a later stage.)</li>
<li>The read lengths can be determined in four ways: drawing from a log-normal distribution (typical for genomic DNA), sampling from an existing FASTQ file (typical for RNA), sampling from a a text file with integers (RNA), or using a fixed length</li>
<li>Quality values and number of passes depend on fragment length.</li>
<li>Provided subread error probabilities are modified according to number of passes</li>
<li>Outputs reads in FASTQ format and alignments in SAM format</li>
</ul>
</div><p>Address of the bookmark: <a href="https://bitbucket.org/genomeinformatics/simlord/" rel="nofollow">https://bitbucket.org/genomeinformatics/simlord/</a></p>]]></description>
	<dc:creator>Aaryan Lokwani</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30831/fsa-fast-statistical-alignment</guid>
	<pubDate>Mon, 06 Feb 2017 04:26:01 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30831/fsa-fast-statistical-alignment</link>
	<title><![CDATA[FSA: Fast Statistical Alignment]]></title>
	<description><![CDATA[<p><span>FSA is a probabilistic multiple sequence alignment algorithm which uses a "distance-based" approach to aligning homologous protein, RNA or DNA sequences. Much as distance-based phylogenetic reconstruction methods like Neighbor-Joining build a phylogeny using only pairwise divergence estimates, FSA builds a multiple alignment using only pairwise estimations of homology. This is made possible by the sequence annealing technique for constructing a multiple alignment from pairwise comparisons, developed by Ariel Schwartz in&nbsp;</span><a href="http://www.eecs.berkeley.edu/Pubs/TechRpts/2007/EECS-2007-39.html">"Posterior Decoding Methods for Optimization and Control of Multiple Alignments</a><span>."</span></p>
<p>FSA brings the high accuracies previously available only for small-scale analyses of proteins or RNAs to large-scale problems such as aligning thousands of sequences or megabase-long sequences. FSA introduces several novel methods for constructing better alignments:</p>
<ul>
<li>FSA uses machine-learning techniques to estimate gap and substitution parameters on the fly for each set of input sequences. This "query-specific learning" alignment method makes FSA very robust: it can produce superior alignments of sets of homologous sequences which are subject to very different evolutionary constraints.</li>
<li>FSA is capable of aligning hundreds or even thousands of sequences using a randomized inference algorithm to reduce the computational cost of multiple alignment. This randomized inference can be over ten times faster than a direct approach with little loss of accuracy.</li>
<li>FSA can quickly align very long sequences using the "anchor annealing" technique for resolving anchors and projecting them with transitive anchoring. It then stitches together the alignment between the anchors using the methods described above.</li>
<li>The included GUI, MAD (Multiple Alignment Display), can display the intermediate alignments produced by FSA, where each character is colored according to the probability that it is correctly aligned (see the picture and&nbsp;<a href="http://fsa.sourceforge.net/images/Suchard_SIV.fsa.mov">movie</a>&nbsp;at the top of the page).</li>
</ul>
<p><span>You can see more information on the&nbsp;</span><a href="http://fsa.sourceforge.net/FAQ.html">FAQ</a><span>.&nbsp;</span></p>
<p>&nbsp;</p><p>Address of the bookmark: <a href="http://fsa.sourceforge.net/" rel="nofollow">http://fsa.sourceforge.net/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41991/sequence-ontology-bioinformatics-analysis-soba-tool-to-provide-a-simple-statistical-and-graphical-summary-of-an-annotated-genome</guid>
	<pubDate>Wed, 22 Jul 2020 10:11:13 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41991/sequence-ontology-bioinformatics-analysis-soba-tool-to-provide-a-simple-statistical-and-graphical-summary-of-an-annotated-genome</link>
	<title><![CDATA[Sequence Ontology Bioinformatics Analysis (SOBA) tool to provide a simple statistical and graphical summary of an annotated genome]]></title>
	<description><![CDATA[<p><span>We have developed the Sequence Ontology Bioinformatics Analysis (SOBA) tool to provide a simple statistical and graphical summary of an annotated genome. We envisage its use during annotation jamborees, genome comparison and for use by developers for rapid feedback during annotation software development and testing. SOBA also provides annotation consistency feedback to ensure correct use of terminology within annotations, and guides users to add new terms to the Sequence Ontology when required. SOBA is available at http://www.sequenceontology.org/cgi-bin/soba.cgi.</span></p>
<p><span>More at <a href="https://pubmed.ncbi.nlm.nih.gov/20494974/">https://pubmed.ncbi.nlm.nih.gov/20494974/</a></span></p><p>Address of the bookmark: <a href="http://www.sequenceontology.org/cgi-bin/soba.cgi" rel="nofollow">http://www.sequenceontology.org/cgi-bin/soba.cgi</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/32187/chromhmm-chromatin-state-discovery-and-characterization</guid>
	<pubDate>Wed, 19 Apr 2017 04:06:23 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32187/chromhmm-chromatin-state-discovery-and-characterization</link>
	<title><![CDATA[ChromHMM: Chromatin state discovery and characterization]]></title>
	<description><![CDATA[<p><span>ChromHMM is software for learning and characterizing chromatin states. ChromHMM can integrate multiple chromatin datasets such as ChIP-seq data of various histone modifications to discover de novo the major re-occuring combinatorial and spatial patterns of marks. ChromHMM is based on a multivariate Hidden Markov Model that explicitly models the presence or absence of each chromatin mark. The resulting model can then be used to systematically annotate a genome in one or more cell types. By automatically computing state enrichments for large-scale functional and annotation datasets ChromHMM facilitates the biological characterization of each state. ChromHMM also produces files with genome-wide maps of chromatin state annotations that can be directly visualized in a genome browser.&nbsp;</span><br><br></p>
<ul>
<li><a href="http://compbio.mit.edu/ChromHMM/ChromHMM.zip">ChromHMM software v1.12</a>&nbsp;(<a href="http://compbio.mit.edu/ChromHMM/versionlog.txt">version log</a>)</li>
<li><a href="http://compbio.mit.edu/ChromHMM/ChromHMM_manual.pdf">ChromHMM manual</a></li>
</ul><p>Address of the bookmark: <a href="http://compbio.mit.edu/ChromHMM/" rel="nofollow">http://compbio.mit.edu/ChromHMM/</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</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/34400/ioniser-tools-for-the-quality-assessment-of-data-produced-by-oxford-nanopore%E2%80%99s-minion-sequencer</guid>
	<pubDate>Thu, 23 Nov 2017 10:24:19 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34400/ioniser-tools-for-the-quality-assessment-of-data-produced-by-oxford-nanopore%E2%80%99s-minion-sequencer</link>
	<title><![CDATA[IONiseR:  tools for the quality assessment of data produced by Oxford Nanopore’s MinION sequencer]]></title>
	<description><![CDATA[<p>This package is intended to provide tools for the quality assessment of data produced by Oxford Nanopore&rsquo;s MinION sequencer. It includes a functions to generate a number plots for examining the statistics that we think will be useful for this task.</p>
<p>However, nanopore sequencing is an emerging and rapidly developing technology. It is not clear what will be most informative. We hope that&nbsp;<code>IONiseR</code>&nbsp;will provide a framework for visualisation of metrics that we haven&rsquo;t thought of, and welcome feedback at&nbsp;<a href="mailto:mike.smith@embl.de" target="_blank">mike.smith@embl.de</a>.</p>
<p>If you&rsquo;re not interested in the quality assement of the raw or event level data, and want to jump straight to the getting FASTQ format files from fast5 files you can go straight to the final section of this document.</p><p>Address of the bookmark: <a href="https://www.bioconductor.org/packages/devel/bioc/vignettes/IONiseR/inst/doc/IONiseR.html" rel="nofollow">https://www.bioconductor.org/packages/devel/bioc/vignettes/IONiseR/inst/doc/IONiseR.html</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36403/ngmlr-long-read-mapper-designed-to-align-pacbio-or-oxford-nanopore</guid>
	<pubDate>Wed, 25 Apr 2018 07:30:54 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36403/ngmlr-long-read-mapper-designed-to-align-pacbio-or-oxford-nanopore</link>
	<title><![CDATA[NGMLR: long-read mapper designed to align PacBio or Oxford Nanopore]]></title>
	<description><![CDATA[<p><span>CoNvex Gap-cost alignMents for Long Reads (ngmlr) is a long-read mapper designed to sensitively align PacBilo or Oxford Nanopore to (large) reference genomes. It was designed to quickly and correctly align the reads, including those spanning (complex) structural variations. Ngmlr uses an SV aware k-mer search to find approximate mapping locations for a read and then a banded Smith-Waterman alignment algorithm to compute the final alignment. Ngmlr uses a convex gap cost model that penalizes gap extensions for longer gaps less than for shorter ones to compute precise alignments. The gap model allows ngmlr to account for both the sequencing error and real genomic variations at the same time and makes it especially effective at more precisely identifying the position of breakpoints stemming from structural variations. The k-mer search helps to detect and split reads that cannot be aligned linearly, enabling ngmlr to reliably align reads to a wide range of different structural variations including nested SVs (e.g. inversions flanked by deletions).</span></p><p>Address of the bookmark: <a href="https://github.com/philres/ngmlr" rel="nofollow">https://github.com/philres/ngmlr</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36812/porechop-tool-for-finding-and-removing-adapters-from-oxford-nanopore-reads</guid>
	<pubDate>Tue, 29 May 2018 07:33:44 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36812/porechop-tool-for-finding-and-removing-adapters-from-oxford-nanopore-reads</link>
	<title><![CDATA[Porechop:  tool for finding and removing adapters from Oxford Nanopore reads]]></title>
	<description><![CDATA[<p>Porechop is a tool for finding and removing adapters from <a href="https://nanoporetech.com/">Oxford Nanopore</a> reads. Adapters on the ends of reads are trimmed off, and when a read has an adapter in its middle, it is treated as chimeric and chopped into separate reads. Porechop performs thorough alignments to effectively find adapters, even at low sequence identity.</p>
<p>Porechop also supports demultiplexing of Nanopore reads that were barcoded with the <a href="https://store.nanoporetech.com/native-barcoding-kit-1d.html">Native Barcoding Kit</a>, <a href="https://store.nanoporetech.com/pcr-barcoding-kit-96.html">PCR Barcoding Kit</a> or <a href="https://store.nanoporetech.com/rapid-barcoding-sequencing-kit.html">Rapid Barcoding Kit</a>.</p><p>Address of the bookmark: <a href="https://github.com/rrwick/Porechop" rel="nofollow">https://github.com/rrwick/Porechop</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38199/pacasus-correction-of-palindromes-in-long-reads-from-pacbio-and-nanopore</guid>
	<pubDate>Mon, 12 Nov 2018 05:26:48 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38199/pacasus-correction-of-palindromes-in-long-reads-from-pacbio-and-nanopore</link>
	<title><![CDATA[Pacasus: Correction of palindromes in long reads from PacBio and Nanopore]]></title>
	<description><![CDATA[<p><br>Tool for detecting and cleaning PacBio / Nanopore long reads after whole genome amplification. Check the poster from the Revolutionizing Next-Generation Sequencing (2nd edition) conference in the source folder:&nbsp;<a href="https://github.com/swarris/Pacasus/blob/master/vib2017.pdf">https://github.com/swarris/Pacasus/blob/master/vib2017.pdf</a>.</p>
<p>The prepint version is found on&nbsp;<a href="http://www.biorxiv.org/content/early/2017/08/09/173872">http://www.biorxiv.org/content/early/2017/08/09/173872</a></p>
<p>It uses the pyPaSWAS framework for sequence alignment (<a href="https://github.com/swarris/pyPaSWAS">https://github.com/swarris/pyPaSWAS</a>)</p><p>Address of the bookmark: <a href="https://github.com/swarris/Pacasus" rel="nofollow">https://github.com/swarris/Pacasus</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40972/deepbinner-a-signal-level-demultiplexer-for-oxford-nanopore-reads</guid>
	<pubDate>Mon, 10 Feb 2020 02:45:53 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40972/deepbinner-a-signal-level-demultiplexer-for-oxford-nanopore-reads</link>
	<title><![CDATA[Deepbinner: a signal-level demultiplexer for Oxford Nanopore reads]]></title>
	<description><![CDATA[<p>Deepbinner is a tool for demultiplexing barcoded <a href="https://nanoporetech.com/">Oxford Nanopore</a> sequencing reads. It does this with a deep <a href="https://adeshpande3.github.io/adeshpande3.github.io/A-Beginner's-Guide-To-Understanding-Convolutional-Neural-Networks/">convolutional neural network</a> classifier, using many of the <a href="https://towardsdatascience.com/neural-network-architectures-156e5bad51ba">architectural advances</a> that have proven successful in image classification. Unlike other demultiplexers (e.g. Albacore and <a href="https://github.com/rrwick/Porechop">Porechop</a>), Deepbinner identifies barcodes from the raw signal (a.k.a. squiggle) which gives it greater sensitivity and fewer unclassified reads.</p><p>Address of the bookmark: <a href="https://github.com/rrwick/Deepbinner" rel="nofollow">https://github.com/rrwick/Deepbinner</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>