<?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/11175?offset=20</link>
	<atom:link href="https://bioinformaticsonline.com/related/11175?offset=20" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27078/homer-software-for-motif-discovery-and-next-gen-sequencing-analysis</guid>
	<pubDate>Tue, 26 Apr 2016 03:48:23 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27078/homer-software-for-motif-discovery-and-next-gen-sequencing-analysis</link>
	<title><![CDATA[HOMER:  Software for motif discovery and next-gen sequencing analysis]]></title>
	<description><![CDATA[<p><span>This tutorial covers topics independently of HOMER, and represents knowledge which is important to know before diving head first into more advanced analysis tools such as HOMER.</span></p>
<ol>
<li><a href="http://homer.salk.edu/homer/basicTutorial/computerSetup.html">Setting up your computing environment</a></li>
<li><a href="http://homer.salk.edu/homer/basicTutorial/retrieveFiles.html">Retrieving and storing sequencing files</a>&nbsp;(your own data or from public sources)</li>
<li><a href="http://homer.salk.edu/homer/basicTutorial/fastqFiles.html">Checking sequence quality, trimming, general sequence manipulation</a></li>
<li><a href="http://homer.salk.edu/homer/basicTutorial/mapping.html">Mapping reads to a reference genome</a></li>
<li><a href="http://homer.salk.edu/homer/basicTutorial/samfiles.html">Manipulating SAM/BAM alignment files</a></li>
<li><a href="http://homer.salk.edu/homer/basicTutorial/genomeBrowsers.html">Visualizing data in a genome browser</a></li>
</ol>
<p><br>RNA-Seq</p>
<ol>
<li><a href="http://homer.salk.edu/homer/basicTutorial/rnaseqCufflinks.html">De novo transcript discovery and differential analysis with Cufflinks</a></li>
<li><a href="http://homer.salk.edu/homer/basicTutorial/rnaseqR.html">Differential expression analysis with R/Bioconductor</a></li>
<li><a href="http://homer.salk.edu/homer/basicTutorial/clustering.html">Clustering of large expression datasets (microarray or RNA-Seq)</a></li>
</ol>
<p><br><span>Microarray</span></p>
<ol>
<li><a href="http://homer.salk.edu/homer/basicTutorial/affymetrix.html">Basic analysis of Affymetrix Gene Expression Arrays using R/Bioconductor</a></li>
</ol>
<p><span>General Tips for Data Analysis</span></p>
<ol>
<li><a href="http://homer.salk.edu/homer/basicTutorial/excelTips.html">Excel workarounds, adding gene annotation, X-Y plots tips, etc.</a></li>
</ol><p>Address of the bookmark: <a href="http://homer.salk.edu/homer/basicTutorial/" rel="nofollow">http://homer.salk.edu/homer/basicTutorial/</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/29029/ngs-tutorial</guid>
	<pubDate>Mon, 05 Sep 2016 09:50:46 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/29029/ngs-tutorial</link>
	<title><![CDATA[NGS Tutorial]]></title>
	<description><![CDATA[<p><span>These tutorials are written for hundreds of bioinformaticians trying to cope with large volume of next-generation sequencing (NGS) data. NGS technologies brought a dramatic shift in the world of sequencing. Merely five years back, genome sequencing of higher eukaryotes used to be very expensive endeavor. To get a genome of interest sequenced, hundreds of scientists had to raise funds together by writing a joint white-paper and petitioning to various government agencies. The tasks of sequencing and assembly were handled by dedicated sequencing facilities, of which only a few existed around the globe. Naturally, the capacities at those sequencing facilities were significantly constrained from high volume of requests</span></p><p>Address of the bookmark: <a href="http://www.homolog.us/Tutorials/index.php" rel="nofollow">http://www.homolog.us/Tutorials/index.php</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/32399/mapping-ngs</guid>
	<pubDate>Tue, 02 May 2017 07:58:07 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32399/mapping-ngs</link>
	<title><![CDATA[Mapping NGS]]></title>
	<description><![CDATA[<p>NGS data are just a bunch of sequences, you have no idea which region in the genome each sequences comes from, which gene it represents...<br>To know that you have to align the sequences to the reference sequence. The reference sequence is in most cases the full genome sequence but sometimes, a library of EST sequences is used.<br>In either way, aligning your sequence reads to the reference sequence is called mapping.</p>
<p>The most used mappers of DNA-seq data are&nbsp;<a href="http://bio-bwa.sourceforge.net/" target="_blank">BWA</a>&nbsp;and&nbsp;<a href="http://bowtie-bio.sourceforge.net/bowtie2/index.shtml" target="_blank">Bowtie</a>&nbsp;for DNA-Seq data and&nbsp;<a href="http://tophat.cbcb.umd.edu/" target="_blank">Tophat</a>,&nbsp;<a href="https://github.com/alexdobin/STAR" target="_blank">STAR</a>&nbsp;or&nbsp;<a href="http://www.ccb.jhu.edu/software/hisat/index.shtml" target="_blank">HISAT</a>&nbsp;for RNA-Seq data. Mappers differ in which options they can take in, how fast and how accurate they are. Bowtie is faster than BWA, but looses some sensitivity (does not map an equal amount of reads to the correct position in the genome).</p><p>Address of the bookmark: <a href="http://wiki.bits.vib.be/index.php/Mapping_of_NGS_data" rel="nofollow">http://wiki.bits.vib.be/index.php/Mapping_of_NGS_data</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44541/powerful-books-for-learning-data-analysis-with-r</guid>
	<pubDate>Tue, 28 May 2024 07:42:56 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44541/powerful-books-for-learning-data-analysis-with-r</link>
	<title><![CDATA[Powerful books for learning data analysis with R]]></title>
	<description><![CDATA[<p><span>R is powerful tool for data analysis, visualization, and machine learning. And it costs $0 to use! Here are six FREE books you can use to learn R today:</span></p>
<p><span>https://csgillespie.github.io/efficientR/</span></p>
<p><span>https://r-graphics.org/</span></p>
<p><span>https://rstudio-education.github.io/hopr/</span></p>
<p><span>https://r-pkgs.org/</span></p>
<p><span>https://r4ds.had.co.nz/</span></p>
<p>&nbsp;</p><p>Address of the bookmark: <a href="https://r-graphics.org/" rel="nofollow">https://r-graphics.org/</a></p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/44267/free-books-on-machine-learning-and-artificial-intelligent</guid>
	<pubDate>Thu, 16 Mar 2023 00:10:24 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/44267/free-books-on-machine-learning-and-artificial-intelligent</link>
	<title><![CDATA[Free Books on Machine Learning and Artificial Intelligent !]]></title>
	<description><![CDATA[<div><p>An Introduction to Statistical Learning<br />This book provides a broad and less technical treatment of key topics in statistical learning. Each chapter includes an R lab. This book is appropriate for anyone who wishes to use contemporary tools for data analysis.</p><p>https://hastie.su.domains/ISLR2/ISLRv2_website.pdf</p><p>Python Data Science Handbook<br />You&rsquo;ll learn how to use the core libraries essential for working with data in Python: particularly IPython, NumPy, Pandas, Matplotlib, Scikit-Learn, and related packages. This resource is perfect for tackling day-to-day issues such as cleaning, manipulating, and transforming data &mdash; or building machine learning models.</p><p>https://jakevdp.github.io/PythonDataScienceHandbook/</p><p>Dive into Deep Learning<br />Interactive deep learning book with code, math, and discussions. Implemented with PyTorch, NumPy/MXNet, JAX, and TensorFlow. Adopted at 400 universities from 60 countries</p><p>https://d2l.ai/</p><p>Approaching (Almost) Any Machine Learning Problem<br />This book is for people who have some theoretical knowledge of machine learning and deep learning and want to dive into applied machine learning. The book is more oriented towards how and what should you use to solve machine learning and deep learning problems. The book is for you if you are looking for guidance on approaching machine learning problems.</p><p>https://github.com/abhishekkrthakur/approachingalmost/blob/master/AAAMLP.pdf</p></div>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<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/40525/heatmaply-popular-graphical-method-for-visualizing-high-dimensional-data</guid>
	<pubDate>Sat, 11 Jan 2020 07:34:14 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40525/heatmaply-popular-graphical-method-for-visualizing-high-dimensional-data</link>
	<title><![CDATA[heatmaply: popular graphical method for visualizing high-dimensional data]]></title>
	<description><![CDATA[<p>This work is based on ggplot2 and plotly.js engine. It produces similar heatmaps as d3heatmap, with the advantage of speed (plotly.js is able to handle larger size matrix), and the ability to zoom from the dendrogram.</p>
<p>heatmaply also provides an interface based around the&nbsp;<a href="https://cran.r-project.org/package=plotly">plotly R package</a>. This interface can be used by choosing&nbsp;<code>plot_method = "plotly"</code>&nbsp;instead of the default&nbsp;<code>plot_method = "ggplot"</code>. This interface can provide smaller objects and faster rendering to disk in many cases and provides otherwise almost identical features.</p>
<p>Documentation for this package is also available as a&nbsp;<a href="https://cran.r-project.org/package=pkgdown">pkgdown</a>&nbsp;site:&nbsp;<a href="http://talgalili.github.io/heatmaply/">http://talgalili.github.io/heatmaply/</a></p><p>Address of the bookmark: <a href="http://talgalili.github.io/heatmaply/articles/heatmaply.html" rel="nofollow">http://talgalili.github.io/heatmaply/articles/heatmaply.html</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27959/darkhorse</guid>
	<pubDate>Wed, 22 Jun 2016 05:37:38 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27959/darkhorse</link>
	<title><![CDATA[DarkHorse]]></title>
	<description><![CDATA[<p><em>DarkHorse</em>&nbsp;is a bioinformatic method for rapid, automated identification and ranking of phylogenetically atypical proteins on a genome-wide basis. It works by selecting potential ortholog matches from a reference database of amino acid sequences, then using these matches to calculate a lineage probability index (LPI) score for each genome protein.</p>
<p>LPI scores are inversely proportional to the phylogenetic distance between database match sequences and the query genome. These scores are useful not only for large-scale<em>de novo</em>&nbsp;predictions of horizontally transferred proteins, but can also serve as an independent quality control test for potential horizontal transfer candidates identified by alternative methods, especially those based on nucleic acid signatures. Candidates having high LPI scores are unlikely to have been horizontally transferred, since they are highly conserved among closely related organisms.</p>
<p>One unique and powerful feature of the DarkHorse HGT Candidate database is the opportunity to explore the phylogenetic background of potential HGT donors as well as recipients. The breadth of the database allows not only query sequences, but also their database match partners to be evaluated for sequence similarity or novelty compared to taxonomically related organisms.</p>
<p><em>DarkHorse</em>&nbsp;is configurable for varying degrees of phylogenetic granularity and protein sequence conservation. Users should consult the&nbsp;<a href="http://darkhorse.ucsd.edu/#references">references</a>&nbsp;cited below for a complete explanation of parameter selection and result interpretation. A brief&nbsp;<a href="http://darkhorse.ucsd.edu/tutorial.html">tutorial</a>&nbsp;page is also available on-line.</p><p>Address of the bookmark: <a href="http://darkhorse.ucsd.edu/download.html" rel="nofollow">http://darkhorse.ucsd.edu/download.html</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/915/researcher-in-computer-sciencebiology</guid>
  <pubDate>Mon, 15 Jul 2013 18:38:40 -0500</pubDate>
  <link></link>
  <title><![CDATA[Researcher in computer science/biology]]></title>
  <description><![CDATA[
<p>Researcher in Computer Science at the Computational Biology Unit - temporary employment</p>

<p>The Department of Informatics is a vacant position as a researcher in computer science, related to Computational Biology Unit (CBU), for 3 years.<br /> <br />The position is part of CBU Service Group and will focus on bioinformatic analysis project and especially the analysis of high-throughput data, including NGS (sequencing), and proteomics data.<br /> <br />The successful candidate will be part of the Norwegian bioinformatics platform's national helpdesk within the project ELIXIR.NO<br /> <br />Applicants must hold a PhD in a relevant subject such as computer science, mathematics, molecular biology and also possess expertise and experience in bioinformatics statistics and analysis of data from high-throughput molecular experiment.<br /> <br />Basic programming or scripting skills are required. Experience in Python, R, Perl, Linux-based operating systems and moreover knowledge of databases and web programming will be a strength for applicants.<br /> <br />We expect enthusiasm and independence and moreover the ability to work in an interdisciplinary team environment.<br /> <br />Good knowledge of English is required.<br /> <br />Salaries start at level 57 (code 1109/LR 24.1) by appointment. Further promotion occurs after<br />service seniority in the position (at grade 57-65). Of particularly highly qualified applicants may be considered a higher salary.<br /> <br />Further information about the position is available from the chair of the CBU, <br />Professor Inge Jonassen, e-mail: Inge.Jonassen @ ii.uib.no<br /> <br />The successful applicant must comply with the guidelines that apply at any given time the position.<br /> <br />State employment shall as far as possible reflect the diversity of the population. It is therefore an objective to achieve a balanced age and sex composition and the recruitment of persons with immigrant backgrounds. Persons with immigrant background are requested to apply for the position.<br /> <br />Women are particularly encouraged to apply. If the experts find that several applicants have approximately equivalent qualifications, the rules on equal in the Personnel Regulations for Academic Positions will be applied.<br /> <br />University of Bergen applies the principles of public openness when recruiting staff to scientific positions.<br /> <br />Information about the applicant may be made public even though the applicant has requested not to be named in the list of applicants. If the request does not host admitted to the result, the applicant shall be notified of this.<br /> <br />Send application, CV, certificates, diplomas, undergraduate work and a list of publications (list of publications) online by clicking on https://www.jobbnorge.no/jobbsoknet/login.aspx?returnurl=/jobbsoknet/jobapplication.aspx?jobid=95196<br /> <br />You need to upload certified translations into English or a Scandinavian language of appendices, such as diplomas and transcripts.<br /> <br />Applications sent by email to individuals at the institute will not be considered.<br /> <br />Deadline: 9 August 2013</p>
]]></description>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/2336/3rd-annual-next-generation-sequencing-asia-congress-2013-at-singapore-singapore</guid>
  <pubDate>Wed, 14 Aug 2013 09:55:04 -0500</pubDate>
  <link></link>
  <title><![CDATA[3rd Annual Next Generation Sequencing Asia Congress 2013 at Singapore, Singapore]]></title>
  <description><![CDATA[
<p>The 3rd Annual Next Generation Sequencing Asia Congress is to be held on the 22nd and 23rd of October 2013 in Singapore. Over the 2 days, the conference will provide an overview of the current options of next-generation sequencing platforms, technologies, applications and the newest computational tools for the analysis of next-generation sequencing data and analytical genomics as well as overcoming data management problems. The event will attract over 200 senior-level decision makers working in areas such as next generation sequencing, analytical genomics, computational biology, oncology, RNA profiling, molecular genomics, biomarkers, bioinformatics &amp; data management and clinical &amp; diagnostics development.</p>

<p>Dated : 22 Nov 2013 -23 Nov 2013</p>

<p>http://www.ngsasia-congress.com/</p>
]]></description>
</item>

</channel>
</rss>