<?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/37233?offset=360</link>
	<atom:link href="https://bioinformaticsonline.com/related/37233?offset=360" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	
<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/24178/essentials-of-statistics-and-data-analysis-using-r</guid>
  <pubDate>Mon, 31 Aug 2015 01:32:12 -0500</pubDate>
  <link></link>
  <title><![CDATA[Essentials of Statistics and Data Analysis using R]]></title>
  <description><![CDATA[
<p>Clinical Development Services Agency (CDSA) is an extramural unit of Translational Health Science and Technology Institute (THSTI), Department of Biotechnology, Ministry of Science &amp; Technology, Government of India. CDSA has a national mandate of strengthening capacity and capability building in the area of Clinical development and Translational Research.</p>

<p>CDSA is pleased to announce a 4 days hands-on training program on “Essentials of Statistics and Data Analysis using R” at ICGEB, Aruna Asaf Ali Road, New Delhi on December 1 – 4, 2015. This will involve developing and enhancing skills to understand basic principles of statistics for summarizing data and use of appropriate statistical tests as well as providing an understanding of data analysis using R. Didactic lectures with practical sessions will be delivered by experienced faculties from AIIMS and Novartis. Live classroom with power point presentations, case studies, mock exercise, practical sessions on R, group work with time for discussion and Q&amp;A sessions are added advantages of this workshop.</p>

<p>Please contact gayatrivishwakarma.cdsa@thsti.res.in or vineetabaloni.cdsa@thsti.res.in for program and registration details.</p>

<p>Please nominate personage or register yourself on or before November 6, 2015 along with the electronic transfer of registration fee.</p>
]]></description>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/45140/integration-of-speciation-research-workshop-announcement</guid>
  <pubDate>Tue, 28 Apr 2026 07:07:57 -0500</pubDate>
  <link></link>
  <title><![CDATA[Integration Of Speciation Research : Workshop Announcement]]></title>
  <description><![CDATA[
<p>We are excited to share that the ESEB- funded special topic network Integration Of Speciation Research (IOS - https://speciation-network.pages.ist.ac.at/) is hosting a second in-person workshop from 7â€“11 December 2026 at the Scottish Centre for Ecology &amp; the Natural Environment (Glasgow, UK - https://www.gla.ac.uk/research/az/scene/).</p>

<p>This workshop is aimed at bringing together ~40 diverse speciation researchers:</p>

<p>-  to collaborate on populating a database of published reproductive barriers based on a standardized RIO framework (https://ecoevorxiv.org/repository/view/10083/). This will involve working through papers during the workshop to extract RI measures and other metadata and entering them into a draft database (some preparatory work before the workshop may be requested to facilitate these steps during the workshop)</p>

<p>- to start working towards a manuscript using this database to answer an outstanding question in speciation</p>

<p>- to network, learn about reproductive isolation, and have fun!</p>

<p>If you are interested in applying to participate in the workshop, please fill out the form in the link below by ** May 20th **. Room &amp; board will be covered by the organizers; all other travel costs are the responsibility of the attendee.</p>

<p>Application link:</p>

<p>https://docs.google.com/forms/d/e/1FAIpQLSenAMqSdZjeRmKEDtBNa5tpjPn7IukPyT5BzfZ4JMpIk2YOEw/viewform</p>

<p>The previous IOS workshop was held in Finland in 2023 (see more details at https://speciation-network.pages.ist.ac.at/workshops) and resulted in new interactions between speciation researchers and the successful publication of an Integration of Speciation research manuscript  (https://academic.oup.com/evolinnean/article/3/1/kzae001/7609448).</p>

<p>We look forward to seeing you in Glasgow!</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/26380/hicdat</guid>
	<pubDate>Fri, 12 Feb 2016 05:23:44 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/26380/hicdat</link>
	<title><![CDATA[HiCdat]]></title>
	<description><![CDATA[<p>HiCdat: a fast and easy-to-use Hi-C data analysis tool</p>
<p>HiCdat is easy-to-use and provides solutions starting from aligned reads up to in-depth analyses. Importantly, HiCdat is focussed on the analysis of larger structural features of chromosomes, their correlation to genomic and epigenomic features, and on comparative studies. It uses simple input and output formats and can therefore easily be integrated into existing workflows or combined with alternative tools.</p>
<p>More at http://bmcbioinformatics.biomedcentral.com/articles/10.1186/s12859-015-0678-x</p><p>Address of the bookmark: <a href="https://github.com/MWSchmid/HiCdat" rel="nofollow">https://github.com/MWSchmid/HiCdat</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/28200/machine-learning</guid>
	<pubDate>Fri, 01 Jul 2016 12:57:12 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/28200/machine-learning</link>
	<title><![CDATA[Machine Learning !!!]]></title>
	<description><![CDATA[<p>In machine learning, computers apply&nbsp;<strong>statistical learning</strong>&nbsp;techniques to automatically identify patterns in data. These techniques can be used to make highly accurate predictions.</p>
<p><em>Keep scrolling.</em>&nbsp;Using a data set about homes, we will create a machine learning model to distinguish homes in New York from homes in San Francisco.</p><p>Address of the bookmark: <a href="http://www.r2d3.us/visual-intro-to-machine-learning-part-1/" rel="nofollow">http://www.r2d3.us/visual-intro-to-machine-learning-part-1/</a></p>]]></description>
	<dc:creator>Gudiya Pal</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/29917/gojs</guid>
	<pubDate>Tue, 22 Nov 2016 08:25:37 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/29917/gojs</link>
	<title><![CDATA[GoJS]]></title>
	<description><![CDATA[<p><strong>GoJS</strong> is a feature-rich JavaScript library for implementing custom interactive diagrams and complex visualizations across modern web browsers and platforms. <strong>GoJS</strong> makes constructing JavaScript diagrams of complex nodes, links, and groups easy with customizable templates and layouts.</p>
<p><strong>GoJS</strong> offers many advanced features for user interactivity such as drag-and-drop, copy-and-paste, in-place text editing, tooltips, context menus, automatic layouts, templates, data binding and models, transactional state and undo management, palettes, overviews, event handlers, commands, and an extensible tool system for custom operations.</p>
<p><strong>GoJS</strong> is pure JavaScript, so users get interactivity without requiring round-trips to servers and without plugins. <strong>GoJS</strong> normally runs completely in the browser, rendering to an HTML5 Canvas element or SVG without any server-side requirements. <strong>GoJS</strong> does not depend on any JavaScript libraries or frameworks, so it should work with any HTML or JavaScript framework or with no framework at all. &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;</p>
<p>More at&nbsp;http://gojs.net/latest/index.html</p><p>Address of the bookmark: <a href="http://gojs.net/latest/index.html" rel="nofollow">http://gojs.net/latest/index.html</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30153/e-mem-efficient-computation-of-maximal-exact-matches</guid>
	<pubDate>Thu, 15 Dec 2016 09:30:43 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30153/e-mem-efficient-computation-of-maximal-exact-matches</link>
	<title><![CDATA[E-MEM: Efficient computation of Maximal Exact Matches]]></title>
	<description><![CDATA[<p>E-MEM is a C++/OpenMP program designed to efficiently compute MEMs between large genomes. See the README file for instructions on how to use E-MEM.&nbsp;<br><br>E-MEM source code</p>
<p>The source code can be downloaded&nbsp;<a href="http://www.csd.uwo.ca/~ilie/E-MEM/e-mem.zip">here</a>.&nbsp;<br><br>If you use E-MEM, please cite:</p>
<ul>
<li>N. Khiste, L. Ilie, E-MEM: Efficient computation of Maximal Exact Matches for very large genomes,&nbsp;<a href="http://bioinformatics.oxfordjournals.org/content/31/4/509.short">Bioinformatics</a>&nbsp;<strong>31</strong>(4) (2015) 509 -- 514.</li>
</ul>
<p>For any questions, please contact Lucian Ilie:&nbsp;<a href="mailto:ilie@uwo.ca">ilie@uwo.ca</a>&nbsp;</p><p>Address of the bookmark: <a href="http://www.csd.uwo.ca/~ilie/E-MEM/" rel="nofollow">http://www.csd.uwo.ca/~ilie/E-MEM/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30212/pear</guid>
	<pubDate>Mon, 19 Dec 2016 09:28:30 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30212/pear</link>
	<title><![CDATA[PEAR]]></title>
	<description><![CDATA[<p><strong>PEAR</strong>&nbsp;is an ultrafast, memory-efficient and highly accurate pair-end read merger. It is fully parallelized and can run with as low as just a few kilobytes of memory.</p>
<p>PEAR evaluates all possible paired-end read overlaps and without requiring the target fragment size as input. In addition, it implements a statistical test for minimizing false-positive results. Together with a highly optimized implementation, it can merge millions of paired end reads within a couple of minutes on a standard desktop computer.</p><p>Address of the bookmark: <a href="http://sco.h-its.org/exelixis/web/software/pear/doc.html" rel="nofollow">http://sco.h-its.org/exelixis/web/software/pear/doc.html</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30829/mercator</guid>
	<pubDate>Mon, 06 Feb 2017 04:20:36 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30829/mercator</link>
	<title><![CDATA[Mercator]]></title>
	<description><![CDATA[<p><span>Our basic strategy in building homology maps is to use exons that are orthologous in multiple genomes as map "anchors." Given K genomes, the steps in the map construction are as follows:</span></p>
<ul>
<li>For each genome, obtain a set of exon annotations. These annotations can be a combination of both exon predictions (e.g. Genscan) and annotations that have been experimentally verified (e.g. RefSeq). Ideally, we would like to have these annotations be as sensitive as possible. Specificity is not a concern, as incorrect annotations are not likely not have significant alignments with other gene annotations.</li>
<li>Compare all exons against all exons in other genomes and record significant alignments between exons. Currently, we use&nbsp;<a href="https://www.biostat.wisc.edu/~cdewey/mercator/#refBLAT">BLAT</a>&nbsp;to do this all-vs-all comparison with alignments being performed in protein space.</li>
<li>Construct a graph with each vertex corresponding to a exon and edges between vertices whose corresponding exons have significant alignments.</li>
<li>Identify cliques in this graph. These cliques are potential anchors to be used in the map.</li>
<li>Starting with the largest cliques (those that have exons in all or most of the genomes), join neighboring (adjacent in genomic coordinates, in each genome) cliques to form&nbsp;runs. Smaller cliques that are inconsistent with runs formed by larger cliques are filtered out. After the smallest cliques have been considered, cliques that are not part of a run are discarded.</li>
<li>The extents of each run in each genome are outputted as orthologous segments. The cliques from each run are used to output the exact genomic coordinates of anchors within each orthologous segment. These anchors can be used by genomic alignment programs (such as&nbsp;<a href="https://www.biostat.wisc.edu/~cdewey/mercator/#refMAVID">MAVID</a>) to do a detailed alignment of each orthologous segment.</li>
</ul>
<p>https://www.biostat.wisc.edu/~cdewey/mercator/</p><p>Address of the bookmark: <a href="https://www.biostat.wisc.edu/~cdewey/mercator/" rel="nofollow">https://www.biostat.wisc.edu/~cdewey/mercator/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30976/brig</guid>
	<pubDate>Thu, 16 Feb 2017 13:14:25 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30976/brig</link>
	<title><![CDATA[BRIG]]></title>
	<description><![CDATA[<p>BRIG is a free cross-platform (Windows/Mac/Unix) application that can display circular comparisons between a large number of genomes, with a focus on handling genome assembly data. The application is available at:<a href="http://sourceforge.net/projects/brig">http://sourceforge.net/projects/brig</a></p>
<p>If you have any questions or comments, post them on&nbsp;<a href="http://sourceforge.net/tracker/?group_id=328245">one of the trackers</a>&nbsp;on BRIG&rsquo;s SourceForge page:<a href="http://sourceforge.net/tracker/?group_id=328245">http://sourceforge.net/tracker/?group_id=328245</a>.</p>
<p>Features:</p>
<ul>
<li>Images show similarity between a central reference sequence and other sequences as concentric rings.</li>
<li>BRIG will perform all BLAST comparisons and file parsing automatically via a simple GUI.</li>
<li>Contig boundaries and read coverage can be displayed for draft genomes; customized graphs and annotations can be displayed.</li>
<li>Using a user-defined set of genes as input, BRIG can display gene presence, absence, truncation or sequence variation in a set of complete genomes, draft genomes or even raw, unassembled sequence data.</li>
<li>BRIG also accepts SAM-formatted read-mapping files enabling genomic regions present in unassembled sequence data from multiple samples to be compared simultaneously</li>
</ul>
<p>&nbsp;</p><p>Address of the bookmark: <a href="http://brig.sourceforge.net/" rel="nofollow">http://brig.sourceforge.net/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/31139/pbsuite-software-for-long-read-sequencing-data-from-pacbio</guid>
	<pubDate>Mon, 27 Feb 2017 09:54:47 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/31139/pbsuite-software-for-long-read-sequencing-data-from-pacbio</link>
	<title><![CDATA[PBSuite: Software for Long-Read Sequencing Data from PacBio]]></title>
	<description><![CDATA[<p><span>PBJelly - the genome upgrading tool.&nbsp;</span><br><span>PBHoney - the structural variation discovery tool&nbsp;</span><br><br><span>Both are contained within the PBSuite code found in downloads.</span><br><br><span>----- PBJelly -----</span><br><span>Read The Paper&nbsp;</span><br><a href="http://www.plosone.org/article/info%3Adoi%2F10.1371%2Fjournal.pone.0047768" target="_blank">http://www.plosone.org/article/info%3Adoi%2F10.1371%2Fjournal.pone.0047768</a><br><br><span>PBJelly is a highly automated pipeline that aligns long sequencing reads (such as PacBio RS reads or long 454 reads in fasta format) to high-confidence draft assembles. PBJelly fills or reduces as many captured gaps as possible to produce upgraded draft genomes.&nbsp;</span><br><br><span>----- PBHoney -----</span><br><span>Read The Paper</span><br><a href="http://www.biomedcentral.com/1471-2105/15/180/abstract" target="_blank">http://www.biomedcentral.com/1471-2105/15/180/abstract</a><br><br><span>PBHoney is an implementation of two variant-identification approaches designed to exploit the high mappability of long reads (i.e., greater than 10,000 bp). PBHoney considers both intra-read discordance and soft-clipped tails of long reads to identify structural variants.</span></p><p>Address of the bookmark: <a href="https://sourceforge.net/projects/pb-jelly/" rel="nofollow">https://sourceforge.net/projects/pb-jelly/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>