<?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/11144?offset=770</link>
	<atom:link href="https://bioinformaticsonline.com/related/11144?offset=770" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/44516/16srna-database-download</guid>
	<pubDate>Wed, 24 Apr 2024 04:33:15 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/44516/16srna-database-download</link>
	<title><![CDATA[16sRNA Database Download]]></title>
	<description><![CDATA[<p>Downloading 16S rRNA databases can be crucial for various bioinformatics analyses, especially in microbiome research. However, it's important to note that databases can vary based on your specific needs, such as the taxonomic coverage you require or the type of analysis you're performing. Here's a general guideline on how you can obtain 16S rRNA databases:</p><ol>
<li>
<p><span>NCBI (National Center for Biotechnology Information)</span>:</p>
<ul>
<li>NCBI provides various databases related to genetic information, including 16S rRNA sequences.</li>
<li>You can access the 16S ribosomal RNA sequences from NCBI's Nucleotide database (<a href="https://www.ncbi.nlm.nih.gov/nucleotide/" target="_new">https://www.ncbi.nlm.nih.gov/nucleotide/</a>).</li>
<li>Perform a search using keywords like "16S rRNA" or specific bacterial names to find relevant sequences.</li>
<li>You can download sequences individually or in batches using the provided tools.</li>
</ul>
</li>
<li>
<p><span>GreenGenes</span>:</p>
<ul>
<li>GreenGenes is a widely used 16S rRNA gene sequence database.</li>
<li>You can access it at <a target="_new">http://greengenes.secondgenome.com/</a>.</li>
<li>GreenGenes provides precompiled databases for various purposes, including classification, alignment, and phylogenetic analysis.</li>
</ul>
</li>
<li>
<p><span>SILVA</span>:</p>
<ul>
<li>SILVA (<a href="https://www.arb-silva.de/" target="_new">https://www.arb-silva.de/</a>) is another comprehensive database for ribosomal RNA (rRNA) sequences.</li>
<li>It covers not only 16S rRNA but also other ribosomal RNA sequences.</li>
<li>SILVA provides precompiled databases for various purposes, including taxonomic classification and alignment.</li>
</ul>
</li>
<li>
<p><span>Ribosomal Database Project (RDP)</span>:</p>
<ul>
<li>RDP (<a target="_new">http://rdp.cme.msu.edu/</a>) is a curated database that offers 16S rRNA sequences.</li>
<li>It provides tools for sequence analysis and classification.</li>
<li>You can download sequences and taxonomy information from their website.</li>
</ul>
</li>
<li>
<p><span>QIIME (Quantitative Insights Into Microbial Ecology)</span>:</p>
<ul>
<li>QIIME (<a href="https://qiime2.org/" target="_new">https://qiime2.org/</a>) is a widely used bioinformatics platform for microbiome analysis.</li>
<li>It provides tools for analyzing microbial communities, including processing 16S rRNA sequences.</li>
<li>QIIME often includes its own preprocessed 16S rRNA databases that can be used for analysis within the platform.</li>
</ul>
</li>
</ol><p>Before downloading any database, make sure to read the terms of use and citation requirements, as some databases may have specific usage policies. Additionally, consider the compatibility of the database with your analysis pipeline and software tools.</p><p>&nbsp;</p><p>NCBI 16s RNA database location&nbsp;ftp://ftp.ncbi.nih.gov/blast/db/16SMicrobial.tar.gz</p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/852/queensland-centre-for-medical-genomics-grimmond-lab</guid>
  <pubDate>Sun, 14 Jul 2013 11:58:34 -0500</pubDate>
  <link></link>
  <title><![CDATA[Queensland Centre for Medical Genomics, Grimmond Lab]]></title>
  <description><![CDATA[
<p>Queensland Centre for Medical Genomics</p>

<p>Research Area:<br />pancreatic cancer; ovarian cancer; prostate cancer; bowel cancer; brain cancer; endometrial cancer; breast cancer; personalised medicine; high-throughput genomics</p>

<p>Link @ http://www.imb.uq.edu.au/sean-grimmond</p>
]]></description>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/4725/complex-systems-from-physics-to-biology-october-15-16-2013-at-jnu-convention-center</guid>
  <pubDate>Mon, 23 Sep 2013 10:17:17 -0500</pubDate>
  <link></link>
  <title><![CDATA[Complex Systems: From Physics to Biology October 15-16 2013 at JNU Convention Center]]></title>
  <description><![CDATA[
<p>The symposium intents to focus on complex systems arising in a variety of settings in physics and biology. In particular, applications of the concepts of physics to biological sciences will be the major theme of this meeting.</p>

<p>Selected Topics:</p>

<p>    Cluster Dynamics<br />    Non-equilibrium Statistical Mechanics<br />    Forced Systems<br />    Hamiltonian Dynamics<br />    Synchronization &amp; Control<br />    Genomics &amp; Systems Biology<br />    Computational Neuroscience<br />    Econophysics</p>

<p>More @ http://www.jnu.ac.in/Conference/SCS2013/</p>
]]></description>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/863/rolland-lagan-lab</guid>
  <pubDate>Sun, 14 Jul 2013 12:57:57 -0500</pubDate>
  <link></link>
  <title><![CDATA[Rolland-Lagan lab]]></title>
  <description><![CDATA[
<p>The Rolland-Lagan lab at the University of Ottawa is specializing in computational and developmental biology. We use a combination of experimental work, microscopy, image analysis and computer simulations to explore developmental mechanisms in two and three dimensions. </p>

<p>Research Area</p>

<p>Developmental biology, Computational biology, Simulation modeling, Image data analysis</p>

<p>Link @ http://mysite.science.uottawa.ca/arolland/index.html</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34618/mashmap-a-fast-and-approximate-software-for-mapping-long-reads-pacbioont-or-assembly-to-reference-genomes</guid>
	<pubDate>Tue, 12 Dec 2017 17:23:31 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34618/mashmap-a-fast-and-approximate-software-for-mapping-long-reads-pacbioont-or-assembly-to-reference-genomes</link>
	<title><![CDATA[MashMap: a fast and approximate software for mapping long reads (PacBio/ONT) or assembly to reference genome(s)]]></title>
	<description><![CDATA[<p><span>MashMap is a fast and approximate software for mapping long reads (PacBio/ONT) or assembly to reference genome(s). It maps a query sequence against a reference region if and only if its estimated alignment identity is above a specified threshold. It does not compute the alignments explicitly, but rather estimates a&nbsp;</span><em>k</em><span>-mer based&nbsp;</span><a href="https://en.wikipedia.org/wiki/Jaccard_index">Jaccard similarity</a><span>&nbsp;using a combination of&nbsp;</span><a href="http://www.cs.princeton.edu/courses/archive/spr05/cos598E/bib/p76-schleimer.pdf">Winnowing</a><span>&nbsp;and&nbsp;</span><a href="https://en.wikipedia.org/wiki/MinHash">MinHash</a><span>. This is then converted to an estimate of sequence identity using the&nbsp;</span><a href="http://mash.readthedocs.org/">Mash</a><span>&nbsp;distance. An appropriate&nbsp;</span><em>k</em><span>-mer sampling rate is automatically determined given minimum local alignment length and identity thresholds. The efficiency of the algorithm improves as both of these thresholds are increased.</span></p><p>Address of the bookmark: <a href="https://github.com/marbl/MashMap" rel="nofollow">https://github.com/marbl/MashMap</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/36630/frequent-paired-end-reads-pe-2x100-mapping-command-lines</guid>
	<pubDate>Tue, 15 May 2018 08:59:29 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/36630/frequent-paired-end-reads-pe-2x100-mapping-command-lines</link>
	<title><![CDATA[Frequent Paired-end reads (PE 2x100) mapping command lines]]></title>
	<description><![CDATA[
<p>bowtie2 -x hs37m -X 650 -q -1 r1.fq -2 r2.fq -S r12.bowtie2.sam  </p>

<p>bwa aln hs37m.fa r1.fq &gt; r1.sai &amp;&amp; bwa aln hs37m.fa r2.fq &gt; r2.sai \  <br />    &amp;&amp; bwa sampe hs37m r1.sai r2.sai r1.fq r2.fq &gt; r12.bwa.sam  </p>

<p>bwa bwasw ../index/bwa/hs37m.fa r12.fq &gt; r12.bwasw.sam  </p>

<p>gsnap -A sam -d hs37m r1.fq r2.fq &gt; r12.gsnap.sam  </p>

<p>novoalign -r Random -o SAM -f r1.fq r2.fq -i 500 50 -d hs37m-k14s3.novo &gt; r12.novo.sam  </p>

<p>smalt map -f samsoft -i 650 -o r12.smalt-k20s13.sam hs37m-k20s13 r1.fq r2.fq  </p>

<p>stampy.py -g hs37m -h hs37m -o r12.stampy.sam -M r1.fq,r2.fq  </p>

<p>soap -D hs37m.fa.index -a r1.fq -b r2.fq -l 32 -g 3 -u dummy -2 dummy -o r12.soap</p>
]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38012/cosine-non-seeding-method-for-mapping-long-noisy-sequences</guid>
	<pubDate>Fri, 26 Oct 2018 00:41:59 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38012/cosine-non-seeding-method-for-mapping-long-noisy-sequences</link>
	<title><![CDATA[COSINE: non-seeding method for mapping long noisy sequences]]></title>
	<description><![CDATA[<p><span>Third generation sequencing (TGS) are highly promising technologies but the long and noisy reads from TGS are difficult to align using existing algorithms. Here, we present COSINE, a conceptually new method designed specifically for aligning long reads contaminated by a high level of errors.</span></p><p>Address of the bookmark: <a href="https://github.com/SUwonglab/COSINE" rel="nofollow">https://github.com/SUwonglab/COSINE</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37545/ncbi-magic-blast</guid>
	<pubDate>Tue, 14 Aug 2018 18:11:11 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37545/ncbi-magic-blast</link>
	<title><![CDATA[NCBI Magic-BLAST]]></title>
	<description><![CDATA[<p>Magic-BLAST is a tool for mapping large next-generation RNA or DNA sequencing runs against a whole genome or transcriptome. Each alignment optimizes a composite score, taking into account simultaneously the two reads of a pair, and in case of RNA-seq, locating the candidate introns and adding up the score of all exons. This is very different from other versions of BLAST, where each exon is scored as a separate hit and read-pairing is ignored.</p>
<p>Magic-BLAST incorporates within the NCBI BLAST code framework ideas developed in the NCBI Magic pipeline, in particular hit extensions by local walk and jump&nbsp;<a href="http://www.ncbi.nlm.nih.gov/pubmed/26109056">(http://www.ncbi.nlm.nih.gov/pubmed/26109056)</a>, and recursive clipping of mismatches near the edges of the reads, which avoids accumulating artefactual mismatches near splice sites and is needed to distinguish short indels from substitutions near the edges.</p>
<p>&nbsp;</p><p>Address of the bookmark: <a href="https://ncbi.github.io/magicblast/" rel="nofollow">https://ncbi.github.io/magicblast/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/44229/common-steps-for-reads-mapping</guid>
	<pubDate>Thu, 09 Mar 2023 02:48:02 -0600</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/44229/common-steps-for-reads-mapping</link>
	<title><![CDATA[Common steps for reads mapping !]]></title>
	<description><![CDATA[<div><div><div><div><div><div><div><div><div><div><p>Mapping reads to a reference genome is an essential step in many types of genomic analysis, such as variant calling and gene expression analysis. Here are some general steps to follow for mapping reads to a genome:</p><ol>
<li>
<p>Choose a read mapper: There are many read mappers available, such as BWA, Bowtie, and HISAT2. Choose a mapper that is appropriate for your type of data and research question.</p>
</li>
<li>
<p>Index the reference genome: Before mapping reads, the reference genome needs to be indexed. This involves creating an index of the genome sequence that allows the mapper to quickly find matches to the reads. Most mappers have their own indexing tools.</p>
</li>
<li>
<p>Prepare the read data: The reads should be in a format that is compatible with the mapper. Most mappers accept FASTQ or BAM files. Depending on the quality of the data, it may need to be filtered or trimmed before mapping.</p>
</li>
<li>
<p>Run the mapper: The mapper is run with the command-line interface or using a graphical user interface. The specific command depends on the mapper being used, but typically involves specifying the input data, reference genome, and output file format.</p>
</li>
<li>
<p>Evaluate the mapping results: After the mapping is complete, the results should be evaluated. This includes assessing the quality of the mapping, such as the mapping rate, the number of mapped reads, and the mapping quality score.</p>
</li>
<li>
<p>Post-processing: Depending on the analysis being performed, post-processing of the mapped reads may be necessary. This can include filtering reads based on quality, removing duplicate reads, and calling variants.</p>
</li>
</ol><p>Overall, mapping reads to a reference genome is a complex process that requires careful consideration of the type of data, the research question, and the specific mapper being used.</p></div></div></div></div></div></div></div></div></div></div>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/11798/phd-scholarship-denmark</guid>
  <pubDate>Fri, 13 Jun 2014 13:44:07 -0500</pubDate>
  <link></link>
  <title><![CDATA[PHD SCHOLARSHIP DENMARK]]></title>
  <description><![CDATA[
<p>ne PhD position is available at the Bioinformatics Center, Department of Biology, University of Copenhagen, Denmark. The PhD position concerns protein structure prediction, and will be in the Structural Bioinformatics group of Associate professor Thomas Hamelryck. The group is an integrated part of the Bioinformatics Center, which is headed by Professor Anders Krogh, employs around sixty scientists (including PhD students) and focuses on non-coding RNA, eukaryotic gene regulation and protein structure prediction. The center provides a modern, pleasant, international working environment with excellent modern facilities, in the heart of Copenhagen.<br />The project will be supervised by Associate Professor Thomas Hamelryck.</p>

<p>The protein folding problem is of enormous practical, theoretical and medical importance - and in addition forms a fascinating intellectual challenge. The aim of this project is to develop and implement a probabilistic method to infer the structure of proteins, building on various probabilistic models of protein structure developed by the Hamelryck group. The method will also take the dynamic nature of proteins into account, and involves a close collaboration with the statistics department at the university within the interdisciplinary project "Dynamical Systems: Mathematical Modeling and Statistical Methods for the Social, Health, and Natural Sciences" (http://dsin.ku.dk/).</p>

<p>Qualifications<br />Knowledge of programming (C++) and statistics or machine learning. Knowledge of biology, physics or biophysics is a plus, but not a requirement.</p>

<p>The deadline for applications is June 15, 2014</p>

<p>More at : https://job.jobnet.dk/CV/FindJob/details.aspx/3695051%20</p>
]]></description>
</item>

</channel>
</rss>