<?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/30557?offset=420</link>
	<atom:link href="https://bioinformaticsonline.com/related/30557?offset=420" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/view/2044</guid>
	<pubDate>Mon, 12 Aug 2013 12:19:29 -0500</pubDate>
	<link>https://bioinformaticsonline.com/view/2044</link>
	<title><![CDATA[Does anyone have Nanopore latest updates?]]></title>
	<description><![CDATA[<p>There was a lot of buzz about&nbsp;<span>Oxford Nanopore Technologies&reg; is developing the GridION&trade; system and miniaturised MinION&trade; device. These are a new generation of electronic molecular analysis system for use in scientific research, personalised medicine, crop science, security/defence and more. The platform technology uses nanopores to analyse single molecules including DNA/RNA and proteins. With a broad patent portfolio, the Oxford Nanopore pipeline includes biological nanopores and solid-state nanopores.</span></p><p>Is this available, or still under trial mode?&nbsp;</p><p><a href="https://www.nanoporetech.com/">https://www.nanoporetech.com/</a></p><p><a href="https://www.nanoporetech.com/technology/the-minion-device-a-miniaturised-sensing-system/the-minion-device-a-miniaturised-sensing-system">https://www.nanoporetech.com/technology/the-minion-device-a-miniaturised-sensing-system/the-minion-device-a-miniaturised-sensing-system</a></p>]]></description>
	<dc:creator>Poonam Mahapatra</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/9639/find-certain-filesdocuments-in-linux-os</guid>
	<pubDate>Sun, 06 Apr 2014 23:56:18 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/9639/find-certain-filesdocuments-in-linux-os</link>
	<title><![CDATA[Find certain files/documents in Linux OS]]></title>
	<description><![CDATA[<p>As bioinformatician I know the fact that we usually handle the large dataset and lost in the huge numbers of files and folders. In order to search the missing file a strong search command is required. The Linux Find Command is one of the most important and much used command in Linux sytems. Find command used to search and locate list of files and directories based on conditions you specify for files that match the arguments. Find can be used in variety of conditions like you can find files by permissions, users, groups, file type, date, size and other possible criteria.<br /><br />Through this article we are sharing our day-to-day Linux find command experience and its usage in the form of examples. In this article we will show you the most used 35 Find Commands examples in Linux. We have divided the section into Five parts from basic to advance usage of find command.</p><p><strong>Part I &ndash; Basic Find Commands for Finding Files with Names</strong><br />1. Find Files Using Name in Current Directory<br /><br />Find all the files whose name is gene.txt in a current working directory.<br /><br /># find . -name gene.txt<br /><br />./gene.txt<br /><br />2. Find Files Under Home Directory<br /><br />Find all the files under /home directory with name gene.txt.<br /><br /># find /home -name gene.txt<br /><br />/home/gene.txt<br /><br />3. Find Files Using Name and Ignoring Case<br /><br />Find all the files whose name is gene.txt and contains both capital and small letters in /home directory.<br /><br /># find /home -iname gene.txt<br /><br />./gene.txt<br />./Gene.txt<br /><br />4. Find Directories Using Name<br /><br />Find all directories whose name is Gene in / directory.<br /><br /># find / -type d -name Gene<br /><br />/Gene<br /><br />5. Find fasta Files Using Name<br /><br />Find all php files whose name is gene.fasta in a current working directory.<br /><br /># find . -type f -name gene.fasta<br /><br />./gene.fasta<br /><br />6. Find all PHP Files in Directory<br /><br />Find all fasta files in a directory.<br /><br /># find . -type f -name "*.fasta"<br /><br />./gene.fasta<br />./cancer.fasta<br />./allgene.fasta<br /><br /><strong>Part II &ndash; Find Files Based on their Permissions</strong><br />7. Find Files With 777 Permissions<br /><br />Find all the files whose permissions are 777.<br /><br /># find . -type f -perm 0777 -print<br /><br />8. Find Files Without 777 Permissions<br /><br />Find all the files without permission 777.<br /><br /># find / -type f ! -perm 777<br /><br />9. Find SGID Files with 644 Permissions<br /><br />Find all the SGID bit files whose permissions set to 644.<br /><br /># find / -perm 2644<br /><br />10. Find Sticky Bit Files with 551 Permissions<br /><br />Find all the Sticky Bit set files whose permission are 551.<br /><br /># find / -perm 1551<br /><br />11. Find SUID Files<br /><br />Find all SUID set files.<br /><br /># find / -perm /u=s<br /><br />12. Find SGID Files<br /><br />Find all SGID set files.<br /><br /># find / -perm /g+s<br /><br />13. Find Read Only Files<br /><br />Find all Read Only files.<br /><br /># find / -perm /u=r<br /><br />14. Find Executable Files<br /><br />Find all Executable files.<br /><br /># find / -perm /a=x<br /><br />15. Find Files with 777 Permissions and Chmod to 644<br /><br />Find all 777 permission files and use chmod command to set permissions to 644.<br /><br /># find / -type f -perm 0777 -print -exec chmod 644 {} \;<br /><br />16. Find Directories with 777 Permissions and Chmod to 755<br /><br />Find all 777 permission directories and use chmod command to set permissions to 755.<br /><br /># find / -type d -perm 777 -print -exec chmod 755 {} \;<br /><br />17. Find and remove single File<br /><br />To find a single file called gene.txt and remove it.<br /><br /># find . -type f -name "gene.txt" -exec rm -f {} \;<br /><br />18. Find and remove Multiple File<br /><br />To find and remove multiple files such as .fa or .gb, then use.<br /><br /># find . -type f -name "*.fa" -exec rm -f {} \;<br /><br />OR<br /><br /># find . -type f -name "*.gb" -exec rm -f {} \;<br /><br />19. Find all Empty Files<br /><br />To file all empty files under certain path.<br /><br /># find /tmp -type f -empty<br /><br />20. Find all Empty Directories<br /><br />To file all empty directories under certain path.<br /><br /># find /tmp -type d -empty<br /><br />21. File all Hidden Files<br /><br />To find all hidden files, use below command.<br /><br /># find /tmp -type f -name ".*"<br /><br /><strong>Part III &ndash; Search Files Based On Owners and Groups</strong><br />22. Find Single File Based on User<br /><br />To find all or single file called gene.txt under / root directory of owner root.<br /><br /># find / -user root -name gene.txt<br /><br />23. Find all Files Based on User<br /><br />To find all files that belongs to user Rahul under /home directory.<br /><br /># find /home -user rahul<br /><br />24. Find all Files Based on Group<br /><br />To find all files that belongs to group Developer under /home directory.<br /><br /># find /home -group developer<br /><br />25. Find Particular Files of User<br /><br />To find all .txt files of user Rahul under /home directory.<br /><br /># find /home -user rahul -iname "*.txt"<br /><br /><strong>Part IV &ndash; Find Files and Directories Based on Date and Time</strong><br />26. Find Last 50 Days Modified Files<br /><br />To find all the files which are modified 50 days back.<br /><br /># find / -mtime 50<br /><br />27. Find Last 50 Days Accessed Files<br /><br />To find all the files which are accessed 50 days back.<br /><br /># find / -atime 50<br /><br />28. Find Last 50-100 Days Modified Files<br /><br />To find all the files which are modified more than 50 days back and less than 100 days.<br /><br /># find / -mtime +50 &ndash;mtime -100<br /><br />29. Find Changed Files in Last 1 Hour<br /><br />To find all the files which are changed in last 1 hour.<br /><br /># find / -cmin -60<br /><br />30. Find Modified Files in Last 1 Hour<br /><br />To find all the files which are modified in last 1 hour.<br /><br /># find / -mmin -60<br /><br />31. Find Accessed Files in Last 1 Hour<br /><br />To find all the files which are accessed in last 1 hour.<br /><br /># find / -amin -60<br /><br /><strong>Part V &ndash; Find Files and Directories Based on Size</strong><br />32. Find 50MB Files<br /><br />To find all 50MB files, use.<br /><br /># find / -size 50M<br /><br />33. Find Size between 50MB &ndash; 100MB<br /><br />To find all the files which are greater than 50MB and less than 100MB.<br /><br /># find / -size +50M -size -100M<br /><br />34. Find and Delete 100MB Files<br /><br />To find all 100MB files and delete them using one single command.<br /><br /># find / -size +100M -exec rm -rf {} \;<br /><br />35. Find Specific Files and Delete<br /><br />Find all .gb files with more than 10MB and delete them using one single command.<br /><br /># find / -type f -name *.gb -size +10M -exec rm {} \;</p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/18741/a-powerful-yet-simple-gene-set-analysis-tool-for-interpreting-rna-seq-and-ngs-results</guid>
	<pubDate>Thu, 30 Oct 2014 09:19:29 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/18741/a-powerful-yet-simple-gene-set-analysis-tool-for-interpreting-rna-seq-and-ngs-results</link>
	<title><![CDATA[A powerful, yet simple, gene set analysis tool for interpreting RNA-seq and NGS results.]]></title>
	<description><![CDATA[<p>LifeMap Sciences is introducing&nbsp;<a href="http://geneanalytics.genecards.org/">GeneAnalytics</a>, our new gene set analysis tool, which is applicable for NGS results and differentially expressed gene lists from variable sources. GeneAnalytics provides&nbsp;gene associations with tissues &amp; cells, diseases, pathways, GO terms and compounds.</p><p>Our main advantages over other similar tools are:</p><ul>
<li>GeneAnalytics is very simple and intuitive to use.</li>
<li>GeneAnalytics is based on our proprietary databases &ndash;&nbsp;<strong>GeneCards</strong>, MalaCards, PathCards and LifeMap Discovery, each of them integrates information from a very large number of resources.</li>
<li>GeneAnalytics supplies links for extensive background information on each of the matched results.</li>
</ul><p>&nbsp;</p><p>I invite you to try it out for free at&nbsp;geneanalytics.genecards.org, and would be happy to hear your comments and thoughts on how we can improve.</p><p>&nbsp;</p><p>Yours,</p><p>Shani Ben-Ari Fuchs</p><p>LifeMap Sciences Team</p>]]></description>
	<dc:creator>Shani</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/9868/raghavas-group</guid>
  <pubDate>Tue, 15 Apr 2014 23:59:48 -0500</pubDate>
  <link></link>
  <title><![CDATA[Raghava's Group]]></title>
  <description><![CDATA[
<p>Raghava's group is known for developing open source software or web servers. Group have developed large number of web-based services.</p>

<p>Find more at http://www.imtech.res.in/raghava/</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/26179/alignment-of-closely-related-whole-genomesscaffolds</guid>
	<pubDate>Fri, 29 Jan 2016 10:37:27 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/26179/alignment-of-closely-related-whole-genomesscaffolds</link>
	<title><![CDATA[Alignment of closely related whole genomes/scaffolds]]></title>
	<description><![CDATA[<p>With the relative ease and low cost of current generation sequencing technologies has led to a dramatic increase in the number of sequenced genomes for species across the tree of life. This increasing volume of data requires tools that can quickly compare multiple whole-genome sequences, millions of base pairs in length, to aid in the study of populations, pan-genomes, and genome evolution.This bookmaks have been created to report new tools for whole genome alignments.</p>
<p>Please report new whole genome alignment tools under comment sections.</p><p>Address of the bookmark: <a href="http://www.cs.utoronto.ca/~brudno/721.full.pdf" rel="nofollow">http://www.cs.utoronto.ca/~brudno/721.full.pdf</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/10127/assistant-professor-at-sardar-patel-university</guid>
  <pubDate>Mon, 21 Apr 2014 21:03:55 -0500</pubDate>
  <link></link>
  <title><![CDATA[Assistant Professor at SARDAR PATEL UNIVERSITY]]></title>
  <description><![CDATA[
<p>SARDAR PATEL UNIVERSITY<br />Centre for Interdisciplinary Studies in Science and Technology</p>

<p>No.: SPU/CISST/Advt./2014-15/519</p>

<p>ADVERTISEMENT for Teaching Positions (Contractual)</p>

<p>Applications for the following Contractual Teaching Position are invited for Centre for Interdisciplinary Studies in Science and Technology (CISST), Sardar Patel University:</p>

<p>2. Assistant Professor (ONE) (Contractual)</p>

<p>For the subject of Bioinformatics</p>

<p>Qualifications:</p>

<p>(I) Good academic record as defined by the concerned university with at least 55 % marks (or an equivalent grade in a point scale wherever grading system is followed) at the Master’s level</p>

<p>(II) Ph.D. degree in the concerned subject or in a relevant interdisciplinary subject<br />from an Indian University or NET/SLET clearance Contractual appointment carries a total Fixed Emoluments of Rs. 30,000/- p.m without any assurance of permanent Positions and related benefits.</p>

<p>An Application Form in prescribed Performa, available on University Website: www.spuvvn.edu should be filled in completely in Twelve Copies with self attested copies of certificates of qualifications and experience. Only one copy of each mark sheet be attached with the first copy of the application form. All 12 (Twelve) Application forms should be sent to Registrar’s office along with Demand Draft of Application form fee of Rs. 250/- (Non-refundable) in favour of “REGISTRAR, SARDAR PATEL UNIVERSITY, VALLABH VIDYANAGAR”. The S.C. and S.T. category candidates need not to pay Application fee.</p>

<p>Applicants who are in service should apply through their present employers. Candidates called for interview shall be required to attend at their own cost.</p>

<p>In absence of suitable candidate, the University may relax the eligibility criteria, for conditional appointment.</p>

<p>The last date of receipt of application by the University is 30th April, 2014</p>

<p>Advertisement: www.spuvvn.edu/careers/CISST%20Advt.%20April%202014.pdf</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/32875/finishing</guid>
	<pubDate>Sat, 20 May 2017 15:50:20 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32875/finishing</link>
	<title><![CDATA[Finishing !!]]></title>
	<description><![CDATA[<p>The process of&nbsp;<em>finishing</em>&nbsp;a genome and moving it from a&nbsp;<em>draft</em>&nbsp;stage (the result of sequencing and initial assembly) to a complete genome is typically a time and resource intensive task. The advent of new sequencing technologies has come with its own set of opportunities and pitfalls in the finishing process. While genomes can now be sequenced to high redundancy in a cost-effective manner, the process of assembling the genomes is more challenging and often draft genomes are fragmented into hundreds of contigs. Correspondingly, the task of producing the complete genome can involve months of lab work and thousands of finishing experiments and is usually done in large genome centers.</p>
<p>The work in our lab has focussed on computational approaches to speed-up the finishing process. Specifically, we have explored the use of optical mapping and mate-pair data to augment assemblies and direct finishing experiments. The tools developed in our lab have been used in several finishing projects, producing complete genomes (and near-complete ones) with surprisingly little computational and experimental effort (Nagarajan et al., in submission). The executables (as well as source code) for these tools are freely available here:</p>
<ul>
<li><strong>Scaffolding using Optical Restriction Mapping</strong><br>Optical Maps are global, ordered maps of restriction site locations in a genome. This information can be quite useful in scaffolding contigs from a shotgun assembly to guide the finishing process. A set of programs to exploit optical maps for assembly can be found here:&nbsp;<a href="http://www.cbcb.umd.edu/finishing/soma-v2.tar.gz">SOMA v2.0 (63 MB tar.gz file)</a>. This version of SOMA contains several improvements to programs in v1.0 as well as new scripts for working with multiple maps, contig graphs and scaffolds.&nbsp;<br><br></li>
<li><strong>Augmenting assemblies with mate-pair data</strong><br>Mate-pair information can be valuable in augmenting short-read assemblies and reconstructing the genome as larger scaffolds. AMOS-Hybrid is a pipeline written in the AMOS framework (open-source assembly tools) to merge arbitrary mated reads into an existing assembly and merge contigs and create scaffolds where possible. Source code and executables for AMOS-Hybrid are available here:&nbsp;<a href="http://www.cbcb.umd.edu/finishing/AMOS-Hybrid-v1.tar.gz">AMOS-Hybrid v1.0 (142 MB tar.gz file)</a>.&nbsp;<br><br></li>
<li><strong>Assembly and sequence-composition guided finishing</strong><br>Contigs from a shotgun assembly are typically linked together in a graph structure that can serve to guide finishing and in some case close gaps&nbsp;<em>in-silico</em>. Also, in many cases, sequence composition of contigs can provide clues to fill gaps in scaffolds. A set of scripts to automate some of these tasks can be found here:&nbsp;<a href="http://www.cbcb.umd.edu/finishing/finishing-v1.tar.gz">Finishing Scripts v1.0 (63 MB tar.gz file)</a>.&nbsp;</li>
</ul>
<p>http://www.cbcb.umd.edu/finishing/</p><p>Address of the bookmark: <a href="http://www.cbcb.umd.edu/finishing/" rel="nofollow">http://www.cbcb.umd.edu/finishing/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/10394/bioinformatics-protocols</guid>
	<pubDate>Mon, 05 May 2014 10:21:41 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/10394/bioinformatics-protocols</link>
	<title><![CDATA[Bioinformatics Protocols]]></title>
	<description><![CDATA[<h2><span> RNA Seq </span></h2>
<p><strong> Basic Galaxy Tutorial </strong></p>
<ul>
<li><a href="https://docs.google.com/document/pub?id=1KbTiBHtvHLfPRZ39AY3uriazrINA8TJzgjjwn1zPP7Y">RNA-Seq tutorial</a> based on <a href="http://www.nature.com/protocolexchange/protocols/2327">Trapnell et al. (2012)</a> <em>Nature Protocols</em></li>
</ul>
<dl><dd>In this tutorial we cover the concepts of <a href="http://en.wikipedia.org/wiki/RNA-Seq">RNA-Seq</a> differential gene expression (DGE) analysis using a very small synthetic dataset from a well studied organism.</dd></dl>
<p><strong> Advanced Galaxy Tutorial </strong></p>
<ul>
<li><a href="https://docs.google.com/document/d/1fQ1XfeOKhezJUDTzMXtZVY20c3RGoHe-HLvFOGzqU4s/pub">RNA-Seq (Advanced) Tutorial</a></li>
</ul>
<dl><dd>In this tutorial we compare the performance of three statistically-based differential expression tools:</dd><dd>* CuffDiff</dd><dd>* EdgeR</dd><dd>* DESeq2</dd></dl>
<p><strong> Advanced Command Line Tutorial </strong></p>
<ul>
<li><a href="https://docs.google.com/document/d/1ayJXtgBP1OXtnV7o7lq4QHKMNk5SdPHFq4hGkqndBtI/pub">Graphical Output with CummeRbund</a> introduces some basic commands using the cummeRbund package of the R programming language</li>
</ul>
<dl><dd>You will need to install R, RStudio and cummeRbund on your PC (explained in the Tutorial). You will learn how to produce graphical output from RNA-Seq analysis previously done using a Cuffdiff analysis.</dd></dl>
<h2><span> Variant Detection </span></h2>
<p><strong> Basic Galaxy Tutorial </strong></p>
<ul>
<li><a href="https://docs.google.com/document/pub?id=1ZRzrjjOCvtAu3m-IKL-rbJ1f4On60dDL_IEwG7oejdI">Variant Detection tutorial</a></li>
</ul>
<dl><dd>In this tutorial we cover the concepts of detecting small variants (SNVs and indels) in human genomic DNA using a small set of reads from chromosome 22.</dd></dl>
<p><strong>Advanced Galaxy Tutorial</strong></p>
<ul>
<li><a href="https://docs.google.com/document/pub?id=1CuKkKylVDb03tnN7RSWl5EUzleetn0ctjmvaidPKLxM">Variant Detection (Advanced) Tutorial</a></li>
</ul>
<dl><dd>In this tutorial we compare the performance of three statistically-based variant detection tools:</dd><dd>* SAMtools: Mpileup</dd><dd>* GATK: Unified Genotyper</dd><dd>* FreeBayes</dd><dd>Each of these tools takes as its input a BAM file of aligned reads and generates a list of likely variants in VCF format</dd></dl>
<p><strong>Pipelines</strong> are for those who are comfortable with using the UNIX command line; and often allow more control over branching and iteration logic.</p>
<ul>
<li><a href="https://github.com/claresloggett/variant_calling_pipeline">WGS/exome GATK-based variant calling pipeline</a></li>
</ul>
<dl><dd>This is a basic variant-calling and annotation pipeline developed at the Victorian Life Sciences Computation Initiative (VLSCI), University of Melbourne. It is based around BWA, GATK and ENSEMBL and was originally designed for human (or similar) data. The master branch is configured for WGS data; there is an exome branch configured for variant calling in exome data.</dd><dd>To run the pipeline you will need Rubra: <a href="https://github.com/bjpop/rubra">https://github.com/bjpop/rubra</a>. Rubra uses the python Ruffus library: <a href="http://www.ruffus.org.uk/">http://www.ruffus.org.uk/</a>.</dd></dl>
<p><strong>Protocols</strong></p>
<ul>
<li><a href="https://docs.google.com/document/d/1lfDYNzHjfDA1pHTHd-0w3xHhg7L4TipT1gRfzgiV8es/pub">Familial Variant Calling</a></li>
</ul>
<dl><dd>In this protocol we discuss and outline the process of calling familial related mutations.</dd></dl>
<ul>
<li><a href="https://docs.google.com/document/d/1PIhm8NrFGaSK0hxpDcp8wUOz11ZkOaHIrpnJshMgDec/pub">Somatic Variant Calling</a></li>
</ul>
<dl><dd>In this protocol we discuss and outline the process of identifying somatic variants or mutations.</dd></dl>
<h2><span> Assembly </span></h2>
<p><strong> Basic Galaxy Tutorial </strong></p>
<ul>
<li><a href="https://docs.google.com/document/pub?id=1N3AB9ptISUu4zULqe1kXpVF0BDyGb5f5yzxWSJd_WNM">Genome assembly tutorial</a></li>
</ul>
<dl><dd>In this tutorial we carry out de novo assembly of a microbial genome. We have also written a <a href="https://docs.google.com/document/d/1xs-TI5MejQARqo0pcocGlymsXldwJbJII890gnmjI0o/pub">De novo Genome Assembly for Illumina Data</a> Protocol for a more generic description of the method.</dd></dl>
<p><strong> Protocol </strong></p>
<ul>
<li><a href="https://docs.google.com/document/d/1xs-TI5MejQARqo0pcocGlymsXldwJbJII890gnmjI0o/pub">De novo Genome Assembly for Illumina Data</a></li>
</ul>
<dl><dd>In this protocol we discuss and outline the process of de novo assembly for small to medium sized genomes. Use our <a href="https://docs.google.com/document/pub?id=1N3AB9ptISUu4zULqe1kXpVF0BDyGb5f5yzxWSJd_WNM">Genome assembly tutorial</a> to learn a specific case of using Galaxy to carry out de novo assembly of a microbial genome.</dd></dl>
<h2><span> Small RNAs </span></h2>
<p><strong> Basic Galaxy Tutorial </strong></p>
<ul>
<li><a href="https://docs.google.com/document/d/1WAObJr7M0m8U-2ku-0Y0Sdt_IHmqd1h8WaJHPhnJ1lM/pub">Quality control for small RNA</a></li>
</ul>
<dl><dd>This tutorial covers initial steps of the workflow for analysis of short RNA expression such as a quality control of the raw reads, processing of the raw reads for the subsequent analysis and initial quality assessment of the library.</dd></dl>
<h2><span> ChIP Seq </span></h2>
<p><strong> Protocol </strong></p>
<ul>
<li><a href="https://docs.google.com/document/d/1UPJC8dsiDeP5R9MH9U0IvoDgPF2Q3EOstAuzS3e6WCE/pub">ChIP-Seq</a></li>
</ul>
<dl><dd>In this protocol we discuss ChIP-Seq: a method to analyze the interaction between proteins and DNA.</dd></dl>
<h2><span> Amplicons </span></h2>
<p><strong>Protocol</strong></p>
<ul>
<li><a href="https://docs.google.com/document/d/1uW7JzxG86QzS92hTyeuNsLhX_d1XFbaZPSjh7jWxcSg/pub">Amplicon Alignment</a></li>
</ul>
<dl><dd>In this protocol we discuss and outline the process of aligning custom amplicons using primers for high precision.</dd></dl>
<h2><span> Learn Galaxy </span></h2>
<p><a href="https://docs.google.com/document/d/1wsdJDYfjZVg2uJxm9AHi_j0mY3X1M1F4gB-elkuYL7c/pub">Introduction to Galaxy,</a> for those who are very new to Galaxy.</p>
<p><a href="https://docs.google.com/document/d/1t7vVqa3mdeZYPv5-8hiHBFBYhNiynV_3mWByno9-wUM/pub">Using Histories and Workflows,</a> for those with some Galaxy knowledge.</p>
<p>The Galaxy project website has many <a href="http://wiki.galaxyproject.org/Learn">tutorials</a> and <a href="http://wiki.galaxyproject.org/Learn/Screencasts">screencasts</a> about using Galaxy and the tools, and developing new tools.</p><p>Address of the bookmark: <a href="https://genome.edu.au/wiki/Learn" rel="nofollow">https://genome.edu.au/wiki/Learn</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34493/plast-a-fast-accurate-and-ngs-scalable-bank-to-bank-sequence-similarity-search-tool</guid>
	<pubDate>Fri, 01 Dec 2017 04:10:54 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34493/plast-a-fast-accurate-and-ngs-scalable-bank-to-bank-sequence-similarity-search-tool</link>
	<title><![CDATA[PLAST: A fast, accurate and NGS scalable bank-to-bank sequence similarity search tool]]></title>
	<description><![CDATA[<p><strong>PLAST is a fast, accurate and NGS scalable bank-to-bank sequence similarity search tool providing significant accelerations of seeds-based heuristic comparison methods, such as the Blast suite of algorithms.</strong></p>
<p><strong>Relying on unique software architecture, PLAST takes full advantage of recent multi-core personal computers without requiring any additional hardware devices.</strong></p>
<p>PLAST stands for&nbsp;<em>Parallel Local Sequence Alignment Search Tool&nbsp;</em>and is was&nbsp;<a href="http://www.biomedcentral.com/1471-2105/10/329" target="_blank">published in BMC Bioinformatics.</a></p>
<p>PLAST is a general purpose sequence comparison tool providing the following benefits:</p>
<ul>
<li>PLAST is a high-performance sequence comparison tool designed to compare two sets of sequences (query vs. reference),</li>
<li>Reduces the processing time of sequences comparisons while providing highest quality results,</li>
<li>Contains a fully integrated data filtering engine capable of selecting relevant hits with user-defined criteria (E-Value, identity, coverage, alignment length, etc.),</li>
<li>Does not require any additional hardware, since it is a software solution. It is easy to install, cost-effective, takes full advantage of multi-core processors and uses a small RAM footprint,</li>
<li>Ready to be used on desktop computer, cluster, cloud as well as within distributed system running Hadoop.</li>
</ul>
<p>https://plast.inria.fr/</p><p>Address of the bookmark: <a href="https://plast.inria.fr/" rel="nofollow">https://plast.inria.fr/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/10457/assistant-professor-bio-informatics-at-health-and-family-welfare-department-medical-education-in-raipur</guid>
  <pubDate>Wed, 07 May 2014 00:08:38 -0500</pubDate>
  <link></link>
  <title><![CDATA[Assistant Professor (Bio-Informatics) at Health and Family Welfare Department (Medical Education) in Raipur]]></title>
  <description><![CDATA[
<p>Advertisement No.05/2014/ Exam/Dated 17/04/2014</p>

<p>No of vacancies: 01</p>

<p>Pay scale:Rs. 15600 – 39100 + 6600/-</p>

<p>Essential Academic Qualifications / Experience : Good academic record as defined by the concerned university with at least 55% marks (or an equivalent grade in a point scale wherever grading system is followed) at the Master's Degree level in a relevant subject from an Indian University, or an equivalent degree from an accredited foreign university.</p>

<p>Besides fulfilling the above qualifications, the candidate must have cleared the National Eligibility Test (NET) conducted by the UGC, CSIR or similar test accredited by the UGC like SLET/ SET.</p>

<p>Notwithstanding anything contained in sub-clauses (a) and (b) to this Clause, candidates, who are, or have been awarded a Ph.D. Degree in accordance with the University Grants Commission (Minimum Standards and Procedure for Award of Ph.D. Degree) Regulations, 2009, shall be exempted from the requirement of the minimum eligibility condition of NET/SLET/SET for recruitment and appointment of Assistant Professor or equivalent positions in Universities/Colleges/Institutions.</p>

<p>NET/SLET/SET shall also not be required for such Masters Programmes in disciplines for which NET/SLET/SET is not conducted.</p>

<p>Apply online: http://www.psc.cg.gov.in/htm/OA_ME2014.html</p>

<p>Last Date for Online Registration: 22/05/2014</p>

<p>For more details: http://www.psc.cg.gov.in/pdf/Advertisement/ADV_ME2014.pdf</p>
]]></description>
</item>

</channel>
</rss>