<?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/41009?offset=540</link>
	<atom:link href="https://bioinformaticsonline.com/related/41009?offset=540" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/32011/fools-guide</guid>
	<pubDate>Sun, 02 Apr 2017 14:31:18 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32011/fools-guide</link>
	<title><![CDATA[Fools guide]]></title>
	<description><![CDATA[<p><span>This website and accompaning documents are intended as a tool to help researchers dealing with non-model organisms acquire and process transcriptomic high-throughput sequencing data without having to learn extensive bioinformatics skills. It covers all steps from tissue collection, sample preparation and computer setup, through addressing biological questions with gene expression and SNP data.</span></p>
<p>http://sfg.stanford.edu/denovo.html</p>
<p>http://sfg.stanford.edu/sequencing.html</p>
<p>http://sfg.stanford.edu/BLAST.html</p>
<p>http://sfg.stanford.edu/denovo.html&nbsp;</p><p>Address of the bookmark: <a href="http://sfg.stanford.edu/guide.html" rel="nofollow">http://sfg.stanford.edu/guide.html</a></p>]]></description>
	<dc:creator>Poonam Mahapatra</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/32709/cabog-celera-assembler-with-best-overlap-graph</guid>
	<pubDate>Mon, 15 May 2017 05:04:39 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32709/cabog-celera-assembler-with-best-overlap-graph</link>
	<title><![CDATA[CABOG: Celera Assembler with Best Overlap Graph]]></title>
	<description><![CDATA[<p>CABOG (Celera Assembler with Best Overlap Graph) is scientific software for&nbsp;<a href="http://bioinformatics.oxfordjournals.org/content/24/24/2818.abstract">DNA research</a>. CABOG has been a critical component of many genome sequencing projects. CABOG operates on small genomes such as bacterial as well as large genomes such as mammalian. CABOG is an extension of the Celera Assembler software that was originally developed at&nbsp;<a href="http://www.celera.com/">Celera</a>&nbsp;for the 2001 publication of the first draft human genome sequence. The software was released to the public domain in 2004. Its open source&nbsp;<a href="http://wgs-assembler.sf.net/">repository</a>&nbsp;on Source Forge is an internet resource for scientists around the world.&nbsp;</p>
<p>CABOG is one of many software programs called genome assemblers. These programs exist to overcome the fundamental limitation of all sequencing machines, namely, that they read out very few DNA letters at a time. These programs reconstruct genomes that are billions of letters long from the hundreds of letters per read that modern sequencers provide. What these programs do is often described as a scaled up version of a family solving a jigsaw puzzle.</p>
<p>The CABOG software was the first to accomplish many scientific goals. It was the first to assemble the genome of a multicellular organism (<em>Drosophila melanogaster</em>, 2000). It was the first to assemble both parental haplotypes of one human genome (J. Craig Venter, 2007). It was the first to assemble environmental sequence from the oceans (Sargasso Sea in 2004 and Global Ocean Sampling in 2007). It was first to combine reads from first-generation Sanger sequencing machines and second-generation pyrosequencing machines (Marine microbes, 2006). Today, CABOG is one of the leading assembly programs for data sets that include paired end data from the Roche 454 line of sequencing machines.</p><p>Address of the bookmark: <a href="http://www.jcvi.org/cms/research/projects/cabog/overview/" rel="nofollow">http://www.jcvi.org/cms/research/projects/cabog/overview/</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/32946/grass-a-generic-algorithm-for-scaffolding-next-generation-sequencing-assemblies</guid>
	<pubDate>Tue, 23 May 2017 05:20:32 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32946/grass-a-generic-algorithm-for-scaffolding-next-generation-sequencing-assemblies</link>
	<title><![CDATA[GRASS: a generic algorithm for scaffolding next-generation sequencing assemblies.]]></title>
	<description><![CDATA[<p><span>GRASS (GeneRic ASsembly Scaffolder)-a novel algorithm for scaffolding second-generation sequencing assemblies capable of using diverse information sources. GRASS offers a mixed-integer programming formulation of the contig scaffolding problem, which combines contig order, distance and orientation in a single optimization objective. The resulting optimization problem is solved using an expectation-maximization procedure and an unconstrained binary quadratic programming approximation of the original problem. We compared GRASS with existing HTS scaffolders using Illumina paired reads of three bacterial genomes. Our algorithm constructs a comparable number of scaffolds, but makes fewer errors. This result is further improved when additional data, in the form of related genome sequences, are used.</span></p><p>Address of the bookmark: <a href="https://github.com/AlexeyG/GRASS" rel="nofollow">https://github.com/AlexeyG/GRASS</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34493/plast-a-fast-accurate-and-ngs-scalable-bank-to-bank-sequence-similarity-search-tool</guid>
	<pubDate>Fri, 01 Dec 2017 04:10:54 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34493/plast-a-fast-accurate-and-ngs-scalable-bank-to-bank-sequence-similarity-search-tool</link>
	<title><![CDATA[PLAST: A fast, accurate and NGS scalable bank-to-bank sequence similarity search tool]]></title>
	<description><![CDATA[<p><strong>PLAST is a fast, accurate and NGS scalable bank-to-bank sequence similarity search tool providing significant accelerations of seeds-based heuristic comparison methods, such as the Blast suite of algorithms.</strong></p>
<p><strong>Relying on unique software architecture, PLAST takes full advantage of recent multi-core personal computers without requiring any additional hardware devices.</strong></p>
<p>PLAST stands for&nbsp;<em>Parallel Local Sequence Alignment Search Tool&nbsp;</em>and is was&nbsp;<a href="http://www.biomedcentral.com/1471-2105/10/329" target="_blank">published in BMC Bioinformatics.</a></p>
<p>PLAST is a general purpose sequence comparison tool providing the following benefits:</p>
<ul>
<li>PLAST is a high-performance sequence comparison tool designed to compare two sets of sequences (query vs. reference),</li>
<li>Reduces the processing time of sequences comparisons while providing highest quality results,</li>
<li>Contains a fully integrated data filtering engine capable of selecting relevant hits with user-defined criteria (E-Value, identity, coverage, alignment length, etc.),</li>
<li>Does not require any additional hardware, since it is a software solution. It is easy to install, cost-effective, takes full advantage of multi-core processors and uses a small RAM footprint,</li>
<li>Ready to be used on desktop computer, cluster, cloud as well as within distributed system running Hadoop.</li>
</ul>
<p>https://plast.inria.fr/</p><p>Address of the bookmark: <a href="https://plast.inria.fr/" rel="nofollow">https://plast.inria.fr/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36884/halc-high-throughput-algorithm-for-long-read-error-correction</guid>
	<pubDate>Fri, 08 Jun 2018 10:47:41 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36884/halc-high-throughput-algorithm-for-long-read-error-correction</link>
	<title><![CDATA[HALC: High throughput algorithm for long read error correction]]></title>
	<description><![CDATA[HALC, a high throughput algorithm for long read error correction. HALC aligns the long reads to short read contigs from the same species with a relatively low identity requirement so that a long read region can be aligned to at least one contig region, including its true genome region’s repeats in the contigs sufficiently similar to it (similar repeat based alignment approach)

HALC was able to obtain 6.7-41.1% higher throughput than the existing algorithms while maintaining comparable accuracy. The HALC corrected long reads can thus result in 11.4-60.7% longer assembled contigs than the existing algorithms.<p>Address of the bookmark: <a href="https://github.com/lanl001/halc" rel="nofollow">https://github.com/lanl001/halc</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37239/kat-a-k-mer-analysis-toolkit-to-quality-control-ngs-datasets-and-genome-assemblies</guid>
	<pubDate>Fri, 06 Jul 2018 03:36:45 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37239/kat-a-k-mer-analysis-toolkit-to-quality-control-ngs-datasets-and-genome-assemblies</link>
	<title><![CDATA[KAT: a K-mer analysis toolkit to quality control NGS datasets and genome assemblies]]></title>
	<description><![CDATA[<p>KAT is a suite of tools that analyse jellyfish hashes or sequence files (fasta or fastq) using kmer counts. The following tools are currently available in KAT:</p>
<ul>
<li><span>hist</span>: Create an histogram of k-mer occurrences from a sequence file. Adds metadata in output for easy plotting.</li>
<li><span>gcp:</span>&nbsp;K-mer GC Processor. Creates a matrix of the number of K-mers found given a GC count and a K-mer count.</li>
<li><span>comp</span>: K-mer comparison tool. Creates a matrix of shared K-mers between two (or three) sequence files or hashes.</li>
<li><span>sect</span>: SEquence Coverage estimator Tool. Estimates the coverage of each sequence in a file using K-mers from another sequence file.</li>
<li><span>blob</span>: Given, reads and an assembly, calculates both the read and assembly K-mer coverage along with GC% for each sequence in the assembly.SEquence Coverage estimator Tool.</li>
<li><span>filter</span>: Filtering tools. Contains tools for filtering k-mer hashes and FastQ/A files:
<ul>
<li><span>kmer</span>: Produces a k-mer hash containing only k-mers within specified coverage and GC tolerances.</li>
<li><span>seq</span>: Filters a sequence file based on whether or not the sequences contain k-mers within a provided hash.</li>
</ul>
</li>
<li><span>plot</span>: Plotting tools. Contains several plotting tools to visualise K-mer and compare distributions. The following plot tools are available:
<ul>
<li><span>density</span>: Creates a density plot from a matrix created with the "comp" tool. Typically this is used to compare two K-mer hashes produced by different NGS reads.</li>
<li><span>profile</span>: Creates a K-mer coverage plot for a single sequence. Takes in fasta coverage output coverage from the "sect" tool</li>
<li><span>spectra-cn</span>: Creates a stacked histogram using a matrix created with the "comp" tool. Typically this is used to compare a jellyfish hash produced from a read set to a jellyfish hash produced from an assembly. The plot shows the amount of distinct K-mers absent, as well as the copy number variation present within the assembly.</li>
<li><span>spectra-hist</span>: Creates a K-mer spectra plot for a set of K-mer histograms produced either by jellyfish-histo or kat-histo.</li>
<li><span>spectra-mx</span>: Creates a K-mer spectra plot for a set of K-mer histograms that are derived from selected rows or columns in a matrix produced by the "comp".</li>
</ul>
</li>
</ul>
<p>In addition, KAT contains a python script for analysing the mathematical distributions present in the K-mer spectra in order to determine how much content is present in each peak.</p>
<p>This README only contains some brief details of how to install and use KAT. For more extensive documentation please visit:&nbsp;<a href="https://kat.readthedocs.org/en/latest/">https://kat.readthedocs.org/en/latest/</a></p>
<p><a href="https://academic.oup.com/bioinformatics/article/33/4/574/2664339">https://academic.oup.com/bioinformatics/article/33/4/574/2664339&nbsp;</a></p><p>Address of the bookmark: <a href="https://github.com/TGAC/KAT" rel="nofollow">https://github.com/TGAC/KAT</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/37905/phased-human-genome-assembly</guid>
	<pubDate>Mon, 08 Oct 2018 09:10:54 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/37905/phased-human-genome-assembly</link>
	<title><![CDATA[Phased Human Genome Assembly !]]></title>
	<description><![CDATA[<p>The new publicly available assembly (PacBio&nbsp;<a href="https://www.globenewswire.com/Tracker?data=IM2cKfZgtHafORdb9VSstujBjyW-aIzFILCtXNAkcY_yqVmxdjvG01R_FZQC7zLxs-alqquXwsW6MG98G9-g-ym8Nue2pmUZMtkIg3FIat2mYbJ-z2Ra367GlinbO13x" target="_blank" title=""><span style="text-decoration: underline;">HG00733</span></a>) has the fewest gaps of any human genome assembly, with more than half of the genome contained in gapless sequence at least 27 Mb long. The primary contig assembly is 2.89 Gb long and consists of 865 contigs that were assembled with PacBio data generated with the company&rsquo;s Sequel<span>&reg;</span>&nbsp;System. Using the&nbsp;<a href="https://www.globenewswire.com/Tracker?data=jOa6mE1Y5r8VbU1CaCgx1A0HsoVzJ7waxOiDKgvmKL6cwJq_eH4nWrGj2vLkNpxHl1-5CH4htDB4113PXT8WU60hvHQ-KKpvAwQwveEGvz3N4d0q7QHSa_X97LW8_9xEiYqfsc4d24ca-IpVYZsf7Ue-XL7fSIIZw_EHK-F96t1aaQNRcD-z1PP5qvlZbVwX" target="_blank" title=""><span style="text-decoration: underline;">FALCON-Unzip assembler</span></a>, maternal and paternal haplotypes were resolved over more than 80% of the genome. Maternal and paternal haplotype blocks were then further phased using Hi-C technology and the&nbsp;<a href="https://www.globenewswire.com/Tracker?data=jOa6mE1Y5r8VbU1CaCgx1IrQmRcKvNQm83FLTqQE6OGzutM-fEggnm4Z-nsniK0D_YmDKS_UKWE0NHtHbgvbL973Y2-9NhrWhYKizXQ4lpiTvlqPf1UZdjqVs7BDjISgDnovv8foYw8es8jQzAg5Xfq1CH36NOnWQgA_X04XSvyEEEj0q801Im6cV5M5K4eL15vb_ZgUayccOvDY_fc6lxxPAAAyA4h16-zUN44Y81KdujciCrJrv5xynMIXEjRsaIKCf6eCX_Q1j_uZlN5TD0MVr6HulTYG8lGgyL0x-eQ=" target="_blank" title=""><span style="text-decoration: underline;">FALCON-Phase method</span></a>developed in collaboration with Phase Genomics. The genome was then&nbsp;<em>de novo</em>&nbsp;scaffolded using Phase Genomics&rsquo;&nbsp;<a href="https://www.globenewswire.com/Tracker?data=4wcqEWHJpCHRJARQkC0oVkYT9htT14iVebujxcW1nMpAjmigHGQ46ObCGetRfyaZm1ADIHaV1-30B9izTAhjJ-efhFlxorUxs08kdV-9AAzQyuHJ9S7wxnRRnyegsTZd" target="_blank" title=""><span style="text-decoration: underline;">Proximo Hi-C platform</span></a>, resulting in the first chromosome-scale diploid assembly of a single individual accomplished with only two technologies. More specific details about the assembly are included on the PacBio blog.</p><p>The data are available using NCBI accession IDs: BioProject: (<a href="https://www.globenewswire.com/Tracker?data=YZtCuhY2wu5H0yIso9jtUufPXbwyHh1QOZ1jBggGpK5NtXaU_JGC9X39F3uHZ96uVmu6hW5OB2Qq805hUEW2OhSNCm630yFiEF6_nsAwYB0=" target="_blank" title=""><span style="text-decoration: underline;">PRJNA483067</span></a>), assembly: [<a href="https://www.globenewswire.com/Tracker?data=CEXZ7E56JOsRgfH4Wq3r5LVbv4QH_UIekV9idYBys9l8K7pFft824jmYWNzJqK7lQ9fMbaAtbURpm8gM7zqUbpPUrydFwrkJGGtG-NBHctjyjddiFY-p06xZPm2mHXE2" target="_blank" title=""><span style="text-decoration: underline;">RBJD00000000</span></a>] and sequence data (<a href="https://www.globenewswire.com/Tracker?data=pELP2RpqTqTRaPF9yN1N7GZYlQmTxpY0aW-B8xaNw6iyD-Lylw7X3UzMDK3YS4AIYgLtD13em2XsbzOwKhXuNbI4Ks6-LSyXl1_yVdFoB0U=" target="_blank" title=""><span style="text-decoration: underline;">SRP155659</span></a>).</p><p><span>Additional Resources</span></p><ul>
<li><a href="http://globenewswire.com/Tracker?data=zXpdadphSgIAIEWeq46yRPm5-TU0H7wTkL48ue4I9GsaHd5mJyMb9PgXgAsElREkLOCOdWdJ8uW9DHB-LyQ7xhzbd97Qis6CuAlqD0ubGgY%3D" target="_blank" title=""><span style="text-decoration: underline;">Interactive map</span></a>&nbsp;showcasing global initiatives underway to generate reference-quality human genome assemblies for diverse populations</li>
<li><a href="http://globenewswire.com/Tracker?data=EQ8NIaaa8k1Nw1MPRJYIHYrqgsDy92kU8W0siJdGQhq5IJ0dcb890PFFm-C1SrAlFf0xkxUVRxZefFK5ebhoIzmS-6OjR1G9sTxOkCOwRHCAZWmHL-e7uGSuZYcw1VsDp8AeDWO0RwcepMMB6hAoR6BBCJDiJVVZtdFlWBn2uxs%3D" target="_blank" title=""><span style="text-decoration: underline;">BioReport Podcast</span></a>&nbsp;on the value of ethnic-specific reference genomes</li>
<li><em>Nature Reviews Genetics</em>&nbsp;paper from NHGRI:&nbsp;<a href="http://globenewswire.com/Tracker?data=dffu-wPD_JX1_KVeCA6VFy-kP1tlAUbn7d85saXD59dnnJfT2BE3N_Rbm6kT4BvifA_XEs49ioa75cy4HyFi90RA_LRa2QFF6Y4mr-dcoMucljZw0K4JNDZuwWkWPE51cVC2Lqq3E3C1aZ8un6Bq3i-OO_NiVH0hh23hUw4wC84%3D" target="_blank" title=""><span style="text-decoration: underline;">Prioritizing&nbsp;diversity&nbsp;in human genomics research</span></a></li>
<li>Article in&nbsp;<em>The Journal of Precision Medicine</em>: &ldquo;<a href="http://globenewswire.com/Tracker?data=yokLqO2TCBLCdj6uZl-GYbqcGMWBerBYjSPrLMumNrWF2p5XlXq9yl5p-1b5xx3Ckfn5ZjQWkdhxLttbiNae5gccUCP-9RWPUqvTu9MuU9zgJ1c8e14lAladCuEOiVZ2oVRiqssPtLu9hgQWw4ad5EUxZemevsHE4BHC6IiFmMZ6DS6ApwZu-IonFgCFBIcjWOpitQthDASosfaqkMi9LsKgLU9F0WGVJDDOzHXpddhjfCUdEEJ7xC1p8uh9TSiCZgZV6XPlUJSe8n0C_9TtOw%3D%3D" target="_blank" title=""><span style="text-decoration: underline;">Minority Report &ndash; Ethnic Diversity and the Real Promise for Precision Medicine</span></a>&rdquo;</li>
<li>Article&nbsp;in&nbsp;<em>Bio-IT World</em>: &ldquo;<a href="http://globenewswire.com/Tracker?data=rLp1pKetctTPitNEnRjOVDZ3Cvw3FUdL6_ybXncvhjR4ksOrX3y6HUK8WtLlKHT7XZzq_woUjZ-uw20YNvsP0GZAmy5lVqETt27oBLi02wFtTH_6ubELIHtBu8vfVyKnqKp-YhosFG5K7y0RUtzmNjOAlCYPAeVXabn2a2AiSePxUXA_tSy_g79hjYm63x9dPN9oFQGYedOsyHD_ls8DKw%3D%3D" target="_blank" title=""><span style="text-decoration: underline;">Genomic Data Standards Are a Necessity</span></a>&rdquo;</li>
<li>NHGRI Project Award:&nbsp;<a href="http://globenewswire.com/Tracker?data=FbqTEeRffJ88lFryYX6MiOefXvIXFdZDAyW4nrFoYNHaJyMEYIcb7I4BIcEQmxzsKOjrlf9F8irfRJeJLOqG8KFsl-kvkhakUkg3BfYdKGnpLzKYyWbUFR0aKMeEXirHBi7oDLEUSDO45qxANwxyee-pqZXfzAIwF1Wcuaf7EIzNqRqmBUJ3TyNyI05lwAo9gDKmApMnJo5VxPj5P_6rY8lisuv1PNSAh_kJPOuhVBk%3D" target="_blank" title=""><span style="text-decoration: underline;">High Quality Human and Non-Human Primate Genome Assemblies</span></a></li>
</ul><p>More details are available on the PacBio website:</p><ul>
<li>Blog post:&nbsp;<a href="http://globenewswire.com/Tracker?data=ycj-ujgsKzVyljNa11buVmIS5tk9B733VsFZEw77nBXo-IkBvcoG16dN9vuTiY3nm2G5dJZS5Iva3w_znrEtJVDuU8cVlFpozY2ibinKwrMGxkXZVSqW8_uD8fbySRjM5Q_cjuPU22ARFSSLCc9vHJx9WHnb9Rza-qPbuWgewa0rWWStq2fQY5mLpeaQf5fcDJnyQkvDAMI3fauXdzyThg%3D%3D" target="_blank" title=""><span style="text-decoration: underline;">Data Release: Highest-Quality, Most Contiguous Individual Human Genome Assembly to Date</span></a></li>
<li>Blog post:&nbsp;<a href="http://globenewswire.com/Tracker?data=GlZZ9nyp5mDSjJPPfhVD1-dZ_W2l8s0eAUox3TQs949zyGjzO7dx9xodyvyqerdqPC-G3ZhdPEs9xNhJwflrwgHPYQL3kTofprKHBBq3O4gn9E75YUBweJw9b6tTE89sMLUQzF-vRNNDjero3mibm_uG-fSHoYBTm2ZlyEmwzZ5E9tXVd5_RjG0Xnej2E0scA0SncEItAF6Q7vdOydTV_Yr9yYT2TmKY5jtyAt6ZrNGn3McqfV9mMRkR-8dYJLqrQln9JiEkWTwUae6Blj56HyjyXKl6Dfa_CyNuy4r-EWU%3D" target="_blank" title=""><span style="text-decoration: underline;">For Reference-Grade Human Genome Assemblies, SMRT Sequencing Yields Optimal Results</span></a></li>
<li>Webinar: &nbsp;<a href="http://globenewswire.com/Tracker?data=xlnfDwMNLGZZvtexJYsUgMe-DV8HNrYx2QqjwIjfj40dToVtqrBi-gvhknHZmIe8GV_3WU3_9LIlP6GzG3ZoajnDIpwECzdMV5Vyy8Ast4Y2AiHJckf7rBhZVEU4_mV4JB0k3I9XjN2jHK8Cp5uBxyIWWqPdI6qBBdCYYhYLXUTkKpaZEV98oCfC5ET2Q7OSwUM7NieKa75yzMHwaPEYwg%3D%3D" target="_blank" title=""><span style="text-decoration: underline;">Assembling High-Quality Human Reference Genomes for Global Populations</span></a></li>
<li>FALCON-Phase&nbsp;<a href="http://globenewswire.com/Tracker?data=4Z9LDdRq3w2zYFQXEFGmz6u-Vrbfh96syfzrQMKhegLRo2PUvk7s3Xz_y1o--NuTLoCQMrHsqOEBUHIL1IPeOmhyf6Eqwdp8dv8xYo9gSVI%3D" target="_blank" title=""><span style="text-decoration: underline;">press release</span></a>&nbsp;and article&nbsp;<a href="http://globenewswire.com/Tracker?data=4Z9LDdRq3w2zYFQXEFGmz9Ts_IJqHWWrKd33x_ldJEU9mSKXpcVTTi9ioY0kVqrbrXHeCKDf4TdPnAoPJaGBK3YeZtYp-nXZacgyPESZ1XboSUZEJ9rIhDyW7bTLL5HN" target="_blank" title=""><span style="text-decoration: underline;">preprint</span></a></li>
<li>PacBio research focus webpage about&nbsp;<a href="http://globenewswire.com/Tracker?data=E-zzUkw4N01KR4muPun47qg4HX8ToDvLS4sX953hLM2wRyQZ2upkLR4WidyXTFDRLWQORpqxnkbD-CNzsOJyIfH8mJPbrLwRf04J4yjuNdem-Fulc8QIT3OCi4wx5LpqgC2ymLE0rYX5UOpbFPBgvA%3D%3D" target="_blank" title=""><span style="text-decoration: underline;">Human Population Genetics</span></a></li>
</ul><p>&nbsp;Ref:&nbsp;https://stockguru.com/2018/10/08/pacific-biosciences-releases-highest-quality-most-contiguous-individual-human-genome-assembly-to-date/</p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37993/platypus-a-haplotype-based-variant-caller-for-next-generation-sequence-data</guid>
	<pubDate>Thu, 25 Oct 2018 06:14:55 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37993/platypus-a-haplotype-based-variant-caller-for-next-generation-sequence-data</link>
	<title><![CDATA[Platypus: A Haplotype-Based Variant Caller For Next Generation Sequence Data]]></title>
	<description><![CDATA[<p><strong>Platypus</strong><span>&nbsp;is a tool designed for efficient and accurate variant-detection in high-throughput sequencing data. By using local realignment of reads and local assembly it achieves both high sensitivity and high specificity. Platypus can detect SNPs, MNPs, short indels, replacements and (using the assembly option) deletions up to several kb. It has been extensively tested on&nbsp;</span><a href="http://www.ncbi.nlm.nih.gov/pubmed/?term=24463883">whole-genome</a><span>,&nbsp;</span><a href="http://www.nature.com/ng/journal/v45/n1/abs/ng.2492.html">exon-capture</a><span>, and&nbsp;</span><a href="http://www.nature.com/nature/journal/v493/n7432/abs/nature11725.html">targeted capture</a><span>&nbsp;data, it has been run on very large datasets as part of the&nbsp;</span><a href="http://www.1000genomes.org/">Thousand Genomes</a><span>&nbsp;and WGS500 projects, and is being used in clinical sequencing trials in the&nbsp;</span><a href="http://www.mcgprogramme.com/">Mainstreaming Cancer Genetics</a><span>&nbsp;programme.&nbsp;</span></p>
<p><span>Tutorial&nbsp;https://github.com/andyrimmer/Platypus/blob/master/misc/README.txt</span></p><p>Address of the bookmark: <a href="http://www.well.ox.ac.uk/platypus" rel="nofollow">http://www.well.ox.ac.uk/platypus</a></p>]]></description>
	<dc:creator>Shruti Paniwala</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38829/nquire-a-statistical-framework-for-ploidy-estimation-using-ngs-short-read-data</guid>
	<pubDate>Thu, 31 Jan 2019 05:12:19 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38829/nquire-a-statistical-framework-for-ploidy-estimation-using-ngs-short-read-data</link>
	<title><![CDATA[nQuire: A statistical framework for ploidy estimation using NGS short-read data]]></title>
	<description><![CDATA[<p>nQuire implements a set of commands to estimate ploidy level of individuals from species, where recent polyploidization occurred and intraspecific ploidy variation is observed. Specifically, nQuire uses next-generation sequencing data to distinguish between diploids, triploids and tetraploids, on the basis of frequency distributions at variant sites where only two bases are segregating.</p>
<p>For more background see also the publication at&nbsp;<a href="https://bmcbioinformatics.biomedcentral.com/articles/10.1186/s12859-018-2128-z">BMC Bioinformatics</a>.</p>
<p>https://github.com/clwgg/nQuire</p><p>Address of the bookmark: <a href="https://github.com/clwgg/nQuire" rel="nofollow">https://github.com/clwgg/nQuire</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/40204/iitm-tokyo-tech-joint-symposium</guid>
	<pubDate>Thu, 24 Oct 2019 10:30:25 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/40204/iitm-tokyo-tech-joint-symposium</link>
	<title><![CDATA[IITM-Tokyo Tech Joint Symposium]]></title>
	<description><![CDATA[<p>The IITM-Tokyo Tech Joint Symposium is a biannual international symposium held in Indian Institute of Technology Madras (IITM), India in collaboration with Tokyo Institute of Technology (Tokyo-Tech), Japan. During the symposium, experts in various domains of Bioinformatics gather from India and Japan under one roof to discuss and present their works. This provides an unique opportunity to the researchers and students to learn the frontiers and interact with eminent scientists in Bioinformatics. The 5th IITM - Tokyo Tech Joint Symposium titled "Current trends in Bioinformatics: Big data analysis, machine learning and drug design", will be held on 6th - 7th March 2020 in IITM, Chennai, India.</p><p>The symposium will focus on topics in the below mentioned areas.</p><p>Topics: Algorithms for biomolecular sequences / structures Bioinformatics databases and tools Protein function Structure based drug design Machine learning Deep learning Large scale data analysis Big Data NGS Analysis Protein interactions/network Molecular modelling/docking/screening Biomolecular structure and function More</p><p>Info: https://web.iitm.ac.in/bioinfo2/symposium2020/home</p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>