<?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/3925?offset=100</link>
	<atom:link href="https://bioinformaticsonline.com/related/3925?offset=100" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43062/jcvi-utility-libraries</guid>
	<pubDate>Sat, 08 May 2021 22:04:02 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43062/jcvi-utility-libraries</link>
	<title><![CDATA[JCVI utility libraries]]></title>
	<description><![CDATA[<p><span>Collection of Python libraries to parse bioinformatics files, or perform computation related to assembly, annotation, and comparative genomics.</span></p><p>Address of the bookmark: <a href="https://github.com/tanghaibao/jcvi" rel="nofollow">https://github.com/tanghaibao/jcvi</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44902/hite-a-fast-and-accurate-dynamic-boundary-adjustment-approach-for-full-length-transposable-elements-detection-and-annotation-in-genome-assemblies</guid>
	<pubDate>Sat, 20 Sep 2025 09:34:04 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44902/hite-a-fast-and-accurate-dynamic-boundary-adjustment-approach-for-full-length-transposable-elements-detection-and-annotation-in-genome-assemblies</link>
	<title><![CDATA[HiTE: a fast and accurate dynamic boundary adjustment approach for full-length Transposable Elements detection and annotation in Genome Assemblies]]></title>
	<description><![CDATA[<p dir="auto"><code>HiTE</code>&nbsp;is a Python software that uses a dynamic boundary adjustment approach to detect and annotate full-length Transposable Elements in Genome Assemblies. In comparison to other tools, HiTE demonstrates superior performance in detecting a greater number of full-length TEs.</p>
<div dir="auto">
<h2 dir="auto">panHiTE</h2>
<a href="https://github.com/CSU-KangHu/HiTE#panhite"></a></div>
<p dir="auto">We have developed panHiTE, a comprehensive and accurate pipeline for TE detection in large-scale population genomes. It has been successfully applied to hundreds of plant population genomes, demonstrating its effectiveness and scalability.</p>
<p dir="auto">For detailed instructions, please refer to the&nbsp;<a href="https://github.com/CSU-KangHu/HiTE/wiki/panHiTE-tutorial">panHiTE tutorial</a>.</p><p>Address of the bookmark: <a href="https://github.com/CSU-KangHu/HiTE" rel="nofollow">https://github.com/CSU-KangHu/HiTE</a></p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/31024/dagchainer-computing-chains-of-syntenic-genes-in-complete-genomes</guid>
	<pubDate>Fri, 17 Feb 2017 16:13:35 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/31024/dagchainer-computing-chains-of-syntenic-genes-in-complete-genomes</link>
	<title><![CDATA[DAGchainer: Computing Chains of Syntenic Genes in Complete Genomes]]></title>
	<description><![CDATA[<p>The DAGchainer software computes chains of syntenic genes found within complete genome sequences. As input, DAGchainer accepts a list of gene pairs with sequence homology along with their genome coordinates. Using a scoring function which accounts for the distance between neighboring genes on each DNA molecule and the BLAST E-value score between homologs, maximally scoring chains of ordered gene pairs are computed and reported. This algorithm can be used to mine large evolutionary conserved regions of genomes between two organisms. Alternatively, by examining colinear sets of homologous genes found within a single genome, segmental genome duplications can be revealed.</p>
<p>This software distribution includes both the DAGchainer utility and a Java-based graphical interface that allows the inputs and outputs to be navigated and interrogated dynamically.</p><p>Address of the bookmark: <a href="http://dagchainer.sourceforge.net/" rel="nofollow">http://dagchainer.sourceforge.net/</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/33976/goldgenomes-online-database</guid>
	<pubDate>Wed, 26 Jul 2017 07:49:29 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/33976/goldgenomes-online-database</link>
	<title><![CDATA[GOLD:Genomes Online Database]]></title>
	<description><![CDATA[<p><span>GOLD</span><span>:Genomes Online Database, is a World Wide Web resource for comprehensive access to information regarding genome and metagenome sequencing projects, and their associated metadata, around the world.</span></p>
<p>https://gold.jgi.doe.gov/</p><p>Address of the bookmark: <a href="https://gold.jgi.doe.gov/" rel="nofollow">https://gold.jgi.doe.gov/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<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/34377/genomicus-genome-browser-that-enables-users-to-navigate-in-genomes-in-several-dimensions</guid>
	<pubDate>Sat, 18 Nov 2017 16:10:16 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34377/genomicus-genome-browser-that-enables-users-to-navigate-in-genomes-in-several-dimensions</link>
	<title><![CDATA[Genomicus: genome browser that enables users to navigate in genomes in several dimensions]]></title>
	<description><![CDATA[<p>Genomicus is a genome browser that enables users to navigate in genomes in several dimensions: linearly along chromosome axes, transversaly across different species, and chronologicaly along evolutionary time.</p>
<p>Once a query gene has been entered, it is displayed in its genomic context in parallel to the genomic context of all its orthologous and paralogous copies in all the other sequenced metazoan genomes. Moreover, Genomicus stores and displays the predicted ancestral genome structure in all the ancestral species within the phylogenetic range of interest.</p>
<p>All the data on extant species displayed in this browser are from&nbsp;<a href="http://www.ensembl.org/">Ensembl</a>.</p><p>Address of the bookmark: <a href="http://genomicus.biologie.ens.fr/genomicus-90.01/cgi-bin/search.pl" rel="nofollow">http://genomicus.biologie.ens.fr/genomicus-90.01/cgi-bin/search.pl</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34877/recovery-of-complete-genomes-from-metagenomes</guid>
	<pubDate>Wed, 27 Dec 2017 00:04:55 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34877/recovery-of-complete-genomes-from-metagenomes</link>
	<title><![CDATA[Recovery of complete genomes from metagenomes]]></title>
	<description><![CDATA[<p>This project contains scripts and tutorials on how to assemble individual microbial genomes from metagenomes, as described in:</p>
<p><strong>Genome sequences of rare, uncultured bacteria obtained by differential coverage binning of multiple metagenomes</strong></p>
<p><a href="http://personprofil.aau.dk/120257">Mads Albertsen</a>,&nbsp;<a href="http://ecogenomic.org/users/phil-hugenholtz">Philip Hugenholtz</a>,&nbsp;<a href="http://ecogenomic.org/users/adam-skarshewski">Adam Skarshewski</a>,&nbsp;<a href="http://www.ecogenomic.org/users/gene-tyson">Gene W. Tyson</a>,&nbsp;<a href="http://personprofil.aau.dk/103057">K&aring;re L. Nielsen</a>&nbsp;and&nbsp;<a href="http://personprofil.aau.dk/105842">Per .H. Nielsen</a></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>Address of the bookmark: <a href="http://madsalbertsen.github.io/multi-metagenome/" rel="nofollow">http://madsalbertsen.github.io/multi-metagenome/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36590/digest-in-silico-restriction-digest-of-complete-genomes</guid>
	<pubDate>Mon, 14 May 2018 04:02:52 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36590/digest-in-silico-restriction-digest-of-complete-genomes</link>
	<title><![CDATA[Digest: In silico restriction digest of complete genomes]]></title>
	<description><![CDATA[<p><span>This tool allows to retrieve number of cleavages yielded by commercially available endonucleases in up-to-date sequenced prokaryotic genomes. When the number of fragments is bellow 50, Pulse Field gel Electrophoresis (PFGE) is simulated.</span></p>
<p>A tool for restriction digest of&nbsp;<a href="http://insilico.ehu.eus/restriction/long_seq/">long</a>user's sequences is available.</p>
<p>&nbsp;</p><p>Address of the bookmark: <a href="http://insilico.ehu.es/digest/" rel="nofollow">http://insilico.ehu.es/digest/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>