<?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/31087?offset=620</link>
	<atom:link href="https://bioinformaticsonline.com/related/31087?offset=620" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41475/proteoclade-a-taxonomic-toolkit-for-multi-species-and-metaproteomic-analysis</guid>
	<pubDate>Wed, 18 Mar 2020 14:27:20 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41475/proteoclade-a-taxonomic-toolkit-for-multi-species-and-metaproteomic-analysis</link>
	<title><![CDATA[ProteoClade: A taxonomic toolkit for multi-species and metaproteomic analysis]]></title>
	<description><![CDATA[<p>ProteoClade is a Python library for&nbsp;<span>taxonomic-based annotation and quantification of bottom-up proteomics data</span>. It is designed to be user-friendly, and has been optimized for speed and storage requirements.</p>
<p>ProteoClade helps you analyze two general categories of experiments:</p>
<ol>
<li>
<p><span><em>Targeted Database</em>&nbsp;Searches:</span>&nbsp;Experiments in which a limited number of species are defined ahead of time, such as those involving Patient-Derived Xenografts (PDXs) or host-pathogen interactions. Reference protein sequence databases are used for targeted searches (ex: using Mascot, MaxQuant).</p>
</li>
<li>
<p><span><em>De Novo</em>&nbsp;Searches:</span>&nbsp;Experiments in which the organisms are unspecified ahead of time or involve samples of high taxonomic complexity. Mass spectra are analyzed in the absence of a reference database (ex: using PEAKS, PepNovo).</p>
</li>
</ol>
<p>ProteoClade scales from two organisms to every organism in UniProt. Please&nbsp;<a href="https://proteoclade.readthedocs.io/">refer to the complete documentation at proteoclade.readthedocs.io</a>&nbsp;for installation, a user's guide, and examples.</p>
<p><a href="https://journals.plos.org/ploscompbiol/article?id=10.1371/journal.pcbi.1007741">https://journals.plos.org/ploscompbiol/article?id=10.1371/journal.pcbi.1007741</a></p><p>Address of the bookmark: <a href="https://github.com/HeldLab/ProteoClade" rel="nofollow">https://github.com/HeldLab/ProteoClade</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/29886/research-officer-at-national-tea-research-foundation</guid>
  <pubDate>Fri, 18 Nov 2016 04:19:24 -0600</pubDate>
  <link></link>
  <title><![CDATA[Research Officer at National Tea Research Foundation]]></title>
  <description><![CDATA[
<p>National Tea Research Foundation (NTRF) a registered body, requires qualified and experienced agricultural research scientist for contractual appointment as per details below :</p>

<p>Post Research Officer, NTRF, Kolkata</p>

<p>Essential Post Graduate degree in Life Science having special paper in Bioinformatics. Post Graduate degree in Bioinformatics.</p>

<p>Desirable Ph. D. in the area of computational biology or bioinformatics.</p>

<p>Job Experience Work experience on database development, capable to work independently and efficient in bioinformatics related project.</p>

<p>Job Responsibility</p>

<p>To develop database on various aspects of tea research.</p>

<p>Screening of the In-house projects of NTRF at the preliminary level.</p>

<p>Review and evaluation of In-house projects of NTRF. Technical monitoring of the In-house projects of NTRF.</p>

<p>Reviewing the final technical report of the In-house projects of NTRF.</p>

<p>Putting-up of same proposals for taking approval and sanction of the competent authority.</p>

<p>Physical and technical verification of the In-house projects of NTRF.</p>

<p>To assist in organizing seminars / workshops / meetings etc.</p>

<p>Interested candidate may appear for walk-in Interview on 17 th November, 2016</p>

<p>More Info :</p>

<p>http://www.teaboard.gov.in/pdf/Recruitment_for_the_post_of_Research_Officer_pdf7538.pdf</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30015/scripts</guid>
	<pubDate>Wed, 30 Nov 2016 10:35:15 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30015/scripts</link>
	<title><![CDATA[Scripts]]></title>
	<description><![CDATA[<p>Useful script for NGS analysis.</p><p>Address of the bookmark: <a href="http://augustus.gobics.de/binaries/scripts/" rel="nofollow">http://augustus.gobics.de/binaries/scripts/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43447/rna-seq-workflow-gene-level-exploratory-analysis-and-differential-expression</guid>
	<pubDate>Sat, 09 Oct 2021 07:59:23 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43447/rna-seq-workflow-gene-level-exploratory-analysis-and-differential-expression</link>
	<title><![CDATA[RNA-seq workflow: gene-level exploratory analysis and differential expression]]></title>
	<description><![CDATA[<p><span>Here we walk through an end-to-end gene-level RNA-seq differential expression workflow using Bioconductor packages. We will start from the FASTQ files, show how these were quantified to the reference transcripts, and prepare gene-level count datasets for downstream analysis. We will perform exploratory data analysis (EDA) for quality assessment and to explore the relationship between samples, perform differential gene expression analysis, and visually explore the results.</span></p><p>Address of the bookmark: <a href="http://master.bioconductor.org/packages/release/workflows/vignettes/rnaseqGene/inst/doc/rnaseqGene.html" rel="nofollow">http://master.bioconductor.org/packages/release/workflows/vignettes/rnaseqGene/inst/doc/rnaseqGene.html</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30102/prism</guid>
	<pubDate>Sat, 10 Dec 2016 15:19:40 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30102/prism</link>
	<title><![CDATA[PRISM]]></title>
	<description><![CDATA[<p><span>PRISM is a software for split read (reads which span across a structrual variant -- SV ) mapping and SV calling from the mapping result. PRISM is able to detect small insertions and abitrary size deletions, inversions and tandom duplications with the direction of discordant read pairs. PRISM_CTX is a tool for detecting inter-chromosome trans-location events.&nbsp;</span><br><br><span>PRISM and PRISM_CTX were originally designed and written by&nbsp;</span><a href="http://www.cs.toronto.edu/~brudno">Michael Brudno</a><span>&nbsp;and Yue Jiang, The original PRISM publication can be found&nbsp;</span><a href="http://bioinformatics.oxfordjournals.org/content/early/2012/07/31/bioinformatics.bts484.abstract">here</a><span>.&nbsp;</span><br><br><span>The authors may be contacted via e-mail at:&nbsp;</span><em>prism at cs.toronto.edu</em><span>.&nbsp;</span><br><br><span>Additional information is available in the&nbsp;</span><a href="http://compbio.cs.toronto.edu/prism/PRISM_README">PRISM README</a><span>&nbsp;file and&nbsp;</span><a href="http://compbio.cs.toronto.edu/prism/PRISM_CTX_README">PRISM_CTX README</a><span>&nbsp;file.&nbsp;</span></p>
<p>http://compbio.cs.toronto.edu/prism/</p><p>Address of the bookmark: <a href="http://compbio.cs.toronto.edu/prism/" rel="nofollow">http://compbio.cs.toronto.edu/prism/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/43999/tools-for-differential-expression-analysis</guid>
	<pubDate>Tue, 08 Nov 2022 03:40:33 -0600</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/43999/tools-for-differential-expression-analysis</link>
	<title><![CDATA[Tools for Differential expression analysis]]></title>
	<description><![CDATA[<p><span>apeglm</span>&nbsp;-&nbsp;<a href="https://bioconductor.org/packages/release/bioc/html/apeglm.html" target="_blank">https://bioconductor.org/packages/release/bioc/html/apeglm.html</a></p><p><span>ashr</span>&nbsp;-&nbsp;<a href="https://github.com/stephens999/ashr" target="_blank">https://github.com/stephens999/ashr</a>,&nbsp;<a href="https://cran.r-project.org/web/packages/ashr/index.html" target="_blank">https://cran.r-project.org/web/packages/ashr/index.html</a></p><p><span>consensusDE</span>&nbsp;-&nbsp;<a href="https://bioconductor.org/packages/release/bioc/html/consensusDE.html" target="_blank">https://bioconductor.org/packages/release/bioc/html/consensusDE.html</a></p><p><span>DESeq2</span>&nbsp;-&nbsp;<a href="https://bioconductor.org/packages/release/bioc/html/DESeq2.html" target="_blank">https://bioconductor.org/packages/release/bioc/html/DESeq2.html</a></p><p><span>edgeR</span>&nbsp;-&nbsp;<a href="https://bioconductor.org/packages/release/bioc/html/edgeR.html" target="_blank">https://bioconductor.org/packages/release/bioc/html/edgeR.html</a></p><p><span>limma</span>&nbsp;-&nbsp;<a href="https://kasperdanielhansen.github.io/genbioconductor/html/limma.html" target="_blank">https://kasperdanielhansen.github.io/genbioconductor/html/limma.html</a>&nbsp;&nbsp;<a href="https://bioconductor.org/packages/release/bioc/html/limma.html" target="_blank">https://bioconductor.org/packages/release/bioc/html/limma.html</a></p><p><span>MetaCycle</span>&nbsp;-&nbsp;<a href="https://cran.r-project.org/web/packages/MetaCycle/index.html" target="_blank">https://cran.r-project.org/web/packages/MetaCycle/index.html</a>,&nbsp;<a href="https://github.com/gangwug/MetaCycle" target="_blank">https://github.com/gangwug/MetaCycle</a></p><p><span>RUVSeq</span>&nbsp;-&nbsp;<a href="https://bioconductor.org/packages/release/bioc/html/RUVSeq.html" target="_blank">https://bioconductor.org/packages/release/bioc/html/RUVSeq.html</a></p><p><span>SARTools</span>&nbsp;-&nbsp;<a href="https://github.com/PF2-pasteur-fr/SARTools" target="_blank">https://github.com/PF2-pasteur-fr/SARTools</a></p><p><span>tximport</span>&nbsp;-&nbsp;<a href="https://github.com/mikelove/tximport" target="_blank">https://github.com/mikelove/tximport</a></p><p>&nbsp;</p>]]></description>
	<dc:creator>Abhi</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44561/bactopia-a-flexible-pipeline-for-complete-analysis-of-bacterial-genomes</guid>
	<pubDate>Sat, 08 Jun 2024 16:25:08 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44561/bactopia-a-flexible-pipeline-for-complete-analysis-of-bacterial-genomes</link>
	<title><![CDATA[Bactopia: a flexible pipeline for complete analysis of bacterial genomes]]></title>
	<description><![CDATA[<p>Bactopia is a flexible pipeline for complete analysis of bacterial genomes. The goal of Bactopia is process your data with a broad set of tools, so that you can get to the fun part of analyses quicker!</p>
<p>Bactopia was inspired by&nbsp;<a href="https://staphopia.github.io/">Staphopia</a>, a workflow we (Tim Read and myself) released that is targeted towards&nbsp;<em>Staphylococcus aureus</em>&nbsp;genomes. Using what we learned from Staphopia and user feedback, Bactopia was developed from scratch with usability, portability, and speed in mind from the start.</p>
<p>Bactopia uses&nbsp;<a href="https://www.nextflow.io/">Nextflow</a>&nbsp;to manage the workflow, allowing for support of many types of environments (e.g. cluster or cloud). Bactopia allows for the usage of many public datasets as well as your own datasets to further enhance the analysis of your sequencing. Bactopia only uses software packages available from&nbsp;<a href="https://bioconda.github.io/">Bioconda</a>&nbsp;and&nbsp;<a href="https://conda-forge.org/">Conda-Forge</a>&nbsp;to make installation as simple as possible for&nbsp;<em>all</em>&nbsp;users.</p>
<p>To highlight the use of&nbsp;<a href="https://bactopia.github.io/latest/full-guide/">Bactopia</a>&nbsp;and&nbsp;<a href="https://bactopia.github.io/latest/bactopia-tools/">Bactopia Tools</a>, we performed an analysis of 1,664 public&nbsp;<em>Lactobacillus</em>&nbsp;genomes, focusing on&nbsp;<em>Lactobacillus crispatus</em>, a species that is a common part of the human vaginal microbiome. The results from this analysis are published in mSystems under the title:&nbsp;<em><a href="https://doi.org/10.1128/mSystems.00190-20">Bactopia: a flexible pipeline for complete analysis of bacterial genomes</a></em></p>
<p><a href="https://bactopia.github.io/latest/assets/bactopia-workflow.png"><img src="https://bactopia.github.io/latest/assets/bactopia-workflow.png" alt="Bactopia Workflow" style="border: 0px;"></a></p><p>Address of the bookmark: <a href="https://bactopia.github.io/latest/" rel="nofollow">https://bactopia.github.io/latest/</a></p>]]></description>
	<dc:creator>Abhi</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/30334/postdoc-at-ubritishcolumbia-in-troutgenomics</guid>
  <pubDate>Thu, 22 Dec 2016 08:18:46 -0600</pubDate>
  <link></link>
  <title><![CDATA[Postdoc at UBritishColumbia in TroutGenomics]]></title>
  <description><![CDATA[
<p>Landscape Genomics Postdoc at UBC A research team at the University of British Columbia’s Department of Zoology and Biodiversity Research Centre is seeking a postdoctoral researcher in landscape genetics of native rainbow trout (Oncorhynchus mykiss). </p>

<p>This project is part of a larger Genome Canada project on genetics and physiology of adaptation to climate change in rainbow trout, and the population genomics component is in the labs of Eric Taylor and Michael Whitlock. The landscape genomics component primarily involves whole genome sequencing approaches to understanding the genomic basis of adaptation to features of habitat, but also to provide insights into phylogeography and the influence of watershed structure on population subdivision in rainbow trout. A PhD in a related field with expertise in basic theory and bioinformatic analysis of population genomics data is required. </p>

<p>The position is available for one year with renewal for up to three additional years. Salary is $55,000 per year plus benefits. To apply, please send a brief cover letter summarizing your qualifications for the position, a CV, and the names, addresses, phone numbers and emails of three references. </p>

<p>Review of applications will begin January 16, 2017. Address application materials to etaylor@zoology.ubc.ca to whom any questions can also be addressed. etaylor@zoology.ubc.ca</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34246/unicycler-hybrid-assembly-pipeline-for-bacterial-genomes</guid>
	<pubDate>Fri, 10 Nov 2017 03:58:27 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34246/unicycler-hybrid-assembly-pipeline-for-bacterial-genomes</link>
	<title><![CDATA[Unicycler: Hybrid assembly pipeline for bacterial genomes]]></title>
	<description><![CDATA[<p><span>Unicycler is an assembly pipeline for bacterial genomes. It can assemble&nbsp;</span><a href="http://www.illumina.com/">Illumina</a><span>-only read sets where it functions as a&nbsp;</span><a href="http://cab.spbu.ru/software/spades/">SPAdes</a><span>-optimiser. It can also assembly long-read-only sets (</span><a href="http://www.pacb.com/">PacBio</a><span>&nbsp;or&nbsp;</span><a href="https://nanoporetech.com/">Nanopore</a><span>) where it runs a&nbsp;</span><a href="https://github.com/lh3/miniasm">miniasm</a><span>+</span><a href="https://github.com/isovic/racon">Racon</a><span>&nbsp;pipeline. For the best possible assemblies, give it both Illumina reads&nbsp;</span><em>and</em><span>&nbsp;long reads, and it will conduct a hybrid assembly.</span></p><p>Address of the bookmark: <a href="https://github.com/rrwick/Unicycler" rel="nofollow">https://github.com/rrwick/Unicycler</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/30654/source-code-and-pseudo-code</guid>
	<pubDate>Mon, 23 Jan 2017 10:17:35 -0600</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/30654/source-code-and-pseudo-code</link>
	<title><![CDATA[Source Code and Pseudo Code !!]]></title>
	<description><![CDATA[<p>An <span style="text-decoration: underline;">algorithm</span> is a procedure for solving a problem in terms of the actions to be executed and the order in which those actions are to be executed. An algorithm is merely the sequence of steps taken to solve a problem. The steps are normally "sequence," "selection, " "iteration," and a case-type statement.</p><p>In C, "sequence statements" are imperatives. The "selection" is the "if then else" statement, and the iteration is satisfied by a number of statements, such as the "while," " do," and the "for," while the case-type statement is satisfied by the "switch" statement.</p><hr><p><span style="text-decoration: underline;">Pseudocode</span> is an artificial and informal language that helps programmers develop algorithms. Pseudocode is a "text-based" detail (algorithmic) design tool.</p><p>The rules of Pseudocode are reasonably straightforward. All statements showing "dependency" are to be indented. These include while, do, for, if, switch. Examples below will illustrate this notion.</p><p><strong> GUIDE TO PSEUDOCODE LEVEL OF DETAIL: Given record/file descriptions, pseudocode should be created in sufficient detail so as to directly support the programming effort. It is the purpose of pseudocode to elaborate on the algorithmic detail and not just cite an abstraction. </strong></p><hr><p>Examples:</p><p>1.</p><pre>If student's grade is greater than or equal to 60
    Print "passed"
else
    Print "failed"  
endif
</pre><hr><p>2.</p><pre>  
Set total to zero
Set grade counter to one
While grade counter is less than or equal to ten
    Input the next grade
    Add the grade into the total
endwhile 
Set the class average to the total divided by ten
Print the class average.
</pre><hr><p>3.</p><pre>Initialize total to zero
Initialize counter to zero
Input the first grade
while the user has not as yet entered the sentinel
   add this grade into the running total 
   add one to the grade counter  
   input the next grade (possibly the sentinel)
endwhile

if the counter is not equal to zero
   set the average to the total divided by the counter
   print the average  
else
   print 'no grades were entered' 
endif 
</pre><hr><p>4.</p><pre>initialize passes to zero
initialize failures to zero
initialize student to one
while student counter is less than or equal to ten
    input the next exam result  
    if the student passed</pre><p>add one to passes else add one to failures add one to student counter endif endwhile print the number of passes print the number of failures if eight or more students passed print "raise tuition" endif</p><hr><h3><strong>5.</strong></h3><pre>Larger example:  

NOTE:  NEVER ANY DATA DECLARATIONS IN PSEUDOCODE

Print out appropriate heading and make it pretty
While not EOF do:
     Scan over blanks and white space until a char is found 
	(get first character on the line)
     set can't-be-ascending-flag to 0
     set consec cntr to 1
     set ascending cntr to 1
     putchar first char of string to screen
     set read character to hold character
     While next character read != blanks and white space
          putchar out on screen
          if new char = hold char + 1
               add 1 to consec cntr
               set hold char = new char
               continue
          endif
          if new char &gt;= hold char 
               if consec cntr &lt; 3 
                    set consec cntr to 1
               endif
               set hold char = new char
               continue
          endif
          if new char &lt; hold char
               if consec cntr &lt; 3
                    set consec cntr to 1
               endif
               set hold char = new char
               set can't be ascending flag to 1
               continue
           endif
     end while
     if consec cntr &gt;= 3 
          printf (Appropriate message 1 and skip a line)
          add 1 to consec total
     endif
     if  can't be ascending flag = 0
          printf (Appropriate message 2 and skip a line)
          add 1 to ascending total
     else
          printf (Sorry message and skip a line)
          add 1 to sorry total
     endif
end While
Print out totals:  Number of consecs, ascendings, and sorries.
Stop
</pre><p>Some Keywords That Should be Used And Additional Points</p><p>For looping and selection, The keywords that are to be used include Do While...EndDo; Do Until...Enddo; While .... Endwhile is acceptable. Also, Loop .... endloop is also VERY good and is language independent. Case...EndCase; If...Endif; Call ... with (parameters); Call; Return ....; Return; When;</p><p>Always use scope terminators for loops and iteration.</p><p>As verbs, use the words Generate, Compute, Process, etc. Words such as set, reset, increment, compute, calculate, add, sum, multiply, ... print, display, input, output, edit, test , etc. with careful indentation tend to foster desirable pseudocode. Also, using words such as Set and Initialize, when assigning values to variables is also desirable.</p><p>More on Formatting and Conventions in Pseudocoding</p><ul>
<li>INDENTATION in pseudocode should be identical to its implementation in a programming language. Try to indent at least four spaces.</li>
<li>As noted above, the pseudocode entries are to be cryptic, AND SHOULD NOT BE PROSE. NO SENTENCES.</li>
<li>No flower boxes (discussed ahead) in your pseudocode.</li>
<li>Do not include data declarations in your pseudocode.</li>
<li>But do cite variables that are initialized as part of their declarations. E.g. "initialize count to zero" is a good entry.<hr>Function Calls, Function Documentation, and Pseudocode</li>
<li>Calls to Functions should appear as:
<ul>     </ul>
</li>
<li>Returns in functions should appear as:
<ul> </ul>
</li>
<li>Function headers should appear as:
<ul>     </ul>
</li>
<li>Note that in C, arguments and parameters such as "fieldn" could be written: "pointer to fieldn ...."</li>
<li>Functions called with addresses should be written as:
<ul>         </ul>
</li>
<li>Function headers containing pointers should be indicated as:
<ul>        </ul>
</li>
<li>Returns in functions where a pointer is returned:
<ul>   </ul>
</li>
<li>It would not hurt the appearance of your pseudocode to draw a line or make your function header line "bold" in your pseudocode. Try to set off your functions.</li>
<li>Try to use scope terminators in your pseudocode and source code too. It really hels the readability of the text.<hr>Source Code</li>
<li>EVERY function should have a flowerbox PRECEDING IT. This flower box is to include the functions name, the main purpose of the function, parameters it is expecting (number and type), and the type of the data it returns. All of these listed items are to be on separate lines with spaces in between each explanatory item.</li>
<li>FORMAT of flowerbox should be
<p>&nbsp;</p>
<pre>	 ********************************************************
	 Function:   ( cryptic text describing single function
		     ....... (indented like this) 	
		     .......
	 Calls:      Start listing functions "this" function calls
		     Show these functions:  one per line, indented

	 Called by:  List of functions that calls "this" function
		     Show these functions:  one per line, indented.

	 Input Parameters:  list, if appropriate; else None
	 
	 Returns:    List, if appropriate.
	 ****************************************************************
</pre>
</li>
<li>INDENTATION is critically important in Source Code. Follow standard examples given in class. If in doubt, ASK. Always indent statements within IFs, FOR loops, WILLE loops, SWITCH statements, etc. a consistent number of spaces, such as four. Alternatively, use the tab key. One or two spaces is insufficient.</li>
<li>Use scope terminators at the end of if statements, for statements, while statements, and at the end of functions. It will make your program much more readable.
<p><strong> SPELLING ERRORS ARE NOT ACCEPTABLE </strong></p>
</li>
</ul>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>