<?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/37962?offset=230</link>
	<atom:link href="https://bioinformaticsonline.com/related/37962?offset=230" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37842/rapclust-accurate-lightweight-clustering-of-de-novo-transcriptomes-using-fragment-equivalence-classes</guid>
	<pubDate>Thu, 04 Oct 2018 17:57:10 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37842/rapclust-accurate-lightweight-clustering-of-de-novo-transcriptomes-using-fragment-equivalence-classes</link>
	<title><![CDATA[RapClust: Accurate, Lightweight Clustering of de novo Transcriptomes using Fragment Equivalence Classes]]></title>
	<description><![CDATA[<p><span>RapClust is a tool for clustering contigs from&nbsp;</span><em>de novo</em><span>&nbsp;transcriptome assemblies. RapClust is designed to be run downstream of the&nbsp;</span><a href="https://github.com/kingsfordgroup/sailfish">Sailfish</a><span>&nbsp;or&nbsp;</span><a href="https://github.com/COMBINE-lab/salmon">Salmon</a><span>&nbsp;tools for rapid transcript-level quantification. Specifically, RapClust relies on the&nbsp;</span><em>fragment equivalence classes</em><span>&nbsp;computed by these tools in order to determine how seqeunce is shared across the transcriptome, and how reads map to potentially-related contigs across different conditions.</span></p><p>Address of the bookmark: <a href="https://github.com/COMBINE-lab/RapClust" rel="nofollow">https://github.com/COMBINE-lab/RapClust</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40856/3d-de-novo-assembly-3d-dna-pipeline</guid>
	<pubDate>Sun, 02 Feb 2020 13:41:55 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40856/3d-de-novo-assembly-3d-dna-pipeline</link>
	<title><![CDATA[3D de novo assembly (3D DNA) pipeline]]></title>
	<description><![CDATA[<p>For a detailed description of the pipeline and how it integrates with other tools designed by the Aiden Lab see&nbsp;<a href="http://aidenlab.org/assembly/manual_180322.pdf">Genome Assembly Cookbook</a>&nbsp;on&nbsp;<a href="http://aidenlab.org/assembly">http://aidenlab.org/assembly</a>.</p>
<p>For the original version of the pipeline and to reproduce the Hs2-HiC and the AaegL4 genomes reported in&nbsp;<a href="http://science.sciencemag.org/content/356/6333/92">(Dudchenko et al.,&nbsp;<em>Science</em>, 2017)</a>&nbsp;see the&nbsp;<a href="https://github.com/theaidenlab/3d-dna/tree/745779bdf64db6e55bddb70c24e9b58825938c33">original commit</a>.</p>
<p>For the detailed description of the merge section see&nbsp;<a href="https://github.com/theaidenlab/AGWG-merge">https://github.com/theaidenlab/AGWG-merge</a>.</p><p>Address of the bookmark: <a href="https://github.com/theaidenlab/3d-dna" rel="nofollow">https://github.com/theaidenlab/3d-dna</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40573/de-novo-genome-assembly-for-illumina-data</guid>
	<pubDate>Mon, 20 Jan 2020 05:13:29 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40573/de-novo-genome-assembly-for-illumina-data</link>
	<title><![CDATA[De novo Genome Assembly for Illumina Data]]></title>
	<description><![CDATA[<p>Written and maintained by <a href="mailto:simon.gladman@unimelb.edu.au">Simon Gladman</a> - Melbourne Bioinformatics (formerly VLSCI)</p>
<p>Protocol Overview / Introduction</p>
<p>In this protocol we discuss and outline the process of de novo assembly for small to medium sized genomes.</p>
<p>https://www.melbournebioinformatics.org.au/tutorials/tutorials/assembly/assembly-protocol/</p><p>Address of the bookmark: <a href="https://www.melbournebioinformatics.org.au/tutorials/tutorials/assembly/assembly-protocol/" rel="nofollow">https://www.melbournebioinformatics.org.au/tutorials/tutorials/assembly/assembly-protocol/</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36618/lamsa-fast-split-read-alignment-with-long-approximate-matches</guid>
	<pubDate>Tue, 15 May 2018 04:44:42 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36618/lamsa-fast-split-read-alignment-with-long-approximate-matches</link>
	<title><![CDATA[LAMSA: fast split read alignment with long approximate matches]]></title>
	<description><![CDATA[LAMSA (Long Approximate Matches-based Split Aligner) is a novel split alignment approach with faster speed and good ability of handling SV events. It is well-suited to align long reads (over thousands of base-pairs).

LAMSA takes takes the advantage of the rareness of SVs to implement a specifically designed two-step strategy. That is, LAMSA initially splits the read into relatively long fragments and co-linearly align them to solve the small variations or sequencing errors, and mitigate the effect of repeats. The alignments of the fragments are then used for implementing a sparse dynamic programming (SDP)-based split alignment approach to handle the large or non-co-linear variants.

We benchmarked LAMSA with simulated and real datasets having various read lengths and sequencing error rates, the results demonstrate that it is substantially faster than the state-of-the-art long read aligners; mean-while, it also has good ability to handle various categories of SVs.

LAMSA is open source and free for non-commercial use.

LAMSA is mainly designed by Bo Liu &amp; Yan Gao and developed by Yan Gao in Center for Bioinformatics, Harbin Institute of Technology, China.<p>Address of the bookmark: <a href="https://github.com/hitbc/LAMSA" rel="nofollow">https://github.com/hitbc/LAMSA</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37473/lsc-a-long-read-error-correction-tool</guid>
	<pubDate>Thu, 02 Aug 2018 07:39:46 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37473/lsc-a-long-read-error-correction-tool</link>
	<title><![CDATA[LSC :a long read error correction tool]]></title>
	<description><![CDATA[<h2>Getting Started</h2>
<p>These simple steps will help you integrate LSC into your transcriptomics analysis pipeline.</p>
<ul>
<li>Read the&nbsp;<a href="https://www.healthcare.uiowa.edu/labs/au/LSC/LSC_requirements.asp">LSC_requirements</a>&nbsp;for running LSC.</li>
<li><a href="https://www.healthcare.uiowa.edu/labs/au/LSC/LSC_download.asp">Download</a>&nbsp;and set-up the LSC package.</li>
<li>Follow the&nbsp;<a href="https://www.healthcare.uiowa.edu/labs/au/LSC/LSC_tutorial.asp">tutorial</a>&nbsp;to see how LSC works on some example data.</li>
<li>Read the&nbsp;<a href="https://www.healthcare.uiowa.edu/labs/au/LSC/LSC_manual.asp">manual</a>&nbsp;if anything is unclear.</li>
<li>You're ready, Happy LSCing!</li>
</ul>
<h2>Latest publication</h2>
<p><span>Kin Fai Au, Jason Underwood, Lawrence Lee and Wing Hung Wong&nbsp;</span><br><strong>Improving PacBio Long Read Accuracy by Short Read Alignment&nbsp;</strong><span>[</span><a href="http://journals.plos.org/plosone/article?id=10.1371%2Fjournal.pone.0046679">Manuscript</a><span>]&nbsp;</span><br><em>PLoS ONE</em><span>&nbsp;2012. 7(10): e46679. doi:10.1371/journal.pone.0046679</span></p><p>Address of the bookmark: <a href="https://www.healthcare.uiowa.edu/labs/au/LSC/" rel="nofollow">https://www.healthcare.uiowa.edu/labs/au/LSC/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43384/lncpipea-nextflow-based-pipeline-for-comprehensive-analyses-of-long-non-coding-rnas-from-rna-seq-datasets</guid>
	<pubDate>Fri, 17 Sep 2021 01:57:02 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43384/lncpipea-nextflow-based-pipeline-for-comprehensive-analyses-of-long-non-coding-rnas-from-rna-seq-datasets</link>
	<title><![CDATA[LncPipe:A Nextflow-based pipeline for comprehensive analyses of long non-coding RNAs from RNA-seq datasets]]></title>
	<description><![CDATA[<p><span>The pipeline was developed based on a popular workflow framework&nbsp;</span><a href="https://github.com/nextflow-io/nextflow">Nextflow</a><span>, composed of four core procedures including reads alignment, assembly, identification and quantification. It contains various unique features such as well-designed lncRNAs annotation strategy, optimized calculating efficiency, diversified classification and interactive analysis report.&nbsp;</span><a href="https://github.com/likelet/LncPipe">LncPipe</a><span>&nbsp;allows users additional control in interuppting the pipeline, resetting parameters from command line, modifying main script directly and resume analysis from previous checkpoint.</span></p>
<p>Ref&nbsp;https://www.lncrnablog.com/lncpipe-a-nextflow-based-pipeline-for-identification-and-analysis-of-long-non-coding-rnas-from-rna-seq-data/</p>
<p><img src="https://ars.els-cdn.com/content/image/1-s2.0-S1673852718301176-gr1.jpg" alt="image" style="border: 0px;"></p><p>Address of the bookmark: <a href="https://github.com/likelet/LncPipe" rel="nofollow">https://github.com/likelet/LncPipe</a></p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>
<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/bookmarks/view/37527/nanopack-visualizing-and-processing-long-read-sequencing-data</guid>
	<pubDate>Fri, 10 Aug 2018 18:41:34 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37527/nanopack-visualizing-and-processing-long-read-sequencing-data</link>
	<title><![CDATA[NanoPack: visualizing and processing long-read sequencing data]]></title>
	<description><![CDATA[<p>The NanoPack tools are written in Python3 and released under the GNU GPL3.0 License. The source code can be found at&nbsp;<a href="https://github.com/wdecoster/nanopack" target="">https://github.com/wdecoster/nanopack</a>, together with links to separate scripts and their documentation. The scripts are compatible with Linux, Mac OS and the MS Windows 10 subsystem for Linux and are available as a graphical user interface, a web service at&nbsp;<a href="http://nanoplot.bioinf.be/" target="">http://nanoplot.bioinf.be</a>&nbsp;and command line tools.</p>
<p>&nbsp;https://academic.oup.com/bioinformatics/article/34/15/2666/4934939</p><p>Address of the bookmark: <a href="https://github.com/wdecoster/nanoQC" rel="nofollow">https://github.com/wdecoster/nanoQC</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/videolist/watch/5379/interview-mark-sansom-u-oxford-simulations-of-membrane-proteins</guid>
	<pubDate>Mon, 07 Oct 2013 14:34:13 -0500</pubDate>
	<link>https://bioinformaticsonline.com/videolist/watch/5379/interview-mark-sansom-u-oxford-simulations-of-membrane-proteins</link>
	<title><![CDATA[Interview Mark Sansom (U. Oxford): Simulations of Membrane Proteins]]></title>
	<description><![CDATA[<iframe width="" height="" src="https://www.youtube-nocookie.com/embed/Fu8hiBu5V5Y" frameborder="0" allowfullscreen></iframe>Workshop in Bioinformatics, 4/June/2012
Campus Vida's Research Centers organize in Santiago de Compostela the Workshop in Bioinformatics. This event addressed issues such as structural bioinformatics, biological modelling and mining bioinformatics data.
Professor Mark Sansom (University of Oxford), belonging to the Structural Bioinformatics and Computational Biochemistr Unit, opened the sessions with the lecture "Multiscale Simulations of Membrane Proteins: Lipid Interactions and Signalling".]]></description>
	
</item>

</channel>
</rss>