<?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/26975?offset=900</link>
	<atom:link href="https://bioinformaticsonline.com/related/26975?offset=900" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/19556/genome-origami</guid>
	<pubDate>Fri, 12 Dec 2014 22:48:17 -0600</pubDate>
	<link>https://bioinformaticsonline.com/news/view/19556/genome-origami</link>
	<title><![CDATA[Genome Origami]]></title>
	<description><![CDATA[<p>There are several interesting factoid about our genomes, one of them is their folding. If we stretched out the DNA in a single cell, which is only a few millionths of an inch wide, it would span more than six feet. In other word, the size of six feet DNA fold themself to fit in a few millionths of an inch wide space. These DNA folding is a dynamic process that changes over time (!!). Researchers around the world have been trying to understand how DNA folds itself up so efficiently, and a recent post on the NIH Director&rsquo;s Blog highlights new research illustrating how the human genome folds inside the cell&rsquo;s nucleus, as well as how DNA folding affects gene regulation. The research team created this delightful video that demonstrates the principles involved using origami art.</p><p>http://bioinformaticsonline.com/videolist/watch/19555/a-3d-map-of-the-human-genome<br /><br />Researchers have been working to determine how cells regulate gene expression for nearly as long as we&rsquo;ve known about DNA. How, for example, do nerve cells know to turn off only nerve cell genes and turn off bone cell genes? DNA folding loops are part of the answer. This research team, which published their findings in a paper in Cell http://www.cell.com/cell/abstract/S0092-8674%2814%2901497-4 , found that the number of loops is much lower than expected. There are only 10,000 loops instead of the predicted millions, and they form on/off switches in DNA.<br /><br /></p><p>More at http://www.eurekalert.org/pub_releases/2014-12/ru-3mr121114.php</p><p>Reference http://www.cell.com/cell/abstract/S0092-8674%2814%2901497-4</p>]]></description>
	<dc:creator>Jitendra Narayan</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40516/nextdenovo-string-graph-based-de-novo-assembler-for-tgs-long-reads</guid>
	<pubDate>Sun, 05 Jan 2020 04:08:29 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40516/nextdenovo-string-graph-based-de-novo-assembler-for-tgs-long-reads</link>
	<title><![CDATA[NextDenovo: string graph-based de novo assembler for TGS long reads]]></title>
	<description><![CDATA[<p>NextDenovo is a string graph-based<span>&nbsp;</span><em>de novo</em><span>&nbsp;</span>assembler for TGS long reads. It uses a "correct-then-assemble" strategy similar to canu, but requires significantly less computing resources and storages. After assembly, the per-base error rate is about 97-98%, to further improve single base accuracy, please use<span>&nbsp;</span><a href="https://github.com/Nextomics/NextPolish">NextPolish</a>.</p>
<p>NextDenovo contains two core modules: NextCorrect and NextGraph. NextCorrect can be used to correct TGS long reads with approximately 15% sequencing errors, and NextGraph can be used to construct a string graph with corrected reads. It also contains a modified version of<span>&nbsp;</span><a href="https://github.com/lh3/minimap2">minimap2</a><span>&nbsp;</span>for adapting input and output and producing more sensitive and accurate dovetail overlaps, and some useful utilities (see<span>&nbsp;</span><a href="https://github.com/Nextomics/NextDenovo/blob/master/doc/UTILITY.md">here</a><span>&nbsp;</span>for more details).</p><p>Address of the bookmark: <a href="https://github.com/Nextomics/NextDenovo" rel="nofollow">https://github.com/Nextomics/NextDenovo</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/19545/walk-%E2%80%93-in-%E2%80%93-interview-agricultural-knowledge-management-unit-indian-agricultural-research-institute-new-delhi-110012</guid>
  <pubDate>Fri, 12 Dec 2014 21:33:02 -0600</pubDate>
  <link></link>
  <title><![CDATA[WALK – IN – INTERVIEW @ Agricultural Knowledge Management Unit Indian Agricultural Research Institute, New Delhi-110012]]></title>
  <description><![CDATA[
<p>Walk-in-interview for the following temporary positions will be conducted on 20th December 2014 (between 10:00 AM to 01:00 PM) at Agricultural Knowledge Management Unit, A0 block (Ground Floor), LBS Building, Indian Agricultural Research Institute, New Delhi-110012:</p>

<p>1 Dr. A.K.Mishra Coordinator &amp; PI (BTISnet)</p>

<p>Traineeship (two) for one year</p>

<p>Rs. 5000/- (consolidated)</p>

<p>M.Sc. (Bioinformatics) with 60 % marks from a recognized University</p>

<p>20-12-2014 (10:00 AM -11:00 AM)</p>

<p>Studentship (four) for one year</p>

<p>Rs. 2500/- (consolidated)</p>

<p>Final year M.Sc./ M.Tech (Bioinformatics) Students from a recognized University</p>

<p>20-12-2014 (11:00 AM- 1:00 PM)</p>

<p>The positions are purely temporary and co-terminus with the DBT Programme. Eligible candidates are requested to submit the application form in the prescribed format along with original certificates/ documents (Degree, Marks sheets, Work experience, if any) at the time of interview. No TA/DA will be paid. Maximum age limit is 28 years for all positions. Age relaxation of 5 yrs for SC/ST and woman candidates and 3 years for OBC candidates will be given. Canvassing in any form invites disqualification.</p>

<p>Advertisement: http://www.iari.res.in/files/BIC-08122014-20141208-172344.pdf</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40972/deepbinner-a-signal-level-demultiplexer-for-oxford-nanopore-reads</guid>
	<pubDate>Mon, 10 Feb 2020 02:45:53 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40972/deepbinner-a-signal-level-demultiplexer-for-oxford-nanopore-reads</link>
	<title><![CDATA[Deepbinner: a signal-level demultiplexer for Oxford Nanopore reads]]></title>
	<description><![CDATA[<p>Deepbinner is a tool for demultiplexing barcoded <a href="https://nanoporetech.com/">Oxford Nanopore</a> sequencing reads. It does this with a deep <a href="https://adeshpande3.github.io/adeshpande3.github.io/A-Beginner's-Guide-To-Understanding-Convolutional-Neural-Networks/">convolutional neural network</a> classifier, using many of the <a href="https://towardsdatascience.com/neural-network-architectures-156e5bad51ba">architectural advances</a> that have proven successful in image classification. Unlike other demultiplexers (e.g. Albacore and <a href="https://github.com/rrwick/Porechop">Porechop</a>), Deepbinner identifies barcodes from the raw signal (a.k.a. squiggle) which gives it greater sensitivity and fewer unclassified reads.</p><p>Address of the bookmark: <a href="https://github.com/rrwick/Deepbinner" rel="nofollow">https://github.com/rrwick/Deepbinner</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/19636/google-genomics</guid>
	<pubDate>Thu, 18 Dec 2014 11:05:42 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/19636/google-genomics</link>
	<title><![CDATA[Google Genomics]]></title>
	<description><![CDATA[<ul>
<li>
<p><strong>Explore genetic variation interactively.</strong> Compare entire cohorts in seconds with SQL-like queries. Compute transition/transversion ratios, genome-wide association, allelic frequency and more.</p>
</li>
<li>
<p><strong>Process big genomic data easily.</strong> Run batch analyses like principal component analysis and Hardy-Weinberg equilibrium on as many samples as you like, in minutes or hours, with just a little code.</p>
</li>
<li>
<p><strong>Use Google's infrastructure and big data expertise.</strong> Store one genome or a million using Google Genomics and take advantage of the same infrastructure that powers Search, Maps, YouTube, Gmail and Drive.</p>
</li>
<li>
<p><strong>Support emerging global standards.</strong> Google Genomics is implementing the API defined by the Global Alliance for Genomics and Health for visualization, analysis and more. Compliant software can access Google Genomics, local servers, or any other implementation.</p>
</li>
</ul><p>Address of the bookmark: <a href="https://cloud.google.com/genomics/" rel="nofollow">https://cloud.google.com/genomics/</a></p>]]></description>
	<dc:creator>Tenzin Paul</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41669/filtlong-quality-filtering-tool-for-long-reads</guid>
	<pubDate>Wed, 13 May 2020 10:23:55 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41669/filtlong-quality-filtering-tool-for-long-reads</link>
	<title><![CDATA[Filtlong: quality filtering tool for long reads]]></title>
	<description><![CDATA[<p>Filtlong is a tool for filtering long reads by quality. It can take a set of long reads and produce a smaller, better subset. It uses both read length (longer is better) and read identity (higher is better) when choosing which reads pass the filter.</p>
<p>Filtlong builds into a stand-alone executable:</p>
<pre><code>git clone https://github.com/rrwick/Filtlong.git
cd Filtlong
make -j
bin/filtlong -h
</code></pre><p>Address of the bookmark: <a href="https://github.com/rrwick/Filtlong" rel="nofollow">https://github.com/rrwick/Filtlong</a></p>]]></description>
	<dc:creator>Radha Agarkar</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/19600/studentship-at-nagaland-university</guid>
  <pubDate>Tue, 16 Dec 2014 01:35:00 -0600</pubDate>
  <link></link>
  <title><![CDATA[Studentship at Nagaland University]]></title>
  <description><![CDATA[
<p>Nagaland University<br />(A Central University Estd. By the Act of Parliament No. 35 of 1989)<br />Lumami 798 627, Nagaland<br />DBT Sponsored ‘Bioinformatics Infrastructure Facility’ Centre</p>

<p>Applications in plain paper are invited for the posts of (1) Traineeship (2 Nos.) and (2) Studentship – (2 Nos.) in the DBT funded-Bioinformatics Infrastructure Facility (BIF), Nagaland University, Lumami-798627, Nagaland. Details are given below. Interested candidates may submit the application along with self attested copies of certificates in support of the candidature to Prof. Chitta Ranjan Deb, Coordinator or Dr. L. N. Kakati, Deputy Coordinator, BIF Centre, Nagaland University, Lumami-798627, Nagaland on or before 15th January 2015.</p>

<p>The scanned application with relevant documents may be sent by email attachment to bifnulumami@gmail.com. Shortlisted candidates will be informed by email if called for interview. No TA/DA is admissible for attending the interview.</p>

<p>Traineeship (Two nos.)</p>

<p>    Post Graduate degree in any branch of Life Sciences from UGC recognized Universities</p>

<p>    Knowledge of computers and bioinformatics</p>

<p>    Rs.8000/- p.m. fixed.</p>

<p>    6 months</p>

<p>Studentship (Two nos.)</p>

<p>    Pursuing Post Graduate degree in any branch of Life Sciences from UGC recognized Universities</p>

<p>    Knowledge of computers and bioinformatics</p>

<p>    Rs.8000/- p.m. fixed.</p>

<p>    6 months</p>

<p>Terms and Conditions:</p>

<p>i) Applicants need to produce all original documents if call for interview.<br />ii) The posts are purely temporary and the appointment does not confer any entitlement or right over the job and will not be considered as formal service.<br />iii) No TA &amp; DA will be paid for appearing in the walk-in-interview.<br />iv) The stipend/salary amount is subject to the sanction of DBT, New Delhi.</p>

<p>Advertisement: http://www.nagauniv.org.in/files/BIF%20Advt.pdf</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42477/hifiasm-a-haplotype-resolved-assembler-for-accurate-hifi-reads</guid>
	<pubDate>Thu, 24 Dec 2020 10:03:36 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42477/hifiasm-a-haplotype-resolved-assembler-for-accurate-hifi-reads</link>
	<title><![CDATA[Hifiasm: a haplotype-resolved assembler for accurate Hifi reads]]></title>
	<description><![CDATA[<p><span>Hifiasm is a fast haplotype-resolved de novo assembler for PacBio Hifi reads. It can assemble a human genome in several hours and works with the California redwood genome, one of the most complex genomes sequenced so far. Hifiasm can produce primary/alternate assemblies of quality competitive with the best assemblers. It also introduces a new graph binning algorithm and achieves the best haplotype-resolved assembly given trio data.</span></p><p>Address of the bookmark: <a href="https://github.com/chhylp123/hifiasm" rel="nofollow">https://github.com/chhylp123/hifiasm</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/19729/senior-scientist-agricultural-bio-informatics-one-post</guid>
  <pubDate>Wed, 24 Dec 2014 05:01:02 -0600</pubDate>
  <link></link>
  <title><![CDATA[Senior Scientist (Agricultural Bio-informatics) (One post)]]></title>
  <description><![CDATA[
<p>Agricultural Scientists Recruitment Board</p>

<p>Qualifications Essential:<br />Doctoral degree in Bio-informatics/ Biotechnology/Molecular Biology and Biotechnology/Life Sciences/ Computer Sciences with specialization in Bio-informatics including relevant basic sciences with 8 years’ experience in the relevant subject as Scientist/Lecturer or in an equivalent position in the Pay Band- 3 of 15600-39100 with Grade Pay of 5400/6000/7000/8000 having made contribution to research/teachin/extension education as evidenced by published work/innovations and impact. </p>

<p>OR </p>

<p>Doctoral degree in the above subject(s) including relevant basic sciences with minimum 8 years’ experience of high quality post-doctoral research in an institution/organization as evidenced by at least 6 publications in journals with NAAS rating of 7.5 or above.</p>

<p>Desirable:<br />(i) Specialization and experience: Knowledge of software development and its application in crop bioinformatics, experience in handling ‘omies’data. <br />(ii) Teaching experience in relevant subject</p>

<p>The Secretary, Agricultural Scientists Recruitment Board, Indian Council of Agricultural Research Krishi Anusandhan Bhavan-I, Pusa New Delhi –110 012, India</p>

<p>Detailed eligibility criteria with how to apply information can be had at:<br />http://www.indiastudychannel.com/jobs/333467-Indian-Council-of-Agricultural-Research-looking-for-Assistant-Director-General.aspx</p>

<p>More at http://asrb.org.in/administrator/uploads_dir/1418978057english.pdf</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/43260/bioinformatics-tools-for-telomere-to-telomere-assembly</guid>
	<pubDate>Tue, 17 Aug 2021 13:17:09 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/43260/bioinformatics-tools-for-telomere-to-telomere-assembly</link>
	<title><![CDATA[Bioinformatics tools for telomere to telomere assembly !]]></title>
	<description><![CDATA[<p>●&nbsp;<a href="https://github.com/arangrhie/merfin" target="_blank">Merfin</a>&nbsp;&ndash; k-mer-based assembly and variant calling evaluation for improved consensus accuracy (Arang Rhie)<br />●&nbsp;<a href="https://www.biorxiv.org/content/10.1101/2020.11.11.378133v1" target="_blank">PanGenie</a>&nbsp;&ndash; algorithm that leverages a pangenome reference built from haplotype-resolved genome assemblies in conjunction with k-mer count information from raw, short-read sequencing data to genotype a wide spectrum of genetic variation (Tobias Marschall)<br />●&nbsp;<a href="https://github.com/ConesaLab/SQANTI3" target="_blank">SQANTI3</a>&nbsp;&ndash; an automated pipeline for the classification of long-read transcripts that can assess the quality of data and the preprocessing pipeline (Roc&iacute;o Amor&iacute;n de Heged&uuml;s&nbsp;<a href="https://twitter.com/rocioadh" target="_blank">@rocioadh</a>)<br />●&nbsp;<a href="https://github.com/GenomeRIK/tama" target="_blank">tama</a>&nbsp;(Transcriptome Annotation by Modular Algorithms) &ndash; software designed for processing Iso-Seq data and other long-read transcriptome data (Richard Kuo&nbsp;<a href="https://twitter.com/GenomeRIK" target="_blank">@GenomeRIK</a>)<br />●&nbsp;<a href="https://github.com/PacificBiosciences/pbAA" target="_blank">pbaa</a>&nbsp;(PacBio Amplicon Analysis) &ndash; separates complex mixtures of amplicon targets from genomic samples to cluster and generate high-quality consensus sequences from HiFi reads (Zev Kronenberg&nbsp;<a href="https://twitter.com/zevkronenberg" target="_blank">@zevkronenberg</a>)<br />●&nbsp;<a href="https://github.com/yuanyuan929/bellerophon" target="_blank">bellerophon</a>&nbsp;&ndash; analyzes MHC typing and other low-complexity gene amplicon data; performs allele calling while detecting polymorphic sites within the sequences and removing potential chimeric sequence variants (Yuanyuan Cheng&nbsp;<a href="https://twitter.com/Yuanyuan929" target="_blank">@Yuanyuan929</a>)<br />●&nbsp;<a href="https://github.com/amwenger/svpack" target="_blank">svpack</a>&nbsp;&ndash; tools for filtering, comparing, and annotating structural variant (SV) calls in VCF format (Aaron Wenger)<br />●&nbsp;<a href="https://github.com/AntonBankevich/jumboDB" target="_blank">JumboDB</a>&nbsp;&ndash; tool for de Bruijn graph construction (Anton Bankevich&nbsp;<a href="https://twitter.com/AntonBankevich" target="_blank">@AntonBankevich</a>)<br />●&nbsp;<a href="https://github.com/ksahlin/ultra" target="_blank">uLTRA</a>&nbsp;&ndash; tool for splice alignment of long transcriptomic reads to a genome, guided by a database of exon annotations. (Kristoffer Sahlin&nbsp;<a href="https://twitter.com/krsahlin" target="_blank">@krsahlin</a>)<br />●&nbsp;<a href="https://www.biorxiv.org/content/10.1101/2021.01.25.428044v1.full.pdf" target="_blank">LeafGo</a>&nbsp;&ndash; workflow to rapidly produce high-quality de novo plant genomes (Luca Ermini&nbsp;<a href="https://twitter.com/ermini_luca" target="_blank">@ermini_luca</a>)</p><p>Reference:</p><p>https://www.pacb.com/blog/young-investigators-share-stellar-science-career-advice-and-bioinformatics-tools-at-smrt-leiden-2021/</p><p>&nbsp;</p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>

</channel>
</rss>