<?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/33791?offset=20</link>
	<atom:link href="https://bioinformaticsonline.com/related/33791?offset=20" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42794/tmrca-calculator</guid>
	<pubDate>Wed, 03 Feb 2021 05:07:30 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42794/tmrca-calculator</link>
	<title><![CDATA[TMRCA Calculator]]></title>
	<description><![CDATA[<p><span>This program calculates the probability that two people have a certain number of generations between them, based on the standard&nbsp;</span><em>infinite alleles</em><span>&nbsp;formula of Walsh. It calculates both the probability of being at an exact number of generations back to the Most Recent Common Ancestor (MRCA) of a certain pair of people and the cumulative probability that the actual number of generations is less than a certain value. Note that the convention using generations is changed from an earlier version of this calculator which used "transmission events". It can list both result types in a table or graph. In either case the horizontal axis stops at the point where the cumulative probability reaches 95% or 10 generations, whichever is longer, or an absolute max of 50,000. Beyond 90% the calculation becomes inaccurate.</span></p>
<p>https://clandonaldusa.org/index.php/tmrca-calculator</p><p>Address of the bookmark: <a href="https://clandonaldusa.org/index.php/tmrca-calculator" rel="nofollow">https://clandonaldusa.org/index.php/tmrca-calculator</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44513/mike-an-ultrafast-assembly-and-alignment-free-approach-for-phylogenetic-tree-construction</guid>
	<pubDate>Mon, 08 Apr 2024 06:19:52 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44513/mike-an-ultrafast-assembly-and-alignment-free-approach-for-phylogenetic-tree-construction</link>
	<title><![CDATA[MIKE: an ultrafast, assembly-, and alignment-free approach for phylogenetic tree construction]]></title>
	<description><![CDATA[<p><span>MIKE (MinHash-based&nbsp;</span><em>k</em><span>-mer algorithm). This algorithm is designed for the swift calculation of the Jaccard coefficient directly from raw sequencing reads and enables the construction of phylogenetic trees based on the resultant Jaccard coefficient. Simulation results highlight the superior speed of MIKE compared to existing state-of-the-art methods. We used MIKE to reconstruct a phylogenetic tree, incorporating 238 yeast, 303&nbsp;</span><em>Zea</em><span>, 141&nbsp;</span><em>Ficus</em><span>, 67&nbsp;</span><em>Oryza</em><span>, and 43&nbsp;</span><em>Saccharum spontaneum</em><span>&nbsp;samples. MIKE demonstrated accurate performance across varying evolutionary scales, reproductive modes, and ploidy levels, proving itself as a powerful tool for phylogenetic tree construction.</span></p><p>Address of the bookmark: <a href="https://github.com/Argonum-Clever2/mike" rel="nofollow">https://github.com/Argonum-Clever2/mike</a></p>]]></description>
	<dc:creator>Abhi</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/29210/cgview-circular-genome-viewer</guid>
	<pubDate>Mon, 19 Sep 2016 07:52:26 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/29210/cgview-circular-genome-viewer</link>
	<title><![CDATA[CGView - Circular Genome Viewer]]></title>
	<description><![CDATA[<p>GView is a Java package used to display and navigate bacterial genomes. GView is useful for producing high-quality genome maps for use in publications and websites, or as a visualization tool in a sequence annotation pipeline. Users can interact with the genome using a powerful pan-and-zoom interface, or GView can write static images of a genome to a file. GView can draw a genome using either circular or linear layouts. For examples of some of the images GView can produce, see the <a href="https://www.gview.ca/bin/view/GView/ImageGallery">Image Gallery</a>. GView is a re-write of <a href="http://wishart.biology.ualberta.ca/cgview/" target="_top">CGView</a>, a circular genome viewer written by Paul Stothard. The goal of GView is to provide greater user interaction, and more flexibility in how the genome map is rendered. To aid with easily configuring the display of a genome, a style editor has been included to provide an intuitive, user-friendly graphical user interface for customizing genome maps. Styling attributes such as colours or fonts for the various map elements can be adjusted in real time. Customized styles can be saved for later use or for application to other genome maps using GView's <a href="https://www.gview.ca/bin/view/GViewDocumentation/GViewGSS">custom file format</a>.</p><p>Address of the bookmark: <a href="http://wishart.biology.ualberta.ca/cgview/" rel="nofollow">http://wishart.biology.ualberta.ca/cgview/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36997/cgview-circular-genome-viewer</guid>
	<pubDate>Wed, 20 Jun 2018 10:15:57 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36997/cgview-circular-genome-viewer</link>
	<title><![CDATA[CGView - Circular Genome Viewer]]></title>
	<description><![CDATA[CGView is a Java package for generating high quality, zoomable maps of circular genomes. Its primary purpose is to serve as a component of sequence annotation pipelines, as a means of generating visual output suitable for the web. Feature information and rendering options are supplied to the program using an XML file, a tab delimited file, or an NCBI ptt file. CGView converts the input into a graphical map (PNG, JPG, or Scalable Vector Graphics format), complete with labels, a title, legends, and footnotes. In addition to the default full view map, the program can generate a series of hyperlinked maps showing expanded views. The linked maps can be explored using any web browser, allowing rapid genome browsing, and facilitating data sharing. The feature labels in maps can be hyperlinked to external resources, allowing CGView maps to be integrated with existing web site content or databases. For examples of the various output types, see the CGView gallery.

http://wishart.biology.ualberta.ca/cgview/gallery.html

http://stothard.afns.ualberta.ca/downloads/CCT/index.html

https://www.gview.ca/wiki/GView/WebHome

https://server.gview.ca/

http://stothard.afns.ualberta.ca/cgview_server/

Paper https://academic.oup.com/bib/advance-article/doi/10.1093/bib/bbx081/4037458<p>Address of the bookmark: <a href="http://wishart.biology.ualberta.ca/cgview/" rel="nofollow">http://wishart.biology.ualberta.ca/cgview/</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34461/drawid-user-friendly-java-software-for-chromosome-measurements-and-idiogram-drawing</guid>
	<pubDate>Mon, 27 Nov 2017 16:03:49 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34461/drawid-user-friendly-java-software-for-chromosome-measurements-and-idiogram-drawing</link>
	<title><![CDATA[DRAWID: user-friendly Java software for chromosome measurements and idiogram drawing]]></title>
	<description><![CDATA[<p>"DRAWID has number of advantages including a user-friendly interactive interface, possibility for simultaneous chromosome and FISH/GISH/banding signal measurement and idiogram drawing as well as number of useful functions facilitating the procedure of chromosome analysis," explain the scientists.</p>
<p>"The output of the program is Microsoft XL table and publish-ready idiogram picture."</p>
<div>
<p>Find their paper openly published with us at:&nbsp;<a href="https://doi.org/10.3897/compcytogen.v11i4.20830" target="_blank">https://doi.org/10.3897/compcytogen.v11i4.20830</a></p>
</div><p>Address of the bookmark: <a href="https://compcytogen.pensoft.net/articles.php?id=20830" rel="nofollow">https://compcytogen.pensoft.net/articles.php?id=20830</a></p>]]></description>
	<dc:creator>Robert M Willioms</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36905/d-genies-a-tool-for-dotplot-large-genomes-in-an-interactive-efficient-and-simple-way</guid>
	<pubDate>Mon, 11 Jun 2018 09:41:22 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36905/d-genies-a-tool-for-dotplot-large-genomes-in-an-interactive-efficient-and-simple-way</link>
	<title><![CDATA[D-GENIES: A tool for Dotplot large Genomes in an Interactive, Efficient and Simple way]]></title>
	<description><![CDATA[D-GENIES – for Dotplot large Genomes in an Interactive, Efficient and Simple way – is an online tool designed to compare two genomes. It supports large genome and you can interact with the dot plot to improve the visualisation.

We use minimap version 2 to align the two genomes. Then, the PAF file is parsed and plotted into an interactive plot written with d3.js library.

D-Genies also allows to display dot plots from other aligners by uploading their PAF or MAF alignment file.

http://dgenies.toulouse.inra.fr/<p>Address of the bookmark: <a href="http://dgenies.toulouse.inra.fr/" rel="nofollow">http://dgenies.toulouse.inra.fr/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40583/trelliscope-flexibly-visualize-large-complex-data-in-great-detail-from-within-the-r-statistical-programming-environment</guid>
	<pubDate>Tue, 21 Jan 2020 04:22:49 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40583/trelliscope-flexibly-visualize-large-complex-data-in-great-detail-from-within-the-r-statistical-programming-environment</link>
	<title><![CDATA[Trelliscope: flexibly visualize large, complex data in great detail from within the R statistical programming environment.]]></title>
	<description><![CDATA[<p>Trelliscope provides a way to flexibly visualize large, complex data in great detail from within the R statistical programming environment. Trelliscope is a component in the<span>&nbsp;</span><a href="http://deltarho.org/docs-trelliscope/deltarho.org">DeltaRho</a><span>&nbsp;</span>environment.</p>
<p>For those familiar with<span>&nbsp;</span><a href="http://cm.bell-labs.com/cm/ms/departments/sia/project/trellis/">Trellis Display</a>,<span>&nbsp;</span><a href="http://docs.ggplot2.org/0.9.3.1/facet_wrap.html">faceting in ggplot</a>, or the notion of<span>&nbsp;</span><a href="http://en.wikipedia.org/wiki/Small_multiple">small multiples</a>, Trelliscope provides a scalable way to break a set of data into pieces, apply a plot method to each piece, and then arrange those plots in a grid and interactively sort, filter, and query panels of the display based on metrics of interest. With Trelliscope, we are able to create multipanel displays on data with a very large number of subsets and view them in an interactive and meaningful way.</p><p>Address of the bookmark: <a href="http://deltarho.org/docs-trelliscope/#introduction" rel="nofollow">http://deltarho.org/docs-trelliscope/#introduction</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43770/chromeister-an-ultra-fast-heuristic-approach-to-detect-conserved-signals-in-extremely-large-pairwise-genome-comparisons</guid>
	<pubDate>Thu, 03 Feb 2022 04:01:55 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43770/chromeister-an-ultra-fast-heuristic-approach-to-detect-conserved-signals-in-extremely-large-pairwise-genome-comparisons</link>
	<title><![CDATA[chromeister: An ultra fast, heuristic approach to detect conserved signals in extremely large pairwise genome comparisons.]]></title>
	<description><![CDATA[<p>chromeister: An ultra fast, heuristic approach to detect conserved signals in extremely large pairwise genome comparisons.</p>
<p dir="auto">USAGE:</p>
<ul dir="auto">
<li>-query: sequence A in fasta format</li>
<li>-db: sequence B in fasta format</li>
<li>-out: output matrix</li>
<li>-kmer Integer: k&gt;1 (default 32) Use 32 for chromosomes and genomes and 16 for small bacteria</li>
<li>-diffuse Integer: z&gt;0 (default 4) Use 4 for everything - if using large plant genomes you can try using 1</li>
<li>-dimension Size of the output matrix and plot. Integer: d&gt;0 (default 1000) Use 1000 for everything that is not full genome size, where 2000 is recommended</li>
</ul><p>Address of the bookmark: <a href="https://github.com/estebanpw/chromeister" rel="nofollow">https://github.com/estebanpw/chromeister</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/33909/itol-interactive-tree-of-life</guid>
	<pubDate>Tue, 18 Jul 2017 05:36:51 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/33909/itol-interactive-tree-of-life</link>
	<title><![CDATA[iTOL: Interactive Tree Of Life]]></title>
	<description><![CDATA[<p><strong>Interactive Tree Of Life</strong>&nbsp;is an online tool for the display, annotation and management of phylogenetic trees.</p>
<p>Explore your trees directly in the browser, and annotate them with various types of data.</p>
<p><span>iTOL can easily visualize trees with 50'000 or more leaves. With advanced search capabilities and display of unrooted, circular and regular cladograms or phylograms, exploring and navigating trees of any size is simple.</span></p>
<p>https://itol.embl.de/</p><p>Address of the bookmark: <a href="https://itol.embl.de/" rel="nofollow">https://itol.embl.de/</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/41899/stay-at-home-revbayes-workshop</guid>
  <pubDate>Sat, 20 Jun 2020 11:53:24 -0500</pubDate>
  <link></link>
  <title><![CDATA[Stay-at-Home RevBayes Workshop]]></title>
  <description><![CDATA[
<p>Stay-at-Home RevBayes Workshop<br />Location: Anywhere (online-only event)<br />Dates: 7/13, 2020 to 8/12, 2020<br />Instructors: Joëlle Barido-Sottani, Walker Pett, Josh Justison, Wade Dismukes, Luiza Fabreti, Tracy Heath, Jeremy M. Brown, Rosana Zenil-Ferguson<br />Register: https://iastate.qualtrics.com/jfe/form/SV_02sCYRWbxYK9I5D</p>

<p>Description<br />This free online-only RevBayes workshop will provide an introduction to the theory and use of RevBayes, with a focus on (1) tree inference from molecular data, (2) analyses combining fossil and extant taxa, and (3) evaluating MCMC performance, with advanced topics including assessing model adequacy and macroevolutionary analyses. Additional topics may be added depending on the interests of selected participants. The format will be a combination of interactive video sessions (via Zoom or similar tools), real-time discussions over Slack, self-guided tutorials, and pre-recorded videos.</p>

<p>The initial session will resolve technical issues and present the basics of using RevBayes. Participants will then be expected to work through several tutorials on their own schedule, with the help of pre-recorded materials. A Slack forum will be open for questions and issues. The workshop will conclude with several online Q&amp;A sessions with the instructors. The dates for the interactive sessions are currently tentative and may be adjusted depending on the schedules of the participants and instructors.</p>

<p>We are hoping to identify up to 15 participants for this online course. While we hope we are able to accommodate everyone who applies, we realize that this may not be possible because of time-zones and availability. If the number of applicants exceeds our capacity, we hope to organize a second round of sessions later in the year. Participants will not be charged for the course, but we will request that they commit to completing the tutorials and attending a majority of interactive sessions.</p>

<p>To apply to this course, please go to the registration form and submit your application by July 6, 2020.</p>

<p>More at https://revbayes.github.io/workshops/online2020.html</p>
]]></description>
</item>

</channel>
</rss>