<?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/34620?offset=10</link>
	<atom:link href="https://bioinformaticsonline.com/related/34620?offset=10" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36239/scilifelab-tutorial-for-bioinformatics-analysis</guid>
	<pubDate>Tue, 17 Apr 2018 04:33:00 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36239/scilifelab-tutorial-for-bioinformatics-analysis</link>
	<title><![CDATA[SciLifeLab tutorial for bioinformatics analysis !]]></title>
	<description><![CDATA[<p>SciLifeLab is a national center for molecular biosciences with focus on health and environmental research.</p>
<h2 id="courses">Courses</h2>
<p><a href="http://uppnex.se/twiki/bin/view/Courses/">Old courses (2012-2014)</a></p>
<h3 id="metagenomics-workshop">Metagenomics Workshop</h3>
<p><a href="https://scilifelab.github.io/courses/Metagenomics/1511/">2015 November - Uppsala</a><br><a href="https://scilifelab.github.io/courses/Metagenomics/1611/">2016 November - Uppsala</a><br><a href="https://scilifelab.github.io/courses/Metagenomics/1711/">2017 November - Uppsala</a></p>
<h3 id="introduction-to-bioinformatics-using-ngs-data">Introduction to Bioinformatics Using NGS Data</h3>
<p><a href="https://scilifelab.github.io/courses/ngsintro/1502/">2015 February - Uppsala</a>&nbsp;<br><a href="https://scilifelab.github.io/courses/ngsintro/1505/">2015 May - Gothenburg</a><br><a href="https://scilifelab.github.io/courses/ngsintro/1509/">2015 September - Uppsala</a><br><a href="https://scilifelab.github.io/courses/ngsintro/1511/">2015 November - Lund</a><br><a href="https://scilifelab.github.io/courses/ngsintro/1601/">2016 January - Uppsala</a><br><a href="https://scilifelab.github.io/courses/ngsintro/1604/">2016 April - Link&ouml;ping</a><br><a href="https://scilifelab.github.io/courses/ngsintro/1609/">2016 September - Uppsala</a><br><a href="https://scilifelab.github.io/courses/ngsintro/1611/">2016 November - Ume&aring;</a><br><a href="https://scilifelab.github.io/courses/ngsintro/1701/">2017 January - Uppsala</a><br><a href="https://scilifelab.github.io/courses/ngsintro/1705/">2017 May - Gothenburg</a><br><a href="https://scilifelab.github.io/courses/ngsintro/1709/">2017 September - Lund</a><br><a href="https://scilifelab.github.io/courses/ngsintro/1711/">2017 November - Uppsala</a><br><a href="https://scilifelab.github.io/courses/ngsintro/1802/">2018 February - Uppsala</a></p>
<h3 id="introduction-to-genome-annotation">Introduction to Genome Annotation</h3>
<p><a href="https://scilifelab.github.io/courses/annotation/2015/">2015 April - Uppsala</a><br><a href="https://scilifelab.github.io/courses/annotation/2016/">2016 April - Uppsala</a><br><a href="https://scilifelab.github.io/courses/annotation/2017/">2017 April - Uppsala</a><br><a href="https://scilifelab.github.io/courses/annotation/2018/">2018 May - Uppsala</a></p>
<h3 id="de-novo-genome-assembly">De Novo Genome Assembly</h3>
<p><a href="https://scilifelab.github.io/courses/assembly/1611/">2016 November - Uppsala</a><br><a href="https://scilifelab.github.io/courses/assembly/2017-11-15/">2017 November - Uppsala</a></p>
<h3 id="rna-seq-course">RNA-seq course</h3>
<p><a href="https://scilifelab.github.io/courses/rnaseq/1510/">2015 October - Uppsala</a><br><a href="https://scilifelab.github.io/courses/rnaseq/1604/">2016 April - Uppsala</a><br><a href="https://scilifelab.github.io/courses/rnaseq/1610/">2016 October - Uppsala</a><br><a href="https://scilifelab.github.io/courses/rnaseq/1703/">2017 March - Uppsala</a><br><a href="https://scilifelab.github.io/courses/rnaseq/1711/">2017 November - Uppsala</a><br><a href="https://scilifelab.github.io/courses/rnaseq/labs">RNAseq tutorials</a></p>
<h3 id="r-programming-foundations-for-life-scientists">R Programming Foundations for Life Scientists</h3>
<p><a href="https://scilifelab.github.io/courses/r_programming/1611/">2016 November - Uppsala</a><br><a href="https://scilifelab.github.io/courses/r_programming/1703/">2017 Mars - Uppsala</a></p>
<h3 id="single-cell-rna-sequencing-analysis">Single cell RNA sequencing analysis</h3>
<p><a href="https://scilifelab.github.io/courses/scrnaseq/1710/">2017 October - Uppsala</a></p><p>Address of the bookmark: <a href="https://scilifelab.github.io/courses/" rel="nofollow">https://scilifelab.github.io/courses/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36592/lachesis-genome-assembly-with-hi-c-based-contact-probability-maps-lachesis</guid>
	<pubDate>Mon, 14 May 2018 04:26:30 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36592/lachesis-genome-assembly-with-hi-c-based-contact-probability-maps-lachesis</link>
	<title><![CDATA[LACHESIS: Genome Assembly with Hi-C-based Contact Probability Maps (LACHESIS)]]></title>
	<description><![CDATA[<p>LACHESIS is method that exploits contact probability map data (e.g. from Hi-C) for chromosome-scale&nbsp;<em>de novo</em>&nbsp;genome assembly.</p>
<p>Further information about LACHESIS, including source code, documentation and a user's guide are available at:&nbsp;<a href="http://shendurelab.github.io/LACHESIS/">http://shendurelab.github.io/LACHESIS</a>.</p>
<p>Manuscript describing LACHESIS was published as: Burton JN#, Adey A, Patwardhan RP, Qiu R, Kitzman JO, Shendure J#.&nbsp;<em>Chromosome-scale scaffolding of de novo genome assemblies based on chromatin interactions.</em>&nbsp;Nature Biotechnology 2013 Dec;31(12):1119-25. doi:&nbsp;<a href="http://dx.doi.org/10.1038/nbt.2727">10.1038/nbt.272</a>. PubMed PMID:&nbsp;<a href="http://www.ncbi.nlm.nih.gov/pubmed/24185095">24185095</a>.</p>
<p>&nbsp;</p>
<p>http://shendurelab.github.io/LACHESIS/</p><p>Address of the bookmark: <a href="http://shendurelab.github.io/LACHESIS/" rel="nofollow">http://shendurelab.github.io/LACHESIS/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/43401/levenshtein-and-damerau-levenshtein-distance</guid>
	<pubDate>Tue, 28 Sep 2021 04:38:55 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/43401/levenshtein-and-damerau-levenshtein-distance</link>
	<title><![CDATA[Levenshtein and Damerau-Levenshtein distance !]]></title>
	<description><![CDATA[<h3><strong>Levenshtein Distance</strong></h3><p>Also known as <strong>Edit Distance</strong>, it is the number of transformations (deletions, insertions, or substitutions) required to transform a source string into the target one. For example, if the target term is &ldquo;book&rdquo; and the source is &ldquo;back&rdquo;, you will need to change the first &ldquo;o&rdquo; to &ldquo;a&rdquo; and the second &ldquo;o&rdquo; to &ldquo;c&rdquo;, which will give us a Levenshtein Distance of 2.Edit Distance is very easy to implement, and it is a popular challenge during code interviews </p><p>Additionally, some frameworks also support the Damerau-Levenshtein distance:</p><p>&nbsp;</p><h3><strong>Damerau-Levenshtein distance</strong></h3><p>It is an extension to Levenshtein Distance, allowing one extra operation: <strong><em>Transposition</em></strong>&nbsp;of two adjacent characters:</p><p><strong>Ex: </strong>TSAR to STAR</p><p><strong>Damerau-Levenshtein distance = </strong>1&nbsp; (Switching S and T positions cost only one operation)</p><p><strong>Levenshtein distance = 2&nbsp;</strong> (Replace S by T and T by S)</p>]]></description>
	<dc:creator>Surabhi Chaudhary</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40208/ragoo-fast-reference-guided-scaffolding-of-genome-assembly-contigs</guid>
	<pubDate>Sun, 27 Oct 2019 00:57:23 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40208/ragoo-fast-reference-guided-scaffolding-of-genome-assembly-contigs</link>
	<title><![CDATA[RaGOO: Fast Reference-Guided Scaffolding of Genome Assembly Contigs]]></title>
	<description><![CDATA[<p>Alonge M, Soyk S, Ramakrishnan S, Wang X, Goodwin S, Sedlazeck FJ, Lippman ZB, Schatz MC:&nbsp;<a href="https://www.biorxiv.org/content/early/2019/01/13/519637">Fast and accurate reference-guided scaffolding of draft genomes</a>.&nbsp;<em>bioRxiv</em>&nbsp;2019.</p>
<p>RaGOO is a tool for coalescing genome assembly contigs into pseudochromosomes via minimap2 alignments to a closely related reference genome. The focus of this tool is on practicality and therefore has the following features:</p>
<ol>
<li>Good performance. On a MacBook Pro using Arabidopsis data, pseudochromosome construction takes less than a minute and the whole pipeline with SV calling takes ~2 minutes.</li>
<li>Intact ordering and orienting of contigs.</li>
<li><a href="https://github.com/malonge/RaGOO/wiki/Misassembly-Correction">Misassembly correction</a></li>
<li><a href="https://github.com/malonge/RaGOO/wiki/GFF-File-Lift-Over">GFF lift-over</a></li>
<li><a href="https://github.com/malonge/RaGOO/wiki/Calling-Structural-Variants">Structural variant calling with and integrated version of Assemblytics</a></li>
<li>Confidence scores associated with the grouping, localization, and orientation for each contig.</li>
</ol><p>Address of the bookmark: <a href="https://github.com/malonge/RaGOO" rel="nofollow">https://github.com/malonge/RaGOO</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44902/hite-a-fast-and-accurate-dynamic-boundary-adjustment-approach-for-full-length-transposable-elements-detection-and-annotation-in-genome-assemblies</guid>
	<pubDate>Sat, 20 Sep 2025 09:34:04 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44902/hite-a-fast-and-accurate-dynamic-boundary-adjustment-approach-for-full-length-transposable-elements-detection-and-annotation-in-genome-assemblies</link>
	<title><![CDATA[HiTE: a fast and accurate dynamic boundary adjustment approach for full-length Transposable Elements detection and annotation in Genome Assemblies]]></title>
	<description><![CDATA[<p dir="auto"><code>HiTE</code>&nbsp;is a Python software that uses a dynamic boundary adjustment approach to detect and annotate full-length Transposable Elements in Genome Assemblies. In comparison to other tools, HiTE demonstrates superior performance in detecting a greater number of full-length TEs.</p>
<div dir="auto">
<h2 dir="auto">panHiTE</h2>
<a href="https://github.com/CSU-KangHu/HiTE#panhite"></a></div>
<p dir="auto">We have developed panHiTE, a comprehensive and accurate pipeline for TE detection in large-scale population genomes. It has been successfully applied to hundreds of plant population genomes, demonstrating its effectiveness and scalability.</p>
<p dir="auto">For detailed instructions, please refer to the&nbsp;<a href="https://github.com/CSU-KangHu/HiTE/wiki/panHiTE-tutorial">panHiTE tutorial</a>.</p><p>Address of the bookmark: <a href="https://github.com/CSU-KangHu/HiTE" rel="nofollow">https://github.com/CSU-KangHu/HiTE</a></p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34328/dfast-a-flexible-prokaryotic-genome-annotation-pipeline-for-faster-genome-publication</guid>
	<pubDate>Tue, 14 Nov 2017 10:26:16 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34328/dfast-a-flexible-prokaryotic-genome-annotation-pipeline-for-faster-genome-publication</link>
	<title><![CDATA[DFAST: a flexible prokaryotic genome annotation pipeline for faster genome publication]]></title>
	<description><![CDATA[<p>We developed a prokaryotic genome annotation pipeline, DFAST, that also supports genome submission to public sequence databases. DFAST was originally started as an on-line annotation server, and to date, over 7,000 jobs have been processed since its first launch in 2016. Here, we present a newly implemented background annotation engine for DFAST, which is also available as a standalone command-line program. The new engine can annotate a typical-sized bacterial genome within 10 minutes, with rich information such as pseudogenes, translation exceptions, and orthologous gene assignment between given reference genomes. In addition, the modular framework of DFAST allows users to customize the annotation workflow easily and will also facilitate extensions for new functions and incorporation of new tools in the future.</p>
<div>Availability and Implementation</div>
<p>The software is implemented in Python 3 and runs in both Python 2.7 and 3.4&ndash; on Macintosh and Linux systems. It is freely available at&nbsp;<a href="https://github.com/nigyta/dfast_core/" target="">https://github.com/nigyta/dfast_core/</a>&nbsp;under the GPLv3 license with external binaries bundled in the software distribution. An on-line version is also available at&nbsp;<a href="https://dfast.nig.ac.jp/" target="">https://dfast.nig.ac.jp/</a>.</p><p>Address of the bookmark: <a href="https://dfast.nig.ac.jp/" rel="nofollow">https://dfast.nig.ac.jp/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37211/jbrowse-embeddable-genome-browser-built-completely-with-javascript-and-html5</guid>
	<pubDate>Fri, 29 Jun 2018 09:19:56 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37211/jbrowse-embeddable-genome-browser-built-completely-with-javascript-and-html5</link>
	<title><![CDATA[JBrowse: Embeddable genome browser built completely with JavaScript and HTML5]]></title>
	<description><![CDATA[JBrowse is a fast, embeddable genome browser built completely with JavaScript and HTML5, with optional run-once data formatting tools written in Perl.

Headline Features:
Fast, smooth scrolling and zooming. Explore your genome with unparalleled speed.
Scales easily to multi-gigabase genomes and deep-coverage sequencing.
Quickly open and view data files on your computer without uploading them to any server.
Supports GFF3, BED, FASTA, Wiggle, BigWig, BAM, VCF (with either .tbi or .idx index), REST, and more.  BAM, BigBed, BigWig, and VCF data are displayed directly from chunks of the compressed binary files, no conversion needed.
Includes an optional “faceted” track selector (see demo) suitable for large installations with thousands of tracks.
Very light server resource requirements. In fact, JBrowse has no back-end server code, just tools for formatting data files to be read directly over HTTP. Serve huge datasets from a single low-cost cloud instance.
Can run as a stand-alone app on OSX and Windows using the Electron platform
Highly extensible plugin architecture, with a large plugin registry of existing examples here https://gmod.github.io/jbrowse-registry

https://jbrowse.org/<p>Address of the bookmark: <a href="https://github.com/GMOD/jbrowse" rel="nofollow">https://github.com/GMOD/jbrowse</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36594/fragscaff-genome-assembly-with-contiguity-preserving-transposition</guid>
	<pubDate>Mon, 14 May 2018 04:28:14 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36594/fragscaff-genome-assembly-with-contiguity-preserving-transposition</link>
	<title><![CDATA[fragScaff: Genome Assembly with Contiguity Preserving Transposition]]></title>
	<description><![CDATA[<p>Contiguity preserving transposition and sequencing (CPT-seq) is an entirely in vitro means of generating libraries comprised of 9216 indexed pools, each of which contains thousands of sparsely sequenced long fragments ranging from 5 kilobases to &gt;1 megabase. This software, fragScaff, leverages coincidences between the content of different pools as a source of contiguity information for scaffolding de novo genome assemblies. FragScaff is complementary to Lachesis, providing midrange contiguity to support robust, accurate chromosome-scale de novo genome assemblies without the need for laborious in vivo cloning steps.</p>
<p>Further information about fragScaff, including source code, is available at:<a href="https://sourceforge.net/projects/fragscaff/files/">https://sourceforge.net/projects/fragscaff/files</a>.</p>
<p>Manuscript describing fragScaff was published as: Adey A, Kitzman JO, Burton JN, Daza R, Kumar A, Christiansen L, Ronaghi M, Amini S, L Gunderson K, Steemers FJ, Shendure J#.&nbsp;<em>In vitro, long-range sequence information for de novo genome assembly via transposase contiguity.</em>&nbsp;Genome Research 2014 Dec;24(12):2041-9. doi:&nbsp;<a href="http://dx.doi.org/10.1101/gr.178319.114">10.1101/gr.178319.114</a>. PubMed PMID:&nbsp;<a href="http://www.ncbi.nlm.nih.gov/pubmed/25327137">25327137</a>.</p>
<p>&nbsp;</p><p>Address of the bookmark: <a href="https://sourceforge.net/projects/fragscaff/files/" rel="nofollow">https://sourceforge.net/projects/fragscaff/files/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37650/p-rna-scaffolder-a-fast-and-accurate-genome-scaffolder-using-paired-end-rna-sequencing-reads</guid>
	<pubDate>Fri, 07 Sep 2018 05:19:06 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37650/p-rna-scaffolder-a-fast-and-accurate-genome-scaffolder-using-paired-end-rna-sequencing-reads</link>
	<title><![CDATA[P_RNA_scaffolder: a fast and accurate genome scaffolder using paired-end RNA-sequencing reads]]></title>
	<description><![CDATA[<p><span>P_RNA_scaffolder is a novel scaffolding tool using Pair-end RNA-seq to scaffold genome fragments. The method is suitable for most genomes. The program could utilize Illumina Paired-end RNA-sequencing reads from target speciesies. Our method provides another practical alternative to existing mate-pair_based approaches or other Protein-based approaches (for instance,&nbsp;</span><a href="http://www.fishbrowser.org/software/PEP_scaffolder/">PEP_scaffolder&nbsp;</a><span>) for scaffolding genome sequences. The most important feature of this method is to improve the completeness of gene regions and long-coding gene regions (for instance,&nbsp;</span><a href="http://circrna.org/">circRNA</a><span>).</span></p><p>Address of the bookmark: <a href="http://www.fishbrowser.org/software/P_RNA_scaffolder/#" rel="nofollow">http://www.fishbrowser.org/software/P_RNA_scaffolder/#</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41592/refka-a-fast-and-efficient-long-read-genome-assembly-approach-for-large-and-complex-genomes</guid>
	<pubDate>Fri, 01 May 2020 03:00:40 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41592/refka-a-fast-and-efficient-long-read-genome-assembly-approach-for-large-and-complex-genomes</link>
	<title><![CDATA[RefKA: A fast and efficient long-read genome assembly approach for large and complex genomes]]></title>
	<description><![CDATA[<p><span>RefKA, a reference-based approach for long read genome assembly. This approach relies on breaking up a closely related reference genome into bins, aligning k-mers unique to each bin with PacBio reads, and then assembling each bin in parallel followed by a final bin-stitching step.</span></p>
<p>&nbsp;</p><p>Address of the bookmark: <a href="https://github.com/AppliedBioinformatics/RefKA" rel="nofollow">https://github.com/AppliedBioinformatics/RefKA</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>

</channel>
</rss>