<?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/17885?offset=30</link>
	<atom:link href="https://bioinformaticsonline.com/related/17885?offset=30" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/5402/key-bioinformatics-scientists</guid>
	<pubDate>Wed, 09 Oct 2013 13:37:07 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/5402/key-bioinformatics-scientists</link>
	<title><![CDATA[Key Bioinformatics Scientists]]></title>
	<description><![CDATA[<p>Address of the bookmark: <a href="http://www.iscb.org/iscb-leadership-a-staff-/officers-and-board-directors" rel="nofollow">http://www.iscb.org/iscb-leadership-a-staff-/officers-and-board-directors</a></p>]]></description>
	<dc:creator>Rahul Agarwal</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27323/cutadapt</guid>
	<pubDate>Fri, 13 May 2016 04:54:50 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27323/cutadapt</link>
	<title><![CDATA[cutadapt]]></title>
	<description><![CDATA[<p>Cutadapt finds and removes adapter sequences, primers, poly-A tails and other types of unwanted sequence from your high-throughput sequencing reads.</p>
<p>Cleaning your data in this way is often required: Reads from small-RNA sequencing contain the 3&rsquo; sequencing adapter because the read is longer than the molecule that is sequenced. Amplicon reads start with a primer sequence. Poly-A tails are useful for pulling out RNA from your sample, but often you don&rsquo;t want them to be in your reads.</p>
<p>Cutadapt helps with these trimming tasks by finding the adapter or primer sequences in an error-tolerant way. It can also modify and filter reads in various ways. Adapter sequences can contain IUPAC wildcard characters. Also, paired-end reads and even colorspace data is supported. If you want, you can also just demultiplex your input data, without removing adapter sequences at all.</p>
<p>Cutadapt comes with an extensive suite of automated tests and is available under the terms of the MIT license.</p>
<p>If you use cutadapt, please cite <a href="http://dx.doi.org/10.14806/ej.17.1.200">DOI:10.14806/ej.17.1.200</a> .</p><p>Address of the bookmark: <a href="https://cutadapt.readthedocs.io/en/stable/installation.html#quickstart" rel="nofollow">https://cutadapt.readthedocs.io/en/stable/installation.html#quickstart</a></p>]]></description>
	<dc:creator>Radha Agarkar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27839/lorma-a-tool-for-correcting-sequencing-errors-in-long-reads-such-those-produced-by-pacific-biosciences-sequencing-machines</guid>
	<pubDate>Wed, 15 Jun 2016 17:18:36 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27839/lorma-a-tool-for-correcting-sequencing-errors-in-long-reads-such-those-produced-by-pacific-biosciences-sequencing-machines</link>
	<title><![CDATA[LoRMA: a tool for correcting sequencing errors in long reads such those produced by Pacific Biosciences sequencing machines]]></title>
	<description><![CDATA[<p>LoRMA is a tool for correcting sequencing errors in long reads such those produced by Pacific Biosciences sequencing machines.</p>
<p>Publication:</p>
<ul>
<li>L. Salmela, R. Walve, E. Rivals, and E. Ukkonen: Accurate selfcorrection of errors in long reads using de Bruijn graphs. Accepted to RECOMB-Seq 2016.</li>
</ul>
<p>Download:</p>
<ul>
<li><a href="https://www.cs.helsinki.fi/u/lmsalmel/LoRMA/LoRMA-0.3.tar.gz">LoRMA 0.3 source files</a></li>
<li><a href="https://www.cs.helsinki.fi/u/lmsalmel/LoRMA/README.txt">README</a></li>
</ul><p>Address of the bookmark: <a href="https://www.cs.helsinki.fi/u/lmsalmel/LoRMA/" rel="nofollow">https://www.cs.helsinki.fi/u/lmsalmel/LoRMA/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/4098/bioinformatics-algorithm-demonstrations-and-tutorials</guid>
	<pubDate>Thu, 29 Aug 2013 09:23:51 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/4098/bioinformatics-algorithm-demonstrations-and-tutorials</link>
	<title><![CDATA[Bioinformatics Algorithm Demonstrations and Tutorials]]></title>
	<description><![CDATA[<p>Abstract</p>
<p>This project presents demonstrations of selected computer science algorithms important in&nbsp;bioinformatics, implemented in the spreadsheet program Microsoft Excel. Spreadsheets provide an&nbsp;interesting platform for demonstration of algorithms, since various steps of the calculations can be&nbsp;exposed in a manner that is easily comprehensible to users with little programming experience. The&nbsp;algorithms demonstrated include two approaches to approximate string matching (dynamic programming&nbsp;and Shift-AND numeric approximate matching), Hierarchical Clustering (used in phylogenetic studies&nbsp;and microarray analysis of gene expression), a Naive Bayes Classifier for simulated microarray gene&nbsp;expression data, and a simple Neural Network. These demonstrations are designed to serve as&nbsp;instructional aids in bioinformatics courses.</p>
<p>Tutorial @&nbsp;http://www.cybertory.org/downloads/bae/BioinformaticsAlgorithmsInExcel.zip</p>
<p>One of the best resource for online bioinformatics learning is https://stepic.org/Bioinformatics-Algorithms-2 Enjoy the online learning.</p>
<p>Reference :&nbsp;cybertory</p>
<blockquote>
<p><span>" Please add your favourite bioinformatics algorithms and tutorial links below in the comment section, for the benefit of bioinformatics and computational biology community ".&nbsp;</span></p>
</blockquote><p>Address of the bookmark: <a href="http://www.cybertory.org/downloads/bae/BioinformaticsAlgorithmsExcelDoc.pdf" rel="nofollow">http://www.cybertory.org/downloads/bae/BioinformaticsAlgorithmsExcelDoc.pdf</a></p>]]></description>
	<dc:creator>Jitendra Narayan</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/videolist/watch/5187/bioinformatics-algorithms-part-1-with-pavel-pevzner-phillip-e-c-compeau</guid>
	<pubDate>Mon, 30 Sep 2013 11:34:09 -0500</pubDate>
	<link>https://bioinformaticsonline.com/videolist/watch/5187/bioinformatics-algorithms-part-1-with-pavel-pevzner-phillip-e-c-compeau</link>
	<title><![CDATA[Bioinformatics Algorithms (Part 1)  with Pavel  Pevzner, Phillip E. C. Compeau,]]></title>
	<description><![CDATA[<iframe width="" height="" src="https://www.youtube-nocookie.com/embed/t5t_nfzdzEg" frameborder="0" allowfullscreen></iframe><p>The course Bioinformatics Algorithms (Part 1) by Pavel Pevzner, Phillip E. C. Compeau, and Nikolay Vyahhi from University of California, San Diego will be offered free of charge to everyone on the Coursera platform. Sign up at http://www.coursera.org/course/bioinformatics.</p>]]></description>
	
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/12206/bioinformatics-algorithms-tutorials</guid>
	<pubDate>Tue, 24 Jun 2014 00:10:45 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/12206/bioinformatics-algorithms-tutorials</link>
	<title><![CDATA[Bioinformatics algorithms tutorials]]></title>
	<description><![CDATA[<p>Useful bioinformatics tutorial, such as</p>
<p>De Bruijn Graphs for NGS Assembly<br>Algorithms for PacBio Reads<br>Software and Hardware Concepts for Bioinformatics<br>Finding us in Homolog.us (Search Algorithms)<br>NGS Genome and RNAseq Assembly - a Hands on Primer<br>Introduction to PERL, Python, R and C/C++ for Bioinformatics</p><p>Address of the bookmark: <a href="http://www.homolog.us/Tutorials/" rel="nofollow">http://www.homolog.us/Tutorials/</a></p>]]></description>
	<dc:creator>John Parker</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/32465/tetra-nucleotide-analysis</guid>
	<pubDate>Thu, 04 May 2017 05:07:41 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32465/tetra-nucleotide-analysis</link>
	<title><![CDATA[Tetra-Nucleotide Analysis]]></title>
	<description><![CDATA[<p>A tetra-nucleotide is a fragment of DNA sequence with 4 bases (e.g. AGTC or TTGG). Pride&nbsp;<em>et al.</em>&nbsp;(2003) showed that the frequency of tetra-nucleotides in bacterial genomes contain useful, albeit weak, phylogenetic signals. Even though tetra-nucleotide analysis (TNA) utilizes the information of whole genome, it is evident that it cannot replace other alignment-based phylogenetic methods such as&nbsp;<a href="https://chunlab.wordpress.com/orthoani/">OrthoANI</a>&nbsp;or&nbsp;16S rRNA phylogeny. However, TNA can be useful for&nbsp;phylogenetic characterization when whole genome or 16S rRNA gene information is not available. For example, a partial genomic fragment obtained from a metagenome can be identified by TNA (Teeling&nbsp;<em>et al.</em>, 2004). TNA is also fast enough that it can be&nbsp;used&nbsp;as a search engine against a large genome database.</p><p>Address of the bookmark: <a href="https://chunlab.wordpress.com/tetra-nucleotide-analysis/" rel="nofollow">https://chunlab.wordpress.com/tetra-nucleotide-analysis/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/23498/algorithms-for-dna-sequencing-course-offered-each-month</guid>
	<pubDate>Sun, 26 Jul 2015 01:57:02 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/23498/algorithms-for-dna-sequencing-course-offered-each-month</link>
	<title><![CDATA[Algorithms for DNA Sequencing (course offered each month)]]></title>
	<description><![CDATA[<p>"<span>We will learn computational methods -- algorithms and data structures -- for analyzing DNA sequencing data. We will learn a little about DNA, genomics, and how DNA sequencing is used. We will use Python to implement key algorithms and data structures and to analyze real genomes and DNA sequencing datasets."</span></p>
<p><span>Source :&nbsp;https://www.coursera.org/course/ads1</span></p>
<p>&nbsp;</p><p>Address of the bookmark: <a href="https://www.coursera.org/course/ads1" rel="nofollow">https://www.coursera.org/course/ads1</a></p>]]></description>
	<dc:creator>Rahul Agarwal</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/44400/pevzner-lab</guid>
  <pubDate>Thu, 02 Nov 2023 05:39:26 -0500</pubDate>
  <link></link>
  <title><![CDATA[Pevzner Lab !]]></title>
  <description><![CDATA[
<p>The laboratory works on genome sequencing, immunoproteogenomics, antibiotics sequencing, and comparative genomics - computational technologies that enabled new applications and allowed scientists to attack biological problems that remained beyond the reach of previous techniques.</p>

<p>https://bioalgorithms.ucsd.edu/research4.html</p>
]]></description>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/41905/research-associate-bioinformatics-in-iisc-recruitment-2020</guid>
  <pubDate>Tue, 23 Jun 2020 21:53:34 -0500</pubDate>
  <link></link>
  <title><![CDATA[Research Associate Bioinformatics in IISc Recruitment 2020]]></title>
  <description><![CDATA[
<p>Research Associate Bioinformatics in IISc Recruitment 2020</p>

<p>Essential Qualifications: Ph.D. (Bioinformatics/ Biophysics/ Biotechnology or any other stream of biological/ physical sciences) with a minimum of two publications in reputed peer reviewed journals in the area of structural bioinformatics or biophysics or biomolecular modeling/ simulation.</p>

<p>Job description: Development of bioinformatics tools and algorithms/software for structure based analysis of biomolecular systems. Programmatic access to major biomolecular databases using APIs Knowledge based prediction and analysis of biomolecular structure, function and interactions. Docking/simulations for inhibitor design.</p>

<p>Desirable Qualifications (Research Associate/s): i)  Strong computer programming skills (in Python/PERL/PHP or C++ or object oriented database management systems like MySQL etc or scripting languages under LINUX/UNIX environment). </p>

<p>ii) Extensive experience in computational analysis of biomolecular structure/interactions and usage of advanced biomolecular simulation softwares. iii) Adequate knowledge of major databases, webservers and softwares in the area of biomolecular structure/function and drug design. iv)  Familiarity with Parallel Programming environments and experience in usage of high-end HPC clusters.</p>

<p>The candidates must highlight their experience in above mentioned fields/topics in their CV. Initial appointment will be for a period of 1 year, subject to extension after review of performance.</p>

<p>Emoluments: As per DST, GOI norms and commensurate with experience.</p>

<p>More at https://www.iisc.ac.in/positions-open/</p>
]]></description>
</item>

</channel>
</rss>