<?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/44569?offset=200</link>
	<atom:link href="https://bioinformaticsonline.com/related/44569?offset=200" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<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>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/40789/complete-genome-sequence-of-wuhan-seafood-market-pneumonia-virus-is-out</guid>
	<pubDate>Fri, 31 Jan 2020 02:36:59 -0600</pubDate>
	<link>https://bioinformaticsonline.com/news/view/40789/complete-genome-sequence-of-wuhan-seafood-market-pneumonia-virus-is-out</link>
	<title><![CDATA[Complete genome sequence of Wuhan seafood market pneumonia virus is out !]]></title>
	<description><![CDATA[<p>Wuhan-Hu-1 claimed at least 40 lives and infected at least 1300 others in China. Cases are now being reported from Thailand, Singapore, Malaysia, South Korea, Japan, Vietnam, Nepal, France, Australia and even as far as the US.&nbsp;On Jan 10 2020, while news of the first fatality was barely trickling in, the <a href="https://www.ncbi.nlm.nih.gov/nuccore/MN908947">29,903 letters</a> constituting the viral genome from an affected individual in Wuhan had already been elucidated (even though a few corrections were made subsequently). All the viral genome sequences from affected individuals are very very close to each other. Several are identical and none has more than 5 differences (99.983% similarity). This strongly suggests that transmission into humans came from a single pointed source and happened very recently, between Sep-Dec 2019.</p><p>Check out the detail at https://www.ncbi.nlm.nih.gov/nuccore/MN908947</p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/41300/china%E2%80%99s-bgi-says-it-can-sequence-a-genome-for-just-100</guid>
	<pubDate>Sat, 29 Feb 2020 04:49:43 -0600</pubDate>
	<link>https://bioinformaticsonline.com/news/view/41300/china%E2%80%99s-bgi-says-it-can-sequence-a-genome-for-just-100</link>
	<title><![CDATA[China’s BGI says it can sequence a genome for just $100]]></title>
	<description><![CDATA[<p>Using technology originally acquired in the US, the Chinese gene giant BGI Group says it will make genome sequencing cheaper than ever, breaking the $100 barrier for the first time.</p><p>The Shenzhen company says the low cost will be possible with an &ldquo;extreme&rdquo; DNA sequencing system it plans to offer that is capable of decoding the genomes of 100,000 people a year.</p><p>Ref:&nbsp;<a href="https://www.technologyreview.com/s/615289/china-bgi-100-dollar-genome/">https://www.technologyreview.com/s/615289/china-bgi-100-dollar-genome/</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42160/vicuna-a-software-tool-that-enables-consensus-assembly-of-ultra-deep-sequence-derived-from-diverse-viral-or-other-heterogeneous-populations</guid>
	<pubDate>Tue, 25 Aug 2020 03:40:17 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42160/vicuna-a-software-tool-that-enables-consensus-assembly-of-ultra-deep-sequence-derived-from-diverse-viral-or-other-heterogeneous-populations</link>
	<title><![CDATA[VICUNA: a software tool that enables consensus assembly of ultra-deep sequence derived from diverse viral or other heterogeneous populations.]]></title>
	<description><![CDATA[<p><span>VICUNA</span><span>&nbsp;is a&nbsp;</span><em>de novo</em><span>&nbsp;assembly program targeting populations with high mutation rates. It creates a single linear representation of the mixed population on which intra-host variants can be mapped. For clinical samples rich in contamination (e.g., &gt;95%), VICUNA can leverage existing genomes, if available, to assemble only target-alike reads. After initial assembly, it can also use existing genomes to perform guided merging of contigs. For each data set (e.g., Illumina paired read, 454), VICUNA outputs consensus sequence(s) and the corresponding multiple sequence alignment of constituent reads. VICUNA efficiently handles ultra-deep sequence data with tens of thousands fold coverage.</span></p>
<p><a href="http://software.broadinstitute.org/viral/docs/vicuna_v1.0.pdf">http://software.broadinstitute.org/viral/docs/vicuna_v1.0.pdf</a></p><p>Address of the bookmark: <a href="https://www.broadinstitute.org/viral-genomics/vicuna" rel="nofollow">https://www.broadinstitute.org/viral-genomics/vicuna</a></p>]]></description>
	<dc:creator>biogeek</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43846/the-complete-sequence-of-a-human-genome</guid>
	<pubDate>Thu, 31 Mar 2022 23:58:18 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43846/the-complete-sequence-of-a-human-genome</link>
	<title><![CDATA[The complete sequence of a human genome]]></title>
	<description><![CDATA[<p><span>The completed regions include all centromeric satellite arrays, recent segmental duplications, and the short arms of all five acrocentric chromosomes, unlocking these complex regions of the genome to variational and functional studies.</span></p><p>Address of the bookmark: <a href="https://www.science.org/doi/10.1126/science.abj6987" rel="nofollow">https://www.science.org/doi/10.1126/science.abj6987</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44904/termal-a-fast-and-interactive-terminal-based-viewer-for-multiple-sequence-alignments</guid>
	<pubDate>Mon, 22 Sep 2025 23:51:02 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44904/termal-a-fast-and-interactive-terminal-based-viewer-for-multiple-sequence-alignments</link>
	<title><![CDATA[Termal: a fast and interactive terminal-based viewer for multiple sequence alignments]]></title>
	<description><![CDATA[<p>termal, a fast, interactive, terminal-based viewer for multiple sequence alignments (MSAs), designed for use on remote systems such as high-performance computing (HPC) clusters.</p>
<p>https://academic.oup.com/bioinformaticsadvances/advance-article/doi/10.1093/bioadv/vbaf208/8257678?login=true</p><p>Address of the bookmark: <a href="https://github.com/sib-swiss/termal" rel="nofollow">https://github.com/sib-swiss/termal</a></p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27104/gatb-genome-analysis-toolbox-with-de-bruijn-graph</guid>
	<pubDate>Thu, 28 Apr 2016 11:16:51 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27104/gatb-genome-analysis-toolbox-with-de-bruijn-graph</link>
	<title><![CDATA[GATB : Genome Analysis Toolbox with de-Bruijn graph]]></title>
	<description><![CDATA[<p>The&nbsp;<strong><strong>Genome Analysis Toolbox with de-Bruijn graph</strong> (GATB)</strong> provides a set of <a href="https://gatb.inria.fr/gatb-global-architecture/">highly efficient algorithms to analyse NGS data sets</a>. These methods enable the analysis of data sets of any size on multi-core desktop computers, including very huge amount of reads data coming from any kind of organisms such as bacteria, plants, animals and even complex samples (<em>e.g.</em> metagenomes).</p>
<p>More at https://gatb.inria.fr/</p><p>Address of the bookmark: <a href="https://gatb.inria.fr/" rel="nofollow">https://gatb.inria.fr/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/26380/hicdat</guid>
	<pubDate>Fri, 12 Feb 2016 05:23:44 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/26380/hicdat</link>
	<title><![CDATA[HiCdat]]></title>
	<description><![CDATA[<p>HiCdat: a fast and easy-to-use Hi-C data analysis tool</p>
<p>HiCdat is easy-to-use and provides solutions starting from aligned reads up to in-depth analyses. Importantly, HiCdat is focussed on the analysis of larger structural features of chromosomes, their correlation to genomic and epigenomic features, and on comparative studies. It uses simple input and output formats and can therefore easily be integrated into existing workflows or combined with alternative tools.</p>
<p>More at http://bmcbioinformatics.biomedcentral.com/articles/10.1186/s12859-015-0678-x</p><p>Address of the bookmark: <a href="https://github.com/MWSchmid/HiCdat" rel="nofollow">https://github.com/MWSchmid/HiCdat</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/28809/kissplice</guid>
	<pubDate>Tue, 16 Aug 2016 08:34:19 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/28809/kissplice</link>
	<title><![CDATA[KisSplice]]></title>
	<description><![CDATA[<p>KisSplice is a software that enables to analyse RNA-seq data with or without a reference genome. It is an exact local transcriptome assembler that allows to identify SNPs, indels and alternative splicing events. It can deal with an arbitrary number of biological conditions, and will quantify each variant in each condition. It has been tested on Illumina datasets of up to 1G reads. Its memory consumption is around 5Gb for 100M reads.</p>
<p>KisSplice is not a full-length transcriptome assembler. This means that it will output the variable regions of the transcripts, not reconstruct them entirely.</p>
<p>KisSplice comes as a workflow, with several possible post-treatments meant to facilitate the analysis of the results. The choice of the post-treatment depends on the availability of a reference genome/transcriptome and on the need to perform a differential analysis, as summarised in the following table.</p><p>Address of the bookmark: <a href="http://kissplice.prabi.fr/" rel="nofollow">http://kissplice.prabi.fr/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/28200/machine-learning</guid>
	<pubDate>Fri, 01 Jul 2016 12:57:12 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/28200/machine-learning</link>
	<title><![CDATA[Machine Learning !!!]]></title>
	<description><![CDATA[<p>In machine learning, computers apply&nbsp;<strong>statistical learning</strong>&nbsp;techniques to automatically identify patterns in data. These techniques can be used to make highly accurate predictions.</p>
<p><em>Keep scrolling.</em>&nbsp;Using a data set about homes, we will create a machine learning model to distinguish homes in New York from homes in San Francisco.</p><p>Address of the bookmark: <a href="http://www.r2d3.us/visual-intro-to-machine-learning-part-1/" rel="nofollow">http://www.r2d3.us/visual-intro-to-machine-learning-part-1/</a></p>]]></description>
	<dc:creator>Gudiya Pal</dc:creator>
</item>

</channel>
</rss>