<?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/32465?offset=250</link>
	<atom:link href="https://bioinformaticsonline.com/related/32465?offset=250" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<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/42141/dbt-biotechnology-eligibility-test-bet-2020</guid>
	<pubDate>Fri, 21 Aug 2020 09:17:24 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/42141/dbt-biotechnology-eligibility-test-bet-2020</link>
	<title><![CDATA[DBT BIOTECHNOLOGY ELIGIBILITY TEST (BET) 2020]]></title>
	<description><![CDATA[<p><span>Ministry of Science &amp;Technology, Govt. of India</span></p><p><span>DBT-Junior Research Fellowship (DBT-JRF) in Biotechnology (2020)</span></p><p><span><span>BIOTECHNOLOGY ELIGIBILITY TEST (BET) 2020</span></span></p><p>Applications are invited from bonafide Indian citizens, residing in India for award of &ldquo;DBT-Junior Research Fellowship&rdquo; (DBT-JRF) for pursuing research in frontier areas of Biotechnology and Life Sciences. The candidates will be selected through &ldquo;Biotechnology Eligibility Test (BET)&rdquo;. Based on the performance in BET, two categories of merit list will be prepared (Category-I and Category-II). Government of India norms for reservation will be followed for selection. Candidates selected under category-I will be eligible to avail fellowship under the programme. These will be tenable at any University/Institute in India where the selected candidate registers for PhD Programme. Candidates selected under Category-II will be eligible to be appointed in any DBT sponsored project and avail fellowship from the project equivalent to NET/GATE, subject to selection through institutional selection process. There will be no binding on Principal Investigators of DBT sponsored projects to select JRF for their project from category-II list. Selection in category-II will not entitle student for any fellowship from DBT-JRF programme.</p><p><span>ELIGIBILITY</span></p><p><span>Qualification</span>: M.Sc./ M.Tech./ M.V.Sc. or equivalent degree/ Integrated BS-MS/ B.E./ B.Tech. in any discipline of&nbsp;<a href="https://www.biotecnika.org/category/jobs/biotech-jobs/">Biotechnology</a>, M.Sc./ M.Tech. Bioinformatics/ Computational Biology, students admitted under DBT supported Postgraduate Teaching Programs. M.Sc. Life Science/ Bioscience/ Zoology/ Botany/ Microbiology/ Biochemistry/ Biophysics and Masters in Allied areas of Biology/Life Sciences. Candidates appearing in the final year examination are also eligible to apply.</p><p><span>Marks</span>: Minimum 60% marks for General, EWS &amp; OBC category and 55% for SC/ ST/ Differently abled in aggregate (or equivalent grade).</p><p><span>Age Limit</span>: Upto 28 years as on the last date of application for General &amp; EWS category. Age relaxation of up to 5 years (33 years) for SC/ ST/ Differently Abled/ women candidates and upto 3 years (31 years) for OBC (Non-Creamy Layer) candidates.</p><p>For detailed procedure for filling the application form, payment of application fee and uploading of required documents/ certificates in the prescribed format, please visit:&nbsp;<span><a href="http://rcb.res.in/BET2020" target="_blank">http://rcb.res.in/BET2020</a></span>. A non-refundable and non-transferable application fee of Rs. 1000/-is payable online by General/ OBC/ EWS candidates and Rs 250/- by SC/ ST/ Differently abled candidates.</p><p><span>IMPORTANT DATES</span></p><table width="691">
<tbody>
<tr>
<td>Online Registration Start</td>
<td><span>April 20, 2020</span></td>
</tr>
<tr>
<td>Online Registration Close</td>
<td><span>May 18, 2020</span></td>
</tr>
<tr>
<td>BET 2020</td>
<td><span>June 30, 2020 (Tuesday)* Tentative</span></td>
</tr>
<tr>
<td>Display of question paper and answer key on website</td>
<td><span>June 30, 2020</span></td>
</tr>
<tr>
<td>Last date of accepting representation of any discrepancy in Question paper &amp; Answer key</td>
<td><span>July 03, 2020</span></td>
</tr>
<tr>
<td>Declaration of BET 2020 Result</td>
<td><span>July 20, 2020</span></td>
</tr>
</tbody>
</table>]]></description>
	<dc:creator>Shruti Paniwala</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/34221/alignment-free-sequence-comparison-tools-available-for-next-generation-sequencing-data-analysis</guid>
	<pubDate>Tue, 07 Nov 2017 05:33:33 -0600</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/34221/alignment-free-sequence-comparison-tools-available-for-next-generation-sequencing-data-analysis</link>
	<title><![CDATA[Alignment-free sequence comparison tools available for next-generation sequencing data analysis]]></title>
	<description><![CDATA[<div><p><span>kallisto</span></p></div><div><p>Transcript abundance quantification from RNA-seq data (uses pseudoalignment for rapid determination of read compatibility with targets)</p><p>Software (C++)</p><p><a href="https://pachterlab.github.io/kallisto/">https://pachterlab.github.io/kallisto/</a></p><p>Sailfish</p><p>Estimation of isoform abundances from reference sequences and RNA-seq data (<em>k</em>-mer based)</p><p>Software (C++)</p><p><a href="http://www.cs.cmu.edu/~ckingsf/software/sailfish/">http://www.cs.cmu.edu/~ckingsf/software/sailfish/</a></p><p>Salmon</p><p>Quantification of the expression of transcripts using RNA-seq data (uses&nbsp;<em>k</em>-mers)</p><p><a href="https://combine-lab.github.io/salmon/">https://combine-lab.github.io/salmon/</a></p><p>RNA-Skim</p><p>RNA-seq quantification at transcript-level (partitions the transcriptome into disjoint transcript clusters; uses&nbsp;<em>sig</em>-mers, a special type of&nbsp;<em>k</em>-mers)</p><p>Software (C++)</p><p><a href="http://www.csbio.unc.edu/rs/">http://www.csbio.unc.edu/rs/</a></p><p>Variant calling</p><p>ChimeRScope</p><p>Fusion transcript prediction using gene&nbsp;<em>k</em>-mers profiles of the RNA-seq paired-end reads</p><p>Software (Java)</p><p><a href="https://github.com/ChimeRScope/ChimeRScope/wiki">https://github.com/ChimeRScope/ChimeRScope/wiki</a></p><p>FastGT</p><p>Genotyping of known SNV/SNP variants directly from raw NGS sequence reads by counting unique&nbsp;<em>k</em>-mers</p><p>Software (C)</p><p><a href="https://github.com/bioinfo-ut/GenomeTester4/">https://github.com/bioinfo-ut/GenomeTester4/</a></p><p>Phy-Mer</p><p>Reference-independent mitochondrial haplogroup classifier from NGS data (<em>k</em>-mer based)</p><p>Software (Python)</p><p><a href="https://github.com/danielnavarrogomez/phy-mer">https://github.com/danielnavarrogomez/phy-mer</a></p><p>LAVA</p><p>Genotyping of known SNPs (dbSNP and Affymetrix's Genome-Wide Human SNP Array) from raw NGS reads (<em>k</em>-mer based)</p><p>Software (C)</p><p><a href="http://lava.csail.mit.edu/">http://lava.csail.mit.edu/</a></p><p>MICADo</p><p>Detection of mutations in targeted third-generation NGS data (can distinguish patients&rsquo; specific mutations; algorithm uses&nbsp;<em>k</em>-mers and is based on colored de Bruijn graphs)</p><p>Software (Python)</p><p><a href="http://github.com/cbib/MICADo">http://github.com/cbib/MICADo</a></p><p>General mapper</p><p>Minimap</p><p>Lightweight and fast read mapper and read overlap detector (uses the concept of &ldquo;minimazers&rdquo;, a special type of&nbsp;<em>k</em>-mers)</p><p>Software (C)</p><p><a href="https://github.com/lh3/minimap">https://github.com/lh3/minimap</a></p><p>Assembly</p><p>De novo genome assembly</p><p>MHAP</p><p>Produces highly continuous assembly (fully resolved chromosome arms) from third-generation long and noisy reads (10 kbp) using a dimensionality reduction technique MinHash</p><p>Software (Java)</p><p><a href="https://github.com/marbl/MHAP">https://github.com/marbl/MHAP</a></p><p>Miniasm</p><p>Assembler of long noisy reads (SMRT, ONT) using the Overlap-Layout Consensus (OLC) approach without the necessity of an error correction stage (uses minimap)</p><p>Software (C)</p><p><a href="https://github.com/lh3/miniasm">https://github.com/lh3/miniasm</a></p><p>LINKS</p><p>Scaffolding genome assembly with error-containing long sequence (e.g., ONT or PacBio reads, draft genomes)</p><p>Software (Perl)</p><p><a href="https://github.com/warrenlr/LINKS/">https://github.com/warrenlr/LINKS/</a></p><p>Read clustering</p><p>afcluster</p><p>Clustering of reads from different genes and different species based on&nbsp;<em>k</em>-mer counts</p><p>Software (C++)</p><p><a href="https://github.com/luscinius/afcluster">https://github.com/luscinius/afcluster</a></p><p>QCluster</p><p>Clustering of reads with alignment-free measures (<em>k</em>-mer based) and quality values</p><p>Software (C++)</p><p><a href="http://www.dei.unipd.it/~ciompin/main/qcluster.html">http://www.dei.unipd.it/~ciompin/main/qcluster.html</a></p><p>Reads error correction</p><p>Lighter</p><p>Correction of sequencing errors in raw, whole genome sequencing reads (<em>k</em>-mer based)</p><p>Software (C++)</p><p><a href="https://github.com/mourisl/Lighter">https://github.com/mourisl/Lighter</a></p><p>QuorUM</p><p>Error corrector for Illumina reads using k-mers</p><p>Software (C++)</p><p><a href="https://github.com/gmarcais/Quorum">https://github.com/gmarcais/Quorum</a></p><p>Trowel</p><p>Software (C++)</p><p><a href="https://sourceforge.net/projects/trowel-ec/">https://sourceforge.net/projects/trowel-ec/</a></p><p>Metagenomics</p><p>Assembly-free phylogenomics</p><p>AAF</p><p>Phylogeny reconstruction directly from unassembled raw sequence data from whole genome sequencing projects; provides bootstrap support to assess uncertainty in the tree topology (<em>k</em>-mer based)</p><p>Software (Python)</p><p><a href="https://github.com/fanhuan/AAF">https://github.com/fanhuan/AAF</a></p><p>kSNP v3</p><p>Reference-free SNP identification and estimation of phylogenetic trees using SNPs (based on&nbsp;<em>k</em>-mer analysis)</p><p>Software (C)</p><p><a href="https://sourceforge.net/projects/ksnp/files/">https://sourceforge.net/projects/ksnp/files/</a></p><p>NGS-MC</p><p>Phylogeny of species based on NGS reads using alignment-free sequence dissimilarity measures d2* and d2&nbsp;S&nbsp;under different Markov chain models (using&nbsp;<em>k</em>-words)</p><p>R package</p><p><a href="http://www-rcf.usc.edu/~fsun/Programs/NGS-MC/NGS-MC.html">http://www-rcf.usc.edu/~fsun/Programs/NGS-MC/NGS-MC.html</a></p><p>Species identification/taxonomic profiling</p><p>CLARK</p><p>Taxonomic classification of metagenomic reads to known bacterial genomes using&nbsp;<em>k</em>-mer search and LCA assignment</p><p>Software (C++)</p><p><a href="http://clark.cs.ucr.edu/">http://clark.cs.ucr.edu/</a></p><p>FOCUS</p><p>Reports organisms present in metagenomic samples and profiles their abundances (uses composition-based approach and non-negative least squares for prediction)</p><p>Web service Software (Python)</p><p><a href="http://edwards.sdsu.edu/FOCUS/">http://edwards.sdsu.edu/FOCUS/</a></p><p>GSM</p><p>Estimation of abundances of microbial genomes in metagenomic samples (<em>k</em>-mer based)</p><p>Software (Go)</p><p><a href="https://github.com/pdtrang/GSM">https://github.com/pdtrang/GSM</a></p><p>Mash</p><p>Species identification using assembled or unassembled Illumina, PacBio, and ONT data (based on MinHash dimensionality-reduction technique)</p><p>Software (C++)</p><p><a href="https://github.com/marbl/mash">https://github.com/marbl/mash</a></p><p>Kraken</p><p>Taxonomic assignment in metagenome analysis by exact&nbsp;<em>k</em>-mer search; LCA assignment of short reads based on a comprehensive sequence database</p><p>Software (C++)</p><p><a href="https://ccb.jhu.edu/software/kraken/">https://ccb.jhu.edu/software/kraken/</a></p><p>LMAT</p><p>Assignment of taxonomic labels to reads by&nbsp;<em>k</em>-mers searches in precomputed database</p><p>Software (C++/Python)</p><p><a href="https://sourceforge.net/projects/lmat/">https://sourceforge.net/projects/lmat/</a></p><p>stringMLST</p><p><em>k</em>-mer-based tool for MLST directly from the genome sequencing reads</p><p>Software (Python)</p><p><a href="http://jordan.biology.gatech.edu/page/software/stringMLST">http://jordan.biology.gatech.edu/page/software/stringMLST</a></p><p>Taxonomer</p><p><em>k</em>-mer-based ultrafast metagenomics tool for assigning taxonomy to sequencing reads from clinical and environmental samples</p><p>Web service</p><p><a href="http://taxonomer.iobio.io/">http://taxonomer.iobio.io/</a></p><p>Other</p><p>d2-tools</p><p>Word-based (<em>k</em>-tuple) comparison (pairwise dissimilarity matrix using d2S measure) of metatranscriptomic samples from NGS reads</p><p>Software (Python/R)</p><p><a href="https://code.google.com/p/d2-tools/">https://code.google.com/p/d2-tools/</a></p><p>VirHostMatcher</p><p>Prediction of hosts from metagenomic viral sequences based on ONF using various distance measures (e.g., d2)</p><p>Software (C++)</p><p><a href="https://github.com/jessieren/VirHostMatcher">https://github.com/jessieren/VirHostMatcher</a></p><p>MetaFast</p><p>Statistics calculation of metagenome sequences and the distances between them based on assembly using de Bruijn graphs and Bray&ndash;Curtis dissimilarity measure</p><p>Software (Java)</p><p><a href="https://github.com/ctlab/metafast">https://github.com/ctlab/metafast</a></p></div>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/42187/scientist-b-at-aiims-new-delhi-delhi</guid>
  <pubDate>Thu, 03 Sep 2020 07:04:11 -0500</pubDate>
  <link></link>
  <title><![CDATA[Scientist B at AIIMS, New Delhi, Delhi]]></title>
  <description><![CDATA[
<p>Scientist B at AIIMS, New Delhi, Delhi</p>

<p>Overview<br />Applications are invited from eligible candidates for the following position under Meity funded research project entitled: Artifical Intelligence in Oncology, Harnsessing big data and advanced computing to provide personalized diganosis and treatment for cancer patients purely on contractual basis</p>

<p>Scientist B</p>

<p>Salary: Rs.80,000/-</p>

<p>Qualification: 1st Class Masters Degree in Bioinformatics/ Computer Science/ Statistics with Ph.D in relevant subject from a recognized University with experience in Machine learning/ AI project plus two years research experience</p>

<p>Age: Upto 40 years</p>

<p>Details<br />Experience:2 Years<br />Location:New Delhi<br />Education:1st Class Masters Degree<br />SALARY: Rs.80,000/-<br />Key Skills: Research Fellowship<br />Desired Profile<br />Two years research experience</p>

<p>Company: AIIMS<br />All India Institute of Medical Sciences, New Delhi is a medical school, hospital and public medical research university</p>

<p>More at https://www.aiims.edu/en/notices/recruitment/aiims-recruitment.html?id=10844<br />PDF https://www.aiims.edu/images/pdf/recruitment/advertisement/Post_BioChem_22_08_20.PDF</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34488/scripts-for-the-analysis-of-hgt-in-genome-sequence-data</guid>
	<pubDate>Wed, 29 Nov 2017 16:44:10 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34488/scripts-for-the-analysis-of-hgt-in-genome-sequence-data</link>
	<title><![CDATA[Scripts for the analysis of HGT in genome sequence data.]]></title>
	<description><![CDATA[<p><span>Scripts for the analysis of HGT in genome sequence data</span></p><p>Address of the bookmark: <a href="https://github.com/reubwn/hgt" rel="nofollow">https://github.com/reubwn/hgt</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/42265/doctoral-researcher-phd-in-computational-biology-biostatistics-at-luxembourg-centre-for-systems-biomedicine-lcsb</guid>
  <pubDate>Sun, 25 Oct 2020 22:59:54 -0500</pubDate>
  <link></link>
  <title><![CDATA[Doctoral researcher (PhD) in Computational Biology / Biostatistics at Luxembourg Centre for Systems Biomedicine (LCSB)]]></title>
  <description><![CDATA[
<p>Contract Type: Fixed Term Contract<br />Work Hours: Full Time 40.0 Hours per Week<br />Location: Belval<br />Student and employee status (36 months studies programme, as per university standards) with project funding available for up to 48 months<br />36 months fixed-term contract (renewable depending on thesis progress evaluation)<br />Job Reference: UOL03604<br />Further Information<br />Applications should be submitted online and include:</p>

<p>A detailed Curriculum vitae<br />A motivation letter, including a brief description of past research experience and future interests, as well as the earliest possible starting date<br />Copies of degree certificates and transcripts<br />Name and contact details of at least two referees<br />Early application is highly encouraged, as the applications will be processed upon reception. Please apply ONLINE formally through the HR system. Applications by email will not be considered.</p>

<p>*gn=gender neutral.</p>

<p>More at https://recruitment.uni.lu/en/details.html?id=QMUFK026203F3VBQB7V7VV4S8&amp;nPostingID=54876&amp;nPostingTargetID=74639&amp;mask=karriereseiten&amp;lg=UK</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/35131/giggle-a-search-engine-for-large-scale-integrated-genome-analysis</guid>
	<pubDate>Wed, 10 Jan 2018 03:10:45 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/35131/giggle-a-search-engine-for-large-scale-integrated-genome-analysis</link>
	<title><![CDATA[GIGGLE: a search engine for large-scale integrated genome analysis]]></title>
	<description><![CDATA[<p><span>GIGGLE is a genomics search engine that identifies and ranks the significance of genomic loci shared between query features and thousands of genome interval files. GIGGLE (</span><a href="https://github.com/ryanlayer/giggle">https://github.com/ryanlayer/giggle</a><span>) scales to billions of intervals and is over three orders of magnitude faster than existing methods. Its speed extends the accessibility and utility of resources such as ENCODE, Roadmap Epigenomics, and GTEx by facilitating data integration and hypothesis generation.</span></p>
<p>https://www.nature.com/articles/nmeth.4556</p><p>Address of the bookmark: <a href="https://github.com/ryanlayer/giggle" rel="nofollow">https://github.com/ryanlayer/giggle</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/42402/two-postdoc-positions-to-study-multiscale-genome-evolution-and-cephalopod-gene-regulation-university-of-vienna-austria</guid>
  <pubDate>Thu, 17 Dec 2020 11:45:16 -0600</pubDate>
  <link></link>
  <title><![CDATA[Two postdoc positions to study multiscale genome evolution and cephalopod gene regulation (University of Vienna, Austria)]]></title>
  <description><![CDATA[
<p>Vienna Biocenter are seeking two postdoctoral researchers to join our team and work on the ERC funded project "METASCALE: Modes of genome evolution during major metazoan transitions". The task of both positions will be to study co-evolutionary trends within animal genomes and their association with the emergence of new gene regulation. Our group employs methods of comparative and regulatory genomics to study the regulatory impact of transitions in animal genome architecture. More recently, we have identified a major genome reorganization in the "smart" coleoid cephalopod molluscs (squid, octopus, cuttlefish) that, together with other genomic changes, potentially comprises a unique path or mode of genome evolution among animals. We are thus interested in quantifying these modes of genome evolution across all available animal genomes and to test whether their shifts are associated with the emergence of novel regulation (e.g., in cephalopods). One of our main model species is the Hawaiian bobtail squid species Euprymna scolopes.  The tasks of the two candidates will be complimentary and highly collaborative with one position focusing on comparative genomics analyses across all metazoans and the other position on regulatory genomics in the squid. A solid background in in bioinformatics and comparative genomics is highly desired for the first position, whereas the second position will benefit from experience in molecular and regulatory genomics methods such as HiC, ATAC-seq, RNA-seq or single cell transcriptomics.</p>

<p>The postdocs will join an international group and network of researchers at the University of Vienna studying a diverse range of species and questions in molecular evolution, development, morphology and genomics. Our group is also part of the large evolVienna network of more than 50 evolutionary biology labs in Vienna, across several universities and research institutes. Our Faculty will be relocating to a new campus at the Vienna Biocenter in summer 2021 (https://biologiezentrum.univie.ac.at/en/). Vienna is a vibrant historic European capital with a high QOL. Information about postdoctoral salaries in Austria can be found on this webpage: https://www.fwf.ac.at/en/research-funding/personnel-costs/</p>

<p>Earliest start date will be after July 2021. Initial term of employment is for two years with the possibility of extension. Remote working, at least initially, is a possibility.</p>

<p>Requirements:<br />- PhD degree or equivalent by the start date <br />- Publishing record in peer-reviewed journals or evidence thereof <br />- At least 2 letters of support</p>

<p>Applications including a letter of motivation should be submitted via the Job Center to the University of Vienna (https://personalwesen.univie.ac.at/en/jobs-recruiting/job-center/,<br />job reference number 11615).</p>

<p>Application deadline: January 15th 2021.<br />Application link: https://univis.univie.ac.at/ebewerbung</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/35920/mesquite-a-modular-system-for-evolutionary-analysis</guid>
	<pubDate>Tue, 13 Mar 2018 06:54:32 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/35920/mesquite-a-modular-system-for-evolutionary-analysis</link>
	<title><![CDATA[Mesquite: A modular system for evolutionary analysis]]></title>
	<description><![CDATA[<p><span>Mesquite is modular, extendible software for evolutionary biology, designed to help biologists organize and analyze comparative data about organisms. Its emphasis is on phylogenetic analysis, but some of its modules concern population genetics, while others do non-phylogenetic multivariate analysis. Because it is modular, the analyses available depend on the modules installed.</span></p>
<p><span>https://github.com/MesquiteProject/MesquiteCore</span></p><p>Address of the bookmark: <a href="http://mesquiteproject.org/" rel="nofollow">http://mesquiteproject.org/</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/42707/bioinformatics-in-africa-part-1</guid>
	<pubDate>Sun, 31 Jan 2021 09:04:01 -0600</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/42707/bioinformatics-in-africa-part-1</link>
	<title><![CDATA[Bioinformatics in Africa:- Part 1]]></title>
	<description><![CDATA[<p>The Institut Pasteur de C&ocirc;te d&rsquo;Ivoire was created by the N&deg;72&shy;511 law of July 27th, 1972 under the Presidency of his Excellency Felix Houphou&euml;t Boigny and Professor Jacques Monod, then Leading of&nbsp;the&nbsp;Pasteur&nbsp;institute&nbsp;of&nbsp;Paris.</p><p>The&nbsp;objectives&nbsp;of&nbsp;the&nbsp;Bioinformatics&nbsp;pole&nbsp;are:</p><p>&bull; Encourage the access to innovations in research and the best exploitation of research data management.</p><p>&bull; Develop&nbsp;the&nbsp;critical&nbsp;spirit&nbsp;of&nbsp;the&nbsp;researchers&nbsp;around&nbsp;their&nbsp;axis&nbsp;of&nbsp;research.</p><p>&bull; Bring an active help to the improvement of the public health while having for constant worries&nbsp;to&nbsp;feed&nbsp;it&nbsp;by&nbsp;research&nbsp;and&nbsp;the&nbsp;innovation.&nbsp;</p><p>&bull; Start&nbsp;training&nbsp;researchers&nbsp;to&nbsp;use&nbsp;bioinformatics&nbsp;as&nbsp;an&nbsp;indispensable&nbsp;tool&nbsp;to&nbsp;research.</p><p>&bull; Encourage interdisciplinary creating a network of scientific information available to the researchers&nbsp;of&nbsp;the&nbsp;institute&nbsp;and&nbsp;partners</p><p>Long&shy;term&nbsp;training&nbsp;activities:</p><p>&bull; To&nbsp;integrate&nbsp;the&nbsp;bioinformatics&nbsp;in&nbsp;the&nbsp;training&nbsp;programs&nbsp;of&nbsp;academic&nbsp;scientists.</p><p>&bull; Development&nbsp;of&nbsp;West&nbsp;Africa&nbsp;Centre&nbsp;training&nbsp;in&nbsp;bioinformatics&nbsp;and&nbsp;genome&nbsp;data&nbsp;analysis.</p><p>Short&shy;term&nbsp;training&nbsp;activities:</p><p>The IPCI will organize in the month of May 2007 a yearly regional course of initiation and using genome data analysis with the participation of the Centre Biotechnologique de Sfax, Tunisia (Pr Ahmed&nbsp;Reba&iuml;,&nbsp;Department&nbsp;of&nbsp;bioinformatics).</p><p>More at&nbsp;https://www.pasteur.ci/</p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>

</channel>
</rss>