<?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/38505?offset=190</link>
	<atom:link href="https://bioinformaticsonline.com/related/38505?offset=190" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/35619/tallymer-method-to-compute-k-mer-frequencies-and-its-application-to-annotate-large-repetitive-plant-genomes</guid>
	<pubDate>Thu, 15 Feb 2018 10:21:02 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/35619/tallymer-method-to-compute-k-mer-frequencies-and-its-application-to-annotate-large-repetitive-plant-genomes</link>
	<title><![CDATA[Tallymer: method to compute K-mer frequencies and its application to annotate large repetitive plant genomes]]></title>
	<description><![CDATA[<p>Tallymer is based on enhanced suffix arrays. This gives a much larger flexibility concerning the choice of the&nbsp;<span>k</span>-mer size. Tallymer can process large data sizes of several billion bases. We used it in a variety of applications to study the genomes of maize and other plant species. In particular, Tallymer was used to index a set whole genome shotgun sequences from maize (B73) (total size 10<sup>9</sup>&nbsp;bp).&nbsp;<br>Tallymer was effective in a variety of applications to aid genome annotation in maize, despite limitations imposed by the relatively low coverage of sequence available.</p>
<p>A manual can be found&nbsp;<a href="https://www.zbh.uni-hamburg.de/fileadmin/gi/tallymer/tallymer.pdf" target="_blank" title="tallymer.pdf (111 KB)">here</a>.</p><p>Address of the bookmark: <a href="https://www.zbh.uni-hamburg.de/forschung/arbeitsgruppe-genominformatik/software/tallymer.html" rel="nofollow">https://www.zbh.uni-hamburg.de/forschung/arbeitsgruppe-genominformatik/software/tallymer.html</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36800/genomemapper-simultaneous-alignment-of-short-reads-against-multiple-genomes</guid>
	<pubDate>Fri, 25 May 2018 09:29:44 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36800/genomemapper-simultaneous-alignment-of-short-reads-against-multiple-genomes</link>
	<title><![CDATA[GenomeMapper: Simultaneous alignment of short reads against multiple genomes]]></title>
	<description><![CDATA[GenomeMapper is a short read mapping tool designed for accurate read alignments. It quickly aligns millions of reads either with ungapped or gapped alignments. It can be used to align against multiple genomes simulanteously or against a single reference. If you are unsure which one is the appropriate GenomeMapper, you might want to use the latter

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC2768987/<p>Address of the bookmark: <a href="http://1001genomes.org/software/genomemapper.html" rel="nofollow">http://1001genomes.org/software/genomemapper.html</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/40699/kevler-reference-free-variant-discovery-in-large-eukaryotic-genomes</guid>
	<pubDate>Tue, 28 Jan 2020 03:21:53 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40699/kevler-reference-free-variant-discovery-in-large-eukaryotic-genomes</link>
	<title><![CDATA[Kevler: Reference-free variant discovery in large eukaryotic genomes]]></title>
	<description><![CDATA[<p><span>Welcome to&nbsp;</span><span>kevlar</span><span>, software for predicting&nbsp;</span><em>de novo</em><span>&nbsp;genetic variants without mapping reads to a reference genome! kevlar's&nbsp;</span><em>k</em><span>-mer abundance based method calls single nucleotide variants (SNVs), multinucleotide variants (MNVs), insertion/deletion variants (indels), and structural variants (SVs) simultaneously with a single simple model.&nbsp;</span></p>
<p><span>More at&nbsp;<a href="https://kevlar.readthedocs.io/en/latest/">https://kevlar.readthedocs.io/en/latest/</a></span></p>
<p><span><a href="https://www.cell.com/iscience/pdf/S2589-0042(19)30259-7.pdf">https://www.cell.com/iscience/pdf/S2589-0042(19)30259-7.pdf</a></span></p><p>Address of the bookmark: <a href="https://github.com/kevlar-dev/kevlar" rel="nofollow">https://github.com/kevlar-dev/kevlar</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>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43806/genomicus-genome-browser-that-enables-users-to-navigate-in-genomes-in-several-dimensions</guid>
	<pubDate>Mon, 28 Feb 2022 23:27:37 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43806/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><br><strong>Summary statistics of Genomicus version 105.01:</strong><span>&nbsp;(view species tree in&nbsp;</span><a href="https://www.genomicus.bio.ens.psl.eu/genomicus-105.01/data/SpeciesTree.pdf">pdf</a><span>&nbsp;or&nbsp;</span><a href="https://www.genomicus.bio.ens.psl.eu/genomicus-105.01/data/SpeciesTree.nwk">newick</a><span>)</span><br><br></p>
<table id="introstats">
<tbody>
<tr><th>Number of extant species</th>
<td>200</td>
</tr>
<tr><th>Number of extant genes</th>
<td>4303993</td>
</tr>
<tr><th>&nbsp;</th></tr>
<tr><th>Number of ancestral species</th>
<td>196</td>
</tr>
<tr><th>Number of ancestral genes</th>
<td>4624213</td>
</tr>
<tr><th>Number of ancestral synteny blocks</th>
<td>83342<br><br></td>
</tr>
</tbody>
</table><p>Address of the bookmark: <a href="https://www.genomicus.bio.ens.psl.eu/genomicus-105.01/cgi-bin/search.pl" rel="nofollow">https://www.genomicus.bio.ens.psl.eu/genomicus-105.01/cgi-bin/search.pl</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44655/ngenomesyn-an-easy-to-use-and-flexible-tool-for-publication-ready-visualization-of-syntenic-relationships-across-multiple-genomes</guid>
	<pubDate>Tue, 10 Sep 2024 04:54:55 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44655/ngenomesyn-an-easy-to-use-and-flexible-tool-for-publication-ready-visualization-of-syntenic-relationships-across-multiple-genomes</link>
	<title><![CDATA[NGenomeSyn: an easy-to-use and flexible tool for publication-ready visualization of syntenic relationships across multiple genomes]]></title>
	<description><![CDATA[<p>NGenomeSyn: an easy-to-use and flexible tool for publication-ready visualization of syntenic relationships across multiple genomes&nbsp;</p>
<p><img src="https://github.com/hewm2008/NGenomeSyn/raw/main/Example/example2/OUT3.png" alt="image" style="border: 0px;"></p>
<p><span>NGenomeSyn [multiple (N) Genome Synteny], for publication-ready visualization of syntenic relationships of the whole genome or local region and genomic features (e.g. repeats, structural variations, genes) across multiple genomes with a high customization. NGenomeSyn provides an easy way for its users to visualize a large amount of data with a rich layout by simply adjusting options for moving, scaling, and rotation of target genomes. Moreover, NGenomeSyn could be applied on the visualization of relationships on non-genomic data with similar input formats.</span></p>
<p>https://academic.oup.com/bioinformatics/article/39/3/btad121/7072460</p><p>Address of the bookmark: <a href="https://github.com/hewm2008/NGenomeSyn" rel="nofollow">https://github.com/hewm2008/NGenomeSyn</a></p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41485/chromosight-computer-vision-based-program-for-pattern-recognition-in-chromosome-hi-c-contact-maps</guid>
	<pubDate>Mon, 23 Mar 2020 06:20:04 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41485/chromosight-computer-vision-based-program-for-pattern-recognition-in-chromosome-hi-c-contact-maps</link>
	<title><![CDATA[chromosight: Computer vision based program for pattern recognition in chromosome (Hi-C) contact maps]]></title>
	<description><![CDATA[<p>Python package to detect chromatin loops (and other patterns) in Hi-C contact maps.</p>
<p>Stable version with pip:</p>
<div>
<pre>pip3 install --user chromosight</pre>
</div>
<p>Stable version with conda:</p>
<div>
<pre>conda install -c bioconda -c conda-forge chromosight</pre>
</div>
<p>or, if you want to get the latest development version:</p>
<pre><code>pip3 install --user -e git+https://github.com/koszullab/chromosight.git@master#egg=chromosight</code></pre><p>Address of the bookmark: <a href="https://github.com/koszullab/Chromosight" rel="nofollow">https://github.com/koszullab/Chromosight</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/39104/hipstr-haplotype-inference-and-phasing-for-short-tandem-repeats</guid>
	<pubDate>Thu, 07 Mar 2019 21:13:06 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/39104/hipstr-haplotype-inference-and-phasing-for-short-tandem-repeats</link>
	<title><![CDATA[HipSTR: Haplotype inference and phasing for Short Tandem Repeats]]></title>
	<description><![CDATA[<p><span>HipSTR</span>&nbsp;was specifically developed to deal with these errors in the hopes of obtaining more robust STR genotypes. In particular, it accomplishes this by:</p>
<ol>
<li>Learning locus-specific PCR stutter models using an&nbsp;<a href="http://en.wikipedia.org/wiki/Expectation-maximization_algorithm">EM algorithm</a></li>
<li>Mining candidate STR alleles from population-scale sequencing data</li>
<li>Employing a specialized hidden Markov model to align reads to candidate alleles while accounting for STR artifacts</li>
<li>Utilizing phased SNP haplotypes to genotype and phase STRs</li>
</ol><p>Address of the bookmark: <a href="https://github.com/tfwillems/HipSTR" rel="nofollow">https://github.com/tfwillems/HipSTR</a></p>]]></description>
	<dc:creator>BioJoker</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/28417/wisescaffolder</guid>
	<pubDate>Wed, 13 Jul 2016 08:08:57 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/28417/wisescaffolder</link>
	<title><![CDATA[WiseScaffolder]]></title>
	<description><![CDATA[<p>Function</p>
<p>WiseScaffolder is a stand-alone semi-automatic application for genome scaffolding of pre-assembled contigs using mate-pair data. It also produces editable scaffold maps, allowing either to build gapped scaffolds or usable as a common thread for the manual improvement of scaffolds.</p>
<p>Description&nbsp;</p>
<p>WiseScaffolder includes 4 subcommands: dumpconfig generates a configuration file that notably specifies the average insert size of the mate-pair library preprocess allows the detection and correction of chimerae, the estimation of contigs copy number and produces valuable outputs for the manual improvement of scaffolds scaffold constitutes the central scaffold-builder and comprises two modules:</p>
<p>i) the interative_scaffold_extender, which works with big, unambiguous contigs, or when they run out, single copy contigs, and</p>
<p>ii) the small_contig_inserter, which inserts the small contigs within scaffolds buildfasta converts the scaffold(s) map(s) into Fasta sequences.</p><p>Address of the bookmark: <a href="http://abims.sb-roscoff.fr/wisescaffolder" rel="nofollow">http://abims.sb-roscoff.fr/wisescaffolder</a></p>]]></description>
	<dc:creator>Poonam Mahapatra</dc:creator>
</item>

</channel>
</rss>