<?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/27080?offset=910</link>
	<atom:link href="https://bioinformaticsonline.com/related/27080?offset=910" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37584/mulan-multiple-sequence-local-alignment-and-visualization-for-studying-function-and-evolution</guid>
	<pubDate>Fri, 24 Aug 2018 09:50:01 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37584/mulan-multiple-sequence-local-alignment-and-visualization-for-studying-function-and-evolution</link>
	<title><![CDATA[Mulan: Multiple-sequence local alignment and visualization for studying function and evolution]]></title>
	<description><![CDATA[<p>Mulan: Multiple-sequence local alignment and visualization for studying function and evolution</p>
<p><span>Mulan (</span><a href="https://www.ncbi.nlm.nih.gov/pmc/articles/PMC540288/#ref44">http://mulan.dcode.org/</a><span>), a novel method and a network server for comparing multiple draft and finished-quality sequences to identify functional elements conserved over evolutionary time. Mulan brings together several novel algorithms: the TBA multi-aligner program for rapid identification of local sequence conservation, and the multiTF program for detecting evolutionarily conserved transcription factor binding sites in multiple alignments. In addition, Mulan supports two-way communication with the GALA database; alignments of multiple species dynamically generated in GALA can be viewed in Mulan, and conserved transcription factor binding sites identified with Mulan/multiTF can be integrated and overlaid with extensive genome annotation data using GALA.</span></p><p>Address of the bookmark: <a href="https://www.ncbi.nlm.nih.gov/pmc/articles/PMC540288/" rel="nofollow">https://www.ncbi.nlm.nih.gov/pmc/articles/PMC540288/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/31377/groopm-metagenomic-binning-toolset</guid>
	<pubDate>Tue, 07 Mar 2017 08:59:45 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/31377/groopm-metagenomic-binning-toolset</link>
	<title><![CDATA[GroopM: Metagenomic binning toolset]]></title>
	<description><![CDATA[<p>GroopM is a metagenomic binning toolset. It leverages spatio-temoral<br>dynamics (differential coverage) to accurately (and almost automatically)<br>extract population genomes from multi-sample metagenomic datasets.</p>
<p>GroopM is largely parameter-free. Use: groopm -h for more info.</p>
<p>For installation and usage instructions see : http://ecogenomics.github.io/GroopM/</p><p>Address of the bookmark: <a href="https://github.com/ecogenomics/GroopM" rel="nofollow">https://github.com/ecogenomics/GroopM</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/39689/msaprobs-parallel-and-accurate-multiple-sequence-alignment</guid>
	<pubDate>Tue, 09 Jul 2019 23:58:44 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/39689/msaprobs-parallel-and-accurate-multiple-sequence-alignment</link>
	<title><![CDATA[MSAProbs - Parallel and accurate multiple sequence alignment]]></title>
	<description><![CDATA[<p><strong>MSAProbs</strong><span>&nbsp;is a well-established state-of-the-art multiple sequence alignment algorithm for protein sequences. The design of MSAProbs is based on a combination of pair hidden Markov models and partition functions to calculate posterior probabilities. Assessed using the popular benchmarks: BAliBASE, PREFAB, SABmark and OXBENCH, MSAProbs achieves statistically significant accuracy improvements over the existing top performing aligners, including ClustalW, MAFFT, MUSCLE, ProbCons and Probalign. In addition, MSAProbs is optimized for shared-memory CPUs by employing a multi-threaded design, and further parallelized for distributed-memory systems using MPI to overcome high memory overhead barrier and achieve good parallel and data-size scalability.</span></p><p>Address of the bookmark: <a href="http://msaprobs.sourceforge.net/homepage.htm#latest" rel="nofollow">http://msaprobs.sourceforge.net/homepage.htm#latest</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/31552/multigenome-assembly</guid>
	<pubDate>Tue, 14 Mar 2017 04:41:23 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/31552/multigenome-assembly</link>
	<title><![CDATA[Multigenome assembly]]></title>
	<description><![CDATA[<p>This project contains scripts and tutorials on how to assemble individual microbial genomes from metagenomes, as described in:</p>
<p>Genome sequences of rare, uncultured bacteria obtained by differential coverage binning of multiple metagenomes</p>
<p>Mads Albertsen, Philip Hugenholtz, Adam Skarshewski, Gene W. Tyson, K&aring;re L. Nielsen and Per .H. Nielsen</p>
<p>Nature Biotechnology 2013, doi:&nbsp;<a href="http://www.nature.com/nbt/journal/vaop/ncurrent/abs/nbt.2579.html">10.1038/nbt.2579</a></p>
<p>See the associated&nbsp;<a href="http://madsalbertsen.github.io/multi-metagenome/">online guide</a>&nbsp;for detailed information.</p>
<p>https://github.com/MadsAlbertsen/multi-metagenome</p><p>Address of the bookmark: <a href="https://github.com/MadsAlbertsen/multi-metagenome" rel="nofollow">https://github.com/MadsAlbertsen/multi-metagenome</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40711/vg-variation-graph-data-structures-interchange-formats-alignment-genotyping-and-variant-calling-methods</guid>
	<pubDate>Tue, 28 Jan 2020 03:53:24 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40711/vg-variation-graph-data-structures-interchange-formats-alignment-genotyping-and-variant-calling-methods</link>
	<title><![CDATA[VG: variation graph data structures, interchange formats, alignment, genotyping, and variant calling methods]]></title>
	<description><![CDATA[<p><em>Variation graphs</em>&nbsp;provide a succinct encoding of the sequences of many genomes. A variation graph (in particular as implemented in vg) is composed of:</p>
<ul>
<li><em>nodes</em>, which are labeled by sequences and ids</li>
<li><em>edges</em>, which connect two nodes via either of their respective ends</li>
<li><em>paths</em>, describe genomes, sequence alignments, and annotations (such as gene models and transcripts) as walks through nodes connected by edges</li>
</ul><p>Address of the bookmark: <a href="https://github.com/vgteam/vg" rel="nofollow">https://github.com/vgteam/vg</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44481/unialigner-a-parameter-free-framework-for-fast-sequence-alignment</guid>
	<pubDate>Fri, 08 Mar 2024 23:36:12 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44481/unialigner-a-parameter-free-framework-for-fast-sequence-alignment</link>
	<title><![CDATA[UniAligner: a parameter-free framework for fast sequence alignment]]></title>
	<description><![CDATA[<p>UniAligner (formerly, TandemAligner) is the first parameter-free algorithm for sequence alignment that introduces a sequence-dependent alignment scoring that automatically changes for any pair of compared sequences. Classical alignment approaches, such as the Smith-Waterman algorithm, that work well for most sequences, fail to construct biologically adequate alignments of extra-long tandem repeats (ETRs), such as human centromeres and immunoglobulin loci. This limitation was overlooked in the previous studies since the sequences of the centromeres and other ETRs across multiple genomes only became available recently.</p>
<p>More at https://www.nature.com/articles/s41592-023-01970-4</p><p>Address of the bookmark: <a href="https://github.com/seryrzu/unialigner" rel="nofollow">https://github.com/seryrzu/unialigner</a></p>]]></description>
	<dc:creator>Abhi</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/35041/seal-sequence-alignment-evaluation-suite</guid>
	<pubDate>Wed, 03 Jan 2018 05:05:46 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/35041/seal-sequence-alignment-evaluation-suite</link>
	<title><![CDATA[Seal: SEquence ALignment evaluation suite]]></title>
	<description><![CDATA[<p><span>Seal</span>&nbsp;is a comprehensive sequencing simulation and alignment tool evaluation suite. This software (implemented in Java) provides several utilities that can be used to evaluate alignment algorithms, including:</p>
<ul>
<li>Reading a pre-existing reference genome from one or more FASTA files.</li>
<li>Alternatively, generating an artificial reference genome based on input parameters (length, repeat count, repeat length, repeat variability rate).</li>
<li>Simulating reads from random locations in the genome based on input parameters of read length, coverage, sequencing error rate, and indel rate.</li>
<li>Applying alignment tools to the genome and the reads through a standardized interface.</li>
<li>Parsing the output of the alignment tool and calculating the number of reads that were correctly or incorrectly mapped.</li>
<li>Computing run times and measures of accuracy.</li>
</ul>
<p><span>Seal</span>&nbsp;has interfaces to evaluate the following software packages:</p>
<ul>
<li>Bowtie</li>
<li>BWA</li>
<li>MAQ</li>
<li>mrFAST</li>
<li>mrsFAST</li>
<li>Novoalign</li>
<li>SHRiMP</li>
<li>SOAPv2</li>
</ul><p>Address of the bookmark: <a href="http://compbio.case.edu/seal/" rel="nofollow">http://compbio.case.edu/seal/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/view/138</guid>
	<pubDate>Wed, 10 Jul 2013 16:30:58 -0500</pubDate>
	<link>https://bioinformaticsonline.com/view/138</link>
	<title><![CDATA[Selecting between Python 2 and Python 3?]]></title>
	<description><![CDATA[<p>Which version is best for bioinformatician to work on?</p>]]></description>
	<dc:creator>Rahul Agarwal</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/32184/metagenomics-assembly-workshop</guid>
	<pubDate>Tue, 18 Apr 2017 04:28:19 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32184/metagenomics-assembly-workshop</link>
	<title><![CDATA[Metagenomics assembly workshop !!]]></title>
	<description><![CDATA[<div>
<div>
<div id="welcome-to-metagenomics-workshop">
<p>Welcome to the one-day metagenomics assembly workshop. This tutorial will guide you through the typical steps of metagenome assembly and binning.</p>
<div>
<ul>
<li><a href="http://denbi-metagenomics-workshop.readthedocs.io/en/latest/data.html">The Tutorial Data Set</a></li>
<li><a href="http://denbi-metagenomics-workshop.readthedocs.io/en/latest/qc/index.html">FastQC Quality Control</a></li>
<li><a href="http://denbi-metagenomics-workshop.readthedocs.io/en/latest/assembly/index.html">Assembly</a>
<ul>
<li><a href="http://denbi-metagenomics-workshop.readthedocs.io/en/latest/assembly/velvet.html">Velvet Assembly</a></li>
<li><a href="http://denbi-metagenomics-workshop.readthedocs.io/en/latest/assembly/megahit.html">MEGAHIT Assembly</a></li>
<li><a href="http://denbi-metagenomics-workshop.readthedocs.io/en/latest/assembly/idba_ud.html">IDBA-UD Assembly</a></li>
<li><a href="http://denbi-metagenomics-workshop.readthedocs.io/en/latest/assembly/ray.html">Ray Assembly</a></li>
</ul>
</li>
<li><a href="http://denbi-metagenomics-workshop.readthedocs.io/en/latest/geneprediction/index.html">Gene Prediction</a></li>
<li><a href="http://denbi-metagenomics-workshop.readthedocs.io/en/latest/evaluation/index.html">Assembly Evaluation</a>
<ul>
<li><a href="http://denbi-metagenomics-workshop.readthedocs.io/en/latest/evaluation/mapping.html">Read Mapping</a></li>
<li><a href="http://denbi-metagenomics-workshop.readthedocs.io/en/latest/evaluation/metaquast.html">MetaQUAST</a></li>
</ul>
</li>
<li><a href="http://denbi-metagenomics-workshop.readthedocs.io/en/latest/binning/index.html">Binning</a>
<ul>
<li><a href="http://denbi-metagenomics-workshop.readthedocs.io/en/latest/binning/maxbin.html">MaxBin Binning</a></li>
<li><a href="http://denbi-metagenomics-workshop.readthedocs.io/en/latest/binning/metabat.html">MetaBAT Binning</a></li>
</ul>
</li>
<li><a href="http://denbi-metagenomics-workshop.readthedocs.io/en/latest/classification/index.html">Classification</a>
<ul>
<li><a href="http://denbi-metagenomics-workshop.readthedocs.io/en/latest/classification/kraken.html">Kraken Taxonomic Sequence Classification System</a></li>
</ul>
</li>
</ul>
</div>
</div>
</div>
</div>
<div><a href="http://denbi-metagenomics-workshop.readthedocs.io/en/latest/data.html" title="The Tutorial Data Set">Next&nbsp;<span></span></a>
<p>&nbsp;</p>
</div><p>Address of the bookmark: <a href="http://denbi-metagenomics-workshop.readthedocs.io/en/latest/index.html" rel="nofollow">http://denbi-metagenomics-workshop.readthedocs.io/en/latest/index.html</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/841/research-fellow</guid>
  <pubDate>Sat, 13 Jul 2013 11:23:20 -0500</pubDate>
  <link></link>
  <title><![CDATA[Research Fellow]]></title>
  <description><![CDATA[
<p>UNIVERSITY OF CALCUTTA</p>

<p>A walk-in-interview will be held on 15.7.2013 at 12 noon in the Department of Biophysics, Molecular Biology and Bioinformatics, 92 A.P.C Road, Kolkata-700 009 to select one trainee research fellow and two students under DIC. The positions are purely temporary and would be for a period of six months from the date of joining which may be extended by another six months subject to successful performance.</p>

<p>Qualification:</p>

<p>For the Trainee Research Fellow: Should have a master degree in Bioinformatics or allied subjects and should have biological database development experience. Must have at least one publication.</p>

<p>For the Students: Should have a master degree in Bioinformatics or allied subjects and should be proficient in C-programming language. Must be familiar with techniques of Developmental Biology.</p>

<p>The Trainee Research Fellow would be paid a consolidated sum of Rs 10000/- per month and the students would be paid a sum amount Rs. 7000/- per month during the tenure of the project.</p>

<p>Advertisement:<br />www.caluniv.ac.in/News%20&amp;%20Announcement/trainee_rf_DIC.pdf</p>
]]></description>
</item>

</channel>
</rss>