<?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/30440?offset=730</link>
	<atom:link href="https://bioinformaticsonline.com/related/30440?offset=730" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	
<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/22147/research-associate-bioinformatics-job-position-in-nipgr</guid>
  <pubDate>Sun, 19 Apr 2015 14:55:19 -0500</pubDate>
  <link></link>
  <title><![CDATA[Research Associate Bioinformatics job position in NIPGR]]></title>
  <description><![CDATA[
<p>NIPGR Recruitment 2015 – Apply for Research Associate Posts</p>

<p>NIPGR is commonly known as National Institute of Plant Genome Research. Recently, it’s great opportunity for those candidates who are interested to do job in NIPGR. National Institute of Plant Genome Research (NIPGR) had found to build a bridge between the branches of natural sciences and due this connection it is steeping on the heaps of success. Its objectives to preserve, research, production and the advancement in the trait are very clear and also being appreciated by the nation and had been contributing for the further enrichment of the institute. NIPGR had announced the recruitment to further make improvements and amendments by the young potential in their panel. The recruitment is being announced for the post is mentioned below. We are giving a complete information to applicants for find their eligibility as per desired post under NIPGR Recruitment 2015 project but if the candidates are not satisfied with this information then they can download an official advertisement of NIPGR recruitment 2015 from the link defined ahead under the head of reference.</p>

<p>NIPGR Recruitment 2015 for the 1 post of Research Associate: National Institute of Plant Genome Research (NIPGR) had instigated the progression of the recruitment and this process is linked thoroughly so as the 1 post of Research Associate. Applicants are associated and linked with the education to be PHD degree in the life science, biotechnology, bioinformatics or molecular biology. Applicants are associated with the dispatch of the application along with the required certificates so as on the date of 24th Feb 2015.</p>

<p>The recruitment notification and application @ http://www.nipgr.res.in/careers/vacancies_latest.php#</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/44724/step-by-step-guide-to-detect-pirnas-using-bioinformatics</guid>
	<pubDate>Fri, 13 Dec 2024 11:41:46 -0600</pubDate>
	<link>https://bioinformaticsonline.com/news/view/44724/step-by-step-guide-to-detect-pirnas-using-bioinformatics</link>
	<title><![CDATA[Step-by-Step Guide to Detect piRNAs Using Bioinformatics]]></title>
	<description><![CDATA[<p>Piwi-interacting RNAs (piRNAs) are a class of small non-coding RNAs that play crucial roles in silencing transposable elements and regulating gene expression, particularly in germline cells. Detecting piRNAs involves identifying their unique characteristics, such as size, sequence motifs, and association with Piwi proteins, from high-throughput RNA sequencing data.</p><p>This blog provides a comprehensive step-by-step guide to detect piRNAs using bioinformatics tools and workflows.</p><h4><strong>Step 1: Prepare Your Data</strong></h4><ol>
<li>
<p><strong>Obtain RNA Sequencing Data</strong><br />Acquire raw small RNA-seq data in FASTQ format. Datasets can be sourced from repositories like <strong>NCBI SRA</strong>, <strong>EMBL-EBI</strong>, or specific small RNA sequencing projects.</p>
</li>
<li>
<p><strong>Quality Control (QC)</strong><br />Use <strong>FastQC</strong> to assess the quality of raw reads:</p>
<div>
<div dir="ltr"><code>fastqc reads.fastq </code></div>
</div>
<p>Evaluate the per-base quality, adapter content, and overrepresented sequences.</p>
</li>
<li>
<p><strong>Trimming and Adapter Removal</strong><br />Use tools like <strong>Cutadapt</strong> or <strong>Trim Galore!</strong> to remove adapters and low-quality bases:</p>
<div>
<div dir="ltr"><code>cutadapt -a TGGAATTCTCGGGTGCCAAGG -o trimmed_reads.fastq reads.fastq </code></div>
</div>
<p>Ensure the remaining reads are of high quality for downstream analysis.</p>
</li>
</ol><h4><strong>Step 2: Map Reads to the Genome</strong></h4><p>Mapping reads to the reference genome is crucial for identifying piRNA loci.</p><ol>
<li>
<p><strong>Reference Genome Preparation</strong><br />Download the genome assembly of your organism from databases like <strong>Ensembl</strong>, <strong>UCSC Genome Browser</strong>, or <strong>NCBI</strong>.</p>
</li>
<li>
<p><strong>Align Reads</strong><br />Use <strong>Bowtie</strong> or <strong>STAR</strong> for small RNA alignment:</p>
<div>
<div dir="ltr"><code>bowtie -v 1 -k 1 --best genome_index trimmed_reads.fastq -S aligned_reads.sam </code></div>
</div>
<ul>
<li><code>-v 1</code>: Allows one mismatch.</li>
<li><code>-k 1</code>: Reports the best alignment.</li>
</ul>
</li>
<li>
<p><strong>Convert SAM to BAM</strong><br />Convert and sort alignments using <strong>SAMtools</strong>:</p>
<div>
<div dir="ltr"><code>samtools view -Sb aligned_reads.sam | samtools sort -o sorted_reads.bam </code></div>
</div>
</li>
</ol><h4><strong>Step 3: Identify Small RNAs</strong></h4><p>piRNAs are characterized by their size (24&ndash;32 nt) and strand bias.</p><ol>
<li>
<p><strong>Extract Reads by Size</strong><br />Use tools like <strong>BEDtools</strong> or custom scripts to filter reads between 24 and 32 nt:</p>
<div>
<div dir="ltr"><code>bedtools bamtofastq -i sorted_reads.bam -fq all_reads.fastq seqkit seq -m 24 -M 32 all_reads.fastq &gt; piRNA_size_reads.fastq </code></div>
</div>
</li>
<li>
<p><strong>Check for Sequence Bias</strong><br />piRNAs often have a strong bias for a uridine at the 5&rsquo; end (1U bias). Use tools like <strong>WebLogo</strong> to visualize sequence motifs.</p>
</li>
</ol><h4><strong>Step 4: Detect Ping-Pong Signature</strong></h4><p>The ping-pong amplification loop is a hallmark of piRNA biogenesis, characterized by a 10 nt overlap between piRNAs on opposite strands.</p><ol>
<li>
<p><strong>Generate Overlap Statistics</strong><br />Use the <strong>piPipes</strong> tool or custom scripts to calculate overlap:</p>
<div>
<div dir="ltr"><code>python ping_pong_overlap.py sorted_reads.bam </code></div>
</div>
</li>
<li>
<p><strong>Visualize Overlap Distribution</strong><br />Plot the distribution of overlaps to confirm the presence of the 10 nt ping-pong signature.</p>
</li>
</ol><h4><strong>Step 5: Annotate piRNA Clusters</strong></h4><p>piRNAs are often generated from genomic clusters.</p><ol>
<li>
<p><strong>Cluster Identification</strong><br />Use tools like <strong>proTRAC</strong> or <strong>PIRANHA</strong> to identify piRNA-producing clusters:</p>
<div>
<div dir="ltr"><code>proTRAC.pl -s sorted_reads.bam -g genome.fa -o clusters </code></div>
</div>
</li>
<li>
<p><strong>Annotate Genomic Regions</strong><br />Annotate the identified clusters using gene annotation files (GTF/GFF). Tools like <strong>BEDtools intersect</strong> can help associate piRNA clusters with genes or transposable elements:</p>
<div>
<div dir="ltr"><code>bedtools intersect -a clusters.bed -b genome_annotation.gtf &gt; annotated_clusters.bed </code></div>
</div>
</li>
</ol><h4><strong>Step 6: Functional Analysis</strong></h4><p>Functional analysis of piRNAs can uncover their targets and regulatory roles.</p><ol>
<li>
<p><strong>Predict piRNA Targets</strong><br />Use tools like <strong>IntaRNA</strong> or <strong>RNAhybrid</strong> to predict interactions between piRNAs and potential target mRNAs:</p>
<div>
<div dir="ltr"><code>RNAhybrid -t target_transcripts.fa -q piRNAs.fa &gt; piRNA_targets.txt </code></div>
</div>
</li>
<li>
<p><strong>Enrichment Analysis</strong><br />Perform GO or KEGG enrichment analysis of target genes using tools like <strong>g:Profiler</strong> or <strong>DAVID</strong>.</p>
</li>
</ol><h4><strong>Step 7: Validation and Visualization</strong></h4><ol>
<li>
<p><strong>Validate piRNA Candidates</strong><br />Cross-check the identified piRNAs against known piRNA databases, such as <strong>piRBase</strong> or <strong>piRNAdb</strong>.</p>
</li>
<li>
<p><strong>Visualize Results</strong></p>
<ul>
<li>Use <strong>IGV</strong> (Integrative Genomics Viewer) to visualize piRNA alignment and clusters on the genome.</li>
<li>Generate heatmaps or circos plots to present piRNA distributions.</li>
</ul>
</li>
</ol><h4><strong>Step 8: Share and Publish Findings</strong></h4><ol>
<li>
<p><strong>Archive Data</strong><br />Submit sequencing data to public repositories like <strong>SRA</strong> or <strong>GEO</strong> with metadata specifying piRNA-related experiments.</p>
</li>
<li>
<p><strong>Publish Results</strong><br />Share findings in journals or conferences, emphasizing novel piRNA candidates, target genes, or regulatory mechanisms.</p>
</li>
</ol><h4><strong>Conclusion</strong></h4><p>Detecting piRNAs involves a combination of computational and analytical methods to identify these unique small RNAs and their roles in gene regulation and transposable element suppression. By following this step-by-step guide, you can confidently navigate the complexities of piRNA detection and contribute to the growing understanding of their biological significance.</p>]]></description>
	<dc:creator>Abhi</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/22073/bcil-bioinformatics-bitp-application</guid>
	<pubDate>Fri, 17 Apr 2015 04:34:56 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/22073/bcil-bioinformatics-bitp-application</link>
	<title><![CDATA[BCIL Bioinformatics BITP Application !!]]></title>
	<description><![CDATA[<p>BCIL Bioinformatics BITP Application Form 2015 logoGrab latest Information! Biotech Consortium India Limited has announced a notification for offering admission in Biotech Industrial Training Program. The organization has invited online application from 7th April 2015 BCIL Admission 2015. BCIL has conducted an entrance exam which is scheduled on 20th June 2015. Candidates those who are looking for this program just go for it and don&rsquo;t miss this opportunity.<br /><br />To apply for Biotech Industrial Training Programme the candidates should have 50% marks in B.Tech/BE/M.Tech Degree in Bio technology, bio process technology and other related disciplines form any recognized institution. The organization has decided application fee of Rs.500/- for all candidates and that should be paid through demand draft. Applicants who satisfy the organization requirement, they can take their steps forward.<br /><br />Candidates should submit the online application before 10th May 2015. After registering the online application you need to take the hard copy of it and send through post. Print out of this application should be reached before 15th May 2015. All the latest updates like selection process, exam syllabus and other related information are updated soon at the main URL of the department and aspirants should keep in touch with this site. Further details of BCIL Bioinformatics BITP Application Form 2015 are explained below.<br /><br />Organization: Biotech Consortium India Limited<br /><br />Website URL: www.bcil.nic.in<br /><br />Location: New Delhi<br /><br />Course Name: Biotech Industrial Training Program<br /><br />Exam Name: BCIL Entrance Exam<br /><br />Educational Details: Applicants should complete their B.Tech/M.Tech/BE programs in Neuro- Science, Agricultural, Bio technology, bio process technology and other related disciplines having 50% aggregate from any authorized university.<br /><br />Application Fee: For all candidates application fee is Rs.500/- and it will be paid through Demand Draft drawn in favour of BCIL, New Delhi.<br /><br />How to Apply: Candidates who are willing to apply for this program they can apply through online mode. Then send the hard copy of registered application form to through post.<br /><br />Important Dates<br /><br />Opening Date of Submission Online Application Form: 7h April 2015<br /><br />Closing Date of Submission of Online Application Form: 10th May 2015<br /><br />Last Date of Receipt of Application Form: 15th May 2015<br /><br />Exam Date: 20th June 2015</p><p>More at http://bcil.nic.in/default.htm</p>]]></description>
	<dc:creator>Pranjali Yadav</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/33789/i-pv-interactive-protein-sequence-visualization</guid>
	<pubDate>Mon, 03 Jul 2017 07:52:51 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/33789/i-pv-interactive-protein-sequence-visualization</link>
	<title><![CDATA[I-PV: Interactive Protein Sequence Visualization]]></title>
	<description><![CDATA[<p><span>I-PV is a interactive data visualization software designed for inspection of protein sequences and mutation information. It is mainly used for Genetics and Bioinformatics. So what exactly makes it standout?</span></p>
<p><span>http://i-pv.org/ipv_rec</span></p><p>Address of the bookmark: <a href="http://i-pv.org/" rel="nofollow">http://i-pv.org/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/22024/research-associate-bioinformatics-job-position-in-indian-agricultural-statistics-research-institute-iasri-pusa-new-delhi</guid>
  <pubDate>Tue, 14 Apr 2015 11:57:13 -0500</pubDate>
  <link></link>
  <title><![CDATA[Research Associate Bioinformatics job position in Indian Agricultural Statistics Research Institute (IASRI), Pusa, New Delhi]]></title>
  <description><![CDATA[
<p>Indian Agricultural Statistics Research Institute is inviting applications from indian citizens for recruiting following posts:</p>

<p>Vacancies:<br />Research Associate-02<br />Age Limits:<br />Candidates age limit should be not more than 40 years as on date of interview.<br />Qualification:<br />Candidates should possess Ph.D in Bioinformatics/Agricultural Statistics/Statistics/Computer Science/Computer Application or equivalent.<br />Selection Process:<br />Selection will be based on interview.<br />How to Apply:<br />Eligible candidates may attend for interview along with application in prescribed format, recent passport size photograph pasted on the application form, bio-data, original certificates and self attested copies of relevant documents, all experience certificates, testimonials etc, held at Indian Agricultural Statistics Research Institute, Pusa, New Delhi on 18-04-2015 at 10:30 AM.<br />Last Date:<br />18-04-2015</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41689/medaka-sequence-correction-provided-by-ont-research</guid>
	<pubDate>Mon, 18 May 2020 16:28:00 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41689/medaka-sequence-correction-provided-by-ont-research</link>
	<title><![CDATA[medaka: Sequence correction provided by ONT Research]]></title>
	<description><![CDATA[<p><code>medaka</code><span>&nbsp;is a tool to create a consensus sequence from nanopore sequencing data. This task is performed using neural networks applied from a pileup of individual sequencing reads against a draft assembly. It outperforms graph-based methods operating on basecalled data, and can be competitive with state-of-the-art signal-based methods, whilst being much faster.</span></p><p>Address of the bookmark: <a href="https://github.com/nanoporetech/medaka" rel="nofollow">https://github.com/nanoporetech/medaka</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/file/view/22044/binc-sample-question-paper</guid>
	<pubDate>Thu, 16 Apr 2015 09:12:39 -0500</pubDate>
	<link>https://bioinformaticsonline.com/file/view/22044/binc-sample-question-paper</link>
	<title><![CDATA[BINC Sample Question Paper !!!]]></title>
	<description><![CDATA[<p>BINC sample question paper for round ONE.</p>]]></description>
	<dc:creator>Jitendra Narayan</dc:creator>
	<enclosure url="https://bioinformaticsonline.com/file/download/22044" length="1260" type="text/plain" />
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44555/ultra-ultra-locates-tandemly-repetitive-areas-effective-labeling-of-repetitive-genomic-sequence</guid>
	<pubDate>Sat, 08 Jun 2024 16:03:39 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44555/ultra-ultra-locates-tandemly-repetitive-areas-effective-labeling-of-repetitive-genomic-sequence</link>
	<title><![CDATA[ULTRA (ULTRA Locates Tandemly Repetitive Areas) : Effective Labeling of Repetitive Genomic Sequence]]></title>
	<description><![CDATA[<p dir="auto">ULTRA is a tool to find and annotate tandem repeats inside genomic sequence. It is able to find repeats of any length and of any period (up to a maximum period of 4000). It can find highly decayed repeats missed by other software, and it will also be able to find very large repeats in highly repetitive sequence, regardless of the size of sequence or length of repeats. ULTRA offers meaningful annotation scores and can produce annotation P-values at user request.</p>
<p dir="auto">More at&nbsp;https://www.biorxiv.org/content/10.1101/2024.06.03.597269v1</p><p>Address of the bookmark: <a href="https://github.com/TravisWheelerLab/ULTRA" rel="nofollow">https://github.com/TravisWheelerLab/ULTRA</a></p>]]></description>
	<dc:creator>Abhi</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/file/view/22068/binc-examination-2015</guid>
	<pubDate>Fri, 17 Apr 2015 03:34:28 -0500</pubDate>
	<link>https://bioinformaticsonline.com/file/view/22068/binc-examination-2015</link>
	<title><![CDATA[BINC examination 2015 !!!]]></title>
	<description><![CDATA[<p>BioInformatics National Certification (BINC) Examination 2015 organized by Department of Biotechnology, Government of India, New Delhi Pondicherry University, Puducherry</p>]]></description>
	<dc:creator>Jitendra Narayan</dc:creator>
	<enclosure url="https://bioinformaticsonline.com/file/download/22068" length="281577" type="application/pdf" />
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/33955/crocoblast-optimized-parallel-implementation-of-local-sequence-alignment-algorithms</guid>
	<pubDate>Tue, 25 Jul 2017 05:03:10 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/33955/crocoblast-optimized-parallel-implementation-of-local-sequence-alignment-algorithms</link>
	<title><![CDATA[CrocoBLAST: Optimized parallel implementation of local sequence alignment algorithms]]></title>
	<description><![CDATA[<p><span>Local sequence alignment is a cornerstone of bioinformatics, allowing to compare the amino-acid sequences of different proteins, or the nucleotide sequences of different pieces of DNA. The Basic Local Alignment Search Tool (BLAST) has revolutionized the field of bioinformatics, and is currently implemented in all free and commercial bioinformatics packages. However, with the advent of Next Generation Sequencing (NGS) and the development of new sequencing techniques, the utility of traditional BLAST implementations is limited. CrocoBLAST combines the accuracy and general applicability of BLAST with computational efficiency, accessibility, and user experience, so that NGS data can be analyzed efficiently even when only modest computational resources are available.</span></p>
<p>https://webchem.ncbr.muni.cz/Platform/App/CrocoBLAST</p><p>Address of the bookmark: <a href="https://webchem.ncbr.muni.cz/Platform/App/CrocoBLAST" rel="nofollow">https://webchem.ncbr.muni.cz/Platform/App/CrocoBLAST</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>