<?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/44529?offset=390</link>
	<atom:link href="https://bioinformaticsonline.com/related/44529?offset=390" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<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/34088/sequence-evolution-function-computational-approaches-in-comparative-genomics</guid>
	<pubDate>Sun, 06 Aug 2017 06:58:12 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34088/sequence-evolution-function-computational-approaches-in-comparative-genomics</link>
	<title><![CDATA[Sequence - Evolution - Function; Computational Approaches in Comparative Genomics]]></title>
	<description><![CDATA[<p><em>Sequence - Evolution - Function</em><span>&nbsp;is an introduction to the computational approaches that play a critical role in the emerging new branch of biology known as functional genomics. The book provides the reader with an understanding of the principles and approaches of functional genomics and of the potential and limitations of computational and experimental approaches to genome analysis.</span></p><p>Address of the bookmark: <a href="https://www.ncbi.nlm.nih.gov/books/NBK20260/" rel="nofollow">https://www.ncbi.nlm.nih.gov/books/NBK20260/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41689/medaka-sequence-correction-provided-by-ont-research</guid>
	<pubDate>Mon, 18 May 2020 16:28:00 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41689/medaka-sequence-correction-provided-by-ont-research</link>
	<title><![CDATA[medaka: Sequence correction provided by ONT Research]]></title>
	<description><![CDATA[<p><code>medaka</code><span>&nbsp;is a tool to create a consensus sequence from nanopore sequencing data. This task is performed using neural networks applied from a pileup of individual sequencing reads against a draft assembly. It outperforms graph-based methods operating on basecalled data, and can be competitive with state-of-the-art signal-based methods, whilst being much faster.</span></p><p>Address of the bookmark: <a href="https://github.com/nanoporetech/medaka" rel="nofollow">https://github.com/nanoporetech/medaka</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/43995/tools-for-sequence-translation</guid>
	<pubDate>Tue, 08 Nov 2022 03:37:58 -0600</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/43995/tools-for-sequence-translation</link>
	<title><![CDATA[Tools for Sequence translation !]]></title>
	<description><![CDATA[<p><span>BOrf</span>&nbsp;-&nbsp;<a href="https://github.com/betsig/borf" target="_blank">https://github.com/betsig/borf</a></p><p><span>CodAn</span>&nbsp;-&nbsp;<a href="https://github.com/pedronachtigall/CodAn" target="_blank">https://github.com/pedronachtigall/CodAn</a></p><p><span>EMBOSS-Sixpack</span>&nbsp;-&nbsp;<a href="https://www.ebi.ac.uk/Tools/st/emboss_sixpack/" target="_blank">https://www.ebi.ac.uk/Tools/st/emboss_sixpack/</a></p><p><span>esl-translate</span>&nbsp;-&nbsp;<a href="http://hmmer.org/" target="_blank">http://hmmer.org/</a>,&nbsp;<a href="https://github.com/EddyRivasLab/easel" target="_blank">https://github.com/EddyRivasLab/easel</a></p><p><span>GeneMarkS-T</span>&nbsp;-&nbsp;<a href="http://exon.gatech.edu/GeneMark/license_download.cgi" target="_blank">http://exon.gatech.edu/GeneMark/license_download.cgi</a></p><p><span>ORFfinder</span>&nbsp;-&nbsp;<a href="https://www.ncbi.nlm.nih.gov/orffinder/" target="_blank">https://www.ncbi.nlm.nih.gov/orffinder/</a>&nbsp;(web server)</p><p><span>PLASS</span>&nbsp;-&nbsp;<a href="https://github.com/soedinglab/plass" target="_blank">https://github.com/soedinglab/plass</a></p><p><span>Prodigal</span>&nbsp;-&nbsp;<a href="https://github.com/hyattpd/Prodigal" target="_blank">https://github.com/hyattpd/Prodigal</a></p><p><span>TransDecoder</span>&nbsp;-&nbsp;<a href="https://github.com/TransDecoder/TransDecoder" target="_blank">https://github.com/TransDecoder/TransDecoder</a></p>]]></description>
	<dc:creator>Abhi</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/fun/view/4196/chemical-elements-of-bioinformatics</guid>
	<pubDate>Tue, 03 Sep 2013 16:35:39 -0500</pubDate>
	<link>https://bioinformaticsonline.com/fun/view/4196/chemical-elements-of-bioinformatics</link>
	<title><![CDATA[Chemical Elements of Bioinformatics]]></title>
	<description><![CDATA[<p>You must be familiar with periodic table and colour pattern, but this time you are going to amaze by new elements table by Eagle genomics. Just check it out and have fun :)</p><p><a href="http://elements.eaglegenomics.com/">http://elements.eaglegenomics.com/</a></p>]]></description>
	<dc:creator>Rahul Agarwal</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/33942/mulan-multiple-sequence-local-alignment-and-conservation-visualization-tool</guid>
	<pubDate>Thu, 20 Jul 2017 08:02:32 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/33942/mulan-multiple-sequence-local-alignment-and-conservation-visualization-tool</link>
	<title><![CDATA[Mulan: MUltiple sequence Local AligNment and conservation visualization tool]]></title>
	<description><![CDATA[<p><span>Mulan performs multiple (2 or more) sequence alignments with an efficient and rapid "full local" alignment strategy that ensures a recapitulation of evolutionary sequence rearrangements (such as inversions and reshuffling) in any of the species. It combines&nbsp;</span><a href="http://www.bx.psu.edu/miller_lab/" target="_new"><em>refine</em>&nbsp;and&nbsp;<em>tba</em></a><span>&nbsp;tools to align either "draft" or "finished" quality sequences. Mulan provides a dynamic graphical interface to align and visualize conservation profiles for evolutionarily distant and closely related species.</span><br><span></span></p>
<p><span>Input formats, automated data upload from the&nbsp;</span><a href="http://genome.ucsc.edu/" target="_new">UCSC Genome Browser</a><span>, gene annotation, annotation of repetitive elements, and progress report were previously described in the&nbsp;</span><a href="https://zpicture.dcode.org/zpInstructions.html" target="_zp">zPicture instructions</a><span>&nbsp;and we refer the users to these materials for more details. This introduction is mainly focused on some novel features unique to the Mulan.</span><span><br></span></p><p>Address of the bookmark: <a href="https://mulan.dcode.org/mulanInstructions.php" rel="nofollow">https://mulan.dcode.org/mulanInstructions.php</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34704/nanosim-nanopore-sequence-read-simulator-based-on-statistical-characterization</guid>
	<pubDate>Mon, 18 Dec 2017 04:16:31 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34704/nanosim-nanopore-sequence-read-simulator-based-on-statistical-characterization</link>
	<title><![CDATA[NanoSim: nanopore sequence read simulator based on statistical characterization.]]></title>
	<description><![CDATA[<p><span>NanoSim, a fast and scalable read simulator that captures the technology-specific features of ONT data and allows for adjustments upon improvement of nanopore sequencing technology. The first step of NanoSim is read characterization, which provides a comprehensive alignment-based analysis and generates a set of read profiles serving as the input to the next step, the simulation stage. The simulation stage uses the model built in the previous step to produce in silico reads for a given reference genome. NanoSim is written in Python and R. The source files and manual are available at the Genome Sciences Centre website: http://www.bcgsc.ca/platform/bioinfo/software/nanosim</span></p>
<p><span>https://github.com/bcgsc/NanoSim</span></p><p>Address of the bookmark: <a href="http://www.bcgsc.ca/platform/bioinfo/software/nanosim" rel="nofollow">http://www.bcgsc.ca/platform/bioinfo/software/nanosim</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36921/breakpointer-using-local-mapping-artifacts-to-support-sequence-breakpoint-discovery-from-single-end-reads</guid>
	<pubDate>Tue, 12 Jun 2018 12:41:10 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36921/breakpointer-using-local-mapping-artifacts-to-support-sequence-breakpoint-discovery-from-single-end-reads</link>
	<title><![CDATA[Breakpointer: using local mapping artifacts to support sequence breakpoint discovery from single-end reads]]></title>
	<description><![CDATA[Breakpointer is a fast tool for locating sequence breakpoints from the alignment of single end reads (SE) produced by next generation sequencing (NGS). It adopts a heuristic method in searching for local mapping signatures created by insertion/deletions (indels) or more complex structural variants(SVs).<p>Address of the bookmark: <a href="https://github.com/ruping/Breakpointer" rel="nofollow">https://github.com/ruping/Breakpointer</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/39372/irnad-a-computational-tool-for-identifying-d-modification-sites-in-rna-sequence</guid>
	<pubDate>Thu, 16 May 2019 00:20:07 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/39372/irnad-a-computational-tool-for-identifying-d-modification-sites-in-rna-sequence</link>
	<title><![CDATA[iRNAD: a computational tool for identifying D modification sites in RNA sequence]]></title>
	<description><![CDATA[<p><span>iRNAD, for identifying D modification sites in RNA sequence. In this predictor, the RNA samples derived from five species were encoded by nucleotide chemical property and nucleotide density. Support vector machine was utilized to perform the classification.&nbsp;</span></p>
<p><span><a href="http://lin-group.cn/server/iRNAD/">http://lin-group.cn/server/iRNAD/</a></span></p><p>Address of the bookmark: <a href="http://lin-group.cn/server/iRNAD/" rel="nofollow">http://lin-group.cn/server/iRNAD/</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40212/kalign-fast-multiple-sequence-alignment-program-for-biological-sequences</guid>
	<pubDate>Fri, 01 Nov 2019 00:20:41 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40212/kalign-fast-multiple-sequence-alignment-program-for-biological-sequences</link>
	<title><![CDATA[Kalign: fast multiple sequence alignment program for biological sequences.]]></title>
	<description><![CDATA[<p><span>Kalign is a fast multiple sequence alignment program for biological sequences.</span></p>
<p>Align sequences and output the alignment in MSF format:</p>
<pre><code>kalign -i BB11001.tfa -f msf  -o out.msf
</code></pre>
<p>Align sequences and output the alignment in clustal format:</p>
<pre><code>kalign -i BB11001.tfa -f clu -o out.clu
</code></pre>
<p>Re-align sequences in an existing alignment:</p>
<pre><code>kalign -i BB11001.msf  -o out.afa
</code></pre>
<p>Reformat existing alignment:</p>
<pre><code>kalign -i BB11001.msf -r afa -o out.afa</code></pre><p>Address of the bookmark: <a href="https://github.com/TimoLassmann/kalign" rel="nofollow">https://github.com/TimoLassmann/kalign</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>

</channel>
</rss>