<?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/30111?offset=510</link>
	<atom:link href="https://bioinformaticsonline.com/related/30111?offset=510" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40699/kevler-reference-free-variant-discovery-in-large-eukaryotic-genomes</guid>
	<pubDate>Tue, 28 Jan 2020 03:21:53 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40699/kevler-reference-free-variant-discovery-in-large-eukaryotic-genomes</link>
	<title><![CDATA[Kevler: Reference-free variant discovery in large eukaryotic genomes]]></title>
	<description><![CDATA[<p><span>Welcome to&nbsp;</span><span>kevlar</span><span>, software for predicting&nbsp;</span><em>de novo</em><span>&nbsp;genetic variants without mapping reads to a reference genome! kevlar's&nbsp;</span><em>k</em><span>-mer abundance based method calls single nucleotide variants (SNVs), multinucleotide variants (MNVs), insertion/deletion variants (indels), and structural variants (SVs) simultaneously with a single simple model.&nbsp;</span></p>
<p><span>More at&nbsp;<a href="https://kevlar.readthedocs.io/en/latest/">https://kevlar.readthedocs.io/en/latest/</a></span></p>
<p><span><a href="https://www.cell.com/iscience/pdf/S2589-0042(19)30259-7.pdf">https://www.cell.com/iscience/pdf/S2589-0042(19)30259-7.pdf</a></span></p><p>Address of the bookmark: <a href="https://github.com/kevlar-dev/kevlar" rel="nofollow">https://github.com/kevlar-dev/kevlar</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/25095/jrf-bioinformatics</guid>
  <pubDate>Mon, 02 Nov 2015 03:24:50 -0600</pubDate>
  <link></link>
  <title><![CDATA[JRF Bioinformatics]]></title>
  <description><![CDATA[
<p>JRF Bioinformatics</p>

<p>Eligibility : ME/M.Tech, MSc(Bio-Chemistry, Bio-Informatics, Bio-Tech, Microbiology), BE/B.Tech</p>

<p>Location : Gandhinagar</p>

<p>Last Date : 05 Nov 2015</p>

<p>Hiring Process : Face to Face Interview</p>

<p>Junior Research Fellow (JRF) Job vacancies in Gujarat State Biotechnology Mission (GSBTM)</p>

<p>Project : “Establishing a network in computational and system biology”</p>

<p>No. of Post : 01</p>

<p>Qualification : MSc. /M.Tech. /B.E. /B.Tech. in Biotechnology/Bioinformatics /Life Sciences /Microbiology /Biochemistry /Genetics from recognized University. Preference would be given to the candidates having NET/GATE.</p>

<p>Fellowship : Rs. 12,000 + 20% HRA<br />How to apply</p>

<p>Applications should be filled Online. The last date for submission of application is 5th November, 2015.</p>

<p>More at http://btm.gujarat.gov.in/btm/recruitment2.htm</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/videolist/watch/16686/sequence-viewer-download-transcripts-exons-and-proteins</guid>
	<pubDate>Mon, 15 Sep 2014 17:30:36 -0500</pubDate>
	<link>https://bioinformaticsonline.com/videolist/watch/16686/sequence-viewer-download-transcripts-exons-and-proteins</link>
	<title><![CDATA[Sequence Viewer: Download Transcripts, Exons and Proteins]]></title>
	<description><![CDATA[<iframe width="" height="" src="https://www.youtube-nocookie.com/embed/ZWnLyYKozaI" frameborder="0" allowfullscreen></iframe>How to download FASTA sequence for certain gene features while in the NCBI's Sequence Viewer.

Sequence Viewer homepage:
www.ncbi.nlm.nih.gov/projects/sviewer/

Sequence Viewer playlist:
https://www.youtube.com/playlist?list=PL76D7EE6A6A8AC1C3]]></description>
	
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/25149/project-assistant-ii-job-vacancies-in-national-institute-of-oceanography-nio-goa</guid>
  <pubDate>Fri, 06 Nov 2015 01:33:22 -0600</pubDate>
  <link></link>
  <title><![CDATA[Project Assistant-II job vacancies in National Institute of Oceanography (NIO Goa)]]></title>
  <description><![CDATA[
<p>Vacancy no : GAP0423/1509-15</p>

<p>Project Assistant-II job vacancies in National Institute of Oceanography (NIO Goa)</p>

<p>Project Title and Code : Biotechnology Information System. -- GAP0423</p>

<p>Qualification : M.Sc Bioinformatics / Zoology / Botany / Environmental Science. Desirable : Basic understanding of biodiversity concept is desirable</p>

<p>No. of Post : 01</p>

<p>Age : 28 Years</p>

<p>Place of Posting : Goa</p>

<p>Consolidated Stipend Per Month : Rs.16000/-</p>

<p>Job Requirement : Collection and handling of biodiversity data as assigned by the scientists and working with in-house biodiversity data management applications and software<br />How to apply</p>

<p>Candidates satisfying requirements may attend the Walk-in-interview on 12.11.2015, 10.00 AM at NIO Dona Paula, Goa-403004 along with their bio-data, attested copies of certificates &amp; mark lists in proof of qualification (SSC onwards), age, experience and testimonials. Candidates should bring a photo identity proof at the time of registration</p>

<p>More at http://www.nio.org/index/option/com_vacgoa/task/show/title/Goa/tid/6/sid/28/thid/64</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34565/fogsaa-fast-optimal-global-sequence-alignment-algorithm</guid>
	<pubDate>Fri, 08 Dec 2017 14:41:08 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34565/fogsaa-fast-optimal-global-sequence-alignment-algorithm</link>
	<title><![CDATA[FOGSAA: Fast Optimal Global Sequence Alignment Algorithm]]></title>
	<description><![CDATA[<p>Sequence alignment algorithms are widely used to infer similarirty and the point of differences between pair of sequences. FOGSAA is a fast Global alignment algorithm. It is basically a branch and bound approach which starts branch expansion in a greedy way taking the symbols from the given pair of sequences (protein or nucleotide) and results in an optimal alignment faster than conventional dymanic programming techniques. It is also better than the heuristic methods with respect to alignment quality.</p><p>Address of the bookmark: <a href="http://www.isical.ac.in/~bioinfo_miu/FOGSAA.htm" rel="nofollow">http://www.isical.ac.in/~bioinfo_miu/FOGSAA.htm</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</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/opportunity/view/25293/srfjrf-bioinformatics-at-national-bureau-of-animal-genetic-resources</guid>
  <pubDate>Thu, 26 Nov 2015 01:54:07 -0600</pubDate>
  <link></link>
  <title><![CDATA[SRF/JRF Bioinformatics at National Bureau of Animal Genetic Resources]]></title>
  <description><![CDATA[
<p>National Bureau of Animal Genetic Resources </p>

<p>SRF Job vacancies in National Bureau of Animal Genetic Resources (NBAGR) on contractual basis</p>

<p>No. of Posts : 03</p>

<p>Qualifications : Master degree in any one of discipline/ Subjects Biotechnology/Bioinformatics/Life Sciences/ Computer Applications with 4 years/5 years of Bachelor’s degree. Candidates having post graduate degree in above mentioned subjects with 3 years Bachelor’s degree should be NET qualified.</p>

<p>Note : i. The Ph.D. Degree holders are eligible for the posts. ii. The Master’s degree holders with the integrated degrees like B.Tech. &amp; M. Tech. (5 years) are eligible. iii. Graduates with three years Bachelor’s degree, who have acquired professional Master’s degree (3 years) like M.Sc. (Ag.), Masters in Computer Applications, M. Tech., etc., are eligible.</p>

<p>Desirable : The candidates should have zeal to work in R environment and NGS data analysis</p>

<p>Emolument : Rs. 28,000/- </p>

<p>Age Limit : 35 year for Men and 40 years for Women in case of SRF on the date of Interview.<br />How to apply</p>

<p>Walk-in-Interview is proposed to be held at National Bureau of Animal Genetic Resources, Karnal (Haryana)-132 001 at 10:30 AM on 02.12.2015. Interested candidates may attend Walk-in-Interview at 10:30 AM on 02.12.2015 alongwith original certificates and typed bio-data with one set of attested copies of each their certificates with passport size photograph.</p>
]]></description>
</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/opportunity/view/25303/ciab-recruits-scientist-engineer-informatics-officer</guid>
  <pubDate>Sat, 28 Nov 2015 03:40:28 -0600</pubDate>
  <link></link>
  <title><![CDATA[CIAB Recruits Scientist, Engineer, Informatics Officer]]></title>
  <description><![CDATA[
<p>Center of Innovative and Applied Bioprocessing (CIAB) - Punjab</p>

<p>Center of Innovative and Applied Bioprocessing (CIAB) invites applications to recruit on vacant posts of Scientist, Associate Plant Manager/ Plant Engineer, Informatics Officer. Applications against these Government Jobs can be submitted on or before 7th January 2016.<br />CIAB Vacancy 2015 Details</p>

<p>9. Research &amp; Development – Informatics Officer<br />Qualification: M. Tech or M.E. in computer science or information technology or bioinformatics with 4 years of R&amp;D experience (after Master’s Degree) in an R&amp;D organization with work profile of large data assembly, analysis.<br />Age Limit: 45 years<br />How to Apply : Duly filled-in applications in prescribed application format along with copies of required documents should be reach to: Chief Exec</p>
]]></description>
</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>