<?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/30018?offset=390</link>
	<atom:link href="https://bioinformaticsonline.com/related/30018?offset=390" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/31976/snpgenie</guid>
	<pubDate>Thu, 30 Mar 2017 17:38:02 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/31976/snpgenie</link>
	<title><![CDATA[SNPGenie]]></title>
	<description><![CDATA[<p>SNPGenie is a Perl script for estimating evolutionary parameters, mainly from pooled next-generation sequencing (NGS) single-nucleotide polymorphism (SNP) variant data. SNP reports (acceptable in a variety of formats) much each correspond to a single population, with variants called relative to a single reference sequence (one sequence in one FASTA file). Just run the main script, <strong>snpgenie.pl</strong>, in a directory containing the necessary <a href="https://github.com/hugheslab/snpgenie#snpgenie-input">input files</a>, and we take care of the rest! For the earlier version, see <a href="http://ww2.biol.sc.edu/~austin/">Hughes Lab Bioinformatics Resource</a>.</p><p>Address of the bookmark: <a href="https://github.com/hugheslab/snpgenie" rel="nofollow">https://github.com/hugheslab/snpgenie</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/858/the-centre-for-bioinformatics-biomarker-discovery-and-information-based-medicine-cibm</guid>
  <pubDate>Sun, 14 Jul 2013 12:31:38 -0500</pubDate>
  <link></link>
  <title><![CDATA[The Centre for Bioinformatics, Biomarker Discovery and Information-Based Medicine (CIBM)]]></title>
  <description><![CDATA[
<p>The Centre for Bioinformatics, Biomarker Discovery and Information-Based Medicine (CIBM) is committed to shortening the process of obtaining novel discoveries to achieve distinctively better outcomes in clinical practice and translational individualised medicine.</p>

<p>Link @ http://www.newcastle.edu.au/research-and-innovation/centre/cibm/about-us</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/32076/ngs-teaching-material</guid>
	<pubDate>Wed, 05 Apr 2017 04:29:06 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32076/ngs-teaching-material</link>
	<title><![CDATA[NGS teaching material]]></title>
	<description><![CDATA[<p><span>High throughput sequencing (HTS) technologies are being applied to a wide range of important topics in biology. However, the analyses of non-model organisms, for which little previous sequence information is available, pose specific problems. This course addresses the specific strengths and weaknesses of alternative HTS technologies, the computational resources needed for HTS, and how to analyze non-model species using HTS. The course consists of a practical training module, HTS bioinformatics training, and lecturing/seminars of HTS approaches specifically targeting non-model organisms.</span></p><p>Address of the bookmark: <a href="http://marinetics.org/teaching/hts/Assembly.html" rel="nofollow">http://marinetics.org/teaching/hts/Assembly.html</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/900/bioruby-ruby-packages-for-biologist</guid>
	<pubDate>Mon, 15 Jul 2013 01:36:28 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/900/bioruby-ruby-packages-for-biologist</link>
	<title><![CDATA[BioRuby :Ruby packages for biologist]]></title>
	<description><![CDATA[<p>BioRuby is a package of Open Source Ruby code, with classes for DNA and protein sequence analysis, alignment, database parsing, and other Bioinformatics tools.<br />BioRuby project provides an integrated environment in bioinformatics for the Ruby language. This project is supported by University of Tokyo (Human Genome Center), Kyoto University(Bioinformatics Center) and the Open Bio Foundation. The project was supported by Information-technology Promotion Agency (IPA) as an Exploratory Software Project in 2005<br />RubyForge is a home for open source Ruby projects: RubyForge is a home for open source Ruby projects. BioRuby project was started in late 2000, and is still in progress. Currently, there are over 80 files and 15,000 lines (except comment-only lines) in our source code. This might be equivalent to twice or more lines of other languages because of Ruby's extremely high descriptive power.</p><p>Classes for <br />Multiple alignment (Bio::Alignment), <br />Gene Ontology(Bio::GO), <br />PDB (Bio::PDB), <br />FANTOM database(Bio::FANTOM), <br />GFF (Bio::GFF) and KEGG<br />Orthology (Bio::KEGG::KO).</p><p>They also added support for many applications such as PSORT, SOSUI, TargetP, TMHMM, GenScan, ClustalW, MAFFT, and KEGG API.</p><p>Wiki Links<br />http://bioruby.open-bio.org/wiki/BioRubyOnRails<br />http://dev.bioruby.org/en/</p><p>BioRuby in Anger<br />http://dev.bioruby.org/en/?BioRuby+in+Anger</p><p>BioRuby RDocs<br />http://bioruby.org/rdoc/</p><p>BioRuby Tutorial Website<br />http://dev.bioruby.org/en/?Tutorial.rd</p><p>Why BioRuby Hub for BioRuby<br />http://www.linuxjournal.com/article/5915</p><p>Social Coding Hub for BioRuby<br />http://www.linuxjournal.com/article/5915</p><p>Bioinformatics on Rails: BioRuby Tutorial<br />http://bioinforuby.blogspot.com/2008/02/bioruby-tutorial.html</p><p>RRA BioRuby<br />http://raa.ruby-lang.org/project/bioruby/</p><p>BioRuby Project Discussion Group<br />http://portal.open-bio.org/mailman/listinfo/bioruby</p><p>BioRuby related Projects: Project tree<br />http://rubyforge.org/softwaremap/trove_list.php?form_cat=252</p><p>Reference<br />http://www.jsbi.org/journal/GIW03/GIW03P191.pdf</p>]]></description>
	<dc:creator>Jitendra Narayan</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/32152/upsetr-shiny-app</guid>
	<pubDate>Fri, 14 Apr 2017 06:19:54 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32152/upsetr-shiny-app</link>
	<title><![CDATA[UpSetR Shiny App!]]></title>
	<description><![CDATA[<p>UpSetR generates static&nbsp;<a href="http://vcg.github.io/upset/?dataset=0&amp;duration=1000&amp;orderBy=subsetSize&amp;grouping=groupByIntersectionSize&amp;selection=">UpSet plots</a>. The UpSet technique visualizes set intersections in a matrix layout and introduces aggregates based on groupings and queries. The matrix layout enables the effective representation of associated data, such as the number of elements in the aggregates and intersections, as well as additional summary statistics derived from subset or element attributes.</p>
<h4>To begin, input your data using one of the three input styles.</h4>
<ol>
<li>"File" takes a correctly formatted.csv file.</li>
<li>"List" takes up to 6 different lists that contain unique elements, similar to that used in the web applications BioVenn&nbsp;<a href="http://www.biomedcentral.com/content/pdf/1471-2164-9-488.pdf">(Hulsen et al., 2008)</a>&nbsp;and jvenn&nbsp;<a href="http://www.biomedcentral.com/content/pdf/1471-2105-15-293.pdf">(Bardou et al., 2014)</a></li>
<li>"Expression" takes the input used by the venneuler R package&nbsp;<a href="https://cran.r-project.org/web/packages/venneuler/venneuler.pdf">(Wilkinson, 2015)</a></li>
</ol><p>Address of the bookmark: <a href="https://gehlenborglab.shinyapps.io/upsetr/" rel="nofollow">https://gehlenborglab.shinyapps.io/upsetr/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/32190/dbg2olcefficient-assembly-of-large-genomes-using-long-erroneous-reads-of-the-third-generation-sequencing-technologies</guid>
	<pubDate>Wed, 19 Apr 2017 10:09:51 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32190/dbg2olcefficient-assembly-of-large-genomes-using-long-erroneous-reads-of-the-third-generation-sequencing-technologies</link>
	<title><![CDATA[DBG2OLC:Efficient Assembly of Large Genomes Using Long Erroneous Reads of the Third Generation Sequencing Technologies]]></title>
	<description><![CDATA[<p>DBG2OLC:Efficient Assembly of Large Genomes Using Long Erroneous Reads of the Third Generation Sequencing Technologies</p>
<p>Our work is published in Scientific Reports:</p>
<p>Ye, C. et al. DBG2OLC: Efficient Assembly of Large Genomes Using Long Erroneous Reads of the Third Generation Sequencing Technologies. Sci. Rep. 6, 31900; doi: 10.1038/srep31900 (2016).</p>
<p><a href="http://www.nature.com/articles/srep31900">http://www.nature.com/articles/srep31900</a></p>
<p>The manual can be downloaded from:</p>
<p><a href="https://github.com/yechengxi/DBG2OLC/raw/master/Manual.docx">https://github.com/yechengxi/DBG2OLC/raw/master/Manual.docx</a></p>
<p>To use precompiled versions,please go to:</p>
<p><a href="https://github.com/yechengxi/DBG2OLC/tree/master/compiled">https://github.com/yechengxi/DBG2OLC/tree/master/compiled</a></p>
<p>&nbsp;</p><p>Address of the bookmark: <a href="https://github.com/yechengxi/DBG2OLC" rel="nofollow">https://github.com/yechengxi/DBG2OLC</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/6420/studentship-and-traineeship-university-of-madras</guid>
  <pubDate>Sat, 16 Nov 2013 19:27:40 -0600</pubDate>
  <link></link>
  <title><![CDATA[STUDENTSHIP and TRAINEESHIP @ University of Madras]]></title>
  <description><![CDATA[
<p>Bioinformatics Infrastructure Facility<br />University of Madras<br />Chennai 600 025</p>

<p>Applications are invited for the STUDENTSHIP and TRAINEESHIP vacancies to carry out project/research work in the DBT - Bioinformatics Infrastructure Facility with consolidated stipend of Rs.5,000/- per month.</p>

<p>Essential Qualification</p>

<p>Student Trainee: Those who have completed M.Sc., Bioinformatics/Biophysics/Life sciences or Pursuing M.Tech., Bioinformatics/Biotechnology</p>

<p>Duration : 3-4 Months</p>

<p>Student Trainee: Those who are pursuing M.Sc Bioinformatics/Biophysics/ Life sciences/others</p>

<p>Duration : 2-3 Months</p>

<p>Mail your CV on or before 25th November 2013 to shirai2011@gmail.com and hard copy to "Dr. D. Velmurugan, Professor &amp; Head, CAS in Crystallography and Biophysics, University of Madras, Guindy Campus, Chennai 600 025". Also, the applicants are requested to attend the interview on 29th November, 2013 at 11 A.M.</p>

<p>Advertisement:</p>

<p>www.unom.ac.in/uploads/announcements/bifadvertisement_20131114080003_23240.pdf</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/32379/enrichr-a-comprehensive-gene-set-enrichment-analysis</guid>
	<pubDate>Thu, 27 Apr 2017 05:42:09 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32379/enrichr-a-comprehensive-gene-set-enrichment-analysis</link>
	<title><![CDATA[Enrichr: a comprehensive gene set enrichment analysis]]></title>
	<description><![CDATA[<p><span>Enrichment analysis is a popular method for analyzing gene sets generated by genome-wide experiments. Here we present a significant update to one of the tools in this domain called Enrichr. Enrichr currently contains a large collection of diverse gene set libraries available for analysis and download. In total, Enrichr currently contains 180 184 annotated gene sets from 102 gene set libraries. New features have been added to Enrichr including the ability to submit fuzzy sets, upload BED files, improved application programming interface and visualization of the results as clustergrams. Overall, Enrichr is a comprehensive resource for curated gene sets and a search engine that accumulates biological knowledge for further biological discoveries. Enrichr is freely available at:&nbsp;</span><a href="http://amp.pharm.mssm.edu/Enrichr" target="">http://amp.pharm.mssm.edu/Enrichr</a><span>.</span></p>
<p>https://academic.oup.com/nar/article-lookup/doi/10.1093/nar/gkw377</p><p>Address of the bookmark: <a href="http://amp.pharm.mssm.edu/Enrichr/" rel="nofollow">http://amp.pharm.mssm.edu/Enrichr/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/918/data-mining-in-bioinformatics</guid>
	<pubDate>Tue, 16 Jul 2013 03:21:28 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/918/data-mining-in-bioinformatics</link>
	<title><![CDATA[Data Mining in Bioinformatics]]></title>
	<description><![CDATA[<p>Data mining, the extraction of hidden predictive information from large databases. Data mining is becoming an increasingly important tool to transform this data into information. It is commonly used in a wide range of profiling practices, such as marketing, surveillance, fraud detection and scientific discovery. Data Mining for Bioinformatics enables researchers to meet the challenge of mining vast amounts of biomolecular data to discover real knowledge. In other words, you&rsquo;re a bioinformatician, and data has been dumped in your lap. Find the patterns, trend, answers, or what ever meaningful knowledge the data is hiding. They scour databases for hidden patterns, finding predictive information that experts may miss because it lies outside their expectations.This page Covering theory, algorithms, and methodologies, as well as data mining technologies. Unfortunately life is never simple. In molecular biology, it&rsquo;s becoming more common to generate reams of data then ask someone in bioinformatics to produce an answer. This is exploratory data analysis, one of the most difficult things to do well. Especially if you&rsquo;re thrown in at the deep end.</p><p><strong>Data mining commonly involves four classes of tasks:</strong></p><ul>
<li>Classification - Arranges the data into predefined groups. For example, an email program might attempt to classify an email as legitimate or spam. Common algorithms include decision tree learning, nearest neighbor, naive Bayesian classification and neural networks.</li>
<li>Clustering - Is like classification but the groups are not predefined, so the algorithm will try to group similar items together.</li>
<li>Regression - Attempts to find a function which models the data with the least error.</li>
<li>Association rule learning - Searches for relationships between variables. For example a supermarket might gather data on customer purchasing habits. Using association rule learning, the supermarket can determine which products are frequently bought together and use this information for marketing purposes. This is sometimes referred to as market basket analysis.</li>
<li>From experience, I can say that is one of the most frustrating positions to be in. Data mining is a huge field and can easily be bewildering for a beginner. However, high through-put techniques in molecular biology require, more and more, that bioinformatics is required to interpret the data. Furthermore, people working in bioinformatics generally come from computer science, or biology backgrounds. Data mining, however, involves statistics to one degree or another, which means entering a field that is may not be your strong point.</li>
<li>Excel is fine for creating graphs. If you&rsquo;re serious about data mining though, you&rsquo;ll need something more heavy weight. I use R, free, and with good data mining packages such as vegan and labdsv. For beginners R can be impenetrable, I recommend this book an introduction to R as well as the underlying statistics.</li>
<li>Any of us can rush head on into a land of support vector machines, hidden markov models and neural networks. But coming back to the first point, what are you trying to prove? Always question what are you doing, how does it fit in to the wider picture? Try to regularly review, and keep track of where you are going? This will prevent you from falling into data mining despair.</li>
</ul><p><strong>Data Mining Resources on the net:</strong><br /><br />A laboratory of data mining and bioinformatics is headed by Prof. Ambuj Singh. There are currently seven graduate students in the research group. Our research focuses on image informatics and scalable querying and mining of graphs.For more detail visit:&nbsp;<a href="http://www.cs.ucsb.edu/~dbl/">http://www.cs.ucsb.edu/~dbl/</a></p><p>Here are the materials (Lecture notes) from several past courses on data mining and/or Web mining by Stanford: For detail visit:&nbsp;<a href="http://infolab.stanford.edu/~ullman/mining/mining.html">http://infolab.stanford.edu/~ullman/mining/mining.html</a><br />Statistical Data Mining Tutorial Slides by Andrew Moore The following links point to a set of tutorials on many aspects of statistical data mining, including the foundations of probability, the foundations of statistical data analysis, and most of the classic machine learning and data mining algorithms. For detail visit:&nbsp;<a href="http://www.autonlab.org/tutorials/">http://www.autonlab.org/tutorials/</a></p><p>A tutorial on Introduction to Data Mining for Discovering hidden value in your data warehouse:<a href="http://www.thearling.com/text/dmwhite/dmwhite.htm">http://www.thearling.com/text/dmwhite/dmwhite.htm</a>&nbsp;<br />Wiki Links:&nbsp;<a href="http://en.wikipedia.org/wiki/Data_mining">http://en.wikipedia.org/wiki/Data_mining</a><br />Bioinformatics with Clementine&nbsp;<a href="http://www.spss.ch/upload/1051192224_inseratClemBio.pdf">http://www.spss.ch/upload/1051192224_inseratClemBio.pdf</a>&nbsp;<br />Causal Data Mining in Bioinformatics by Ioannis Tsamardinos:&nbsp;<a href="http://www.forth.gr/ics/bmi/In_the_News/2007/EN69-4.pdf">http://www.forth.gr/ics/bmi/In_the_News/2007/EN69-4.pdf</a></p><p>Report on ACM Text Mining in Bioinformatics (TMBIO 006)&nbsp;<a href="http://www.sigir.org/forum/2007J/2007j_sigirforum_song.pdf">http://www.sigir.org/forum/2007J/2007j_sigirforum_song.pdf</a>&nbsp;<br />BIOKDD 2002: Recent Advances in Data Mining for&nbsp;<br />Bioinformatics:&nbsp;<a href="http://www.acm.org/sigs/sigkdd/explorations/issue4-2/zaki.pdf">http://www.acm.org/sigs/sigkdd/explorations/issue4-2/zaki.pdf</a></p><p><strong>Bioinformatics and Medical Informatics:</strong>&nbsp;<br /><br />Tools for Mining and Applying Genetic Information in Patient Care:<a href="http://www.biomedtechalliance.org/pdfs/03_03_05/03_03_05.pdf">http://www.biomedtechalliance.org/pdfs/03_03_05/03_03_05.pdf</a></p><p>DATA MINING OF MICROARRAY DATABASES FOR HUMAN LUNG CANCER:&nbsp;<a href="http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.106.385&amp;rep=rep1&amp;type=pdf">http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.106.385&amp;rep=rep1&amp;type=pdf</a></p><p>Towards knowledge-based gene expression data mining:&nbsp;<a href="http://www.ailab.si/blaz/papers/2007-JBI-BellazziZupan.pdf">http://www.ailab.si/blaz/papers/2007-JBI-BellazziZupan.pdf</a></p><p>DRAFT Accepted for publication in 'Data Mining in Bioinformatics'<br />Jason Wang, Mohammed Zaki, Hannu Toivonen, and Dennis Shasha (Eds.), Springer:<a href="http://www.cs.helsinki.fi/u/htoivone/pubs/gene_mapping_by_pattern_discovery.pdf">http://www.cs.helsinki.fi/u/htoivone/pubs/gene_mapping_by_pattern_discovery.pdf</a></p><p>Data Mining and Text Mining for Bioinformatics: Proceedings of the European Workshop:&nbsp;<a href="http://www.rok.informatik.hu-berlin.de/wbi/research/publications/2003/proceedings_ws_mining.pdf">http://www.rok.informatik.hu-berlin.de/wbi/research/publications/2003/proceedings_ws_mining.pdf</a></p><p><strong>Biological Network Analysis:<br /></strong><br />Graph Mining in Bioinformatics:&nbsp;<a href="http://agbs.kyb.tuebingen.mpg.de/wikis/bg/BNA-5.pdf">http://agbs.kyb.tuebingen.mpg.de/wikis/bg/BNA-5.pdf</a>.</p><p>Text mining in bioinformatics:&nbsp;<a href="http://agbs.kyb.tuebingen.mpg.de/wikis/bg/4.pdf">http://agbs.kyb.tuebingen.mpg.de/wikis/bg/4.pdf</a></p><p>Some datamining books that are available on google books:</p><p>Data mining and bioinformatics: first international workshop, VDMB 2006 By Mehmet M. Dalkilic</p><p>Data mining: concepts and techniques By Jiawei Han, Micheline Kamber</p>]]></description>
	<dc:creator>Jitendra Narayan</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/32481/sspace</guid>
	<pubDate>Fri, 05 May 2017 05:42:15 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32481/sspace</link>
	<title><![CDATA[SSPACE]]></title>
	<description><![CDATA[<p>SSPACE standard is a stand-alone program for scaffolding pre-assembled contigs using NGS paired-read data. It is unique in offering the possibility to manually control the scaffolding process. By using the distance information of paired-end and/or matepair data, SSPACE is able to assess the order, distance and orientation of your contigs and combine them into scaffolds. Currently we offer this as a command-line tool in Perl. The input data is given by pre-assembled contig sequences (FASTA) and NGS paired-read data (Illumina/454/Solid FASTA or FASTQ). The final scaffolds are provided in FASTA format.</p>
<p>&nbsp;</p><p>Address of the bookmark: <a href="https://www.baseclear.com/genomics/bioinformatics/basetools/SSPACE" rel="nofollow">https://www.baseclear.com/genomics/bioinformatics/basetools/SSPACE</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>