<?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/36880?offset=1310</link>
	<atom:link href="https://bioinformaticsonline.com/related/36880?offset=1310" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<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>

<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/34235/quorum-an-error-corrector-for-illumina-reads</guid>
	<pubDate>Wed, 08 Nov 2017 11:40:41 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34235/quorum-an-error-corrector-for-illumina-reads</link>
	<title><![CDATA[QuorUM: An Error Corrector for Illumina Reads]]></title>
	<description><![CDATA[<p><span><span>Illumina Sequencing data can provide high coverage of a genome by relatively short (most often 100 bp to 150 bp) reads at a low cost. Even with low (advertised 1%) error rate, 100 &times; coverage Illumina data on average has an error in some read at every base in the genome. These errors make handling the data more complicated because they result in a large number of low-count erroneous&nbsp;</span><em>k</em><span>-mers in the reads. However, there is enough information in the reads to correct most of the sequencing errors, thus making subsequent use of the data (e.g. for mapping or assembly) easier. Here we use the term &ldquo;error correction&rdquo; to denote the reduction in errors due to both changes in individual bases and trimming of unusable sequence. We developed an error correction software called QuorUM. QuorUM is mainly aimed at error correcting Illumina reads for subsequent assembly. It is designed around the novel idea of minimizing the number of distinct erroneous&nbsp;</span><em>k</em><span>-mers in the output reads and preserving the most true&nbsp;</span><em>k</em><span>-mers, and we introduce a composite statistic &pi; that measures how successful we are at achieving this dual goal. We evaluate the performance of QuorUM by correcting actual Illumina reads from genomes for which a reference assembly is available.</span></span></p>
<p><span>QuorUM is distributed as an independent software package and as a module of the MaSuRCA assembly software. Both are available under the GPL open source license at&nbsp;</span><a href="http://www.genome.umd.edu/">http://www.genome.umd.edu</a><span>.</span></p><p>Address of the bookmark: <a href="http://journals.plos.org/plosone/article?id=10.1371/journal.pone.0130821" rel="nofollow">http://journals.plos.org/plosone/article?id=10.1371/journal.pone.0130821</a></p>]]></description>
	<dc:creator>Jit</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/40893/quorum-an-error-corrector-for-illumina-reads</guid>
	<pubDate>Tue, 04 Feb 2020 23:26:55 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40893/quorum-an-error-corrector-for-illumina-reads</link>
	<title><![CDATA[QuorUM: An Error Corrector for Illumina Reads]]></title>
	<description><![CDATA[<p><span>We produce trimmed and error-corrected reads that result in assemblies with longer contigs and fewer errors. We compared QuorUM against several published error correctors and found that it is the best performer in most metrics we use. QuorUM is efficiently implemented making use of current multi-core computing architectures and it is suitable for large data sets (1 billion bases checked and corrected per day per core)</span></p><p>Address of the bookmark: <a href="http://www.genome.umd.edu/" rel="nofollow">http://www.genome.umd.edu/</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/26827/kamaleshwar-singh-lab</guid>
  <pubDate>Fri, 25 Mar 2016 10:46:49 -0500</pubDate>
  <link></link>
  <title><![CDATA[Kamaleshwar Singh Lab]]></title>
  <description><![CDATA[
<p>The focus of Dr. Singh’s research and teaching is on the molecular mechanistic basis for environmental carcinogen-induced genetic (DNA damage) and epigenetic changes, and susceptibility to human cancer development</p>

<p>More at http://www.tiehh.ttu.edu/dr.-kamaleshwar-singh.html</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/33482/tardis-toolkit-for-automated-and-rapid-discovery-of-structural-variants</guid>
	<pubDate>Fri, 09 Jun 2017 04:43:31 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/33482/tardis-toolkit-for-automated-and-rapid-discovery-of-structural-variants</link>
	<title><![CDATA[TARDIS: Toolkit for automated and rapid discovery of structural variants]]></title>
	<description><![CDATA[<p>tardis</p>
<p>Toolkit for Automated and Rapid DIscovery of Structural variants</p>
<p>Requirements</p>
<p>zlib (http://www.zlib.net)<br>mrfast (https://github.com/BilkentCompGen/mrfast)<br>htslib (included as submodule; http://htslib.org/)<br>Fetching tardis</p>
<p>git clone https://github.com/BilkentCompGen/tardis.git --recursive</p>
<p>&nbsp;</p>
<p>https://github.com/BilkentCompGen/tardis</p><p>Address of the bookmark: <a href="https://github.com/BilkentCompGen/tardis" rel="nofollow">https://github.com/BilkentCompGen/tardis</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/25406/assistant-professor-bioinformatics-at-alagappa-university</guid>
  <pubDate>Thu, 03 Dec 2015 23:30:43 -0600</pubDate>
  <link></link>
  <title><![CDATA[ASSISTANT PROFESSOR Bioinformatics at ALAGAPPA UNIVERSITY]]></title>
  <description><![CDATA[
<p>ALAGAPPA UNIVERSITY<br /> Recruitment and Sarkari Naukri for the Post of ASSISTANT PROFESSOR Bioinformatics<br />Job Description UGC scale of pay is applicable. For eligibility qualifications and other norms, please refer to the ?Instructions to the Candidates? available with the application forms which can be had on payment of Rs.520/- inclusive of Rs.20/- for postage. For SC/ST, Rs.320/- inclusive of Rs.20/- for postage on enclosure of a copy of the community certificate. Payment is to be made by means of Demand Draft drawn on any nationalized bank in favour of ?The Registrar, Alagappa University? payable at Karaikudi. Candidates can also download the application form and instructions to the candidates from httpwww.alagappauniversity.ac Filled-in application should reach on or before 19.10.2015<br />Salary for Job : Rs.15600-39100+AGP Rs.6000<br />Education : Good academic record with at least 55 marks (or an equivalent grade in a point scale wherever grading system is followed) at the Masters Degree level in a relevant subject from an Indian University, or an equivalent degree from an accredited foreign university. Besides fulfilling the above qualifications, the candidate must have cleared the National Eligibility Test (NET) conducted by the UGC, CSIR or similar test accredited by the UGC like SLET/SET.Notwithstanding anything contained in sub-clauses (i) and (ii) above, the candidates, who are, or have been awarded a Ph.D. degree in accordance with the University Grants Commission (Minimum Standards and Procedure for Award of Ph.D. Degree) Regulations 2009, shall be exempted from the requirement of the minimum eligibility condition of NET/SLET/SET for recruitment and appointment of Assistant Professor or equivalent positions in Universities/Colleges/Institutions.<br />Number of Vacancies : 02<br />Naukri Location : Other City(s) in Tamil Nadu<br />Address : KARAIKUDI ? 630 003<br />Last Date to Apply : 2015-12-04<br />Apply Process : written test/interview</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40298/environment-for-tree-exploration-ete-is-a-python-programming-toolkit-that-assists-in-the-recontruction-manipulation-analysis-and-visualization-of-phylogenetic-trees</guid>
	<pubDate>Wed, 27 Nov 2019 05:32:33 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40298/environment-for-tree-exploration-ete-is-a-python-programming-toolkit-that-assists-in-the-recontruction-manipulation-analysis-and-visualization-of-phylogenetic-trees</link>
	<title><![CDATA[Environment for Tree Exploration (ETE) is a Python programming toolkit that assists in the recontruction, manipulation, analysis and visualization of phylogenetic trees]]></title>
	<description><![CDATA[<p><span>The Environment for Tree Exploration (ETE) is a Python programming toolkit that assists in the recontruction, manipulation, analysis and visualization of phylogenetic trees (although clustering trees or any other tree-like data structure are also supported).</span></p>
<p><span>Other tools</span></p>
<p><span><a href="https://github.com/shenwei356/taxonkit">https://github.com/shenwei356/taxonkit</a></span></p>
<p>&nbsp;</p>
<ul>
<li>ETE, version:&nbsp;<a href="https://pypi.org/project/ete3/3.1.1/">3.1.1</a></li>
<li>BioPython, version:&nbsp;<a href="https://pypi.org/project/biopython/1.73/">1.73</a></li>
<li>taxadb, version:&nbsp;<a href="https://pypi.org/project/taxadb/0.9.0">0.10.1</a></li>
<li>TaxonKit, version:&nbsp;<a href="https://github.com/shenwei356/taxonkit/releases/tag/0.10.1">0.5.0</a></li>
</ul><p>Address of the bookmark: <a href="https://pypi.org/project/ete3/3.1.1/" rel="nofollow">https://pypi.org/project/ete3/3.1.1/</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/26435/bioinformatics-centre-bose-institute-vacancy-of-research-associate-senior-research-fellow</guid>
  <pubDate>Mon, 22 Feb 2016 03:27:17 -0600</pubDate>
  <link></link>
  <title><![CDATA[Bioinformatics Centre, Bose Institute vacancy of Research Associate / Senior Research Fellow]]></title>
  <description><![CDATA[
<p>Bioinformatics Centre, Bose Institute vacancy of Research Associate / Senior Research Fellow</p>

<p>Location where with post of Research Associate / Senior Research Fellow is available:<br />Bioinformatics Centre, Bose Institute in Kolkata, West Bengal</p>

<p>Title of the Project: "Setting up of National Facility on Interactive Graphics Computer System".</p>

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

<p>Salary: Rs. 22000/- per month plus admissible HRA and Medical Benefits for RA and Rs. 20000/- per month plus admissible HRA and Medical Benefits for SRF (Extended).</p>

<p>Age Limit: Max. 35 years for RA and Max. 33 years for SRF (Extended)</p>

<p>Required Job Profile:</p>

<p>Candidate must possess PhD degree in biological or chemical sciences with in depth understanding of protein structure and function; experience on protein crystallization and various modeling software will be advantages and candidate who have submitted PhD thesis can be considered as extended SRF.</p>

<p>The project would involve cloning, expression, crustallization of vibrio cholera toxin, Ace and modeling of its admissible HRA and medical benefits for SRF (Extended).</p>

<p>How to apply:</p>

<p>Eligible and interested candidates should need to appear before the selection committee along with typed application addressed to the above mentioned address along with biodata with complete details and attested copies of certificates on 02.03.2016 at 11:30 am. No TA or DA will be paid for attending the interview. No TA or DA will be paid for attending the interview.</p>

<p>Refer to http://www.boseinst.ernet.in/ADVT/15/p_30.pdf</p>
]]></description>
</item>

</channel>
</rss>