<?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/1897?offset=220</link>
	<atom:link href="https://bioinformaticsonline.com/related/1897?offset=220" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34515/metasim-a-sequencing-simulator-for-genomics-and-metagenomics</guid>
	<pubDate>Mon, 04 Dec 2017 07:18:20 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34515/metasim-a-sequencing-simulator-for-genomics-and-metagenomics</link>
	<title><![CDATA[MetaSim A Sequencing Simulator for Genomics and Metagenomics.]]></title>
	<description><![CDATA[<p><span>Our software can be used to&nbsp;</span><strong>generate collections of synthetic reads</strong><span>&nbsp;that reflect the diverse taxonomical composition of typical metagenome data sets. Based on a database of given genomes, the program allows the user to&nbsp;</span><strong>design a metagenome</strong><span>&nbsp;by specifying the number of genomes present at different levels of the NCBI taxonomy, and then to collect reads from the metagenome using a&nbsp;</span><strong>simulation of a number of different sequencing technologies</strong><span>. A population sampler optionally produces evolved sequences based on source genomes and a given evolutionary tree.&nbsp;</span></p><p>Address of the bookmark: <a href="http://ab.inf.uni-tuebingen.de/software/metasim/" rel="nofollow">http://ab.inf.uni-tuebingen.de/software/metasim/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40707/vt-a-variant-tool-set-that-discovers-short-variants-from-next-generation-sequencing-data</guid>
	<pubDate>Tue, 28 Jan 2020 03:44:43 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40707/vt-a-variant-tool-set-that-discovers-short-variants-from-next-generation-sequencing-data</link>
	<title><![CDATA[vt: a variant tool set that discovers short variants from Next Generation Sequencing data.]]></title>
	<description><![CDATA[<p><span>vt is a variant tool set that discovers short variants from Next Generation Sequencing data.</span></p>
<p><span><a href="https://genome.sph.umich.edu/wiki/Vt">https://genome.sph.umich.edu/wiki/Vt</a></span></p>
<p><a href="https://github.com/atks/vt">https://github.com/atks/vt</a></p><p>Address of the bookmark: <a href="https://genome.sph.umich.edu/wiki/Vt" rel="nofollow">https://genome.sph.umich.edu/wiki/Vt</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43892/choosing-the-right-ngs-sequencing-instrument-for-your-study</guid>
	<pubDate>Wed, 15 Jun 2022 00:37:29 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43892/choosing-the-right-ngs-sequencing-instrument-for-your-study</link>
	<title><![CDATA[Choosing the Right NGS Sequencing Instrument for Your Study]]></title>
	<description><![CDATA[<p>The right sequencing instrument for your study depends on your project goal. Setting aside turnaround time and price, it essentially comes down to the numbers of reads and read length you need for your experiment. Below, we've described and compared metrics for each of the instruments available. If you&rsquo;re new to high-throughput sequencing and have questions about how you should design your sequencing run, fill out our&nbsp;<a href="https://genohub.com/ngs-consultation/"><span>free consultation form</span></a>&nbsp;and we'll get in touch with you to help.</p>
<p>More at&nbsp;https://genohub.com/ngs-instrument-guide/</p><p>Address of the bookmark: <a href="https://genohub.com/ngs-instrument-guide/" rel="nofollow">https://genohub.com/ngs-instrument-guide/</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/view/1906</guid>
	<pubDate>Sun, 11 Aug 2013 11:13:58 -0500</pubDate>
	<link>https://bioinformaticsonline.com/view/1906</link>
	<title><![CDATA[Compressive Genomics]]></title>
	<description><![CDATA[<p>The key to finding a solution is to notice that most&nbsp;<a href="http://www.i-programmer.info/news/181-algorithms/4537-a-new-dna-sequence-search-compressive-genomics.html">genomic</a>sequences differ by very little. It may well be that the number of complete genome sequences being stored is increasing rapidly, but the actual amount of new data is very small. In other words, a single DNA sequence isn't particularly compressible but a set of sequences shares so much in common that the redundancy can be used to store them in a much smaller storage space. (Source:e-article from&nbsp;Alex Armstrong)</p><p><a href="http://www.i-programmer.info/news/181-algorithms/4537-a-new-dna-sequence-search-compressive-genomics.html">http://www.i-programmer.info/news/181-algorithms/4537-a-new-dna-sequence-search-compressive-genomics.html</a></p><p><a href="http://en.wikipedia.org/wiki/Compression_of_Genomic_Re-Sequencing_Data">http://en.wikipedia.org/wiki/Compression_of_Genomic_Re-Sequencing_Data</a></p><p><a href="http://www.nature.com/nbt/journal/v30/n7/full/nbt.2241.html">http://www.nature.com/nbt/journal/v30/n7/full/nbt.2241.html</a></p><p><a href="http://bioinformatics.oxfordjournals.org/content/29/13/i283.full">http://bioinformatics.oxfordjournals.org/content/29/13/i283.full</a></p><p><a href="http://groups.csail.mit.edu/cb/cast/">http://groups.csail.mit.edu/cb/cast/</a></p>]]></description>
	<dc:creator>Rahul Agarwal</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/2991/illumina-reveals-first-dataset-of-long-reads</guid>
	<pubDate>Fri, 23 Aug 2013 06:29:14 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/2991/illumina-reveals-first-dataset-of-long-reads</link>
	<title><![CDATA[Illumina reveals first dataset of long reads]]></title>
	<description><![CDATA[<p>With the help of Moleculo technology , acquired by Illumina releases new service for long reads sequencing i.e., &nbsp;<a href="http://www.illumina.com/services/long-read-sequencing-service.ilmn">FastTrack Long Reads</a>.</p><p>Average read length is around<span>&nbsp;8,500 base pairs in release dataset.</span>&nbsp;Best thing about this, there is not much effect on cost and quality of data.</p><p>You can also check following pages for publications on long reads and more:</p><p><a href="http://www.illumina.com/services/long-read-sequencing-service.ilmn">http://www.illumina.com/services/long-read-sequencing-service.ilmn</a></p><p><a href="http://blog.basespace.illumina.com/2013/07/22/first-data-set-from-fasttrack-long-reads-early-access-service/">http://blog.basespace.illumina.com/2013/07/22/first-data-set-from-fasttrack-long-reads-early-access-service/</a></p><p>&nbsp;</p><p>&nbsp;</p>]]></description>
	<dc:creator>Rahul Agarwal</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/4288/new-born-babies-get-ready-to-know-their-whole-genome-soon</guid>
	<pubDate>Thu, 05 Sep 2013 07:24:02 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/4288/new-born-babies-get-ready-to-know-their-whole-genome-soon</link>
	<title><![CDATA[New born babies get ready to know their whole genome soon!!!]]></title>
	<description><![CDATA[<p>USA launch a pilot projects to examine medical information of newborn baby, which are being funded by the Eunice Kennedy Shriver National Institute of Child Health and Human Development (NICHD) and the National Human Genome Research Institute (NHGRI), both parts of the National Institutes of Health.</p><p>Awards of $5 million to four grantees have been made in fiscal year 2013 under the Genomic Sequencing and Newborn Screening Disorders research program. The program will be funded at $25 million over five years, as funds are made available.</p><p>"Hundreds of US babies will be pioneers in genomic medicine through a&nbsp;US$25-million programme to sequence their genomes&nbsp;soon after they are born."</p><p><strong>Source</strong>:</p><p><a href="http://blogs.nature.com/news/2013/09/scientists-to-sequence-hundreds-of-newborns-genomes.html">http://blogs.nature.com/news/2013/09/scientists-to-sequence-hundreds-of-newborns-genomes.html</a></p><p><a href="http://www.genome.gov/27554919">http://www.genome.gov/27554919</a></p>]]></description>
	<dc:creator>Rahul Agarwal</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/5388/biggest-human-brain-project-hbp-launched</guid>
	<pubDate>Mon, 07 Oct 2013 19:50:55 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/5388/biggest-human-brain-project-hbp-launched</link>
	<title><![CDATA[Biggest Human Brain Project (HBP) launched!!!]]></title>
	<description><![CDATA[<p><img src="http://s1.ibtimes.com/sites/www.ibtimes.com/files/styles/v2_article_large/public/2013/10/07/human-brain-project.jpg" width="500" height="500" alt="image" style="border: 0px;"></p><p>"In neuroscience, the project will use neuroinformatics and brain simulation to collect and integrate experimental data, identifying and filling gaps in our knowledge, and prioritising future experiments.</p><p>In medicine, the HBP will use medical informatics to identify biological signatures of brain disease, allowing diagnosis at an early stage, before the disease has done irreversible damage, and enabling personalized treatment, adapted to the needs of individual patients. Better diagnosis, combined with disease and drug simulation, will accelerate the discovery of new treatments, drastically lowering the cost of drug discovery.<br /><br />In computing, new techniques of interactive supercomputing, driven by the needs of brain simulation, will impact a vast range of industries. Devices and systems, modelled after the brain, will overcome fundamental limits on the energy-efficiency, reliability and programmability of current technologies, clearing the road for systems with brain-like intelligence."</p><p>Source:&nbsp;<a href="http://www.forbes.com/sites/jenniferhicks/2013/10/07/the-human-brain-project-begins/">http://www.forbes.com/sites/jenniferhicks/2013/10/07/the-human-brain-project-begins/</a>&nbsp;</p><p>(<a href="https://www.facebook.com/humanbrainproj/info">https://www.facebook.com/humanbrainproj/info</a>)</p><p>Home Page:</p><p><a href="https://www.humanbrainproject.eu/">https://www.humanbrainproject.eu/</a></p><p>Jobs:</p><p><a href="https://www.humanbrainproject.eu/participate/jobs">https://www.humanbrainproject.eu/participate/jobs</a></p>]]></description>
	<dc:creator>Rahul Agarwal</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/9675/application-scientist-in-strand-lifesciences-bangalore</guid>
  <pubDate>Mon, 07 Apr 2014 08:17:32 -0500</pubDate>
  <link></link>
  <title><![CDATA[Application Scientist in Strand LifeSciences Bangalore]]></title>
  <description><![CDATA[
<p>Job Description<br />We are looking for a motivated application scientist to help evaluate, compare, and develop next generation sequencing (NGS) data analysis methods. The successful candidate should be able to quickly understand the state-of-art computational biology techniques, prototype them and perform benchmarking studies. The candidate must also be comfortable working with people from different disciplines and be able to present data analysis results in a clear and effective manner. The candidate is also expected to interact with customers as needed, write technical reports and publish new methods and/or data analysis findings in public forums.</p>

<p>Candidate Requirements:<br />A PhD in computer science, computational biology, Bioinformatics, or a related field, along with sufficient programming skills for prototyping. Experience with next generation sequencing data analysis is required. Candidates with MS degree but with relevant work experience can also be considered. </p>

<p>To Apply<br />To apply, please send your updated CV and cover letter to Dr. Rohit Gupta (rohit@strandls.com). </p>

<p>Source: http://www.strandls.com/application-scientist</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/11368/metagenomics-role-in-antibiotic-resistance</guid>
	<pubDate>Mon, 02 Jun 2014 08:04:40 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/11368/metagenomics-role-in-antibiotic-resistance</link>
	<title><![CDATA[Metagenomics role in antibiotic resistance]]></title>
	<description><![CDATA[<p>Related latest article:</p>
<p><a href="http://www.nature.com/nature/journal/v509/n7502/pdf/nature13377.pdf">http://www.nature.com/nature/journal/v509/n7502/pdf/nature13377.pdf</a></p><p>Address of the bookmark: <a href="https://www.landesbioscience.com/journals/virulence/2013VIRULENCE0033R2.pdf" rel="nofollow">https://www.landesbioscience.com/journals/virulence/2013VIRULENCE0033R2.pdf</a></p>]]></description>
	<dc:creator>Rahul Agarwal</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/34221/alignment-free-sequence-comparison-tools-available-for-next-generation-sequencing-data-analysis</guid>
	<pubDate>Tue, 07 Nov 2017 05:33:33 -0600</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/34221/alignment-free-sequence-comparison-tools-available-for-next-generation-sequencing-data-analysis</link>
	<title><![CDATA[Alignment-free sequence comparison tools available for next-generation sequencing data analysis]]></title>
	<description><![CDATA[<div><p><span>kallisto</span></p></div><div><p>Transcript abundance quantification from RNA-seq data (uses pseudoalignment for rapid determination of read compatibility with targets)</p><p>Software (C++)</p><p><a href="https://pachterlab.github.io/kallisto/">https://pachterlab.github.io/kallisto/</a></p><p>Sailfish</p><p>Estimation of isoform abundances from reference sequences and RNA-seq data (<em>k</em>-mer based)</p><p>Software (C++)</p><p><a href="http://www.cs.cmu.edu/~ckingsf/software/sailfish/">http://www.cs.cmu.edu/~ckingsf/software/sailfish/</a></p><p>Salmon</p><p>Quantification of the expression of transcripts using RNA-seq data (uses&nbsp;<em>k</em>-mers)</p><p><a href="https://combine-lab.github.io/salmon/">https://combine-lab.github.io/salmon/</a></p><p>RNA-Skim</p><p>RNA-seq quantification at transcript-level (partitions the transcriptome into disjoint transcript clusters; uses&nbsp;<em>sig</em>-mers, a special type of&nbsp;<em>k</em>-mers)</p><p>Software (C++)</p><p><a href="http://www.csbio.unc.edu/rs/">http://www.csbio.unc.edu/rs/</a></p><p>Variant calling</p><p>ChimeRScope</p><p>Fusion transcript prediction using gene&nbsp;<em>k</em>-mers profiles of the RNA-seq paired-end reads</p><p>Software (Java)</p><p><a href="https://github.com/ChimeRScope/ChimeRScope/wiki">https://github.com/ChimeRScope/ChimeRScope/wiki</a></p><p>FastGT</p><p>Genotyping of known SNV/SNP variants directly from raw NGS sequence reads by counting unique&nbsp;<em>k</em>-mers</p><p>Software (C)</p><p><a href="https://github.com/bioinfo-ut/GenomeTester4/">https://github.com/bioinfo-ut/GenomeTester4/</a></p><p>Phy-Mer</p><p>Reference-independent mitochondrial haplogroup classifier from NGS data (<em>k</em>-mer based)</p><p>Software (Python)</p><p><a href="https://github.com/danielnavarrogomez/phy-mer">https://github.com/danielnavarrogomez/phy-mer</a></p><p>LAVA</p><p>Genotyping of known SNPs (dbSNP and Affymetrix's Genome-Wide Human SNP Array) from raw NGS reads (<em>k</em>-mer based)</p><p>Software (C)</p><p><a href="http://lava.csail.mit.edu/">http://lava.csail.mit.edu/</a></p><p>MICADo</p><p>Detection of mutations in targeted third-generation NGS data (can distinguish patients&rsquo; specific mutations; algorithm uses&nbsp;<em>k</em>-mers and is based on colored de Bruijn graphs)</p><p>Software (Python)</p><p><a href="http://github.com/cbib/MICADo">http://github.com/cbib/MICADo</a></p><p>General mapper</p><p>Minimap</p><p>Lightweight and fast read mapper and read overlap detector (uses the concept of &ldquo;minimazers&rdquo;, a special type of&nbsp;<em>k</em>-mers)</p><p>Software (C)</p><p><a href="https://github.com/lh3/minimap">https://github.com/lh3/minimap</a></p><p>Assembly</p><p>De novo genome assembly</p><p>MHAP</p><p>Produces highly continuous assembly (fully resolved chromosome arms) from third-generation long and noisy reads (10 kbp) using a dimensionality reduction technique MinHash</p><p>Software (Java)</p><p><a href="https://github.com/marbl/MHAP">https://github.com/marbl/MHAP</a></p><p>Miniasm</p><p>Assembler of long noisy reads (SMRT, ONT) using the Overlap-Layout Consensus (OLC) approach without the necessity of an error correction stage (uses minimap)</p><p>Software (C)</p><p><a href="https://github.com/lh3/miniasm">https://github.com/lh3/miniasm</a></p><p>LINKS</p><p>Scaffolding genome assembly with error-containing long sequence (e.g., ONT or PacBio reads, draft genomes)</p><p>Software (Perl)</p><p><a href="https://github.com/warrenlr/LINKS/">https://github.com/warrenlr/LINKS/</a></p><p>Read clustering</p><p>afcluster</p><p>Clustering of reads from different genes and different species based on&nbsp;<em>k</em>-mer counts</p><p>Software (C++)</p><p><a href="https://github.com/luscinius/afcluster">https://github.com/luscinius/afcluster</a></p><p>QCluster</p><p>Clustering of reads with alignment-free measures (<em>k</em>-mer based) and quality values</p><p>Software (C++)</p><p><a href="http://www.dei.unipd.it/~ciompin/main/qcluster.html">http://www.dei.unipd.it/~ciompin/main/qcluster.html</a></p><p>Reads error correction</p><p>Lighter</p><p>Correction of sequencing errors in raw, whole genome sequencing reads (<em>k</em>-mer based)</p><p>Software (C++)</p><p><a href="https://github.com/mourisl/Lighter">https://github.com/mourisl/Lighter</a></p><p>QuorUM</p><p>Error corrector for Illumina reads using k-mers</p><p>Software (C++)</p><p><a href="https://github.com/gmarcais/Quorum">https://github.com/gmarcais/Quorum</a></p><p>Trowel</p><p>Software (C++)</p><p><a href="https://sourceforge.net/projects/trowel-ec/">https://sourceforge.net/projects/trowel-ec/</a></p><p>Metagenomics</p><p>Assembly-free phylogenomics</p><p>AAF</p><p>Phylogeny reconstruction directly from unassembled raw sequence data from whole genome sequencing projects; provides bootstrap support to assess uncertainty in the tree topology (<em>k</em>-mer based)</p><p>Software (Python)</p><p><a href="https://github.com/fanhuan/AAF">https://github.com/fanhuan/AAF</a></p><p>kSNP v3</p><p>Reference-free SNP identification and estimation of phylogenetic trees using SNPs (based on&nbsp;<em>k</em>-mer analysis)</p><p>Software (C)</p><p><a href="https://sourceforge.net/projects/ksnp/files/">https://sourceforge.net/projects/ksnp/files/</a></p><p>NGS-MC</p><p>Phylogeny of species based on NGS reads using alignment-free sequence dissimilarity measures d2* and d2&nbsp;S&nbsp;under different Markov chain models (using&nbsp;<em>k</em>-words)</p><p>R package</p><p><a href="http://www-rcf.usc.edu/~fsun/Programs/NGS-MC/NGS-MC.html">http://www-rcf.usc.edu/~fsun/Programs/NGS-MC/NGS-MC.html</a></p><p>Species identification/taxonomic profiling</p><p>CLARK</p><p>Taxonomic classification of metagenomic reads to known bacterial genomes using&nbsp;<em>k</em>-mer search and LCA assignment</p><p>Software (C++)</p><p><a href="http://clark.cs.ucr.edu/">http://clark.cs.ucr.edu/</a></p><p>FOCUS</p><p>Reports organisms present in metagenomic samples and profiles their abundances (uses composition-based approach and non-negative least squares for prediction)</p><p>Web service Software (Python)</p><p><a href="http://edwards.sdsu.edu/FOCUS/">http://edwards.sdsu.edu/FOCUS/</a></p><p>GSM</p><p>Estimation of abundances of microbial genomes in metagenomic samples (<em>k</em>-mer based)</p><p>Software (Go)</p><p><a href="https://github.com/pdtrang/GSM">https://github.com/pdtrang/GSM</a></p><p>Mash</p><p>Species identification using assembled or unassembled Illumina, PacBio, and ONT data (based on MinHash dimensionality-reduction technique)</p><p>Software (C++)</p><p><a href="https://github.com/marbl/mash">https://github.com/marbl/mash</a></p><p>Kraken</p><p>Taxonomic assignment in metagenome analysis by exact&nbsp;<em>k</em>-mer search; LCA assignment of short reads based on a comprehensive sequence database</p><p>Software (C++)</p><p><a href="https://ccb.jhu.edu/software/kraken/">https://ccb.jhu.edu/software/kraken/</a></p><p>LMAT</p><p>Assignment of taxonomic labels to reads by&nbsp;<em>k</em>-mers searches in precomputed database</p><p>Software (C++/Python)</p><p><a href="https://sourceforge.net/projects/lmat/">https://sourceforge.net/projects/lmat/</a></p><p>stringMLST</p><p><em>k</em>-mer-based tool for MLST directly from the genome sequencing reads</p><p>Software (Python)</p><p><a href="http://jordan.biology.gatech.edu/page/software/stringMLST">http://jordan.biology.gatech.edu/page/software/stringMLST</a></p><p>Taxonomer</p><p><em>k</em>-mer-based ultrafast metagenomics tool for assigning taxonomy to sequencing reads from clinical and environmental samples</p><p>Web service</p><p><a href="http://taxonomer.iobio.io/">http://taxonomer.iobio.io/</a></p><p>Other</p><p>d2-tools</p><p>Word-based (<em>k</em>-tuple) comparison (pairwise dissimilarity matrix using d2S measure) of metatranscriptomic samples from NGS reads</p><p>Software (Python/R)</p><p><a href="https://code.google.com/p/d2-tools/">https://code.google.com/p/d2-tools/</a></p><p>VirHostMatcher</p><p>Prediction of hosts from metagenomic viral sequences based on ONF using various distance measures (e.g., d2)</p><p>Software (C++)</p><p><a href="https://github.com/jessieren/VirHostMatcher">https://github.com/jessieren/VirHostMatcher</a></p><p>MetaFast</p><p>Statistics calculation of metagenome sequences and the distances between them based on assembly using de Bruijn graphs and Bray&ndash;Curtis dissimilarity measure</p><p>Software (Java)</p><p><a href="https://github.com/ctlab/metafast">https://github.com/ctlab/metafast</a></p></div>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>

</channel>
</rss>