<?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/39837?offset=110</link>
	<atom:link href="https://bioinformaticsonline.com/related/39837?offset=110" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36846/gblocks-eliminates-poorly-aligned-positions-and-divergent-regions-of-a-dna-or-protein-alignment</guid>
	<pubDate>Sat, 02 Jun 2018 07:36:05 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36846/gblocks-eliminates-poorly-aligned-positions-and-divergent-regions-of-a-dna-or-protein-alignment</link>
	<title><![CDATA[Gblocks: eliminates poorly aligned positions and divergent regions of a DNA or protein alignment]]></title>
	<description><![CDATA[<p><a href="http://molevol.cmima.csic.es/castresana/Gblocks.html">Gblocks</a><span>&nbsp;eliminates poorly aligned positions and divergent regions of a DNA or protein alignment so that it becomes more suitable for phylogenetic analysis. This server implements the most important features of the Gblocks program to make its use as simple as possible without loosing the functionality that it is necessary in most of the cases. Other options can be changed in the stand-alone program. You can see here an&nbsp;</span><a href="http://molevol.cmima.csic.es/castresana/Gblocks_server/nad3.pir-gb.htm">example output file</a><span>&nbsp;showing the blocks selected from a protein alignment. Further information can be found in the&nbsp;</span><a href="http://molevol.cmima.csic.es/castresana/Gblocks/Gblocks_documentation.html">online documentation</a><span>.&nbsp;</span></p><p>Address of the bookmark: <a href="http://molevol.cmima.csic.es/castresana/Gblocks_server.html" rel="nofollow">http://molevol.cmima.csic.es/castresana/Gblocks_server.html</a></p>]]></description>
	<dc:creator>Poonam Mahapatra</dc:creator>
</item>
<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/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/44508/a-web-based-tool-for-sequence-alignment-statistics-and-innovative-visualization</guid>
	<pubDate>Thu, 04 Apr 2024 01:44:50 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44508/a-web-based-tool-for-sequence-alignment-statistics-and-innovative-visualization</link>
	<title><![CDATA[A web-based tool for sequence alignment statistics and innovative visualization]]></title>
	<description><![CDATA[<p>AlignStatPlot, a new R package and online tool that is well-documented and easy-to usefor MSA and post-MSA analysis. This tool performs both traditional and cutting-edge analy-ses on sequencing data and generates new visualisation methods for MSA results. Whencompared to currently available tools, AlignStatPlot provides a robust ability to handle andvisualise diversity data, while the online version will save time and encourage researchersto focus on explaining their findings. It is a simple tool that can be used in conjunction withpopulation genetics software (PDF) AlignStatPlot: An R package and online tool for robust sequence alignment statistics and innovative visualization of big data.</p><p>Address of the bookmark: <a href="https://bioinformatics.um6p.ma/AlignStatPlot/" rel="nofollow">https://bioinformatics.um6p.ma/AlignStatPlot/</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44527/alvis-a-tool-for-contig-and-read-alignment-visualisation-and-chimera-detection</guid>
	<pubDate>Wed, 08 May 2024 07:02:55 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44527/alvis-a-tool-for-contig-and-read-alignment-visualisation-and-chimera-detection</link>
	<title><![CDATA[Alvis: a tool for contig and read ALignment VISualisation and chimera detection]]></title>
	<description><![CDATA[<p><span>Alvis, a simple command line tool that can generate visualisations for a number of common alignment analysis tasks. Alvis is a fast and portable tool that accepts input in a variety of alignment formats and will output production ready vector images. Additionally, Alvis will highlight potentially chimeric reads or contigs, a common source of misassemblies.</span></p>
<p>More at&nbsp;https://bmcbioinformatics.biomedcentral.com/articles/10.1186/s12859-021-04056-0</p><p>Address of the bookmark: <a href="https://github.com/SR-Martin/alvis" rel="nofollow">https://github.com/SR-Martin/alvis</a></p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37796/grsr-a-tool-for-deriving-genome-rearrangement-scenarios-from-multiple-unichromosomal-genome-sequences</guid>
	<pubDate>Fri, 28 Sep 2018 09:35:10 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37796/grsr-a-tool-for-deriving-genome-rearrangement-scenarios-from-multiple-unichromosomal-genome-sequences</link>
	<title><![CDATA[GRSR: a tool for deriving genome rearrangement scenarios from multiple unichromosomal genome sequences]]></title>
	<description><![CDATA[<p>GRSR is a Tool for Deriving Genome Rearrangement Scenarios for Multiple Uni-chromosomal Genomes. This tool will do the following steps:</p>
<ul>
<li>Step 1. Run mugsy to get multiple sequence alignment results.</li>
<li>Step 2 &amp; 3. Extraction of the Coordinates of Core Blocks, Construction of Synteny Blocks and Generating Signed Permutations.</li>
<li>Step 4. Generate pairwise genome rearrangement scenarios and find repeats at the breakpoints of each rearrangement events.</li>
<li></li>
<li></li>
</ul>
<p>https://github.com/DanwangJessica/GRSR</p><p>Address of the bookmark: <a href="https://github.com/DanwangJessica/GRSR" rel="nofollow">https://github.com/DanwangJessica/GRSR</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41405/sequence-tube-maps-displays-multiple-genomic-sequences-in-the-form-of-a-tube-map</guid>
	<pubDate>Wed, 11 Mar 2020 01:12:06 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41405/sequence-tube-maps-displays-multiple-genomic-sequences-in-the-form-of-a-tube-map</link>
	<title><![CDATA[Sequence Tube Maps: displays multiple genomic sequences in the form of a tube map]]></title>
	<description><![CDATA[<p>A JavaScript module for the visualization of genomic sequence graphs. It automatically generates a "tube map"-like visualization of sequence graphs which have been created with <a href="https://github.com/vgteam/vg">vg</a>. (<a href="https://github.com/vgteam/vg">https://github.com/vgteam/vg</a>)</p>
<h3>Link to working demo: <a href="https://vgteam.github.io/sequenceTubeMap/">https://vgteam.github.io/sequenceTubeMap/</a></h3>
<p><img src="https://raw.githubusercontent.com/vgteam/sequenceTubeMap/master/images/header.png" alt="image" style="border: 0px; border: 0px;"></p><p>Address of the bookmark: <a href="https://github.com/vgteam/sequenceTubeMap" rel="nofollow">https://github.com/vgteam/sequenceTubeMap</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/32129/lordec-a-hybrid-error-correction-program-for-long-pacbio-reads</guid>
	<pubDate>Mon, 10 Apr 2017 04:16:09 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32129/lordec-a-hybrid-error-correction-program-for-long-pacbio-reads</link>
	<title><![CDATA[LoRDEC: a hybrid error correction program for long, PacBio reads]]></title>
	<description><![CDATA[<p>LoRDEC is a program to correct sequencing errors in long reads from 3rd generation sequencing with high error rate, and is especially intended for PacBio reads. It uses a hybrid strategy, meaning that it uses two sets of reads: the reference read set, whose error rate is assumed to be small, and the PacBio read set, which is then corrected using the reference set. Typically, the reference set contains Illumina reads.</p>
<p><br> Usually, errors in PacBio reads include many insertions and deletions, and comparatively less substitutions. LoRDEC can correct errors of all these types.<br> After correction, a larger portion of the sequence of PacBio reads is usable for detection of region of similarity with other sequences, for aligning them to the contigs of an assembly, etc.</p>
<p>Why is LoRDEC different?</p>
<ul>
<li>It is efficient and can process large read data sets, included from eukaryotic or vertebrate species, on a usual computing server, and even works on desktop/laptop computers.</li>
<li>It adopts a novel graph based approach: it builds a succinct De Bruijn Graph (DBG) representing the short reads, and seeks a corrective sequence for each erroneous region of a long read by traversing chosen paths in the graph.</li>
</ul><p>Address of the bookmark: <a href="http://www.atgc-montpellier.fr/lordec/" rel="nofollow">http://www.atgc-montpellier.fr/lordec/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/44408/charpak-exchange-program</guid>
  <pubDate>Fri, 10 Nov 2023 02:33:38 -0600</pubDate>
  <link></link>
  <title><![CDATA[Charpak exchange program]]></title>
  <description><![CDATA[
<p>The scholarship is designed for Indian students from all fields and streams of study, enrolled in an Indian institution at the Bachelors or Master’s degree level, who wish to undertake a study exchange semester programme in France (for a period of one to six months).</p>

<p>BENEFITS <br />The Charpak exchange program offers the following benefits to the awardees based on merit: monthly stipend of 860 euros social security student visa and Campus France fee waiver assistance in finding an affordable student accommodation (subject to availability)</p>

<p>https://www.inde.campusfrance.org/charpak-exchange-scholarship-spring-session-jan-june</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36830/crossmap-a-program-for-convenient-conversion-of-genome-coordinates</guid>
	<pubDate>Thu, 31 May 2018 06:00:47 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36830/crossmap-a-program-for-convenient-conversion-of-genome-coordinates</link>
	<title><![CDATA[CrossMap: a program for convenient conversion of genome coordinates]]></title>
	<description><![CDATA[CrossMap is a program for convenient conversion of genome coordinates (or annotation files) between different assemblies (such as Human hg18 (NCBI36) &lt;&gt; hg19 (GRCh37), Mouse mm9 (MGSCv37) &lt;&gt; mm10 (GRCm38)).

It supports most commonly used file formats including SAM/BAM, Wiggle/BigWig, BED, GFF/GTF, VCF.

CrossMap is designed to liftover genome coordinates between assemblies. 

It’s not a program for aligning sequences to reference genome.

We do not recommend using CrossMap to convert genome coordinates between species.<p>Address of the bookmark: <a href="http://crossmap.sourceforge.net" rel="nofollow">http://crossmap.sourceforge.net</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>