<?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/32946?offset=140</link>
	<atom:link href="https://bioinformaticsonline.com/related/32946?offset=140" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37496/gsearch-a-fast-and-flexible-general-search-tool-for-whole-genome-sequencing</guid>
	<pubDate>Mon, 06 Aug 2018 17:19:15 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37496/gsearch-a-fast-and-flexible-general-search-tool-for-whole-genome-sequencing</link>
	<title><![CDATA[gSearch: a fast and flexible general search tool for whole-genome sequencing]]></title>
	<description><![CDATA[<p><span>gSearch compares sequence variants in the Genome Variation Format (GVF) or Variant Call Format (VCF) with a pre-compiled annotation or with variants in other genomes. Its search algorithms are subsequently optimized and implemented in a multi-threaded manner.&nbsp;</span></p><p>Address of the bookmark: <a href="http://ml.ssu.ac.kr/gSearch/index.html" rel="nofollow">http://ml.ssu.ac.kr/gSearch/index.html</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37574/simlord-a-read-simulator-for-third-generation-sequencing-reads</guid>
	<pubDate>Wed, 22 Aug 2018 10:40:27 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37574/simlord-a-read-simulator-for-third-generation-sequencing-reads</link>
	<title><![CDATA[SimLoRD: A read simulator for third generation sequencing reads]]></title>
	<description><![CDATA[<p>SimLoRD is a read simulator for third generation sequencing reads and is currently focused on the Pacific Biosciences SMRT error model.</p>
<p>Reads are simulated from both strands of a provided or randomly generated reference sequence.</p>
<div id="rst-header-features">
<ul>
<li>The reference can be read from a FASTA file or randomly generated with a given GC content. It can consist of several chromosomes, whose structure is respected when drawing reads. (Simulation of genome rearrangements may be incorporated at a later stage.)</li>
<li>The read lengths can be determined in four ways: drawing from a log-normal distribution (typical for genomic DNA), sampling from an existing FASTQ file (typical for RNA), sampling from a a text file with integers (RNA), or using a fixed length</li>
<li>Quality values and number of passes depend on fragment length.</li>
<li>Provided subread error probabilities are modified according to number of passes</li>
<li>Outputs reads in FASTQ format and alignments in SAM format</li>
</ul>
</div><p>Address of the bookmark: <a href="https://bitbucket.org/genomeinformatics/simlord/" rel="nofollow">https://bitbucket.org/genomeinformatics/simlord/</a></p>]]></description>
	<dc:creator>Aaryan Lokwani</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37749/d2tools-the-toolbox-for-counting-the-frequency-of-k-tuple-from-sequencing-datasets-and-calculate-the-dissimilarity</guid>
	<pubDate>Thu, 20 Sep 2018 08:38:29 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37749/d2tools-the-toolbox-for-counting-the-frequency-of-k-tuple-from-sequencing-datasets-and-calculate-the-dissimilarity</link>
	<title><![CDATA[d2Tools: The toolbox for counting the frequency of k-tuple from sequencing datasets and calculate the dissimilarity]]></title>
	<description><![CDATA[<p><code>d2Tools</code>&nbsp;are the toolbox for counting the frequency of K-tuple from sequencing datasets and then calculating the pairwise dissimilarity matrix between samples with the&nbsp;<strong>d2-style</strong>(d2/d2<code>*</code>/d2S representing d2/d2Star/d2shepp, respectively) measures. Hao, Dai, Eucliean, Mahattan, and Chebyshev distance measures are also included in d2Tools.</p>
<p>Manual at&nbsp;https://code.google.com/archive/p/d2-tools/wikis/d2ToolMannual.wiki</p><p>Address of the bookmark: <a href="https://code.google.com/archive/p/d2-tools/" rel="nofollow">https://code.google.com/archive/p/d2-tools/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/38649/ngs-platforms-launched-by-bgi%E2%80%99s-mgi-tech</guid>
	<pubDate>Thu, 10 Jan 2019 04:42:06 -0600</pubDate>
	<link>https://bioinformaticsonline.com/news/view/38649/ngs-platforms-launched-by-bgi%E2%80%99s-mgi-tech</link>
	<title><![CDATA[NGS Platforms launched by BGI’s MGI Tech]]></title>
	<description><![CDATA[<p>MGI Tech Co., Ltd. (MGI), a subsidiary of BGI Group, is committed to enabling effective and affordable healthcare solutions for all. Based on its proprietary technology, MGI produces sequencing devices, equipment, consumables and reagents to support life science research, medicine and healthcare. MGI's multi-omics platforms include genetic sequencing, mass spectrometry and medical imaging. Providing real-time, comprehensive, life-long solutions, its mission&nbsp;is to&nbsp;develop and promote advanced life science tools for future healthcare.</p><p>MGI, a subsidiary of global genomics leader BGI Group, announced pricing and its first early access customer for the new ultra high-throughput sequencer, MGISEQ-T7, saying it has driven down sequencing cost to&nbsp;$5&nbsp;per gigabyte, with exceptionally high accuracy. Such innovations are helping more people to realize the benefits of genomic information.</p><p>In October, MGI launched the MGISEQ-T7, a highly flexible production-scale platform that is the most powerful sequencer to date. It can produce as many as 60 whole human genomes in one day. The instrument sells for&nbsp;$1 million.</p><p>The T7 enables simultaneous but independent operation of up to four flow cells, which means different applications such as single-cell RNA sequencing, whole exome sequencing and whole genome sequencing can be run in different flow cells at the same time. This helps to reduce costs, allowing MGI to offer the most competitive sequencing price in the market.</p><p><span>Powered by DNBseq&trade;, MGISEQ delivers quality data with accuracy for SNP and Indel calling rate of 99.9% and 99%, respectively, along with decreased duplication rate down to less than 2 percent, and almost zero Index mis-assignment rate.</span></p><p><span><span>SOURCE MGI</span></span></p><p>https://www.bgi.com/global/company/news/bgis-mgi-tech-launches-two-new-ngs-platforms/</p><p>http://en.mgitech.cn/</p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40251/mosdepth-fast-bamcram-depth-calculation-for-wgs-exome-or-targeted-sequencing</guid>
	<pubDate>Wed, 13 Nov 2019 22:20:19 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40251/mosdepth-fast-bamcram-depth-calculation-for-wgs-exome-or-targeted-sequencing</link>
	<title><![CDATA[mosdepth: fast BAM/CRAM depth calculation for WGS, exome, or targeted sequencing]]></title>
	<description><![CDATA[<p>mosdepth can output:</p>
<p>per-base depth about 2x as fast samtools depth--about 25 minutes of CPU time for a 30X genome.<br>mean per-window depth given a window size--as would be used for CNV calling.<br>the mean per-region given a BED file of regions.<br>a distribution of proportion of bases covered at or above a given threshold for each chromosome and genome-wide.<br>quantized output that merges adjacent bases as long as they fall in the same coverage bins e.g. (10-20)<br>threshold output to indicate how many bases in each region are covered at the given thresholds.<br>A summary of mean depths per chromosome and within specified regions per chromosome.</p><p>Address of the bookmark: <a href="https://github.com/brentp/mosdepth" rel="nofollow">https://github.com/brentp/mosdepth</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</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/bookmarks/view/36257/aligngraph-algorithm-for-secondary-de-novo-genome-assembly-guided-by-closely-related-references</guid>
	<pubDate>Tue, 17 Apr 2018 16:21:20 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36257/aligngraph-algorithm-for-secondary-de-novo-genome-assembly-guided-by-closely-related-references</link>
	<title><![CDATA[AlignGraph: algorithm for secondary de novo genome assembly guided by closely related references]]></title>
	<description><![CDATA[<p>AlignGraph is a software that extends and joins contigs or scaffolds by reassembling them with help provided by a reference genome of a closely related organism.</p>
<p>Using AlignGraph</p>
<pre><code>AlignGraph --read1 reads_1.fa --read2 reads_2.fa --contig contigs.fa --genome genome.fa --distanceLow distanceLow --distanceHigh distancehigh --extendedContig extendedContigs.fa --remainingContig remainingContigs.fa [--kMer k --insertVariation insertVariation --coverage coverage --part p --fastMap --ratioCheck --iterativeMap --misassemblyRemoval --resume]</code></pre>
<h3>&nbsp;</h3><p>Address of the bookmark: <a href="https://github.com/baoe/AlignGraph" rel="nofollow">https://github.com/baoe/AlignGraph</a></p>]]></description>
	<dc:creator>Manisha Mishra</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37561/hercules-a-profile-hmm-based-hybrid-error-correction-algorithm-for-long-reads</guid>
	<pubDate>Mon, 20 Aug 2018 14:14:11 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37561/hercules-a-profile-hmm-based-hybrid-error-correction-algorithm-for-long-reads</link>
	<title><![CDATA[Hercules: a profile HMM-based hybrid error correction algorithm for long reads]]></title>
	<description><![CDATA[<p><span>Choosing whether to use second or third generation sequencing platforms can lead to trade-offs between accuracy and read length. Several studies require long and accurate reads including de novo assembly, fusion and structural variation detection. In such cases researchers often combine both technologies and the more erroneous long reads are corrected using the short reads. Current approaches rely on various graph based alignment techniques and do not take the error profile of the underlying technology into account. Memory- and time- efficient machine learning algorithms that address these shortcomings have the potential to achieve better and more accurate integration of these two technologies. Results: We designed and developed Hercules, the first machine learning-based long read error correction algorithm. The algorithm models every long read as a profile Hidden Markov Model with respect to the underlying platformtextquoterights error profile. The algorithm learns a posterior transition/emission probability distribution for each long read and uses this to correct errors in these reads. Using datasets from two DNA-seq BAC clones (CH17-157L1 and CH17-227A2), and human brain cerebellum polyA RNA-seq, we show that Hercules-corrected reads have the highest mapping rate among all competing algorithms and highest accuracy when most of the basepairs of a long read are covered with short reads. Availability: </span></p>
<p><span>Hercules source code is available at https://github.com/BilkentCompGen/Hercules</span></p><p>Address of the bookmark: <a href="https://github.com/BilkentCompGen/Hercules" rel="nofollow">https://github.com/BilkentCompGen/Hercules</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41881/hdock-server</guid>
	<pubDate>Tue, 16 Jun 2020 01:54:41 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41881/hdock-server</link>
	<title><![CDATA[HDOCK SERVER]]></title>
	<description><![CDATA[<p>HDOCK SERVER</p>
<p>Protein-protein and protein-DNA/RNA docking based on a hybrid algorithm of template-based modeling and&nbsp;<em>ab initio</em>&nbsp;free docking.</p>
<p><span>The HDOCK server distinguishes itself from similar docking servers in its ability to support amino acid sequences as input and a hybrid docking strategy in which experimental information about the protein&ndash;protein binding site and small-angle X-ray scattering can be incorporated during the docking and post-docking processes.</span></p><p>Address of the bookmark: <a href="http://hdock.phys.hust.edu.cn/" rel="nofollow">http://hdock.phys.hust.edu.cn/</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>

</channel>
</rss>