<?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/41452?offset=220</link>
	<atom:link href="https://bioinformaticsonline.com/related/41452?offset=220" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	
<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/opportunity/view/41039/phd-position-in-translational-medicine</guid>
  <pubDate>Sat, 15 Feb 2020 06:07:19 -0600</pubDate>
  <link></link>
  <title><![CDATA[PhD position in Translational Medicine]]></title>
  <description><![CDATA[
<p>https://www.jobvector.de/jobs-stellenangebote/biologie-life-sciences/wissenschaftliche-r-mitarbeiter-in/phd-position-translational-medicine-129981.html?suid=1b510358c7578e8f75cf04a464fc21a404a574ca</p>

<p>Essential experience / qualifications:<br />Master / Diploma in Biology, Biochemistry, Molecular Medicine or similar; solid knowledge of molecular and cell biological techniques; good English knowledge</p>

<p>Applications:<br />Please send your application (including CV, letter of motivation, contact information of two references, and list of publication) by 13.03.2020 at the latest to:</p>

<p>Universitätsklinikum Erlangen<br />Chirurgische Klinik<br />Translational Research Center<br />Prof. Dr. rer. nat. Michael Stürzl<br />Schwabachanlage 12<br />91054 Erlangen<br />E-Mail: michael.stuerzl@uk-erlangen.de</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42485/fastprongs-fast-preprocessing-of-next-generation-sequencing-reads</guid>
	<pubDate>Sat, 26 Dec 2020 08:35:21 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42485/fastprongs-fast-preprocessing-of-next-generation-sequencing-reads</link>
	<title><![CDATA[FastProNGS: fast preprocessing of next-generation sequencing reads]]></title>
	<description><![CDATA[<p><span>FastProNGS to integrate the quality control process with automatic adapter removal. Parallel processing was implemented to speed up the process by allocating multiple threads. Compared with similar up-to-date preprocessing tools, FastProNGS is by far the fastest.&nbsp;</span></p><p>Address of the bookmark: <a href="https://github.com/Megagenomics/FastProNGS" rel="nofollow">https://github.com/Megagenomics/FastProNGS</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/27348/ngago-challenge-crispr</guid>
	<pubDate>Tue, 17 May 2016 03:31:32 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/27348/ngago-challenge-crispr</link>
	<title><![CDATA[NgAgo challenge CRISPR !!]]></title>
	<description><![CDATA[<p><a href="http://www.nature.com/nbt/journal/vaop/ncurrent/full/nbt.3547.html" target="_blank" title="A recent Nature Biotechnology paper"><strong>A recent Nature Biotechnology paper</strong></a>&nbsp;from Chunyu Han&rsquo;s lab,&nbsp;DNA-guided genome editing using the&nbsp;<em>Natronobacterium gregoryi&nbsp;</em>Argonaute,&nbsp;is a must-read for genome editing folks who want to learn about NgAgo. Their team sums up NgAgo&rsquo;s potential pluses this way (<strong>emphasis</strong>&nbsp;mine):</p><blockquote><p>&ldquo;The useful features of NgAgo for genome editing include the following.<strong>First, it has a low tolerance to guide&ndash;target mismatch</strong>. A single nucleotide mismatch at each position of the gDNA impaired the cleavage efficiency of NgAgo, and mismatches at three positions completely blocked cleavage in our experiments.&nbsp;<strong>Second, 5&prime; phosphorylated short ssDNAs are rare in mammalian cells, which minimizes the possibility of cellular oligonucleotides misguiding NgAgo</strong>.<strong>Third, NgAgo follows a &lsquo;one-guide-faithful&rsquo; rule,</strong>&nbsp;that is, a guide can only be loaded when NgAgo protein is in the process of expression, and, once loaded, NgAgo cannot swap its gDNA with other free ssDNA at 37 &deg;C. All of these features could minimize off-target effects.&nbsp;<strong>Finally, it is easy to design and synthesize ssDNAs and to adjust their concentration</strong>, which is difficult with the Cas9-sgRNA system, if the sgRNA is expressed from a plasmid and the normal dosage of an ssDNA guide is only ~1/10 of that of a sgRNA expression plasmid.</p></blockquote><p>NgAgo might be a more orderly way and perhaps even simpler way to go about genome editing than CRISPR, but the jury is still out on that until there are more papers and data. The NgAgo edit efficiency at this preliminary stage of technology development seems very strong. See the pics below</p><p><img src="http://i1.wp.com/www.ipscell.com/wp-content/uploads/2016/05/NgAgo1.jpg" alt="image" width="1311" height="559" style="border: 0px; border: 0px;"></p><p>&nbsp;</p><p>Reference:&nbsp;http://www.nature.com/nbt/journal/vaop/ncurrent/full/nbt.3547.html</p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/40497/artificial-intelligence-is-more-accurate-than-doctors-in-diagnosing-breast-cancer</guid>
	<pubDate>Wed, 01 Jan 2020 22:12:34 -0600</pubDate>
	<link>https://bioinformaticsonline.com/news/view/40497/artificial-intelligence-is-more-accurate-than-doctors-in-diagnosing-breast-cancer</link>
	<title><![CDATA[Artificial intelligence is more accurate than doctors in diagnosing breast cancer]]></title>
	<description><![CDATA[<p>Artificial intelligence is more accurate than doctors in diagnosing breast cancer from mammograms, a study in the journal Nature suggests.</p><p>An international team, including researchers from&nbsp;<a href="https://health.google/" target="_blank">Google Health</a>&nbsp;and&nbsp;<a href="https://www.imperial.ac.uk/news/183293/research-collaboration-aims-improve-breast-cancer/" target="_blank">Imperial College London</a>, designed and trained a computer model on X-ray images from nearly 29,000 women.</p><p>The algorithm&nbsp;<a href="https://nature.com/articles/s41586-019-1799-6" target="_blank">outperformed six radiologists</a>&nbsp;in reading mammograms.</p><p>AI was still as good as two doctors working together.</p><p>Unlike humans, AI is tireless. Experts say it could improve detection. Read More:&nbsp;<a href="https://www.bbc.com/news/health-50857759" target="_blank">https://www.bbc.com/news/health-50857759</a></p>]]></description>
	<dc:creator>BioStar</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/bookmarks/view/44894/dna2bit-an-ultra-fast-and-accurate-genomic-distance-estimation-software</guid>
	<pubDate>Sun, 31 Aug 2025 06:24:58 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44894/dna2bit-an-ultra-fast-and-accurate-genomic-distance-estimation-software</link>
	<title><![CDATA[dna2bit: an ultra-fast and accurate genomic distance estimation software]]></title>
	<description><![CDATA[<p><span>dna2bit is a software tool developed in C++11, leveraging the capabilities of OpenMP for parallel computing and the popcount technique for efficient bit manipulation. It has been thoroughly tested using the g++ and clang compilers on both Linux and MacOS platforms.</span></p><p>Address of the bookmark: <a href="https://github.com/lijuzeng/dna2bit" rel="nofollow">https://github.com/lijuzeng/dna2bit</a></p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>
<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/37241/remilo-reference-assisted-misassembly-detection-algorithm-using-short-and-long-reads</guid>
	<pubDate>Fri, 06 Jul 2018 04:27:49 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37241/remilo-reference-assisted-misassembly-detection-algorithm-using-short-and-long-reads</link>
	<title><![CDATA[ReMILO: reference assisted misassembly detection algorithm using short and long reads.]]></title>
	<description><![CDATA[ReMILO, a reference assisted misassembly detection algorithm that uses both short reads and PacBio SMRT long reads. ReMILO aligns the initial short reads to both the contigs and reference genome, and then constructs a novel data structure called red-black multipositional de Bruijn graph to detect misassemblies. In addition, ReMILO also aligns the contigs to long reads and find their differences from the long reads to detect more misassemblies.<p>Address of the bookmark: <a href="https://github.com/songc001/remilo" rel="nofollow">https://github.com/songc001/remilo</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/39640/flas-fast-and-high-throughput-algorithm-for-pacbio-long-read-self-correction</guid>
	<pubDate>Sat, 22 Jun 2019 12:16:39 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/39640/flas-fast-and-high-throughput-algorithm-for-pacbio-long-read-self-correction</link>
	<title><![CDATA[FLAS: fast and high throughput algorithm for PacBio long read self-correction.]]></title>
	<description><![CDATA[<p><span>FLAS, a wrapper algorithm of MECAT, to achieve high throughput long read self-correction while keeping MECAT's fast speed. FLAS finds additional alignments from MECAT prealigned long reads to improve the correction throughput, and removes misalignments for accuracy.</span></p><p>Address of the bookmark: <a href="https://github.com/baoe/flas" rel="nofollow">https://github.com/baoe/flas</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>