<?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/43614?offset=330</link>
	<atom:link href="https://bioinformaticsonline.com/related/43614?offset=330" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30144/bima-v3-an-aligner-customized-for-mate-pair-library-sequencing</guid>
	<pubDate>Wed, 14 Dec 2016 15:20:00 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30144/bima-v3-an-aligner-customized-for-mate-pair-library-sequencing</link>
	<title><![CDATA[BIMA V3: an aligner customized for mate pair library sequencing]]></title>
	<description><![CDATA[<p>Summary: Mate pair library sequencing is an effective and economical method for detecting genomic structural variants and chromosomal abnormalities. Unfortunately, the mapping and alignment of mate pair read pairs to a reference genome is a challenging and <br>time consuming process for most NGS alignment programs. Large insert sizes, introduction of library preparation protocol artifacts (biotin junction reads, paired-end read contamination, chimeras, etc.), and presence of structural variant breakpoints within reads increases mapping and alignment complexity. We describe an algorithm that is up to 20 times faster and 25% more accurate than popular NGS alignment programs when processing mate pair sequencing. <br>Availability: http://bioinformaticstools.mayo.edu/research/bima/ <br>Contact: vasmatzis.george@mayo.edu</p><p>Address of the bookmark: <a href="http://bioinformatics.oxfordjournals.org/content/early/2014/02/12/bioinformatics.btu078.full.pdf" rel="nofollow">http://bioinformatics.oxfordjournals.org/content/early/2014/02/12/bioinformatics.btu078.full.pdf</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30304/mcscan</guid>
	<pubDate>Thu, 22 Dec 2016 03:53:58 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30304/mcscan</link>
	<title><![CDATA[MCscan]]></title>
	<description><![CDATA[<p><span>MCscan is a computer program that can simultaneously scan multiple genomes to identify homologous chromosomal regions and subsequently align these regions using genes as anchors. This is the toolset for generating the synteny correspondences in&nbsp;</span><a href="http://chibba.agtec.uga.edu/duplication">Plant Genome Duplication Database</a><span>. It is intended as an easy-to-use and quick way to identify conserved gene arrays both within the same genome and across different genomes.</span></p>
<p><span>More at&nbsp;http://chibba.agtec.uga.edu/duplication/mcscan/</span></p><p>Address of the bookmark: <a href="http://chibba.agtec.uga.edu/duplication/mcscan/" rel="nofollow">http://chibba.agtec.uga.edu/duplication/mcscan/</a></p>]]></description>
	<dc:creator>Bulbul</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/31012/genomecomp</guid>
	<pubDate>Fri, 17 Feb 2017 08:38:32 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/31012/genomecomp</link>
	<title><![CDATA[GenomeComp]]></title>
	<description><![CDATA[<p>GenomeComp is a tool for summarizing, parsing and visualizing the genome wide sequence comparison results derived from voluminous BLAST textual output, so as to locate the rearrangements, insertions or deletions of genome segments between species or strains.<br><br>It can be easily used to compare, parsing and visualize large genomic sequences, especially closely related genomes such as inter-species or inter-strains. In addition, it can also show other sequence features like repeat sequence distributions in one whole-genome DNA sequence by comparing the genome to itself.<br><br>It is a stand-alone graphical user interface (GUI) program which runs on Linux, Unix, Mac OS X (tested on version 10.2.4 only) and Microsoft Windows platforms and is written in Perl/Tk.</p><p>Address of the bookmark: <a href="http://www.mgc.ac.cn/GenomeComp/" rel="nofollow">http://www.mgc.ac.cn/GenomeComp/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/31209/dial</guid>
	<pubDate>Wed, 01 Mar 2017 08:42:28 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/31209/dial</link>
	<title><![CDATA[DIAL]]></title>
	<description><![CDATA[<p>A computational pipeline for identifying single-base substitutions between two closely related genomes without the help of a reference genome. DIAL works even when the depth of coverage is insufficient for de novo assembly, and it can be extended to determine small insertions/deletions. Our main motivation is to use this tool to survey the genetic diversity of endangered species as the identified sequence differences can be used to design genotyping arrays to assist in the species' management.</p>
<p>http://www.bx.psu.edu/~ratan/</p><p>Address of the bookmark: <a href="http://www.bx.psu.edu/miller_lab/" rel="nofollow">http://www.bx.psu.edu/miller_lab/</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/31881/gbtools-interactive-visualization-of-metagenome-bins-in-r</guid>
	<pubDate>Sun, 26 Mar 2017 15:41:31 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/31881/gbtools-interactive-visualization-of-metagenome-bins-in-r</link>
	<title><![CDATA[gbtools: Interactive Visualization of Metagenome Bins in R]]></title>
	<description><![CDATA[<p><span>We have developed gbtools, a software package that allows users to visualize metagenomic assemblies by plotting coverage (sequencing depth) and GC values of contigs, and also to annotate the plots with taxonomic information. Different sets of annotations, including taxonomic assignments from conserved marker genes or SSU rRNA genes, can be imported simultaneously; users can choose which annotations to plot. Bins can be manually defined from plots, or be imported from third-party binning tools and overlaid onto plots, such that results from different methods can be compared side-by-side. gbtools reports summary statistics of bins including marker gene completeness, and allows the user to add or subtract bins with each other.&nbsp;</span></p>
<p><span>Tool at&nbsp;https://github.com/kbseah/genome-bin-tools</span></p><p>Address of the bookmark: <a href="http://journal.frontiersin.org/article/10.3389/fmicb.2015.01451/full" rel="nofollow">http://journal.frontiersin.org/article/10.3389/fmicb.2015.01451/full</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/33720/deschrambler</guid>
	<pubDate>Thu, 29 Jun 2017 11:54:59 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/33720/deschrambler</link>
	<title><![CDATA[DESCHRAMBLER]]></title>
	<description><![CDATA[<p>DESCHRAMBLER is shown to produce highly accurate reconstructions using data simulation and by benchmarking it against other reconstruction tools</p>
<p>You can find the detail of reconstructed data at http://bioinfo.konkuk.ac.kr/DESCHRAMBLER/</p><p>Address of the bookmark: <a href="https://github.com/jkimlab/DESCHRAMBLER" rel="nofollow">https://github.com/jkimlab/DESCHRAMBLER</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36950/salsa-a-tool-to-scaffold-long-read-assemblies-with-hi-c</guid>
	<pubDate>Fri, 15 Jun 2018 04:01:15 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36950/salsa-a-tool-to-scaffold-long-read-assemblies-with-hi-c</link>
	<title><![CDATA[SALSA: A tool to scaffold long read assemblies with Hi-C]]></title>
	<description><![CDATA[This code is used to scaffold your assemblies using Hi-C data. This version implements some improvements in the original SALSA algorithm. If you want to use the old version, it can be found in the old_salsa branch.

To use the latest version, first run the following commands:

  cd SALSA
  make
To run the code, you will need Python 2.7, BOOST libraries and Networkx(version lower than 1.2).

If you consider using this tool, please cite our publication which describes the methods used for scaffolding.

Ghurye, J., Pop, M., Koren, S., Bickhart, D., &amp; Chin, C. S. (2017). Scaffolding of long read assemblies using long range contact information. BMC genomics, 18(1), 527. Link

Ghurye, J., Rhie, A., Walenz, B.P., Schmitt, A., Selvaraj, S., Pop, M., Phillippy, A.M. and Koren, S., 2018. Integrating Hi-C links with assembly graphs for chromosome-scale assembly. bioRxiv, p.261149 Link

For any queries, please either ask on github issue page or send an email to Jay Ghurye (jayg@cs.umd.edu).<p>Address of the bookmark: <a href="https://github.com/machinegun/SALSA" rel="nofollow">https://github.com/machinegun/SALSA</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/37927/you-cant-hide-from-genome-hackers</guid>
	<pubDate>Sat, 13 Oct 2018 14:17:28 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/37927/you-cant-hide-from-genome-hackers</link>
	<title><![CDATA[You can't hide from Genome Hackers]]></title>
	<description><![CDATA[<p><span>Young computational biologist named Yaniv Erlich shocked the research world by showing it was possible to&nbsp;</span><a href="https://www.wired.com/2013/01/your-genome-could-reveal-your-identity/">unmask the identities</a><span>&nbsp;of people listed in anonymous genetic databases using&nbsp;</span><a href="http://science.sciencemag.org/content/339/6117/321" target="_blank">only an Internet connection</a></p><p>Paper: http://science.sciencemag.org/content/early/2018/10/10/science.aau4832</p><p>More at&nbsp;https://www.wired.com/story/genome-hackers-show-no-ones-dna-is-anonymous-anymore/</p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38441/genome-sequence-based-sub-species-delineation</guid>
	<pubDate>Wed, 12 Dec 2018 08:31:14 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38441/genome-sequence-based-sub-species-delineation</link>
	<title><![CDATA[Genome sequence-based (sub-)species delineation.]]></title>
	<description><![CDATA[<p>The GGDC web service reports digital DDH for a universal and accurate delineation of prokaryotic (sub-)species without inheriting the pitfalls of classic DDH, and also calculates differences in genomic G+C content.</p>
<p>http://ggdc.dsmz.de/ggdc_background.php#</p>
<p><small>Genome-to-Genome Distance Calculator 2.1</small></p>
<p>http://ggdc.dsmz.de/ggdc.php</p>
<p>&nbsp;</p><p>Address of the bookmark: <a href="http://ggdc.dsmz.de/" rel="nofollow">http://ggdc.dsmz.de/</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/39250/darwin-wga-a-co-processor-provides-increased-sensitivity-in-whole-genome-alignments-with-high-speedup</guid>
	<pubDate>Sat, 13 Apr 2019 08:55:31 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/39250/darwin-wga-a-co-processor-provides-increased-sensitivity-in-whole-genome-alignments-with-high-speedup</link>
	<title><![CDATA[Darwin-WGA: A Co-processor Provides Increased Sensitivity in Whole Genome Alignments with High Speedup]]></title>
	<description><![CDATA[<p>Darwin-WGA, is the first hardware accelerator for whole genome alignment and accelerates the gapped filtering stage. Darwin-WGA also employs GACT-X, a novel algorithm used in the extension stage to align arbitrarily long genome sequences using a small on-chip memory, that provides better quality alignments at 2&times; improvement in memory and speed over the previously published GACT algorithm. Implemented on an FPGA, Darwin-WGA provides up to 24&times; improvement (performance/$) in WGA over iso-sensitive software.</p>
<p><a href="https://stanford.edu/~yatisht/pubs/darwin-wga.pdf">https://stanford.edu/~yatisht/pubs/darwin-wga.pdf</a></p><p>Address of the bookmark: <a href="https://github.com/gsneha26/Darwin-WGA" rel="nofollow">https://github.com/gsneha26/Darwin-WGA</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>