<?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/44513?offset=70</link>
	<atom:link href="https://bioinformaticsonline.com/related/44513?offset=70" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34569/ksnp30-snp-detection-and-phylogenetic-analysis-of-genomes-without-genome-alignment-or-reference-genome</guid>
	<pubDate>Fri, 08 Dec 2017 16:48:40 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34569/ksnp30-snp-detection-and-phylogenetic-analysis-of-genomes-without-genome-alignment-or-reference-genome</link>
	<title><![CDATA[kSNP3.0: SNP detection and phylogenetic analysis of genomes without genome alignment or reference genome]]></title>
	<description><![CDATA[<p><span>Sept. 20, 2017 Version 3.1 released. Major upgrade. Version 3.1 fixes the problems with SNP annotation that arose when NCBI discontinued use of GI numbers. Please read carefully the Preface (page 3) and the File of annotated genomes section (pages 9-10) in the version 3.1 User Guide. Thanks to Tom Slezak for revsing the get_genbank_file3 script and to Tod Stuber (USDA) for testing version 3.1 even though he doesn't need the annotation feature. All users are encouraged to upgrade to version 3.1.&nbsp;<br></span></p><p>Address of the bookmark: <a href="https://sourceforge.net/projects/ksnp/files/" rel="nofollow">https://sourceforge.net/projects/ksnp/files/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/40395/forbio-and-uib-course-introduction-to-phylogenetic-methods</guid>
	<pubDate>Mon, 16 Dec 2019 09:39:12 -0600</pubDate>
	<link>https://bioinformaticsonline.com/news/view/40395/forbio-and-uib-course-introduction-to-phylogenetic-methods</link>
	<title><![CDATA[ForBio and UiB course: Introduction to phylogenetic methods]]></title>
	<description><![CDATA[<p>The is an introductory course that is aimed at students who will need to preform phylogenetic analyses in their work, but who have little or no experience with phylogenetic analyses. The ForBio component of the course is focused on the practical aspects of phylogenetic analyses and students that have not attended the theoretical part of the course are expected to have read the relevant literature. The course will cover all basic aspects of phylogenetic analyses with emphasis on use of DNA data. Students will learn how to prepare their data, explore its properties and how to analyze it using distance, parsimony, likelihood and Bayesian methods. In the last two days students will also get an introduction to molecular dating with focus on the use of BEAST and to comparative methods used to study the evolution of discrete and continuous traits.</p><p><a href="https://www.forbio.uio.no/events/courses/2020/Bergen_Phylogenetics_2020.html">https://www.forbio.uio.no/events/courses/2020/Bergen_Phylogenetics_2020.html</a></p><p><a href="https://uio.us13.list-manage.com/track/click?u=12ea100a4bd384fb9ba660c5e&amp;id=527fe56cca&amp;e=fe181c3ca8" target="_blank">ForBio travel grants</a><br />We have changed our travel grants rules. ForBio offers both incoming and outgoing travel grants to fund collaborations between<strong>&nbsp;ForBio members based in Norway</strong>&nbsp;and taxonomic experts up to<strong>&nbsp;NOK 14,000</strong>. Grants are given for taxonomic training with relevance to the main research project of the applicant, and aim to allow the student to do taxonomic research with specific experts, work with particular collections, or learn new preparation techniques directly from experts.&nbsp; Participation in external courses, conferences, fieldwork or other kinds of activities which are not&nbsp;classified as expert-in-training visits are no longer eligible for support.&nbsp; There are two application deadlines:&nbsp;<strong>March 1st</strong><strong>&nbsp;</strong>2020.</p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/33791/slactree-svg-large-annotated-circular-tree-drawing</guid>
	<pubDate>Mon, 03 Jul 2017 08:02:56 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/33791/slactree-svg-large-annotated-circular-tree-drawing</link>
	<title><![CDATA[slacTree: SVG Large Annotated Circular Tree drawing]]></title>
	<description><![CDATA[<p>A simple, extensible, Perl script for producing figures of large phylogenetic trees.</p>
<ul>
<li>While there are many other tree drawing programs, slacTree was originally written in 2009 to fill a need for producing publication quality figures of circular trees with more than 1000 taxa with custom annotations</li>
<li>Because it is a single Perl script with very few dependencies, it is easy to run, and easy to further customize</li>
<li>SVG is used because it is a scalable format allowing for very small representations of entire trees or highly magnified regions with unlimited resolution</li>
<li>Circular and radial trees are more compact than linear representations</li>
<li></li>
</ul>
<h2>&nbsp;</h2><p>Address of the bookmark: <a href="https://github.com/mccrowjp/slacTree" rel="nofollow">https://github.com/mccrowjp/slacTree</a></p>]]></description>
	<dc:creator>Jit</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>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36111/d3networktools-for-creating-d3-javascript-network-tree-dendrogram-and-sankey-graphs-from-r</guid>
	<pubDate>Fri, 06 Apr 2018 12:10:45 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36111/d3networktools-for-creating-d3-javascript-network-tree-dendrogram-and-sankey-graphs-from-r</link>
	<title><![CDATA[d3Network:Tools for creating D3 JavaScript network, tree, dendrogram, and Sankey graphs from R.]]></title>
	<description><![CDATA[<p><a href="http://bost.ocks.org/mike/">Mike Bostock</a><span>&rsquo;s&nbsp;</span><a href="http://d3js.org/">D3.js</a><span>&nbsp;is great for creating&nbsp;</span><a href="http://bl.ocks.org/mbostock/4062045">interactive network graphs</a><span>&nbsp;with JavaScript. The&nbsp;</span><a href="https://github.com/christophergandrud/d3Network">d3Network</a><span>&nbsp;package makes it easy to create these network graphs from&nbsp;</span><a href="http://www.r-project.org/">R</a><span>. The main idea is that you should able to take an R data frame with information about the relationships between members of a network and create full network graphs with one command.</span></p><p>Address of the bookmark: <a href="http://christophergandrud.github.io/d3Network/" rel="nofollow">http://christophergandrud.github.io/d3Network/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44157/onezoom-tree-of-life-explorer</guid>
	<pubDate>Sat, 12 Nov 2022 09:29:08 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44157/onezoom-tree-of-life-explorer</link>
	<title><![CDATA[OneZoom tree of life explorer...]]></title>
	<description><![CDATA[<p>An interactive map of the evolutionary links between all living things known to science. Discover your favourites, see which species are under threat, and be amazed by the diversity of life on earth.</p>
<p>&nbsp;</p><p>Address of the bookmark: <a href="https://www.onezoom.org/" rel="nofollow">https://www.onezoom.org/</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37751/kast-perform-alignment-free-k-tuple-frequency-comparisons-from-sequences</guid>
	<pubDate>Thu, 20 Sep 2018 08:56:35 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37751/kast-perform-alignment-free-k-tuple-frequency-comparisons-from-sequences</link>
	<title><![CDATA[KAST: Perform Alignment-free k-tuple frequency comparisons from sequences]]></title>
	<description><![CDATA[<p><span>Perform Alignment-free k-tuple frequency comparisons from sequences. This can be in the form of two input files (e.g. a reference and a query) or a single file for pairwise comparisons to be made.</span></p><p>Address of the bookmark: <a href="https://github.com/martinjvickers/KAST" rel="nofollow">https://github.com/martinjvickers/KAST</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/2726/comparison-of-short-read-de-novo-alignment-algorithms</guid>
	<pubDate>Wed, 21 Aug 2013 07:56:01 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/2726/comparison-of-short-read-de-novo-alignment-algorithms</link>
	<title><![CDATA[Comparison of Short Read De Novo Alignment Algorithms]]></title>
	<description><![CDATA[<p>Excellent article to introduce different sequencing methods along with tools for de novo assembly of sequencing reads and their relevant references.</p>
<p>Title:&nbsp;<strong>Comparison of Short Read De Novo Alignment Algorithms&nbsp;</strong></p>
<p>Author<strong>: Nikhil Gopal</strong></p><p>Address of the bookmark: <a href="http://biochem218.stanford.edu/Projects%202011/Gopal%202011.pdf" rel="nofollow">http://biochem218.stanford.edu/Projects%202011/Gopal%202011.pdf</a></p>]]></description>
	<dc:creator>Rahul Agarwal</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34413/coursera-genome-assembly-tutorial</guid>
	<pubDate>Sat, 25 Nov 2017 08:57:25 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34413/coursera-genome-assembly-tutorial</link>
	<title><![CDATA[coursera genome assembly tutorial]]></title>
	<description><![CDATA[<p><span>Solutions to Coursera Genome Sequencing (Bioinformatics II)</span></p><p>Address of the bookmark: <a href="https://github.com/iansealy/coursera-assembly" rel="nofollow">https://github.com/iansealy/coursera-assembly</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34528/cope-an-accurate-k-mer-based-pair-end-reads-connection-tool-to-facilitate-genome-assembly</guid>
	<pubDate>Wed, 06 Dec 2017 02:08:14 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34528/cope-an-accurate-k-mer-based-pair-end-reads-connection-tool-to-facilitate-genome-assembly</link>
	<title><![CDATA[COPE: an accurate k-mer-based pair-end reads connection tool to facilitate genome assembly]]></title>
	<description><![CDATA[<p><span>An efficient tool called Connecting Overlapped Pair-End (COPE) reads, to connect overlapping pair-end reads using k-mer frequencies. We evaluated our tool on 30&times; simulated pair-end reads from Arabidopsis thaliana with 1% base error. COPE connected over 99% of reads with 98.8% accuracy, which is, respectively, 10 and 2% higher than the recently published tool FLASH. When COPE is applied to real reads for genome assembly, the resulting contigs are found to have fewer errors and give a 14-fold improvement in the N50 measurement when compared with the contigs produced using unconnected reads.</span></p><p>Address of the bookmark: <a href="ftp://ftp.genomics.org.cn/pub/cope" rel="nofollow">ftp://ftp.genomics.org.cn/pub/cope</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>