<?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/10243?offset=80</link>
	<atom:link href="https://bioinformaticsonline.com/related/10243?offset=80" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36512/hisat2-a-fast-and-sensitive-alignment-program-for-mapping-next-generation-sequencing-reads</guid>
	<pubDate>Tue, 08 May 2018 04:27:22 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36512/hisat2-a-fast-and-sensitive-alignment-program-for-mapping-next-generation-sequencing-reads</link>
	<title><![CDATA[HISAT2: a fast and sensitive alignment program for mapping next-generation sequencing reads]]></title>
	<description><![CDATA[<p><strong>HISAT2</strong><span>&nbsp;is a fast and sensitive alignment program for mapping next-generation sequencing reads (both DNA and RNA) to a population of human genomes (as well as to a single reference genome). Based on an extension of BWT for graphs&nbsp;</span><a href="http://dl.acm.org/citation.cfm?id=2674828">[Sir&eacute;n et al. 2014]</a><span>, we designed and implemented a graph FM index (GFM), an original approach and its first implementation to the best of our knowledge. In addition to using one global GFM index that represents a population of human genomes, HISAT2 uses a large set of small GFM indexes that collectively cover the whole genome (each index representing a genomic region of 56 Kbp, with 55,000 indexes needed to cover the human population). These small indexes (called local indexes), combined with several alignment strategies, enable rapid and accurate alignment of sequencing reads. This new indexing scheme is called a Hierarchical Graph FM index (HGFM).&nbsp;</span></p>
<p><span>more at&nbsp;https://ccb.jhu.edu/software/hisat2/index.shtml</span></p><p>Address of the bookmark: <a href="https://github.com/infphilo/hisat2" rel="nofollow">https://github.com/infphilo/hisat2</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36739/blasr-mapping-single-molecule-sequencing-reads-using-basic-local-alignment-with-successive-refinement-blasr-theory-and-application</guid>
	<pubDate>Wed, 23 May 2018 06:54:32 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36739/blasr-mapping-single-molecule-sequencing-reads-using-basic-local-alignment-with-successive-refinement-blasr-theory-and-application</link>
	<title><![CDATA[BlasR Mapping single molecule sequencing reads using Basic Local Alignment with Successive Refinement (BLASR): Theory and Application,]]></title>
	<description><![CDATA[<p><span>BLASR (Basic Local Alignment with Successive Refinement) for mapping Single Molecule Sequencing (SMS) reads that are thousands to tens of thousands of bases long with divergence between the read and genome dominated by insertion and deletion error.</span></p>
<p>Here is how I use the blasr to align PacBio reads to the contigs (target.fasta). The &ldquo;target.fasta.sa&rdquo; is the suffix array from &ldquo;target.fasta&rdquo; generated by sawriter.</p>
<blockquote>
<p>blasr query.fa ./target.fasta -sa ./target.fasta.sa -bestn 40 -maxScore -500 -m 4 -nproc 24 -out target.m4 -maxLCPLength 15</p>
</blockquote>
<p>the output format option &ldquo;-m 4&Prime; generate the alignment coordinate. Not fully documented, but I can explain that to you.&nbsp;</p>
<p>I use a 24 cores / 48G ram server for the alignment. It took about 2 to 3 hours aligning 3G PacBio Reads to 10^6 sequences of short read contigs with a mean 3.5kbp length.</p><p>Address of the bookmark: <a href="http://bix.ucsd.edu/projects/blasr/" rel="nofollow">http://bix.ucsd.edu/projects/blasr/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37223/chopstitch-exon-annotation-and-splice-graph-construction-using-transcriptome-assembly-and-whole-genome-sequencing-data</guid>
	<pubDate>Tue, 03 Jul 2018 04:14:52 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37223/chopstitch-exon-annotation-and-splice-graph-construction-using-transcriptome-assembly-and-whole-genome-sequencing-data</link>
	<title><![CDATA[ChopStitch: exon annotation and splice graph construction using transcriptome assembly and whole genome sequencing data]]></title>
	<description><![CDATA[ChopStitch is a new method for finding putative exons and constructing splice graphs using an assembled transcriptome and whole genome shotgun sequencing (WGSS) data. ChopStitch identifies exon-exon boundaries in de novo assembled RNA-seq data with the help of a Bloom filter that represents the k-mer spectrum of WGSS reads. The algorithm also detects base substitutions in transcript sequences corresponding to sequencing or assembly errors, haplotype variations, or putative RNA editing events. The primary output of our tool is a FASTA file containing putative exons. Further, exon edges are interrogated for alternative exon-exon boundaries to detect transcript isoforms, which are reported as splice graphs in dot output format.<p>Address of the bookmark: <a href="https://github.com/bcgsc/ChopStitch" rel="nofollow">https://github.com/bcgsc/ChopStitch</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37512/purecn-copy-number-calling-and-snv-classification-using-targeted-short-read-sequencing</guid>
	<pubDate>Thu, 09 Aug 2018 04:09:37 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37512/purecn-copy-number-calling-and-snv-classification-using-targeted-short-read-sequencing</link>
	<title><![CDATA[PureCN: copy number calling and SNV classification using targeted short read sequencing]]></title>
	<description><![CDATA[<p>This package estimates tumor purity, copy number, and loss of heterozygosity (LOH), and classifies single nucleotide variants (SNVs) by somatic status and clonality. PureCN is designed for targeted short read sequencing data, integrates well with standard somatic variant detection and copy number pipelines, and has support for tumor samples without matching normal samples.</p>
<p>Author: Markus Riester [aut, cre], Angad P. Singh [aut]</p>
<p>Maintainer: Markus Riester &lt;markus.riester at novartis.com&gt;</p>
<div id="bioc_citation_outer">
<p>Citation (from within R, enter&nbsp;<code>citation("PureCN")</code>):</p>
<div id="bioc_citation">
<p>Riester M, Singh A, Brannon A, Yu K, Campbell C, Chiang D, Morrissey M (2016). &ldquo;PureCN: Copy number calling and SNV classification using targeted short read sequencing.&rdquo;&nbsp;<em>Source Code for Biology and Medicine</em>,&nbsp;<strong>11</strong>, 13. doi:&nbsp;<a href="http://doi.org/10.1186/s13029-016-0060-z">10.1186/s13029-016-0060-z</a>.</p>
</div>
</div><p>Address of the bookmark: <a href="http://bioconductor.org/packages/release/bioc/html/PureCN.html" rel="nofollow">http://bioconductor.org/packages/release/bioc/html/PureCN.html</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37643/lorma-a-tool-for-correcting-sequencing-errors-in-long-reads</guid>
	<pubDate>Thu, 06 Sep 2018 16:21:01 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37643/lorma-a-tool-for-correcting-sequencing-errors-in-long-reads</link>
	<title><![CDATA[LoRMA: A tool for correcting sequencing errors in long reads]]></title>
	<description><![CDATA[<p><span>An error correction method that uses long reads only. The method consists of two phases: first, we use an iterative alignment-free correction method based on de Bruijn graphs with increasing length of&nbsp;</span><em>k</em><span>-mers, and second, the corrected reads are further polished using long-distance dependencies that are found using multiple alignments. According to our experiments, the proposed method is the most accurate one relying on long reads only for read sets with high coverage. Furthermore, when the coverage of the read set is at least 75&times;, the throughput of the new method is at least 20% higher.</span></p>
<blockquote>
<p><span>conda install -c atgc-montpellier lorma</span></p>
</blockquote><p>Address of the bookmark: <a href="https://gite.lirmm.fr/lorma/lorma-releases/wikis/home" rel="nofollow">https://gite.lirmm.fr/lorma/lorma-releases/wikis/home</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37830/nquire-a-statistical-framework-for-ploidy-estimation-using-next-generation-sequencing</guid>
	<pubDate>Thu, 04 Oct 2018 05:23:59 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37830/nquire-a-statistical-framework-for-ploidy-estimation-using-next-generation-sequencing</link>
	<title><![CDATA[nQuire: a statistical framework for ploidy estimation using next generation sequencing]]></title>
	<description><![CDATA[<p>nQuire provides a statistical framework to study organisms with intraspecific variation in ploidy. nQuire is likely to be useful in epidemiological studies of pathogens, artificial selection experiments, and for historical or ancient samples where intact nuclei are not preserved. It is implemented as a stand-alone Linux command line tool in the C programming language and is available at https://github.com/clwgg/nQuireunder the MIT license.</p><p>Address of the bookmark: <a href="https://github.com/clwgg/nQuireunder" rel="nofollow">https://github.com/clwgg/nQuireunder</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38304/lordfast-sensitive-and-fast-alignment-search-tool-for-long-noisy-read-sequencing-data</guid>
	<pubDate>Tue, 27 Nov 2018 04:43:57 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38304/lordfast-sensitive-and-fast-alignment-search-tool-for-long-noisy-read-sequencing-data</link>
	<title><![CDATA[lordFAST: sensitive and Fast Alignment Search Tool for LOng noisy Read sequencing Data]]></title>
	<description><![CDATA[<p><span>lordFAST is a sensitive tool for mapping long reads with high error rates. lordFAST is specially designed for aligning reads from PacBio sequencing technology but provides the user the ability to change alignment parameters depending on the reads and application.</span></p>
<p>lordFAST, a novel long-read mapper that is specifically designed to align reads generated by PacBio and potentially other SMS technologies to a reference. lordFAST not only has higher sensitivity than the available alternatives, it is also among the fastest and has a very low memory footprint.</p>
<p>&nbsp;</p><p>Address of the bookmark: <a href="https://github.com/vpc-ccg/lordfast" rel="nofollow">https://github.com/vpc-ccg/lordfast</a></p>]]></description>
	<dc:creator>BioJoker</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38762/katuali-is-a-flexible-consensus-pipeline-implemented-in-snakemake-to-basecall-assemble-and-polish-oxford-nanopore-technologies-sequencing-data</guid>
	<pubDate>Tue, 22 Jan 2019 06:26:55 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38762/katuali-is-a-flexible-consensus-pipeline-implemented-in-snakemake-to-basecall-assemble-and-polish-oxford-nanopore-technologies-sequencing-data</link>
	<title><![CDATA[Katuali is a flexible consensus pipeline implemented in Snakemake to basecall, assemble, and polish Oxford Nanopore Technologies&#039; sequencing data]]></title>
	<description><![CDATA[<ul>
<li>Run a pipeline processing fast5s to a consensus in a single command.</li>
<li>Recommended fixed "standard" and "fast" pipelines.</li>
<li>Interchange basecaller, assembler, and consensus components of the pipelines simply by changing the target filepath.</li>
<li>Seemless distribution of tasks over local or distributed compute.</li>
<li>Highly configurable.</li>
<li>Open source (Mozilla Public License 2.0).</li>
</ul>
<p>Documentation can be found at&nbsp;<a href="https://nanoporetech.github.io/katuali/">https://nanoporetech.github.io/katuali/</a>.</p><p>Address of the bookmark: <a href="https://github.com/nanoporetech/katuali" rel="nofollow">https://github.com/nanoporetech/katuali</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/39827/prof-dr-med-andreas-ramming</guid>
  <pubDate>Wed, 07 Aug 2019 03:25:48 -0500</pubDate>
  <link></link>
  <title><![CDATA[Prof. Dr. med. Andreas Ramming]]></title>
  <description><![CDATA[
<p>In many autoimmune diseases, a misdirected immune response leads to chronic inflammation and subsequently to fibrotic and degenerative tissue remodeling. Therapeutic options are available for inflammatory joint diseases, but only about 40% of patients respond to these existing therapies on a permanent basis. In the remaining cases, these therapies miss their target from the beginning or later during the course of treatment failure. There are currently no causal therapies available for the treatment of fibrotic autoimmune diseases such as systemic sclerosis. Therefore, there is an urgent need to develop new therapeutic options for the treatment of fibrotic and synovitic autoimmune diseases. His group is therefore deal with the molecular mechanisms of these misdirected signaling pathways for the development of novel, targeted therapies</p>

<p>http://www.medizin3.uk-erlangen.de/forschung/arbeitsgruppen/matrixbiologie-entzuendliche-signalwege-in-arthritis-und-fibrose/</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40611/deepvariant-an-analysis-pipeline-that-uses-a-deep-neural-network-to-call-genetic-variants-from-next-generation-dna-sequencing-data</guid>
	<pubDate>Sat, 25 Jan 2020 13:28:09 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40611/deepvariant-an-analysis-pipeline-that-uses-a-deep-neural-network-to-call-genetic-variants-from-next-generation-dna-sequencing-data</link>
	<title><![CDATA[DeepVariant : an analysis pipeline that uses a deep neural network to call genetic variants from next-generation DNA sequencing data.]]></title>
	<description><![CDATA[<p><span>DeepVariant is an analysis pipeline that uses a deep neural network to call genetic variants from next-generation DNA sequencing data.</span></p>
<p><span><span>DeepVariant is an analysis pipeline that uses a deep neural network to call genetic variants from next-generation DNA sequencing data. DeepVariant relies on&nbsp;</span><a href="https://github.com/google/nucleus">Nucleus</a><span>, a library of Python and C++ code for reading and writing data in common genomics file formats (like SAM and VCF) designed for painless integration with the&nbsp;</span><a href="https://www.tensorflow.org/">TensorFlow</a><span>&nbsp;machine learning framework.</span></span></p>
<p><span><a href="https://ai.googleblog.com/2017/12/deepvariant-highly-accurate-genomes.html">https://ai.googleblog.com/2017/12/deepvariant-highly-accurate-genomes.html</a></span></p>
<p><span><a href="https://www.biorxiv.org/content/10.1101/092890v6">https://www.biorxiv.org/content/10.1101/092890v6</a></span></p>
<p><span><img src="https://4.bp.blogspot.com/-2KlXZO60sWE/WiGc8qlZfxI/AAAAAAAACOs/s1pNiKI8jsAvJLr1E_po5udDO8eObm_awCLcBGAs/s640/image3.png" width="640" height="427" alt="image" style="border: 0px;"></span></p><p>Address of the bookmark: <a href="https://github.com/google/deepvariant" rel="nofollow">https://github.com/google/deepvariant</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>