<?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=1190</link>
	<atom:link href="https://bioinformaticsonline.com/related/31087?offset=1190" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41843/stringtie-transcript-assembly-and-quantification-for-rna-seq</guid>
	<pubDate>Tue, 09 Jun 2020 05:21:11 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41843/stringtie-transcript-assembly-and-quantification-for-rna-seq</link>
	<title><![CDATA[StringTie Transcript assembly and quantification for RNA-Seq]]></title>
	<description><![CDATA[<p><strong>StringTie</strong><span>&nbsp;is a fast and highly efficient assembler of RNA-Seq alignments into potential transcripts. It uses a novel network flow algorithm as well as an optional&nbsp;</span><em>de novo</em><span>&nbsp;assembly step to assemble and quantitate full-length transcripts representing multiple splice variants for each gene locus. Its input can include not only alignments of short reads that can also be used by other transcript assemblers, but also alignments of longer sequences that have been assembled from those reads. In order to identify differentially expressed genes between experiments, StringTie's output can be processed by specialized software like&nbsp;</span><a href="https://github.com/alyssafrazee/ballgown">Ballgown</a><span>,&nbsp;</span><a href="http://cole-trapnell-lab.github.io/cufflinks/cuffdiff/index.html">Cuffdiff</a><span>&nbsp;or other programs (DESeq2, edgeR, etc.).</span></p><p>Address of the bookmark: <a href="https://ccb.jhu.edu/software/stringtie/" rel="nofollow">https://ccb.jhu.edu/software/stringtie/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/33966/ra-bioinformatics-at-national-institute-of-biomedical-genomics-india</guid>
  <pubDate>Wed, 26 Jul 2017 03:49:52 -0500</pubDate>
  <link></link>
  <title><![CDATA[RA Bioinformatics at NATIONAL INSTITUTE OF BIOMEDICAL GENOMICS,  INDIA]]></title>
  <description><![CDATA[
<p>NATIONAL INSTITUTE OF BIOMEDICAL GENOMICS<br />(An Autonomous Institution of the Government of India) <br />P.O.: N.S.S., Kalyani 741251, West Bengal</p>

<p>Advertisement No. 137/ESTB/NIBMG/17-18 </p>

<p>Position available Project Description: Several positions are available for the project titled: “A unified web-portal for analysis, integration and visualization of multi-omics data”. The goal of this project is to develop a user-accessible resource for integrated analysis and visualization of multi-OMICs data sets (including gene expression, genotype, methylation, microRNA, etc.). Data sets generated on various platforms shall be maintained in a stable database, accessed through standard querying mechanisms, and the results shall be displayed via user-friendly interface. The analysis engine shall run on open-source software (such as R/Bioconductor) developed in-house. All positions are contractual. </p>

<p>Appointment will be initially given for a period of one year which is extendable depending upon performance, availability of funds and requirements of the institute. </p>

<p>Project Code: 20275 Position: (No. of positions available) </p>

<p>Research Associate (3)</p>

<p>Position 1: Ph.D. or equivalent in statistics, computer science, mathematics, bioinformatics, or related subject. <br />Position 1: Those with experience in database management shall be preferred. Experience with UNIX or GNU/Linux operating system. <br />Position 1: Creation and maintenance of a database for population- and diseaseassociated variation resource. Development of programmatic interface for querying the database, filtering of the results and identification of genes of interest. </p>

<p>Rs. 36000/- + 10% HRA </p>

<p>Please apply online via web link http://apply.nibmg.ac.in/ (no other form of application will be accepted). The last date of application is 14-08-2017. All letters to attend screening test and /or interview will be sent only to the short-listed candidates by Email only. No correspondence will be made with applicants who are not shortlisted /not called for screening test and /or interview. No TA/DA will be paid for attending the screening test and /or interview.<br />Detail information at http://www.nibmg.ac.in/academic/Advt_20275.pdf</p>

<p>More Info: http://www.nibmg.ac.in/?q=Project%20Linked%20Personnel</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40856/3d-de-novo-assembly-3d-dna-pipeline</guid>
	<pubDate>Sun, 02 Feb 2020 13:41:55 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40856/3d-de-novo-assembly-3d-dna-pipeline</link>
	<title><![CDATA[3D de novo assembly (3D DNA) pipeline]]></title>
	<description><![CDATA[<p>For a detailed description of the pipeline and how it integrates with other tools designed by the Aiden Lab see&nbsp;<a href="http://aidenlab.org/assembly/manual_180322.pdf">Genome Assembly Cookbook</a>&nbsp;on&nbsp;<a href="http://aidenlab.org/assembly">http://aidenlab.org/assembly</a>.</p>
<p>For the original version of the pipeline and to reproduce the Hs2-HiC and the AaegL4 genomes reported in&nbsp;<a href="http://science.sciencemag.org/content/356/6333/92">(Dudchenko et al.,&nbsp;<em>Science</em>, 2017)</a>&nbsp;see the&nbsp;<a href="https://github.com/theaidenlab/3d-dna/tree/745779bdf64db6e55bddb70c24e9b58825938c33">original commit</a>.</p>
<p>For the detailed description of the merge section see&nbsp;<a href="https://github.com/theaidenlab/AGWG-merge">https://github.com/theaidenlab/AGWG-merge</a>.</p><p>Address of the bookmark: <a href="https://github.com/theaidenlab/3d-dna" rel="nofollow">https://github.com/theaidenlab/3d-dna</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34479/bioinformatics-lectures</guid>
	<pubDate>Wed, 29 Nov 2017 05:39:54 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34479/bioinformatics-lectures</link>
	<title><![CDATA[Bioinformatics lectures !]]></title>
	<description><![CDATA[<div>
<div>
<div>Computational Biology is a&nbsp;<em style="font-size: 12.8px; font-weight: normal;">huge</em>&nbsp;field of study, that touches upon many distinct algorithmic and biological areas of study. What we are able to cover in this course will depend, in part, on the pace at which we move, which I will attempt to adjust as appropriate. However, here is a tentative list of topics I hope to cover this semester (not necessarily in order).
<ul>
<li>Optimal sequence alignment (global, local, and glocal alignment &amp;mdash with constant &amp; affine gap penalties</li>
<li>Algorithms and data structures for efficient text indexing and&nbsp;<em>exact</em>&nbsp;search</li>
<li>Heuristics for read&nbsp;<em>alignment</em>&nbsp;and&nbsp;<em>mapping</em>&nbsp;&amp;mdash mapping DNA-seq and RNA-seq reads</li>
<li>Genome assembly &amp;mdash k-mers, De Brujin graph construction and representation, long-read technology and read-overlap graph assembly</li>
<li>Motif finding via Gibbs sampling</li>
<li>Gene finding &amp;mdash statistical models for&nbsp;<em>ab initio</em>&nbsp;and evidence-guided prediction of genes</li>
<li>RNA-seq and transcriptomics &amp;mdash transcript assembly, abundance estimation and differential expression testing</li>
<li>Phylogenetics &amp;mdash The small and large phylogeny problem; parsimony, maximum likelihood and Bayesian methods</li>
</ul>
</div>
</div>
</div><p>Address of the bookmark: <a href="https://rob-p.github.io/CSE549F16/lectures/" rel="nofollow">https://rob-p.github.io/CSE549F16/lectures/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/35257/india-and-germany-to-begin-joint-research-in-the-area-of-bioinformatics-in-health-research</guid>
	<pubDate>Wed, 17 Jan 2018 14:10:36 -0600</pubDate>
	<link>https://bioinformaticsonline.com/news/view/35257/india-and-germany-to-begin-joint-research-in-the-area-of-bioinformatics-in-health-research</link>
	<title><![CDATA[India and Germany to begin joint research in the area of 'Bioinformatics in Health Research']]></title>
	<description><![CDATA[<p><span>To facilitate bilateral cooperation in biotechnology between the scientific communities of India and Germany, the Department of Biotechnology (DBT) will soon begin collaborative research in the identified priority area of 'Bioinformatics in Health Research' under the programme of Indo-German Cooperation in Health Research.&nbsp;</span><br /><br /><span>The purpose of the programme is to stimulate new collaborations, e.g. the preparation of joint projects under national funding programmes. The programme facilitates bilateral cooperation in biotechnology between the scientific communities of India and Germany by way of joint research projects which will encompass bilateral workshops/seminar and exchange visits of scientists.&nbsp;</span><br /><br /><span>The programme is being implemented within the agreement of Indo-German cooperation in S&amp;T of 1974, under which the Department of Biotechnology, Government of India and Forschungszentrum Julich BMBH (FZJ), Federal Republic of Germany, have agreed for cooperative programme in biotechnology.</span><br /><br /><span>DBT of the Ministry of Science &amp; Technology, Government of India and the Project Management Agency at the German Aerospace Center (DLR-PT, European and International Cooperation), Bonn are the nodal implementing agencies from the Indian and German side respectively.</span><br /><br /><span>Through this programme, it is expected that the funded cooperation enables the partners to develop applicable scientific results which can be published and/ or could be commercialised and may lead to formation of joint ventures. All publications, patents coming out of these projects, need to be jointly authored by both Indian and German scientists. All necessary approvals like ethical clearance, HMSC approval from Indian point of view as well as EU, if applicable, from German point of view, e.g. before conducting animal experimentation if any needs to be obtained by PIs before undertaking the project.&nbsp;</span><br /><br /><span>Now, both the nodal agencies have invited research proposals in identified priority area of 'Bioinformatics in Health Research' from eligible scientists.&nbsp; Joint research projects are required to be submitted to both the nodal agencies by 15 January 2018. Scientists/faculty members working in regular capacity in universities, national R&amp;D laboratories/institutes and private R&amp;D institutes can be part of this joint research programme.&nbsp;&nbsp; For the private sector, partners from all kind of private sectors are eligible, but financing is limited. For Indian scientists from the private sector, only local hospitality in Germany as part of the exchange visit is available from the German side.&nbsp; For German scientists from the private sector, only travel costs are available for small and medium size enterprises (for definition of SME ref. to 2003/361/EC) as well as local hospitality in India will be borne by themselves.</span></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41501/hicanu-accurate-assembly-of-segmental-duplications-satellites-and-allelic-variants-from-high-fidelity-long-reads</guid>
	<pubDate>Fri, 27 Mar 2020 22:49:31 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41501/hicanu-accurate-assembly-of-segmental-duplications-satellites-and-allelic-variants-from-high-fidelity-long-reads</link>
	<title><![CDATA[HiCanu: accurate assembly of segmental duplications, satellites, and allelic variants from high-fidelity long reads]]></title>
	<description><![CDATA[<p><span>HiCanu, a significant modification of the Canu assembler designed to leverage the full potential of HiFi reads via homopolymer compression, overlap-based error correction, and aggressive false overlap filtering.&nbsp;</span></p>
<p>More at&nbsp;<a href="https://www.biorxiv.org/content/10.1101/2020.03.14.992248v3?fbclid=IwAR2PaN4GLjvAZpWmCE2q0EWk2dtwY7wiKxVlXn9PPG7OBSP06PP2gcCrv3A">https://www.biorxiv.org/content/10.1101/2020.03.14.992248v3</a></p><p>Address of the bookmark: <a href="https://github.com/marbl/canu" rel="nofollow">https://github.com/marbl/canu</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/35798/an-introduction-to-applied-bioinformatics</guid>
	<pubDate>Fri, 02 Mar 2018 04:26:38 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/35798/an-introduction-to-applied-bioinformatics</link>
	<title><![CDATA[An Introduction to Applied Bioinformatics]]></title>
	<description><![CDATA[<p>IAB is primarily being developed by&nbsp;<a href="http://caporasolab.us/people/greg-caporaso/">Greg Caporaso</a>(GitHub/Twitter:&nbsp;<a href="https://github.com/gregcaporaso">@gregcaporaso</a>) in the&nbsp;<a href="http://www.caporasolab.us/">Caporaso Lab</a>&nbsp;at&nbsp;<a href="http://www.nau.edu/">Northern Arizona University</a>. You can find information on the courses I teach on&nbsp;<a href="http://www.caporasolab.us/teaching">my teaching website</a>&nbsp;and information on my research and lab on&nbsp;<a href="http://www.caporasolab.us/">my lab website</a>.</p>
<p>&nbsp;</p><p>Address of the bookmark: <a href="http://readiab.org/" rel="nofollow">http://readiab.org/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42160/vicuna-a-software-tool-that-enables-consensus-assembly-of-ultra-deep-sequence-derived-from-diverse-viral-or-other-heterogeneous-populations</guid>
	<pubDate>Tue, 25 Aug 2020 03:40:17 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42160/vicuna-a-software-tool-that-enables-consensus-assembly-of-ultra-deep-sequence-derived-from-diverse-viral-or-other-heterogeneous-populations</link>
	<title><![CDATA[VICUNA: a software tool that enables consensus assembly of ultra-deep sequence derived from diverse viral or other heterogeneous populations.]]></title>
	<description><![CDATA[<p><span>VICUNA</span><span>&nbsp;is a&nbsp;</span><em>de novo</em><span>&nbsp;assembly program targeting populations with high mutation rates. It creates a single linear representation of the mixed population on which intra-host variants can be mapped. For clinical samples rich in contamination (e.g., &gt;95%), VICUNA can leverage existing genomes, if available, to assemble only target-alike reads. After initial assembly, it can also use existing genomes to perform guided merging of contigs. For each data set (e.g., Illumina paired read, 454), VICUNA outputs consensus sequence(s) and the corresponding multiple sequence alignment of constituent reads. VICUNA efficiently handles ultra-deep sequence data with tens of thousands fold coverage.</span></p>
<p><a href="http://software.broadinstitute.org/viral/docs/vicuna_v1.0.pdf">http://software.broadinstitute.org/viral/docs/vicuna_v1.0.pdf</a></p><p>Address of the bookmark: <a href="https://www.broadinstitute.org/viral-genomics/vicuna" rel="nofollow">https://www.broadinstitute.org/viral-genomics/vicuna</a></p>]]></description>
	<dc:creator>biogeek</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42806/graphunzip-phases-an-assembly-graph-using-hi-c-data-andor-long-reads</guid>
	<pubDate>Fri, 05 Feb 2021 21:22:24 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42806/graphunzip-phases-an-assembly-graph-using-hi-c-data-andor-long-reads</link>
	<title><![CDATA[GraphUnzip: Phases an assembly graph using Hi-C data and/or long reads.]]></title>
	<description><![CDATA[<p>GraphUnzip, a fast, memory-efficient and accurate tool to unzip assembly graphs into their constituent haplotypes using long reads and/or Hi-C data. As GraphUnzip only connects sequences in the assembly graph that already had a potential link based on overlaps, it yields high-quality gap-less supercontigs. To demonstrate the efficiency of GraphUnzip, we tested it on a simulated diploid Escherichia coli genome, and on two real datasets for the genomes of the rotifer Adineta vaga and the potato Solanum tuberosum. In all cases, GraphUnzip yielded highly continuous phased assemblies.</p>
<p>https://www.biorxiv.org/content/biorxiv/early/2021/02/01/2021.01.29.428779.full.pdf</p><p>Address of the bookmark: <a href="https://github.com/nadegeguiglielmoni/GraphUnzip" rel="nofollow">https://github.com/nadegeguiglielmoni/GraphUnzip</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43090/loretta-a-user-friendly-tool-for-assembling-viral-genomes-from-pacbio-sequence-data</guid>
	<pubDate>Wed, 23 Jun 2021 07:54:53 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43090/loretta-a-user-friendly-tool-for-assembling-viral-genomes-from-pacbio-sequence-data</link>
	<title><![CDATA[LoReTTA, a user-friendly tool for assembling viral genomes from PacBio sequence data]]></title>
	<description><![CDATA[<p>LoReTTA (Long Read Template-Targeted Assembler), a tool designed for performing <em>de novo</em> assembly of long reads generated from viral genomes on the PacBio platform. LoReTTA exploits a reference genome to guide the assembly process, an approach that has been successful with short reads.</p>
<p>https://academic.oup.com/ve/article/7/1/veab042/6248116</p><p>Address of the bookmark: <a href="https://academic.oup.com/ve/article/7/1/veab042/6248116" rel="nofollow">https://academic.oup.com/ve/article/7/1/veab042/6248116</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>

</channel>
</rss>