<?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/41991?offset=1410</link>
	<atom:link href="https://bioinformaticsonline.com/related/41991?offset=1410" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/39856/tritex-sequence-assembly-pipeline-for-triticeae-genomes</guid>
	<pubDate>Tue, 20 Aug 2019 09:47:14 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/39856/tritex-sequence-assembly-pipeline-for-triticeae-genomes</link>
	<title><![CDATA[TRITEX sequence assembly pipeline for Triticeae genomes]]></title>
	<description><![CDATA[<div>
<p>The pipeline is open-source and hosted in a public Bitbucket&nbsp;<a href="https://bitbucket.org/tritexassembly/tritexassembly.bitbucket.io/src/master/">repository</a>.</p>
</div>
<div>
<p>TRITEX has been run on highly inbred genotypes of barley (<em>Hordeum vulgare</em>), tetraploid wheat (<em>Triticum turgidum</em>) and hexaploid wheat (<em>T. aestivum</em>) with reasonable results: super-scaffold N50 values in the range of dozens of Mb and pseudomolecules with better gene space representation than a BAC-by-BAC assembly. It has never been tested and is not expected to work on heterozygous or autopolyploid genomes.</p>
</div>
<div>
<p>A protocol for generating chromosome-conformation capture sequencing (Hi-C) data suitable for use with the pipeline is described in&nbsp;<a href="https://bio-protocol.org/e2955">Himmelbach et al. 2018</a>. Refer to the&nbsp;<a href="https://www.10xgenomics.com/resources/technical-notes/">technical notes</a>&nbsp;of 10X Genomics on how to generate Chromium data.</p>
</div><p>Address of the bookmark: <a href="https://tritexassembly.bitbucket.io/" rel="nofollow">https://tritexassembly.bitbucket.io/</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/bookmarks/view/40217/shouji-a-fast-and-efficient-pre-alignment-filter-for-sequence-alignment</guid>
	<pubDate>Mon, 04 Nov 2019 07:09:45 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40217/shouji-a-fast-and-efficient-pre-alignment-filter-for-sequence-alignment</link>
	<title><![CDATA[Shouji: a fast and efficient pre-alignment filter for sequence alignment]]></title>
	<description><![CDATA[<p>The ability to generate massive amounts of sequencing data continues to overwhelm the processing capacity of existing algorithms and compute infrastructures. In this work, we explore the use of hardware/software co-design and hardware acceleration to significantly reduce the execution time of short sequence alignment, a crucial step in analyzing sequenced genomes.</p>
<p>&nbsp;<img src="https://github.com/BilkentCompGen/Shoji/raw/master/Figure1-GitHub.png" alt="image" style="border: 0px;"></p>
<p>We introduce Shouji, a highly parallel and accurate pre-alignment filter that remarkably reduces the need for computationally-costly dynamic programming algorithms. The first key idea of our proposed pre-alignment filter is to provide high filtering accuracy by correctly detecting all common subsequences shared between two given sequences. The second key idea is to design a hardware accelerator design that adopts modern FPGA (field-programmable gate array) architectures to further boost the performance of our algorithm.</p>
<p>More at <a href="https://github.com/CMU-SAFARI/Shouji">https://github.com/CMU-SAFARI/Shouji</a></p><p>Address of the bookmark: <a href="https://github.com/CMU-SAFARI/Shouji" rel="nofollow">https://github.com/CMU-SAFARI/Shouji</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/19820/rstudio</guid>
	<pubDate>Sat, 27 Dec 2014 06:50:58 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/19820/rstudio</link>
	<title><![CDATA[RStudio]]></title>
	<description><![CDATA[<p>RStudio IDE is a powerful and productive user interface for R. It&rsquo;s free and open source, and works great on Windows, Mac, and Linux.</p>
<p>The developers and expert trainers are the authors of several popular R packages, including ggplot2, plyr, lubridate, and others.</p>
<p>More at http://www.rstudio.com/</p>
<p>http://www.rstudio.com/products/RStudio/</p><p>Address of the bookmark: <a href="http://www.rstudio.com/" rel="nofollow">http://www.rstudio.com/</a></p>]]></description>
	<dc:creator>Jitendra Narayan</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41033/clark-fast-accurate-and-versatile-sequence-classification-system</guid>
	<pubDate>Sat, 15 Feb 2020 01:49:01 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41033/clark-fast-accurate-and-versatile-sequence-classification-system</link>
	<title><![CDATA[CLARK: Fast, accurate and versatile sequence classification system]]></title>
	<description><![CDATA[<p><span></span><a href="http://dx.doi.org/10.1186/s12864-015-1419-2"><strong>CLARK</strong></a><span>, a method based on a supervised sequence classification using discriminative&nbsp;</span><em>k</em><span>-mers. Considering two distinct specific classification problems (see the article for details), namely (1) the taxonomic classification of metagenomic reads to known bacterial genomes, and (2) the assignment of BAC clones and transcript to chromosome arms/centromeres (in the absence of a finished assembly for the reference genome), CLARK outperforms in classification speed and precision the best state-of-the-art methods.</span></p>
<p><span><a href="http://clark.cs.ucr.edu/Spaced/">http://clark.cs.ucr.edu/Spaced/</a></span></p><p>Address of the bookmark: <a href="http://clark.cs.ucr.edu/Spaced/" rel="nofollow">http://clark.cs.ucr.edu/Spaced/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41959/rna-bloom-a-fast-and-memory-efficient-de-novo-transcript-sequence-assembler</guid>
	<pubDate>Thu, 09 Jul 2020 03:13:06 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41959/rna-bloom-a-fast-and-memory-efficient-de-novo-transcript-sequence-assembler</link>
	<title><![CDATA[RNA-Bloom: a fast and memory-efficient de novo transcript sequence assembler]]></title>
	<description><![CDATA[<p><strong>RNA-Bloom</strong><span>&nbsp;</span>is a fast and memory-efficient<span>&nbsp;</span><em>de novo</em><span>&nbsp;</span>transcript sequence assembler. It is designed for the following sequencing data types:</p>
<ul>
<li>single-end/paired-end bulk RNA-seq (strand-specific/agnostic)</li>
<li>paired-end single-cell RNA-seq (strand-specific/agnostic)</li>
<li>nanopore RNA-seq (PCR cDNA/direct cDNA/direct RNA)</li>
</ul>
<p>Written by<span>&nbsp;</span><a>Ka Ming Nip</a><span>&nbsp;</span>✉️</p><p>Address of the bookmark: <a href="https://github.com/bcgsc/RNA-Bloom" rel="nofollow">https://github.com/bcgsc/RNA-Bloom</a></p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/20271/research-associate-tata-memorial-centre-advanced-centre-for-treatment-research-and-education-in-cancer-kharghar-navi-mumbai</guid>
  <pubDate>Thu, 08 Jan 2015 20:53:57 -0600</pubDate>
  <link></link>
  <title><![CDATA[Research Associate	@ TATA MEMORIAL CENTRE ADVANCED CENTRE FOR TREATMENT, RESEARCH AND EDUCATION IN CANCER KHARGHAR, NAVI MUMBAI]]></title>
  <description><![CDATA[
<p>TATA MEMORIAL CENTRE ADVANCED CENTRE FOR TREATMENT, RESEARCH AND EDUCATION IN CANCER KHARGHAR, NAVI MUMBAI – 410210</p>

<p>Website: www.actrec.gov.in; Ph: 27405000</p>

<p>No. ACTREC/Advt./ 66 /2014 23rd December, 2014<br />Research Associate	</p>

<p>International Cancer Genome Consortium (ICGC) - India Project (IRB Project No. 3 A/c. No. 2408)</p>

<p>Dr. Rajiv Sarin</p>

<p>Duration of the Project: One year Extendable up to Three years.</p>

<p>Consolidated Salary: Rs. 42,000/- p.m.</p>

<p>Application last date: 8th January, 2015.</p>

<p>Interview Date &amp; Time: 21st January, 2015, at 11.00 a.m.</p>

<p>Venue: Conference Room, 3rd floor, Khanolkar Shodhika, ACTREC.</p>

<p>Essential Qualifications and Experience:</p>

<p>Ph.D (any branch of Life Sciences)</p>

<p>The candidate must have at least one year experience after Ph.D., preferably in Genomics and Molecular Biology.</p>

<p>Candidates fulfilling these requirements should pre register themselves by sending their application in the prescribed format with recent CV and contact details of 2 referees by e-mail to icgc@actrec.gov.in latest 8th January, 2015 by 10.00 a.m.</p>

<p>Candidates shortlisted for the interview will be intimated by email on or before 9th January, 2015.</p>

<p>The interviews would be held on 21st January 2015 and will be only for the pre registered candidates who have been shortlisted.<br />No T.A./D.A. will be admissible for attending the interview.</p>

<p>At the time of Interview the candidate should bring original certificates along with CV with contact details of 2 referees and submit the photocopies (attested) of the certificates, with a recent passport size photograph.</p>

<p>Advertisement: www.actrec.gov.in/data%20files/2014/Walk-in-Research-Fellow-26-12-14.doc</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43439/mmseqs2-ultra-fast-and-sensitive-sequence-search-and-clustering-suite</guid>
	<pubDate>Wed, 06 Oct 2021 07:01:14 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43439/mmseqs2-ultra-fast-and-sensitive-sequence-search-and-clustering-suite</link>
	<title><![CDATA[MMseqs2: ultra fast and sensitive sequence search and clustering suite]]></title>
	<description><![CDATA[<p><span>MMseqs2 (Many-against-Many sequence searching) is a software suite to search and cluster huge protein and nucleotide sequence sets. MMseqs2 is open source GPL-licensed software implemented in C++ for Linux, MacOS, and (as beta version, via cygwin) Windows. The software is designed to run on multiple cores and servers and exhibits very good scalability. MMseqs2 can run 10000 times faster than BLAST. At 100 times its speed it achieves almost the same sensitivity. It can perform profile searches with the same sensitivity as PSI-BLAST at over 400 times its speed.</span></p><p>Address of the bookmark: <a href="https://github.com/soedinglab/MMseqs2" rel="nofollow">https://github.com/soedinglab/MMseqs2</a></p>]]></description>
	<dc:creator>Abhi</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/videolist/watch/20454/comparative-genomics-in-ensembl</guid>
	<pubDate>Wed, 21 Jan 2015 08:31:11 -0600</pubDate>
	<link>https://bioinformaticsonline.com/videolist/watch/20454/comparative-genomics-in-ensembl</link>
	<title><![CDATA[Comparative Genomics in Ensembl]]></title>
	<description><![CDATA[<iframe width="" height="" src="https://www.youtube-nocookie.com/embed/dDRdCnZOMCM" frameborder="0" allowfullscreen></iframe>The Ensembl browser provides viewable whole-genome alignments, homologues and phylogenetic gene trees, protein families, and ancestral sequences.  Learn how to view and export these data in this video.]]></description>
	
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44904/termal-a-fast-and-interactive-terminal-based-viewer-for-multiple-sequence-alignments</guid>
	<pubDate>Mon, 22 Sep 2025 23:51:02 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44904/termal-a-fast-and-interactive-terminal-based-viewer-for-multiple-sequence-alignments</link>
	<title><![CDATA[Termal: a fast and interactive terminal-based viewer for multiple sequence alignments]]></title>
	<description><![CDATA[<p>termal, a fast, interactive, terminal-based viewer for multiple sequence alignments (MSAs), designed for use on remote systems such as high-performance computing (HPC) clusters.</p>
<p>https://academic.oup.com/bioinformaticsadvances/advance-article/doi/10.1093/bioadv/vbaf208/8257678?login=true</p><p>Address of the bookmark: <a href="https://github.com/sib-swiss/termal" rel="nofollow">https://github.com/sib-swiss/termal</a></p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>

</channel>
</rss>