<?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/36861?offset=570</link>
	<atom:link href="https://bioinformaticsonline.com/related/36861?offset=570" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34394/tulip-the-uncorrected-long-read-itegration-pipeline</guid>
	<pubDate>Thu, 23 Nov 2017 09:30:01 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34394/tulip-the-uncorrected-long-read-itegration-pipeline</link>
	<title><![CDATA[TULIP - The Uncorrected Long read Itegration Pipeline]]></title>
	<description><![CDATA[<p>#Running TULIP (The Uncorrected Long-read Integration Process), version 0.4 late 2016 (European eel)</p>
<p>TULIP currently consists of to Perl scripts, tulipseed.perl and tulipbulb.perl. These are very much intended as prototypes, and additional components and/or implementations are likely to follow.&nbsp;<br>Tulipseed takes as input alignments files of long reads to sparse short seeds, and outputs a graph and scaffold structures. Tulipbulb adds long read sequencing data to these.</p>
<p>&nbsp;</p>
<p>https://github.com/Generade-nl/TULIP</p><p>Address of the bookmark: <a href="https://github.com/Generade-nl/TULIP" rel="nofollow">https://github.com/Generade-nl/TULIP</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36632/tulip-the-uncorrected-long-read-integration-pipeline</guid>
	<pubDate>Tue, 15 May 2018 09:06:37 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36632/tulip-the-uncorrected-long-read-integration-pipeline</link>
	<title><![CDATA[TULIP - The Uncorrected Long read Integration Pipeline]]></title>
	<description><![CDATA[TULIP currently consists of two Perl scripts, tulipseed.perl and tulipbulb.perl. These are very much intended as prototypes, and additional components and/or implementations are likely to follow.

Tulipseed takes as input alignments files of long reads to sparse short seeds, and outputs a graph and scaffold structures.<p>Address of the bookmark: <a href="https://github.com/Generade-nl/TULIP" rel="nofollow">https://github.com/Generade-nl/TULIP</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/34702/run-miniasm-assembler-on-nanopore-reads</guid>
	<pubDate>Mon, 18 Dec 2017 04:07:50 -0600</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/34702/run-miniasm-assembler-on-nanopore-reads</link>
	<title><![CDATA[Run miniasm assembler on nanopore reads !]]></title>
	<description><![CDATA[<p>Miniasm is a very fast OLC-based&nbsp;<em>de novo</em>&nbsp;assembler for noisy long reads. It takes all-vs-all read self-mappings (typically by&nbsp;<a href="https://github.com/lh3/minimap">minimap</a>) as input and outputs an assembly graph in the&nbsp;<a href="https://github.com/pmelsted/GFA-spec/blob/master/GFA-spec.md">GFA</a>&nbsp;format. Different from mainstream assemblers, miniasm does not have a consensus step. It simply concatenates pieces of read sequences to generate the final&nbsp;<a href="http://wgs-assembler.sourceforge.net/wiki/index.php/Celera_Assembler_Terminology">unitig</a>&nbsp;sequences. Thus the per-base error rate is similar to the raw input reads.</p><p>Find the detail of the reads repeats:</p><blockquote><p>fq2fa ONT_A.fastq ONT_A.fasta&nbsp;<br /><br />minimap2 -xava-ont ONT_A.fasta ONT_A.fasta -t10 -X &gt; AONT.paf&nbsp;<br /><br />awk '{if($1==$6){print}}' AONT.paf &gt; AONTself.paf&nbsp;<br /><br />awk '$5=="-"' AONTself.paf | awk '{print $1}'| sort|uniq &gt; invertedrepeat.list</p></blockquote><p>Generated a few palindrome and repeats plots (highlighting only repeats largest than 10, 20 and 30 kb)</p><blockquote><p>minidot -f 5 -m 30000 AONTself.paf &gt; AONTself30000.eps&nbsp;<br />sed 's/_template_pass_FAH31515//' AONTself30000.eps &gt; AONTself30000final.eps&nbsp;<br /><br />minidot -f 5 -m 20000 AONTself.paf &gt; AONTself20000.eps&nbsp;<br />sed 's/_template_pass_FAH31515//' AONTself20000.eps &gt; AONTself20000final.eps&nbsp;<br /><br />minidot -f 5 -m 10000 AONTself.paf &gt; AONTself10000.eps&nbsp;<br />sed 's/_template_pass_FAH31515//' AONTself10000.eps &gt; AONTself10000final.eps&nbsp;</p></blockquote><p>Assemble with miniasm:</p><blockquote><p>miniasm -f ONT_A.fasta AONT.paf &gt; AONT.gfa&nbsp;</p><p>grep '^S' AONT.gfa |awk '{print "&gt;"$2"\n"$3}' &gt; AONT_miniasm.fasta&nbsp;<br /><br />minimap2 -xasm10 AONT_miniasm.fasta AONT_miniasm.fasta -t1 -X &gt; AONT_miniasm.paf&nbsp;<br /><br />awk '{if($1==$6){print}}' AONT_miniasm.paf &gt; AONT_miniasm_self.paf&nbsp;<br /><br />minidot -f 5 -m 10000 AONT_miniasm_self.paf &gt; AONT_miniasm_self10000.eps&nbsp;</p></blockquote><p>Njoy the assembly !</p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/36630/frequent-paired-end-reads-pe-2x100-mapping-command-lines</guid>
	<pubDate>Tue, 15 May 2018 08:59:29 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/36630/frequent-paired-end-reads-pe-2x100-mapping-command-lines</link>
	<title><![CDATA[Frequent Paired-end reads (PE 2x100) mapping command lines]]></title>
	<description><![CDATA[
<p>bowtie2 -x hs37m -X 650 -q -1 r1.fq -2 r2.fq -S r12.bowtie2.sam  </p>

<p>bwa aln hs37m.fa r1.fq &gt; r1.sai &amp;&amp; bwa aln hs37m.fa r2.fq &gt; r2.sai \  <br />    &amp;&amp; bwa sampe hs37m r1.sai r2.sai r1.fq r2.fq &gt; r12.bwa.sam  </p>

<p>bwa bwasw ../index/bwa/hs37m.fa r12.fq &gt; r12.bwasw.sam  </p>

<p>gsnap -A sam -d hs37m r1.fq r2.fq &gt; r12.gsnap.sam  </p>

<p>novoalign -r Random -o SAM -f r1.fq r2.fq -i 500 50 -d hs37m-k14s3.novo &gt; r12.novo.sam  </p>

<p>smalt map -f samsoft -i 650 -o r12.smalt-k20s13.sam hs37m-k20s13 r1.fq r2.fq  </p>

<p>stampy.py -g hs37m -h hs37m -o r12.stampy.sam -M r1.fq,r2.fq  </p>

<p>soap -D hs37m.fa.index -a r1.fq -b r2.fq -l 32 -g 3 -u dummy -2 dummy -o r12.soap</p>
]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36895/npscarf-real-time-scaffolder-using-spades-contigs-and-nanopore-sequencing-reads</guid>
	<pubDate>Mon, 11 Jun 2018 05:14:57 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36895/npscarf-real-time-scaffolder-using-spades-contigs-and-nanopore-sequencing-reads</link>
	<title><![CDATA[npScarf: real-time scaffolder using SPAdes contigs and Nanopore sequencing reads]]></title>
	<description><![CDATA[npScarf (jsa.np.npscarf) is a program that connect contigs from a draft genomes to generate sequences that are closer to finish. These pipelines can run on a single laptop for microbial datasets. In real-time mode, it can be integrated with simple structural analyses such as gene ordering, plasmid forming.<p>Address of the bookmark: <a href="http://japsa.readthedocs.io/en/latest/tools/jsa.np.npscarf.html" rel="nofollow">http://japsa.readthedocs.io/en/latest/tools/jsa.np.npscarf.html</a></p>]]></description>
	<dc:creator>Shruti Paniwala</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37759/pandaseq-is-a-program-to-align-illumina-reads-optionally-with-pcr-primers-embedded-in-the-sequence-and-reconstruct-an-overlapping-sequence</guid>
	<pubDate>Fri, 21 Sep 2018 10:19:52 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37759/pandaseq-is-a-program-to-align-illumina-reads-optionally-with-pcr-primers-embedded-in-the-sequence-and-reconstruct-an-overlapping-sequence</link>
	<title><![CDATA[PANDASEQ is a program to align Illumina reads, optionally with PCR primers embedded in the sequence, and reconstruct an overlapping sequence.]]></title>
	<description><![CDATA[<p>Development packages for zlib and libbz2 are needed, as well as a standard compiler environment. On Ubuntu, this can be installed via:</p>
<pre><code>sudo apt-get install build-essential libtool automake zlib1g-dev libbz2-dev pkg-config
</code></pre>
<p>On MacOS, the Apple Developer tools and Fink (or MacPorts or Brew) must be installed, then:</p>
<pre><code>sudo fink install bzip2-dev pkgconfig</code></pre><p>Address of the bookmark: <a href="https://github.com/neufeld/pandaseq" rel="nofollow">https://github.com/neufeld/pandaseq</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40460/sviper-swipe-your-structural-variants-called-on-long-ontpacbio-reads-with-short-exact-illumina-reads</guid>
	<pubDate>Sun, 22 Dec 2019 03:48:28 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40460/sviper-swipe-your-structural-variants-called-on-long-ontpacbio-reads-with-short-exact-illumina-reads</link>
	<title><![CDATA[SViper: Swipe your Structural Variants called on long (ONT/PacBio) reads with short exact (Illumina) reads.]]></title>
	<description><![CDATA[<p>Call sviper</p>
<pre><code>~$ ./sviper -s short-reads.bam -l long-reads.bam -r ref.fa -c variants.vcf -o polished_variants
</code></pre>
<p>This will output a&nbsp;<code>polished_variants.vcf</code>&nbsp;file, that contains all the refined variants.</p>
<p>Sometimes it is helpful to look at the polished sequence, e.g. with the IGV browser. In that case you want SViper to output the polished and aligned sequences in a bam file via the option&nbsp;<code>--output-polished-bam</code>:</p>
<pre><code>~$ ./sviper -s short-reads.bam -l long-reads.bam -r ref.fa -c variants.vcf -o polished_variants --output-</code>polished-bam</pre><p>Address of the bookmark: <a href="https://github.com/smehringer/SViper" rel="nofollow">https://github.com/smehringer/SViper</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41030/slr-superscaffolder-a-scaffold-assemble-pipeline-for-stlfr-reads</guid>
	<pubDate>Fri, 14 Feb 2020 14:23:30 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41030/slr-superscaffolder-a-scaffold-assemble-pipeline-for-stlfr-reads</link>
	<title><![CDATA[SLR-superscaffolder: A scaffold assemble pipeline for stLFR reads.]]></title>
	<description><![CDATA[<p>This is a scaffold assembler designed for stLFR reads[1]. It uses the link-reads information from stLFR reads to assemble contigs to scaffolds.</p>
<p>Here is an illustration of this pipeline:</p>
<p>&nbsp;<img src="https://github.com/BGI-Qingdao/SLR-superscaffolder/raw/master/image.png" alt="image" style="border: 0px;"></p><p>Address of the bookmark: <a href="https://github.com/BGI-Qingdao/SLR-superscaffolder" rel="nofollow">https://github.com/BGI-Qingdao/SLR-superscaffolder</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<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/blog/view/44234/steps-to-find-palindrome-in-genomes</guid>
	<pubDate>Thu, 09 Mar 2023 02:56:54 -0600</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/44234/steps-to-find-palindrome-in-genomes</link>
	<title><![CDATA[Steps to find palindrome in genomes !]]></title>
	<description><![CDATA[<div><div><div><div><div><div><div><div><div><div><p>Palindromes are sequences of nucleotides that read the same backward as forward. They can be present in genomes and have various biological functions. Here are some methods for discovering palindromes in genomes:</p><ol>
<li>
<p>Direct sequence search: One of the simplest ways to discover palindromes is to search the genome sequence directly for palindromic sequences using pattern matching tools, such as regular expressions or string algorithms. This approach can be useful for discovering simple palindromes, but may miss more complex palindromic structures.</p>
</li>
<li>
<p>Dot plot analysis: Dot plot analysis is a graphical method that can be used to identify palindromic regions in a genome. It involves plotting the genome sequence against itself and examining the diagonal patterns that emerge. Palindromic regions will appear as symmetrical patterns along the diagonal.</p>
</li>
<li>
<p>Restriction enzyme analysis: Some restriction enzymes, such as EcoRI and HindIII, recognize palindromic sequences and cleave DNA at these sites. By digesting the genome with these enzymes and examining the resulting fragments, palindromic regions can be identified.</p>
</li>
<li>
<p>Next-generation sequencing: High-throughput sequencing technologies, such as PacBio and Oxford Nanopore, can generate long reads that can span entire palindromic regions. By mapping these reads to the genome, palindromic regions can be identified and characterized.</p>
</li>
<li>
<p>Comparative genomics: Comparing the genomes of related species can also reveal palindromic regions that are conserved across evolutionarily divergent lineages. This approach can help identify functional palindromes that are under selective pressure.</p>
</li>
</ol><p>Overall, the discovery of palindromic sequences in genomes can be accomplished using a variety of methods, each with their own advantages and limitations. A combination of these methods can provide a comprehensive understanding of the palindromic landscape of a genome.</p></div></div></div></div></div></div></div></div></div></div>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>

</channel>
</rss>