<?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/29384?offset=980</link>
	<atom:link href="https://bioinformaticsonline.com/related/29384?offset=980" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42477/hifiasm-a-haplotype-resolved-assembler-for-accurate-hifi-reads</guid>
	<pubDate>Thu, 24 Dec 2020 10:03:36 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42477/hifiasm-a-haplotype-resolved-assembler-for-accurate-hifi-reads</link>
	<title><![CDATA[Hifiasm: a haplotype-resolved assembler for accurate Hifi reads]]></title>
	<description><![CDATA[<p><span>Hifiasm is a fast haplotype-resolved de novo assembler for PacBio Hifi reads. It can assemble a human genome in several hours and works with the California redwood genome, one of the most complex genomes sequenced so far. Hifiasm can produce primary/alternate assemblies of quality competitive with the best assemblers. It also introduces a new graph binning algorithm and achieves the best haplotype-resolved assembly given trio data.</span></p><p>Address of the bookmark: <a href="https://github.com/chhylp123/hifiasm" rel="nofollow">https://github.com/chhylp123/hifiasm</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/22388/perl-one-liner-basics</guid>
	<pubDate>Sun, 24 May 2015 09:28:33 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/22388/perl-one-liner-basics</link>
	<title><![CDATA[Perl One liner basics !!]]></title>
	<description><![CDATA[<p>Perl has a ton of command line switches (see perldoc perlrun), but I'm just going to cover the ones you'll commonly need to debug code. The most important switch is -e, for execute (or maybe "engage" :) ). The -e switch takes a quoted string of Perl code and executes it. For example:<br /><br />$ perl -e 'print "Hello, World!\n"'<br />Hello, World!<br /><br />It's important that you use single-quotes to quote the code for -e. This usually means you can't use single-quotes within the one liner code. If you're using Windows cmd.exe or PowerShell, you must use double-quotes instead.<br /><br />I'm always forgetting what Perl's predefined special variables do, and often test them at the command line with a one liner to see what they contain. For instance do you remember what $^O is?<br /><br />$ perl -e 'print "$^O\n"'<br />linux<br /><br />It's the operating system name. With that cleared up, let's see what else we can do. If you're using a relatively new Perl (5.10.0 or higher) you can use the -E switch instead of -e. This turns on some of Perl's newer features, like say, which prints a string and appends a newline to it. This saves typing and makes the code cleaner:<br /><br />$ perl -E 'say "$^O"'<br />linux<br /><br />Pretty handy! say is a nifty feature that you'll use again and again.</p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<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/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/researchlabs/view/22416/rosenberg-lab</guid>
  <pubDate>Wed, 27 May 2015 17:52:24 -0500</pubDate>
  <link></link>
  <title><![CDATA[Rosenberg lab]]></title>
  <description><![CDATA[
<p>Research. Research in the lab focuses on mathematical, statistical, and computational problems in evolutionary biology and human genetics. Long-term interests of the lab include topics such as:</p>

<p>    Human genetic variation<br />    Inference of human evolutionary history from genetic markers<br />    Statistical analysis of population-genetic data<br />    Mathematical models of gene genealogies<br />    Theoretical population genetics<br />    Combinatorics of evolutionary trees<br />    The relationship between gene trees and species trees<br />    The role of human evolutionary genetics in the search for genes that contribute to disease-susceptibility <br />More at https://web.stanford.edu/group/rosenberglab/index.html</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/opportunity/view/22437/jrf-bioinformatics-icar-national-research-centre-for-orchids-pakyong</guid>
  <pubDate>Thu, 28 May 2015 19:33:19 -0500</pubDate>
  <link></link>
  <title><![CDATA[JRF Bioinformatics @ ICAR - National Research Centre for Orchids  Pakyong]]></title>
  <description><![CDATA[
<p>ICAR - National Research Centre for Orchids</p>

<p>Pakyong</p>

<p>F.No:NRCO/Admn/DBT /136 /</p>

<p>Walk-in-Interviews will be held at 737106, Sikkim for the post of 01 (One Project ‘DBT’s Twinning programme for the NE’ titled “Assessment of some fragrant orchids of north-east India for sustainable improvement of community livelihood”, indicated below. The appointment will be on contractual basis and the incumbents shall not have any regular appointment in ICAR.</p>

<p>‘DBT’s Twinning programme for the NE’ titled “Assessment of chemical and genetic divergence of some fragrant orchids of north-east India for sustainable improvement of community livelihood”</p>

<p>Junior Research Fellow (One post)</p>

<p>Essential Qualification : a. MSc (with NET qualification) / M.Tech degree (with or without NET) with minimum 55% marks in Biotechnology/ Bioinformatics/ Molecular Biology or any other related field.</p>

<p>Desirable Qualification: Computer Skills (Linux, Perl, Java, MySQL) with experience in advanced molecular Biology techniques</p>

<p>2nd June 2015</p>

<p>Advertisement: www.nrcorchids.nic.in/Employments/Vacancy%20-%20JRF.pdf</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/22570/frequent-words-problem-solution-by-perl</guid>
	<pubDate>Tue, 09 Jun 2015 23:38:44 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/22570/frequent-words-problem-solution-by-perl</link>
	<title><![CDATA[Frequent words problem solution by Perl]]></title>
	<description><![CDATA[<div><p>Solved with perl <a href="http://rosalind.info/problems/1a/">http://rosalind.info/problems/1a/</a></p><p>#Find the most frequent k-mers in a string.<br />#Given: A DNA string Text and an integer k.<br />#Return: All most frequent k-mers in Text (in any order).<br /><br />use strict;<br />use warnings;<br /><br />my $string="ACGTTGCATGTCGCATGATGCATGAGAGCT";<br />my $kmer=4; <br />my %myHash;<br />my $max=0;<br /><br />for (my $aa=0; $aa&lt;=(length($string)-4); $aa++) {<br />&nbsp;&nbsp; &nbsp;my $myStr=substr&nbsp; $string, $aa,$kmer;<br />&nbsp;&nbsp; &nbsp;#print "$myStr\n";<br />&nbsp;&nbsp; &nbsp;my $km=kmerMatch ($string, $myStr, $kmer);<br />&nbsp;&nbsp; &nbsp;if ($km &gt; $max) { $max = $km;}<br />&nbsp;&nbsp; &nbsp;#print "$km\t$myStr\n";<br />&nbsp;&nbsp; &nbsp;$myHash{$myStr}=$km;<br />&nbsp;&nbsp; &nbsp;<br />}<br /><br />#Print all key which have matching values<br />foreach my $name (keys %myHash){<br />&nbsp;&nbsp;&nbsp; print "$name " if $myHash{$name} == $max;<br />}<br /><br />sub kmerMatch { #Check the exact matching kmers with sliding window<br />my ($string, $myStr, $kmer)=@_;<br />my $count=0;<br />for (my $aa=0; $aa&lt;=(length($string)-4); $aa++) {<br />&nbsp;&nbsp; &nbsp;my $myWin=substr&nbsp; $string, $aa,$kmer;<br />&nbsp;&nbsp; &nbsp;if ($myWin eq $myStr) {<br />&nbsp;&nbsp; &nbsp;&nbsp;&nbsp; &nbsp;#print "$myWin eq $myStr\n";<br />&nbsp;&nbsp; &nbsp;&nbsp;&nbsp; &nbsp;$count++;<br />&nbsp;&nbsp; &nbsp;}<br />}<br />return $count;<br />}</p></div>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/22572/clump-finding-problem-solved-with-perl</guid>
	<pubDate>Wed, 10 Jun 2015 00:17:17 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/22572/clump-finding-problem-solved-with-perl</link>
	<title><![CDATA[Clump Finding Problem Solved with Perl]]></title>
	<description><![CDATA[<p>The question at http://rosalind.info/problems/1d/</p><p>Script are moved to&nbsp;http://bioinformaticsonline.com/snippets/view/34633/clump-finding-problem-solved-with-perl</p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/22786/ra-at-university-of-delhi</guid>
  <pubDate>Wed, 17 Jun 2015 20:35:35 -0500</pubDate>
  <link></link>
  <title><![CDATA[RA at University of Delhi]]></title>
  <description><![CDATA[
<p>Research Scientist Jobs opportunity in University of Delhi on temporary basis</p>

<p>Qualifications : Ph. D.</p>

<p>Desirable : Experience on DNA Markers, plant genome mapping and bioinformatics</p>

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

<p>Department : Genetics</p>

<p>Salary : Rs. 60,000/-<br />How to apply</p>

<p>The applicants are requested to register their names on the day of interview in the First Floor, Biotech Centre, Centre for Genetic Manipulation of Crop Plants, Department of Genetics before the stipulated time for the interview. Only the registered eligible candidates will be interviewed on the day in the Committee Room. Applicants are requested to bring all related documents, in original and a set of photocopy, for verification. Date and time of the interview : 25.06.2015 at 10:30 AM.</p>

<p>Click Here for Job Details http://www.du.ac.in/du/index.php?mact=News,cntnt01,detail,0&amp;cntnt01articleid=5492&amp;cntnt01returnid=83</p>
]]></description>
</item>

</channel>
</rss>