<?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/31566?offset=1060</link>
	<atom:link href="https://bioinformaticsonline.com/related/31566?offset=1060" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/26537/destruct</guid>
	<pubDate>Mon, 29 Feb 2016 17:34:59 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/26537/destruct</link>
	<title><![CDATA[destruct]]></title>
	<description><![CDATA[<p>Destruct is a tool for joint prediction of rearrangement breakpoints from single or multiple tumour samples.</p>
<p>More at&nbsp;https://bitbucket.org/dranew/destruct</p><p>Address of the bookmark: <a href="https://bitbucket.org/dranew/destruct" rel="nofollow">https://bitbucket.org/dranew/destruct</a></p>]]></description>
	<dc:creator>Jitendra Prajapati</dc:creator>
</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/bookmarks/view/26571/pattern-searching-in-a-single-genome</guid>
	<pubDate>Mon, 07 Mar 2016 05:02:51 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/26571/pattern-searching-in-a-single-genome</link>
	<title><![CDATA[Pattern Searching in a Single Genome]]></title>
	<description><![CDATA[<p>Pattern searching holds much importance for biologists , for the understanding of DNA ( and its functionality) can be more than a matter of satisfying curiosity , but also give answers to many issuess uchas medical conditions . However,there are a number of ways of searching with in a single chromosome.</p><p>Address of the bookmark: <a href="https://www.stats.ox.ac.uk/__data/assets/pdf_file/0018/5373/LintonFinalReport.pdf" rel="nofollow">https://www.stats.ox.ac.uk/__data/assets/pdf_file/0018/5373/LintonFinalReport.pdf</a></p>]]></description>
	<dc:creator>Aasha</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44593/bear-better-emulation-for-artificial-reads</guid>
	<pubDate>Sat, 06 Jul 2024 04:27:53 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44593/bear-better-emulation-for-artificial-reads</link>
	<title><![CDATA[BEAR: Better Emulation for Artificial Reads]]></title>
	<description><![CDATA[<p dir="auto">Created by Stephen Johnson, Brett Trost, Dr. Jeffrey R. Long, Dr. Anthony Kusalik University of Saskatchewan, Department of Computer Science</p>
<p dir="auto">BEAR is intended to be an easy-to-use collection of scripts for generating simulated WGS metagenomic reads with read lengths, quality scores, error profiles, and species abundances derived from real user-supplied WGS data.</p><p>Address of the bookmark: <a href="https://github.com/sej917/BEAR" rel="nofollow">https://github.com/sej917/BEAR</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/33479/novelseq-novel-sequence-insertion-detection</guid>
	<pubDate>Fri, 09 Jun 2017 04:31:30 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/33479/novelseq-novel-sequence-insertion-detection</link>
	<title><![CDATA[NovelSeq: Novel Sequence Insertion Detection]]></title>
	<description><![CDATA[<p><span>The NovelSeq framework is designed to detect novel sequence insertions using high throughput paired-end whole genome sequencing data.</span></p>
<p>http://novelseq.sourceforge.net/Home</p>
<p>Paper at&nbsp;https://www.ncbi.nlm.nih.gov/pubmed/20385726</p><p>Address of the bookmark: <a href="http://novelseq.sourceforge.net/Home" rel="nofollow">http://novelseq.sourceforge.net/Home</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/44365/program-officer-bioinformatics-at-jhpiego</guid>
  <pubDate>Tue, 29 Aug 2023 00:05:30 -0500</pubDate>
  <link></link>
  <title><![CDATA[Program Officer, Bioinformatics at Jhpiego]]></title>
  <description><![CDATA[
<p>Jhpiego is a non-profit global health leader and Johns Hopkins University affiliate that is saving lives, improving health, and transforming futures. We partner with governments, health experts, and local communities to build the skills and systems that guarantee a healthier future for women and families. Jhpiego translates the best science and practices into moments of care that can mean the difference between life and death for women and families. The moment a woman gives birth; the moment a midwife helps a newborn to breathe. Through our partnerships, we are revolutionizing health care for the world’s most disadvantaged and vulnerable people. In India, Jhpiego works across various states in close collaboration with national and state governments, providing technical assistance in the areas of family planning, maternal and child health, strengthening human resources for health, and non-communicable diseases. These programs are funded by USAID, the Bill &amp; Melinda Gates Foundation, the David &amp; Lucile Packard Foundation, the Children’s Investment Fund Foundation (CIFF), , and other anonymous donors.</p>

<p>The Program Officer, Bioinformatics, operating under the Senior Advisor for Metagenomics &amp; Lab Systems, will play a pivotal role in leveraging bioinformatics to advance the objectives of the Health Security and AMR program. This position offers a unique opportunity to contribute to cutting-edge genomics research and its application in public health.</p>

<p>More detail at https://jobs-jhpiego.icims.com/jobs/5440/program-officer-%e2%80%93-bio-informatics/job</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36893/beap-blast-extension-and-assembly-program</guid>
	<pubDate>Mon, 11 Jun 2018 04:52:56 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36893/beap-blast-extension-and-assembly-program</link>
	<title><![CDATA[BEAP: Blast Extension and Assembly Program]]></title>
	<description><![CDATA[The Blast Extension and Assembly Program (BEAP) is a computer program that uses a short starting DNA fragment, often a EST or partial gene segment, as "primer", to recursively blast nucleotide databases in an attempt to obtain all sequences that overlaps, directly or indirectly, with the "primer" therefore help to "extend" the length of the original sequence for constructing a "full length" sequence for functional analysis, or at least to obtain neighboring regions of the segment for SNP discovery and linkage disequilibrium analysis. The confidence of assembling the resulting sequences is achieved by using a known genome, such as human genome, as a reference.
 
https://www.animalgenome.org/tools/beap/<p>Address of the bookmark: <a href="https://www.animalgenome.org/tools/beap/" rel="nofollow">https://www.animalgenome.org/tools/beap/</a></p>]]></description>
	<dc:creator>Shruti Paniwala</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/43995/tools-for-sequence-translation</guid>
	<pubDate>Tue, 08 Nov 2022 03:37:58 -0600</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/43995/tools-for-sequence-translation</link>
	<title><![CDATA[Tools for Sequence translation !]]></title>
	<description><![CDATA[<p><span>BOrf</span>&nbsp;-&nbsp;<a href="https://github.com/betsig/borf" target="_blank">https://github.com/betsig/borf</a></p><p><span>CodAn</span>&nbsp;-&nbsp;<a href="https://github.com/pedronachtigall/CodAn" target="_blank">https://github.com/pedronachtigall/CodAn</a></p><p><span>EMBOSS-Sixpack</span>&nbsp;-&nbsp;<a href="https://www.ebi.ac.uk/Tools/st/emboss_sixpack/" target="_blank">https://www.ebi.ac.uk/Tools/st/emboss_sixpack/</a></p><p><span>esl-translate</span>&nbsp;-&nbsp;<a href="http://hmmer.org/" target="_blank">http://hmmer.org/</a>,&nbsp;<a href="https://github.com/EddyRivasLab/easel" target="_blank">https://github.com/EddyRivasLab/easel</a></p><p><span>GeneMarkS-T</span>&nbsp;-&nbsp;<a href="http://exon.gatech.edu/GeneMark/license_download.cgi" target="_blank">http://exon.gatech.edu/GeneMark/license_download.cgi</a></p><p><span>ORFfinder</span>&nbsp;-&nbsp;<a href="https://www.ncbi.nlm.nih.gov/orffinder/" target="_blank">https://www.ncbi.nlm.nih.gov/orffinder/</a>&nbsp;(web server)</p><p><span>PLASS</span>&nbsp;-&nbsp;<a href="https://github.com/soedinglab/plass" target="_blank">https://github.com/soedinglab/plass</a></p><p><span>Prodigal</span>&nbsp;-&nbsp;<a href="https://github.com/hyattpd/Prodigal" target="_blank">https://github.com/hyattpd/Prodigal</a></p><p><span>TransDecoder</span>&nbsp;-&nbsp;<a href="https://github.com/TransDecoder/TransDecoder" target="_blank">https://github.com/TransDecoder/TransDecoder</a></p>]]></description>
	<dc:creator>Abhi</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/26877/research-fellow-bioinformatics</guid>
  <pubDate>Mon, 04 Apr 2016 05:41:21 -0500</pubDate>
  <link></link>
  <title><![CDATA[Research Fellow Bioinformatics]]></title>
  <description><![CDATA[
<p>Research Fellow Bioinformatics<br />Eligibility : BSc(Bio-Tech), MSc(Bio-Tech)<br />Location : Ludhiana<br />Last Date : 19 Apr 2016<br />Hiring Process : Walk - In<br />Punjab Agricultural University</p>

<p>Research Fellow Bioinformatics job opportunities in Punjab Agricultural University<br />Qualification : B.Sc. with minimum OCPA 5.00/10.00 basis or 50% marks. ii. M.Sc. in Biotechnology/ Molecular Biology/Molecular Genetics/Bioinformatics/Genetics/Plant Breeding/Plant Breeding &amp; Genetics with at least 6.50/10.00 or 65% marks. iii. Ph.D. in the relevant field with minimum OCPA 6.50/10.00 or 65% marks<br />Pay Scale : Rs.24000/-<br />Application Fee : A Bank Draft of Rs. 200/- in favour of Comptroller, Punjab Agricultural University, Ludhiana <br /> <br />How to apply<br />Walk in Interview will be held on 26.09.2016 at 11:30 a.m. in the office of the Director, School of Agricultural Biotechnology. No separate information for interview will be sent. No TA/DA will be paid for attending the interview. Candidate Should apply with detailed bio data to this office latest by 19.04.2016</p>

<p>More at http://web.pau.edu/index.php?_act=manageAllBanner&amp;DO=viewAllBanner</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/33223/tbl2asn-a-command-line-program-that-automates-the-creation-of-sequence-records-for-submission-to-genbank</guid>
	<pubDate>Mon, 29 May 2017 07:37:08 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/33223/tbl2asn-a-command-line-program-that-automates-the-creation-of-sequence-records-for-submission-to-genbank</link>
	<title><![CDATA[Tbl2asn: a command-line program that automates the creation of sequence records for submission to GenBank]]></title>
	<description><![CDATA[<p>Tbl2asn is a command-line program that automates the creation of sequence records for submission to GenBank. It uses many of the same functions as Sequin but is driven generally by data files. Tbl2asn generates .sqn files for submission to GenBank. Additional manual editing is not required before submission.</p>
<p>Tbl2asn is available by anonymous&nbsp;<a href="ftp://ftp.ncbi.nih.gov/toolbox/ncbi_tools/converters/by_program/tbl2asn/">FTP</a>. Copy the right version for your platform, then uncompress the file, rename it to "tbl2asn", and set the permissions, as necessary for the platform.</p>
<p>&nbsp;</p><p>Address of the bookmark: <a href="https://www.ncbi.nlm.nih.gov/genbank/tbl2asn2/" rel="nofollow">https://www.ncbi.nlm.nih.gov/genbank/tbl2asn2/</a></p>]]></description>
	<dc:creator>Poonam Mahapatra</dc:creator>
</item>

</channel>
</rss>