<?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/33887?offset=40</link>
	<atom:link href="https://bioinformaticsonline.com/related/33887?offset=40" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/36870/understanding-liftover</guid>
	<pubDate>Wed, 06 Jun 2018 10:00:20 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/36870/understanding-liftover</link>
	<title><![CDATA[Understanding liftOver !]]></title>
	<description><![CDATA[<p>LiftOver is a necesary step to bring all genetical analysis to the same reference build. LiftOver can have three use cases:</p><p>(1) <a href="https://genome.sph.umich.edu/wiki/LiftOver#Lift_genome_positions">Convert genome position from one genome assembly to another genome assembly</a></p><p>In most scenarios, we have known genome positions in NCBI build 36 (UCSC hg 18) and hope to lift them over to NCBI build 37 (UCSC hg19).</p><p>(2) <a href="https://genome.sph.umich.edu/wiki/LiftOver#Lift_dbSNP_rs_numbers">Convert dbSNP rs number from one build to another</a></p><p>(3) <a href="https://genome.sph.umich.edu/wiki/LiftOver#Lift_Merlin.2FPLINK_format">Convert both genome position and dbSNP rs number over different versions</a></p><p>Run:</p><pre>liftOver input.bed hg18ToHg19.over.chain.gz output.bed unlifted.bed</pre><p>The outformat is as follow:</p><pre>Deleted in new:
    Sequence intersects no chains
Partially deleted in new:
    Sequence insufficiently intersects one chain
Split in new:
    Sequence insufficiently intersects multiple chains
Duplicated in new:
    Sequence sufficiently intersects multiple chains
Boundary problem:
    Missing start or end base in an exon</pre><p>For example:</p><p>If you liftOver <span>chr4:6497-6497 from <span>hg19 to GRch38 </span>and it return "deleted in new". </span></p><p>It means chr4:6497-6497 is part of a genomic contig on hg19 that is not anymore mapped on GRch38 because the new assembly is now better built without including this contig.</p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40505/decostar-reconstructing-the-ancestral-organization-of-genes-or-genomes-using-reconciled-phylogenies</guid>
	<pubDate>Fri, 03 Jan 2020 13:28:19 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40505/decostar-reconstructing-the-ancestral-organization-of-genes-or-genomes-using-reconciled-phylogenies</link>
	<title><![CDATA[DeCoSTAR: Reconstructing the Ancestral Organization of Genes or Genomes Using Reconciled Phylogenies]]></title>
	<description><![CDATA[<p>DeCoSTAR computes adjacency evolutionary scenarios using a scoring scheme based on a weighted sum of adjacency gains and breakages. Solutions, both optimal and near-optimal, are sampled according to the Boltzmann&ndash;Gibbs distribution centered around parsimonious solutions, and statistical supports on ancestral and extant adjacencies are provided. DeCoSTAR supports the features of previously contributed tools that reconstruct ancestral adjacencies, namely DeCo, DeCoLT, ART-DeCo, and DeClone. In a few minutes, DeCoSTAR can reconstruct the evolutionary history of domains inside genes, of gene fusion and fission events, or of gene order along chromosomes, for large data sets including dozens of whole genomes from all kingdoms of life.</p><p>Address of the bookmark: <a href="https://github.com/YoannAnselmetti/DeCoSTAR_pipeline" rel="nofollow">https://github.com/YoannAnselmetti/DeCoSTAR_pipeline</a></p>]]></description>
	<dc:creator>Shruti Paniwala</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42530/shovill-assemble-bacterial-isolate-genomes-from-illumina-paired-end-reads</guid>
	<pubDate>Sat, 02 Jan 2021 07:05:36 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42530/shovill-assemble-bacterial-isolate-genomes-from-illumina-paired-end-reads</link>
	<title><![CDATA[shovill: Assemble bacterial isolate genomes from Illumina paired-end reads]]></title>
	<description><![CDATA[<p><span>Shovill is a pipeline which uses SPAdes at its core, but alters the steps before and after the primary assembly step to get similar results in less time. Shovill also supports other assemblers like SKESA, Velvet and Megahit, so you can take advantage of the pre- and post-processing the Shovill provides with those too.</span></p><p>Address of the bookmark: <a href="https://github.com/tseemann/shovill" rel="nofollow">https://github.com/tseemann/shovill</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34562/harvest-a-suite-of-core-genome-alignment-and-visualization-tools</guid>
	<pubDate>Fri, 08 Dec 2017 07:16:03 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34562/harvest-a-suite-of-core-genome-alignment-and-visualization-tools</link>
	<title><![CDATA[Harvest: a suite of core-genome alignment and visualization tools]]></title>
	<description><![CDATA[<p>Harvest is a suite of core-genome alignment and visualization tools for quickly analyzing thousands of intraspecific microbial genomes, including variant calls, recombination detection, and phylogenetic trees.</p>
<p><a href="https://harvest.readthedocs.io/en/latest/_images/screen.png"><img src="https://harvest.readthedocs.io/en/latest/_images/screen.png" alt="_images/screen.png" style="border: 0px;"></a><span></span></p>
<p><strong>Tools</strong></p>
<ul>
<li><a href="https://harvest.readthedocs.io/en/latest/content/parsnp.html">Parsnp</a>&nbsp;- Core-genome alignment and analysis</li>
<li><a href="https://harvest.readthedocs.io/en/latest/content/gingr.html">Gingr</a>&nbsp;- Interactive visualization of alignments, trees and variants</li>
<li><a href="https://harvest.readthedocs.io/en/latest/content/harvest-tools.html">HarvestTools</a>&nbsp;- Archiving and postprocessing</li>
<li></li>
</ul><p>Address of the bookmark: <a href="https://harvest.readthedocs.io/en/latest/" rel="nofollow">https://harvest.readthedocs.io/en/latest/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/35802/bioinformatics-tools-to-detect-horizontal-gene-transfer-hgt-in-genomes</guid>
	<pubDate>Fri, 02 Mar 2018 04:56:23 -0600</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/35802/bioinformatics-tools-to-detect-horizontal-gene-transfer-hgt-in-genomes</link>
	<title><![CDATA[Bioinformatics tools to detect horizontal gene transfer (HGT) in genomes]]></title>
	<description><![CDATA[<p>Horizontal gene transfer (HGT), the &ldquo;non-sexual movement of genetic material between two organisms&rdquo; , is relatively common in prokaryotes&nbsp;and single-celled eukaryotes, but a number of factors combine to make it far rarer in multicellular eukaryotes. In order for a eukaryotic species to gain a gene by HGT, foreign DNA must enter the host nucleus, integrate into the genome, and in more complex organisms it must enter the sequestered germline in order to be transmitted to offspring. Once there, it must not experience strong negative selection, despite potential for genetic incompatibility with the host genome and mismatch between the niche of the donor and the host. Over the longer term, foreign DNA may become &ldquo;domesticated&rdquo; in the recipient genome and provide novel function.</p><p>Following are the popular tool to detect HGT in genomes:</p><p><a href="http://www.trex.uqam.ca/index.php?action=hgt&amp;project=trex">T-REX</a>&nbsp;/&nbsp;<a href="http://www.trex.uqam.ca/download/hgt-detection_3.22.zip">3.22</a></p><p>HGT detection /&nbsp;download &amp; compile</p><p><a href="https://www.ncbi.nlm.nih.gov/pubmed/20525630">20525630</a></p><p>&nbsp;</p><p><a href="http://compbio.engr.uconn.edu/software/RANGER-DTL/">RANGER-DTL</a>&nbsp;/&nbsp;<a href="http://compbio.engr.uconn.edu/software/RANGER-DTL/Linux.zip">2.0</a></p><p>HGT detection /&nbsp;download binary</p><p><a href="https://www.ncbi.nlm.nih.gov/pubmed/22689773">22689773</a></p><p>&nbsp;</p><p><a href="https://bioinfocs.rice.edu/phylonet">PhyloNet</a>&nbsp;/&nbsp;<a href="https://bioinfocs.rice.edu/sites/g/files/bxs266/f/kcfinder/files/PhyloNet_3.6.1.jar">3.6.1</a></p><p>HGT detection /&nbsp;download binary</p><p><a href="https://www.ncbi.nlm.nih.gov/pubmed/18662388">18662388</a></p><p>&nbsp;</p><p><a href="https://www.cs.hmc.edu/~hadas/jane/index.html">Jane</a>&nbsp;/&nbsp;<a href="https://www.cs.hmc.edu/~hadas/jane/form.html">4.01</a></p><p>HGT detection /&nbsp;download binary (!license!)</p><p><a href="https://www.ncbi.nlm.nih.gov/pubmed/20181081">20181081</a></p><p>&nbsp;</p><p><a href="http://www.tree-puzzle.de/">TREE-PUZZLE</a>&nbsp;/&nbsp;<a href="http://www.tree-puzzle.de/tree-puzzle-5.3.rc16-linux.tar.gz">5.3.rc16</a></p><p>HGT detection /&nbsp;download &amp; compile</p><p><a href="https://www.ncbi.nlm.nih.gov/pubmed/11934758">11934758</a></p><p>&nbsp;</p><p><a href="http://www.sigmath.es.osaka-u.ac.jp/shimo-lab/prog/consel/">CONSEL</a>&nbsp;/&nbsp;<a href="http://www.sigmath.es.osaka-u.ac.jp/shimo-lab/prog/consel/pub/cnsls020.tgz">0.20</a></p><p>HGT detection /&nbsp;download</p><p><a href="https://www.ncbi.nlm.nih.gov/pubmed/11751242">11751242</a></p><p>&nbsp;</p><p><a href="http://darkhorse.ucsd.edu/">DarkHorse</a>&nbsp;/&nbsp;<a href="http://darkhorse.ucsd.edu/DarkHorse-1.5_rev170.tar.gz">1.5 rev170</a></p><p>HGT detection /&nbsp;download &amp; install</p><p><a href="https://www.ncbi.nlm.nih.gov/pubmed/17274820">17274820</a></p><p>&nbsp;</p><p><a href="https://github.com/DittmarLab/HGTector">HGTector</a>&nbsp;/&nbsp;<a href="https://github.com/DittmarLab/HGTector/archive/wgshgt.zip">0.2.1</a></p><p>HGT detection /&nbsp;git clone</p><p><a href="https://www.ncbi.nlm.nih.gov/pubmed/25159222">25159222</a></p><p>&nbsp;</p><p><a href="http://www5.esu.edu/cpsc/bioinfo/software/EGID/">EGID</a>&nbsp;/&nbsp;<a href="http://www5.esu.edu/cpsc/bioinfo/software/EGID/EGID_1.0.tar.gz">1.0</a></p><p>HGT detection /&nbsp;download</p><p><a href="https://www.ncbi.nlm.nih.gov/pubmed/22355228">22355228</a></p><p>&nbsp;</p><p><a href="http://exon.gatech.edu/GeneMark/">GeneMarkS</a>&nbsp;/&nbsp;<a href="http://exon.gatech.edu/GeneMark/license_download.cgi">4.30</a></p><p>HGT detection / download binary (!license!)</p><p><a href="https://www.ncbi.nlm.nih.gov/pubmed/9461475">9461475</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36837/ranbow-a-haplotype-assembler-for-polyploid-genomes</guid>
	<pubDate>Fri, 01 Jun 2018 07:21:54 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36837/ranbow-a-haplotype-assembler-for-polyploid-genomes</link>
	<title><![CDATA[Ranbow: a haplotype assembler for polyploid genomes]]></title>
	<description><![CDATA[Ranbow is a haplotype assembler for polyploid genomes. It has been developed for the haplotype assembly of the hexaploid sweet potato genome, which is highly heterozygous. Ranbow can also be applied to other polyploid genomes. After a first phasing, Ranbow utilizes the assembled haplotypes to improve the accuracy of variant calling results and to infer the evolutionary history of the organism´s genome. Ranbow has three main modes of function:

ranbow hap: for haplotyping
ranbow eval: for evaluating of the assemble haplotypes by gold standard (long) reads 
ranbow phylo: for the phylogenetic analysis<p>Address of the bookmark: <a href="https://www.molgen.mpg.de/ranbow" rel="nofollow">https://www.molgen.mpg.de/ranbow</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37980/csbfinder-discovery-of-colinear-syntenic-blocks-across-thousands-of-prokaryotic-genomes</guid>
	<pubDate>Wed, 24 Oct 2018 22:12:27 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37980/csbfinder-discovery-of-colinear-syntenic-blocks-across-thousands-of-prokaryotic-genomes</link>
	<title><![CDATA[CSBFinder: Discovery of colinear syntenic blocks across thousands of prokaryotic genomes]]></title>
	<description><![CDATA[<p>CSBFinder is a standalone Desktop java application with a graphical user interface, that can also be executed via command line.</p>
<p>CSBFinder implements a novel methodology for the discovery, ranking, and taxonomic distribution analysis of colinear syntenic blocks (<span>CSBs</span>) - groups of genes that are consistently located close to each other, in the same order, across a wide range of taxa. CSBFinder incorporates an efficient algorithm that identifies CSBs in large genomic datasets. The discovered CSBs are ranked according to a probabilistic score and clustered to families according to their gene content similarity.</p><p>Address of the bookmark: <a href="https://github.com/dinasv/CSBFinder" rel="nofollow">https://github.com/dinasv/CSBFinder</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/39869/mfannot-a-program-for-the-annotation-of-mitochondrial-and-plastid-genomes</guid>
	<pubDate>Mon, 26 Aug 2019 11:47:56 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/39869/mfannot-a-program-for-the-annotation-of-mitochondrial-and-plastid-genomes</link>
	<title><![CDATA[MFannot : a program for the annotation of mitochondrial and plastid genomes]]></title>
	<description><![CDATA[<p><span>MFannot is a program for the annotation of mitochondrial and plastid genomes</span></p>
<p>MFannot is a program for the annotation of mitochondrial and plastid genomes. It is a PERL wrapper around a set of diverse, external independent tools.</p>
<p>It makes intense use of RNA/intron detection tools including&nbsp;<a href="http://hmmer.org/">HMMER</a>,&nbsp;<a href="https://github.com/nathanweeks/exonerate">Exonerate</a>,&nbsp;<a href="https://bioinformatics.ca/links_directory/tool/9822/erpin">Erpin</a>&nbsp;and others.</p>
<p><a href="http://megasun.bch.umontreal.ca/cgi-bin/mfannot/mfannotInterface.pl">http://megasun.bch.umontreal.ca/cgi-bin/mfannot/mfannotInterface.pl</a></p><p>Address of the bookmark: <a href="https://github.com/BFL-lab/Mfannot" rel="nofollow">https://github.com/BFL-lab/Mfannot</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41125/chromonomer-a-tool-set-for-repairing-and-enhancing-assembled-genomes-through-integration-of-genetic-maps-and-conserved-synteny</guid>
	<pubDate>Mon, 17 Feb 2020 05:38:46 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41125/chromonomer-a-tool-set-for-repairing-and-enhancing-assembled-genomes-through-integration-of-genetic-maps-and-conserved-synteny</link>
	<title><![CDATA[Chromonomer: a tool set for repairing and enhancing assembled genomes through integration of genetic maps and conserved synteny]]></title>
	<description><![CDATA[<p>Chromonomer is a program designed to integrate a genome assembly with a genetic map. Chromonomer tries very hard to identify and remove markers that are out of order in the genetic map, when considered against their local assembly order; and to identify scaffolds that have been incorrectly assembled according to the genetic map, and split those scaffolds.</p><p>Address of the bookmark: <a href="http://catchenlab.life.illinois.edu/chromonomer/" rel="nofollow">http://catchenlab.life.illinois.edu/chromonomer/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41918/phispy-phispy-identifies-prophages-in-bacterial-and-probably-archaeal-genomes</guid>
	<pubDate>Tue, 30 Jun 2020 21:36:19 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41918/phispy-phispy-identifies-prophages-in-bacterial-and-probably-archaeal-genomes</link>
	<title><![CDATA[PhiSpy: PhiSpy identifies prophages in Bacterial (and probably Archaeal) genomes]]></title>
	<description><![CDATA[<p>PhiSpy identifies prophages in Bacterial (and probably Archaeal) genomes. Given an annotated genome it will use several approaches to identify the most likely prophage regions.</p>
<p>Initial versions of PhiSpy were written by</p>
<p>Sajia Akhter (<a href="mailto:sajia@stanford.edu">sajia@stanford.edu</a>)&nbsp;<a href="http://edwards.sdsu.edu/research/">Edwards Bioinformatics Lab</a></p>
<p>Improvements, bug fixes, and other changes were made by</p>
<p>Katelyn McNair&nbsp;<a href="http://edwards.sdsu.edu/research/">Edwards Bioinformatics Lab</a>&nbsp;and Przemyslaw Decewicz&nbsp;<a href="http://ddlemb.com/">DEMB at the University of Warsaw</a></p><p>Address of the bookmark: <a href="https://github.com/linsalrob/PhiSpy" rel="nofollow">https://github.com/linsalrob/PhiSpy</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>