<?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/30144?offset=1300</link>
	<atom:link href="https://bioinformaticsonline.com/related/30144?offset=1300" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<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/22028/walk-in-for-research-asst-programmer-enterovirus-research-centre-mumbai-india</guid>
  <pubDate>Tue, 14 Apr 2015 12:36:51 -0500</pubDate>
  <link></link>
  <title><![CDATA[Walk in for Research Asst &amp; Programmer Enterovirus Research Centre Mumbai - India]]></title>
  <description><![CDATA[
<p>Enterovirus Research Centre Mumbai Jobs 2015 –</p>

<p>Walk in for Research Asst &amp; Programmer Posts: Enterovirus Research Centre, Mumbai, Indian Council of Medical Research has issued notification for the recruitment of Research Asst &amp; Programmer vacancies on temporary basis for the project entitled “An Atlas of Non-Polio Enterovirus Types Isolated from Cases of Acute Flaccid Paralysis in India”. Eligible candidates may walk in on 20-04-2015 from 10:00 AM to 12:00 Noon. Other details like age limit, educational qualification, how to apply are given below…</p>

<p>Enterovirus Research Centre Mumbai Vacancy Details:<br />Total No. of Posts: 04<br />Name of the Posts:<br />1. Research Assistant: 03 Posts<br />2. Programmer: 01 Post</p>

<p>Age Limit: Candidates age should below 28 years. Age relaxations are applicable as per rules.</p>

<p>Educational Qualification: Candidates should have M.Sc (1st Class) in Microbiology/ Bioinformatics/ Biotechnology/ Life Science for post 1, BE/ B.Tech/ MCA for post 2.</p>

<p>Selection Process: Candidates are selected based on their performance in interview.</p>

<p>How to Apply: Eligible candidates may attend for interview along with original certificates, CV, attested copies of relevant certificates, one recent passport size photograph duly affixed on right side of application at Enterovirus Research Centre, Mumbai, Indian Council of Medical Research, Haffkine Institute Cmpound, Acharya Donde Marg, Parel, Mumbai-400012 on 20-04-2015 from 10:00 AM to 12:00 Noon.</p>

<p>Important Dates:<br />Date &amp; Time of Interview: 20-04-2015 from 10:00 AM to 12:00 Noon.<br />Registration Time: 12:00 Noon.</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/file/view/22050/binc-sample-question-paper</guid>
	<pubDate>Thu, 16 Apr 2015 09:15:09 -0500</pubDate>
	<link>https://bioinformaticsonline.com/file/view/22050/binc-sample-question-paper</link>
	<title><![CDATA[BINC Sample Question Paper !!!]]></title>
	<description><![CDATA[<p>BINC sample question paper round THREE ...</p>]]></description>
	<dc:creator>Jitendra Narayan</dc:creator>
	<enclosure url="https://bioinformaticsonline.com/file/download/22050" length="316" type="text/plain" />
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42132/squeezemeta-a-fully-automated-metagenomics-pipeline-from-reads-to-bins</guid>
	<pubDate>Mon, 17 Aug 2020 05:25:10 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42132/squeezemeta-a-fully-automated-metagenomics-pipeline-from-reads-to-bins</link>
	<title><![CDATA[SqueezeMeta: a fully automated metagenomics pipeline, from reads to bins]]></title>
	<description><![CDATA[<p>SqueezeMeta is a full automatic pipeline for metagenomics/metatranscriptomics, covering all steps of the analysis. SqueezeMeta includes multi-metagenome support allowing the co-assembly of related metagenomes and the retrieval of individual genomes via binning procedures. Thus, SqueezeMeta features several unique characteristics:</p>
<ol>
<li>Co-assembly procedure with read mapping for estimation of the abundances of genes in each metagenome</li>
<li>Co-assembly of a large number of metagenomes via merging of individual metagenomes</li>
<li>Includes binning and bin checking, for retrieving individual genomes</li>
<li>The results are stored in a database, where they can be easily exported and shared, and can be inspected anywhere using a web interface.</li>
<li>Internal checks for the assembly and binning steps inform about the consistency of contigs and bins, allowing to spot potential chimeras.</li>
<li>Metatranscriptomic support via mapping of cDNA reads against reference metagenomes</li>
</ol><p>Address of the bookmark: <a href="https://github.com/jtamames/SqueezeMeta" rel="nofollow">https://github.com/jtamames/SqueezeMeta</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/22130/senior-research-fellow-srf-bioinformatics-at-central-institute-for-research-on-buffaloes</guid>
  <pubDate>Sat, 18 Apr 2015 04:30:47 -0500</pubDate>
  <link></link>
  <title><![CDATA[Senior Research Fellow (SRF) Bioinformatics at Central Institute for Research on Buffaloes]]></title>
  <description><![CDATA[
<p>Senior Research Fellow (SRF) Bioinformatics at Central Institute for Research on Buffaloes<br />Address: Central Institute for Research on Buffaloes, Sirsa Road, Hisar<br />State: Haryana<br />Pay Scale: Post Graduate in subjects other than Veterinary Science Rs. 16000/- per month for 1st and 2nd year and Rs. 18000/- per month for 3rd year. Post Graduate in Veterinary Science Rs. 18000/- per month for 1st and 2nd Year and Rs. 20000/- per month for 3rd year.<br />Educational Requirements: Master’s degree in biotechnology/animal biotechnology, veterinary/animal biochemistry, veterinary microbiology or veterinary/animal physiology/Nano Technology/Bioinformatics or related area.<br />Qualifications: Ph.D in relevant field/experience of working in any research project<br />Details will be available at: http://www.cirb.res.in/attachments/195_Walk-in-Interview%20for%20Senior%20Research%20Fellow%20%28SRF%29%20%28On%20Dated%2020.4.2015%29.pdf<br />How To Apply: Interested candidates who fulfill the above conditions should report for interview with a copy of their bio-data, photocopy and original certificates and testimonials, other related material i.e. reports, documents, articles, etc., if any.<br />Date &amp; Time of Interview: 20.04.2015 at 11.00 hrs<br />Venue: CIRB, Hisar</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42946/aligngraph2-similar-genome-assisted-reassembly-pipeline-for-pacbio-long-reads</guid>
	<pubDate>Sun, 14 Mar 2021 09:42:47 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42946/aligngraph2-similar-genome-assisted-reassembly-pipeline-for-pacbio-long-reads</link>
	<title><![CDATA[AlignGraph2: similar genome-assisted reassembly pipeline for PacBio long reads]]></title>
	<description><![CDATA[<p><span>AlignGraph2 is the second version of&nbsp;</span><a href="https://github.com/baoe/AlignGraph">AlignGraph</a><span>&nbsp;for PacBio long reads. It extends and refines contigs assembled from the long reads with a published genome similar to the sequencing genome.</span></p>
<p><span>More at&nbsp;https://academic.oup.com/bib/advance-article-abstract/doi/10.1093/bib/bbab022/6146772</span></p><p>Address of the bookmark: <a href="https://github.com/huangs001/AlignGraph2" rel="nofollow">https://github.com/huangs001/AlignGraph2</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/22236/savitribai-phule-pune-university-recruitment-for-04-jrf-post-in-april-2015</guid>
  <pubDate>Mon, 27 Apr 2015 20:28:59 -0500</pubDate>
  <link></link>
  <title><![CDATA[Savitribai Phule Pune University Recruitment for 04 JRF Post in April 2015]]></title>
  <description><![CDATA[
<p>Savitribai Phule Pune University announced application for recruitment to the post of Junior Research Fellow. The candidates for the post can apply through prescribed format before 10 May 2015.<br />Description:</p>

<p>Important Date &amp; Details</p>

<p>Closing Date for Registration: 10 May 2015</p>

<p>Details of Post</p>

<p>Name of Post: Junior Research Fellow- 04 Posts</p>

<p>Pay Scale: Rs. 12,000 or 16,00+ HRA Post Graduate degree with NET (16,000+HRA) Post Graduate Degree (12,000+HRA)</p>

<p>Eligibility Criteria: M.Sc. in Microbiology/Marine Microbiology/ Marine Biotechnology/Biotechnology/Bioinformatics/Zoology or equivalent degree with minimum 60% marks or equivalent grade</p>

<p>Age Limit- Not more than 28 years</p>

<p>Organisation Name: Savitribai Phule Pune University<br />Eligibility for the post:</p>

<p>Selection Procedure: The selection procedure is through personal interview. No TA/DA will be paid for appearing in the interview.</p>

<p>How to Apply: The candidates may send their application along with CV to the Head Department of Zoology, Savitribai Phule University on or before 10 May 2015.</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/44234/steps-to-find-palindrome-in-genomes</guid>
	<pubDate>Thu, 09 Mar 2023 02:56:54 -0600</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/44234/steps-to-find-palindrome-in-genomes</link>
	<title><![CDATA[Steps to find palindrome in genomes !]]></title>
	<description><![CDATA[<div><div><div><div><div><div><div><div><div><div><p>Palindromes are sequences of nucleotides that read the same backward as forward. They can be present in genomes and have various biological functions. Here are some methods for discovering palindromes in genomes:</p><ol>
<li>
<p>Direct sequence search: One of the simplest ways to discover palindromes is to search the genome sequence directly for palindromic sequences using pattern matching tools, such as regular expressions or string algorithms. This approach can be useful for discovering simple palindromes, but may miss more complex palindromic structures.</p>
</li>
<li>
<p>Dot plot analysis: Dot plot analysis is a graphical method that can be used to identify palindromic regions in a genome. It involves plotting the genome sequence against itself and examining the diagonal patterns that emerge. Palindromic regions will appear as symmetrical patterns along the diagonal.</p>
</li>
<li>
<p>Restriction enzyme analysis: Some restriction enzymes, such as EcoRI and HindIII, recognize palindromic sequences and cleave DNA at these sites. By digesting the genome with these enzymes and examining the resulting fragments, palindromic regions can be identified.</p>
</li>
<li>
<p>Next-generation sequencing: High-throughput sequencing technologies, such as PacBio and Oxford Nanopore, can generate long reads that can span entire palindromic regions. By mapping these reads to the genome, palindromic regions can be identified and characterized.</p>
</li>
<li>
<p>Comparative genomics: Comparing the genomes of related species can also reveal palindromic regions that are conserved across evolutionarily divergent lineages. This approach can help identify functional palindromes that are under selective pressure.</p>
</li>
</ol><p>Overall, the discovery of palindromic sequences in genomes can be accomplished using a variety of methods, each with their own advantages and limitations. A combination of these methods can provide a comprehensive understanding of the palindromic landscape of a genome.</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/bookmarks/view/38563/hecil-a-hybrid-error-correction-algorithm-for-long-reads-with-iterative-learning</guid>
	<pubDate>Tue, 01 Jan 2019 12:01:00 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38563/hecil-a-hybrid-error-correction-algorithm-for-long-reads-with-iterative-learning</link>
	<title><![CDATA[HECIL: A Hybrid Error Correction Algorithm for Long Reads with Iterative Learning]]></title>
	<description><![CDATA[<p><span>HECIL&mdash;Hybrid Error Correction with Iterative Learning&mdash;a hybrid error correction framework that determines a correction policy for erroneous long reads, based on optimal combinations of decision weights obtained from short read alignments.&nbsp;</span></p>
<p><span><span>HECIL&rsquo;s core algorithm by introducing an iterative learning paradigm that enhances the correction policy at each iteration by incorporating knowledge gathered from previous iterations via data-driven confidence metrics assigned to prior corrections.</span></span></p><p>Address of the bookmark: <a href="https://github.com/NDBL/HECIL" rel="nofollow">https://github.com/NDBL/HECIL</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>

</channel>
</rss>