<?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/34515?offset=50</link>
	<atom:link href="https://bioinformaticsonline.com/related/34515?offset=50" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<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/bookmarks/view/40701/fastgt-an-alignment-free-method-for-calling-common-snvs-directly-from-raw-sequencing-reads</guid>
	<pubDate>Tue, 28 Jan 2020 03:27:33 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40701/fastgt-an-alignment-free-method-for-calling-common-snvs-directly-from-raw-sequencing-reads</link>
	<title><![CDATA[FastGT: an alignment-free method for calling common SNVs directly from raw sequencing reads]]></title>
	<description><![CDATA[<p>FastGT is a program package for whole-genome genotyping of genome variants directly from raw sequencing reads. It is written in C and runs in Linux. FastGT uses a list of variant-specific k-mer pairs that are unique in human genome, counts the frequency of k-mers in sequencing data and predicts the genotype. All this takes less than 1 hour on average low-cost Linux server.</p>
<p><a href="http://bioinfo.ut.ee/FastGT/">http://bioinfo.ut.ee/FastGT/</a></p>
<p><strong><a href="https://github.com/bioinfo-ut/GenomeTester4/">https://github.com/bioinfo-ut/GenomeTester4/</a></strong></p><p>Address of the bookmark: <a href="http://bioinfo.ut.ee/FastGT/" rel="nofollow">http://bioinfo.ut.ee/FastGT/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41599/haslr-a-hybrid-assembler-which-uses-both-second-and-third-generation-sequencing-reads</guid>
	<pubDate>Mon, 04 May 2020 02:04:03 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41599/haslr-a-hybrid-assembler-which-uses-both-second-and-third-generation-sequencing-reads</link>
	<title><![CDATA[HASLR: a hybrid assembler which uses both second and third generation sequencing reads]]></title>
	<description><![CDATA[<p><span>HASLR, a hybrid assembler which uses both second and third generation sequencing reads to efficiently generate accurate genome assemblies. Our experiments show that HASLR is not only the fastest assembler but also the one with the lowest number of misassemblies on all the samples compared to other tested assemblers. Furthermore, the generated assemblies in terms of contiguity and accuracy are on par with the other tools on most of the samples. Availability. HASLR is an open source tool available at https://github.com/vpc-ccg/haslr.</span></p><p>Address of the bookmark: <a href="https://github.com/vpc-ccg/haslr" rel="nofollow">https://github.com/vpc-ccg/haslr</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42826/ktrim-an-extra-fast-and-accurate-adapter-and-quality-trimmer-for-sequencing-data</guid>
	<pubDate>Thu, 11 Feb 2021 21:39:05 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42826/ktrim-an-extra-fast-and-accurate-adapter-and-quality-trimmer-for-sequencing-data</link>
	<title><![CDATA[Ktrim: an extra-fast and accurate adapter- and quality-trimmer for sequencing data]]></title>
	<description><![CDATA[<p>Ktrim&nbsp;is written in&nbsp;<code style="font-size: 13.6px; padding: 0.2em 0.4em; margin: 0px; background-color: var(--color-markdown-code-bg);">C++</code>&nbsp;for GNU Linux/Unix platforms. After uncompressing the source package, you can find an executable file&nbsp;<code style="font-size: 13.6px; padding: 0.2em 0.4em; margin: 0px; background-color: var(--color-markdown-code-bg);">ktrim</code>&nbsp;under&nbsp;<code style="font-size: 13.6px; padding: 0.2em 0.4em; margin: 0px; background-color: var(--color-markdown-code-bg);">bin/</code>&nbsp;directory compiled using&nbsp;<code style="font-size: 13.6px; padding: 0.2em 0.4em; margin: 0px; background-color: var(--color-markdown-code-bg);">g++ v4.8.5</code>&nbsp;and linked with&nbsp;<code style="font-size: 13.6px; padding: 0.2em 0.4em; margin: 0px; background-color: var(--color-markdown-code-bg);">libz v1.2.7</code>&nbsp;for Linux x86_64 system. If you could not run it (which is usually caused by low version of&nbsp;<code style="font-size: 13.6px; padding: 0.2em 0.4em; margin: 0px; background-color: var(--color-markdown-code-bg);">libc++</code>&nbsp;or&nbsp;<code style="font-size: 13.6px; padding: 0.2em 0.4em; margin: 0px; background-color: var(--color-markdown-code-bg);">libz</code>&nbsp;library) or you want to build a version optimized for your system, you can re-compile the programs:</p>
<p>user@linux$ make clean &amp;&amp; make</p><p>Address of the bookmark: <a href="https://github.com/hellosunking/Ktrim" rel="nofollow">https://github.com/hellosunking/Ktrim</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/29614/art-set-of-simulation-tools</guid>
	<pubDate>Thu, 03 Nov 2016 08:28:25 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/29614/art-set-of-simulation-tools</link>
	<title><![CDATA[ART: Set of Simulation Tools]]></title>
	<description><![CDATA[<p>ART is a set of simulation tools to generate synthetic next-generation sequencing reads. ART simulates sequencing reads by mimicking real sequencing process with empirical error models or quality profiles summarized from large recalibrated sequencing data. ART can also simulate reads using user own read error model or quality profiles. ART supports simulation of single-end, paired-end/mate-pair reads of three major commercial next-generation sequencing platforms: Illumina's Solexa, Roche's 454 and Applied Biosystems' SOLiD. ART can be used to test or benchmark a variety of method or tools for next-generation sequencing data analysis, including read alignment, de novo assembly, SNP and structure variation discovery. ART was used as a primary tool for the simulation study of the <span><a href="http://www.1000genomes.org/" target="_blank">1000 Genomes Project<span></span></a></span> . ART is implemented in C++ with optimized algorithms and is highly efficient in read simulation. ART outputs reads in the FASTQ format, and alignments in the ALN format. ART can also generate alignments in the SAM alignment or UCSC BED file format. ART can be used together with genome variants simulators (e.g. <span><a href="http://bioinform.github.io/varsim/" target="_blank">VarSim<span></span></a></span>) for evaluating variant calling tools or methods.</p><p>Address of the bookmark: <a href="http://www.niehs.nih.gov/research/resources/software/biostatistics/art/" rel="nofollow">http://www.niehs.nih.gov/research/resources/software/biostatistics/art/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40715/mutatrix-a-population-genome-simulator-which-generates-simulated-genomes</guid>
	<pubDate>Tue, 28 Jan 2020 04:06:58 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40715/mutatrix-a-population-genome-simulator-which-generates-simulated-genomes</link>
	<title><![CDATA[mutatrix: a population genome simulator which generates simulated genomes.]]></title>
	<description><![CDATA[<p><span>genome simulation across a population with zeta-distributed allele frequency, snps, insertions, deletions, and multi-nucleotide polymorphisms</span></p>
<p><span>More at&nbsp;<a href="https://github.com/ekg/mutatrix">https://github.com/ekg/mutatrix</a></span></p>
<pre>./mutatrix -S sample -P test/ -p 2 -n 10 reference.fasta</pre><p>Address of the bookmark: <a href="https://github.com/ekg/mutatrix" rel="nofollow">https://github.com/ekg/mutatrix</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/view/119</guid>
	<pubDate>Wed, 10 Jul 2013 14:35:34 -0500</pubDate>
	<link>https://bioinformaticsonline.com/view/119</link>
	<title><![CDATA[Which are the best statistical programming languages to study for a bioinformatician?]]></title>
	<description><![CDATA[<p><span>In Bio-informatics based&nbsp;genome sequencing and predicting metabolic pathways&nbsp;research jobs&nbsp;I used Matlab, SAS, SPSS, R and several Bioconductor packages. Matlab had a lot of powerful tools and was easy to use, whereas SPSS is for non-programmers and R need programming skills. I am wondering what other people think is best? or there might not be one specific language but a few that lend themselves best to Bio-informatics work that is math heavy and deals with a large amount of data.</span></p>]]></description>
	<dc:creator>Jitendra Narayan</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/857/smyth-lab</guid>
  <pubDate>Sun, 14 Jul 2013 12:26:18 -0500</pubDate>
  <link></link>
  <title><![CDATA[Smyth Lab]]></title>
  <description><![CDATA[
<p>Statistical functional genomics in experimental medicine<br />The genome projects and the accelerated development of high-throughput genomic technologies such as microarrays have revolutionised biology. Making the most of this revolution requires the marriage of researchers from mathematical and biological backgrounds.</p>

<p>Research Area:<br />Linear models for microarray data<br />Digital gene expression technologies<br />Detection of molecular pathways<br />Bioinformatics resources for medical research</p>

<p>Link @ http://www.wehi.edu.au/faculty_members/professor_gordon_smyth/</p>
]]></description>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/914/welch-lab</guid>
  <pubDate>Mon, 15 Jul 2013 18:21:13 -0500</pubDate>
  <link></link>
  <title><![CDATA[Welch Lab]]></title>
  <description><![CDATA[
<p>They are based in the Department of Genetics at the University of Cambridge. </p>

<p>The research covers diverse areas of evolutionary biology, and molecular evolution in particular. It combines theoretical and empirical approaches, and particularly evolutionary inference from genome sequence data.</p>

<p>Links @ http://www.gen.cam.ac.uk/research/welch/GroupPage/Home.html</p>
]]></description>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/1466/iscb-asia-2013-translational-bioinformatics-conference</guid>
  <pubDate>Thu, 08 Aug 2013 06:31:32 -0500</pubDate>
  <link></link>
  <title><![CDATA[ISCB-Asia 2013 Translational Bioinformatics Conference]]></title>
  <description><![CDATA[
<p>ISCB-Asia 2013<br />Translational Bioinformatics Conference<br />Seoul, Korea<br />October 2 - 4, 2013</p>

<p>For more information visit: http://www.snubi.org/TBC2013/</p>
]]></description>
</item>

</channel>
</rss>