<?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/34711?offset=110</link>
	<atom:link href="https://bioinformaticsonline.com/related/34711?offset=110" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40754/understanding-your-reads-and-mapping</guid>
	<pubDate>Wed, 29 Jan 2020 06:29:55 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40754/understanding-your-reads-and-mapping</link>
	<title><![CDATA[Understanding your reads and mapping !]]></title>
	<description><![CDATA[<p>One of the best tutorial for beginners ...</p>
<p>https://bioinformatics-core-shared-training.github.io/cruk-summer-school-2017/Day1/Session4-seqIntro.html</p><p>Address of the bookmark: <a href="https://bioinformatics-core-shared-training.github.io/cruk-summer-school-2017/Day1/Session4-seqIntro.html" rel="nofollow">https://bioinformatics-core-shared-training.github.io/cruk-summer-school-2017/Day1/Session4-seqIntro.html</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/43977/read-simulators</guid>
	<pubDate>Fri, 30 Sep 2022 06:48:18 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/43977/read-simulators</link>
	<title><![CDATA[Read Simulators]]></title>
	<description><![CDATA[<h1>Short Read Simulators</h1><p>With the popularity of next-generation sequencing (NGS) technologies, many NGS read simulators have been developed. Currently, many of the popular short read simulators are designed to simulate reads mimicking many Illumina, 454 and SOLiD platforms. Listed below are some popular short read simulators. Links to their publications are provided as well.</p><ol>
<li><a href="https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0003373" target="_blank">MetaSim</a></li>
<li><a href="https://github.com/lh3/wgsim" target="_blank">wgsim</a></li>
<li><a href="https://github.com/timmassingham/simNGS" target="_blank">SimNGS</a></li>
<li><a href="https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0049110" target="_blank">ArtificialFastqGenerator</a></li>
<li id="e943"><a href="https://academic.oup.com/bioinformatics/article/35/3/521/5055123" target="_blank">InSilicoSeq</a></li>
</ol><h1>Long Read Simulators</h1><p id="d469">With the advancements in sequencing technologies, scientists have shown an increasing interest in using third-generation sequencing (TGS) technologies. Currently, many of the popular long read simulators are designed to simulate reads mimicking the two main TGS technologies; (1)&nbsp;<em>Pacific Biosciences (PacBio)</em>&nbsp;and (2)&nbsp;<em>Oxford Nanopore (ONT)</em>. Listed below are some of the popular and recently introduced PacBio and ONT simulators. Links to their publications are provided as well.</p><h2><span>PacBio Simulators</span></h2><ol>
<li><a href="https://academic.oup.com/bioinformatics/article/29/1/119/273243" target="_blank">PBSIM</a></li>
<li><a href="https://academic.oup.com/bioinformatics/article/32/24/3829/2525710" target="_blank">LongISLND</a></li>
<li><a href="https://academic.oup.com/bioinformatics/article/32/17/2704/2450740" target="_blank">SimLoRD</a></li>
<li><a href="https://bmcbioinformatics.biomedcentral.com/articles/10.1186/s12859-018-2208-0" target="_blank">NPBSS</a></li>
<li id="fed0"><a href="https://bmcbioinformatics.biomedcentral.com/articles/10.1186/s12859-019-2901-7" target="_blank">PaSS</a></li>
</ol><h2><span>ONT Simulators</span></h2><ol>
<li id="f145"><a href="https://academic.oup.com/gigascience/article/6/4/gix010/3051934" target="_blank">NanoSim</a></li>
<li id="c6f5"><a href="https://ieeexplore.ieee.org/document/8621253" target="_blank">Nanopore SimulatION</a></li>
<li><a href="https://academic.oup.com/bioinformatics/article/34/17/2899/4962495" target="_blank">DeepSimulator</a></li>
<li><a href="https://academic.oup.com/bioinformatics/article/36/8/2578/5698265" target="_blank">DeepSimulator1.5</a></li>
</ol>]]></description>
	<dc:creator>Abhi</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36618/lamsa-fast-split-read-alignment-with-long-approximate-matches</guid>
	<pubDate>Tue, 15 May 2018 04:44:42 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36618/lamsa-fast-split-read-alignment-with-long-approximate-matches</link>
	<title><![CDATA[LAMSA: fast split read alignment with long approximate matches]]></title>
	<description><![CDATA[LAMSA (Long Approximate Matches-based Split Aligner) is a novel split alignment approach with faster speed and good ability of handling SV events. It is well-suited to align long reads (over thousands of base-pairs).

LAMSA takes takes the advantage of the rareness of SVs to implement a specifically designed two-step strategy. That is, LAMSA initially splits the read into relatively long fragments and co-linearly align them to solve the small variations or sequencing errors, and mitigate the effect of repeats. The alignments of the fragments are then used for implementing a sparse dynamic programming (SDP)-based split alignment approach to handle the large or non-co-linear variants.

We benchmarked LAMSA with simulated and real datasets having various read lengths and sequencing error rates, the results demonstrate that it is substantially faster than the state-of-the-art long read aligners; mean-while, it also has good ability to handle various categories of SVs.

LAMSA is open source and free for non-commercial use.

LAMSA is mainly designed by Bo Liu &amp; Yan Gao and developed by Yan Gao in Center for Bioinformatics, Harbin Institute of Technology, China.<p>Address of the bookmark: <a href="https://github.com/hitbc/LAMSA" rel="nofollow">https://github.com/hitbc/LAMSA</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/39190/chipulate-a-python3-framework-to-simulate-read-counts-in-a-chip-seq-experiment</guid>
	<pubDate>Mon, 25 Mar 2019 12:46:47 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/39190/chipulate-a-python3-framework-to-simulate-read-counts-in-a-chip-seq-experiment</link>
	<title><![CDATA[ChIPulate: A Python3 framework to simulate read counts in a ChIP-seq experiment]]></title>
	<description><![CDATA[<p><span style="color: #202020; font-size: 13px; font-style: normal; font-weight: 400; text-align: start; background-color: #ffffff; float: none;">ChIP-seq simulation pipeline, ChIPulate, we assess the impact of various biological and experimental sources of variation on several outcomes of a ChIP-seq experiment, viz., the recoverability of the TF binding motif, accuracy of TF-DNA binding detection, the sensitivity of inferred TF-DNA binding strength, and number of replicates needed to confidently infer binding strength.<span> <br></span></span></p><p>Address of the bookmark: <a href="https://github.com/vishakad/chipulate" rel="nofollow">https://github.com/vishakad/chipulate</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44329/metabuli-%EB%B6%84%EB%A6%AC-improves-metagenomic-read-classification</guid>
	<pubDate>Sat, 03 Jun 2023 20:15:04 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44329/metabuli-%EB%B6%84%EB%A6%AC-improves-metagenomic-read-classification</link>
	<title><![CDATA[Metabuli 분리 improves metagenomic read classification]]></title>
	<description><![CDATA[<p><span>Metabuli 분리 improves metagenomic read classification through metamers, DNA-AA k-mers, to be sensitive and specific, recovering 99% and 98% of DNA or AA classifiers.</span></p>
<p>&nbsp;</p>
<p><span><span>Metabuli is metagenomic classifier that jointly analyze both DNA and amino acid (AA) sequences. DNA-based classifiers can make specific classifications, exploiting point mutations to distinguish close taxa. AA-based classifiers have higher sensitivity in detecting homology between query and reference sequences, leverageing higher conservation of AA sequences. Metabuli combines the information of both sequence types using a novel k-mer structure,&nbsp;</span><em>metamer</em><span>, to enable both specific and sensitive characterization of metagenomic samples. In addition, it can classify reads against a database of any size as long as it fits in the hard disk.</span> </span></p><p>Address of the bookmark: <a href="https://github.com/steineggerlab/Metabuli" rel="nofollow">https://github.com/steineggerlab/Metabuli</a></p>]]></description>
	<dc:creator>Abhi</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/4099/sequencing-solutions-to-world-health</guid>
	<pubDate>Thu, 29 Aug 2013 15:05:35 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/4099/sequencing-solutions-to-world-health</link>
	<title><![CDATA[Sequencing Solutions to World Health]]></title>
	<description><![CDATA[<p>"<em>New technology that quickly, easily and economically reveals the genomes of viruses and pathogens transforms public health and medicine."</em></p>
<p><strong>Source</strong>: Life technologies</p><p>Address of the bookmark: <a href="http://www.lifetechnologies.com/global/en/home/communities-social/blog/blogs/sequencing-solutions-to-world-health.html?cid=social_blogseries_20130829_11098264" rel="nofollow">http://www.lifetechnologies.com/global/en/home/communities-social/blog/blogs/sequencing-solutions-to-world-health.html?cid=social_blogseries_20130829_11098264</a></p>]]></description>
	<dc:creator>Rahul Agarwal</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/2726/comparison-of-short-read-de-novo-alignment-algorithms</guid>
	<pubDate>Wed, 21 Aug 2013 07:56:01 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/2726/comparison-of-short-read-de-novo-alignment-algorithms</link>
	<title><![CDATA[Comparison of Short Read De Novo Alignment Algorithms]]></title>
	<description><![CDATA[<p>Excellent article to introduce different sequencing methods along with tools for de novo assembly of sequencing reads and their relevant references.</p>
<p>Title:&nbsp;<strong>Comparison of Short Read De Novo Alignment Algorithms&nbsp;</strong></p>
<p>Author<strong>: Nikhil Gopal</strong></p><p>Address of the bookmark: <a href="http://biochem218.stanford.edu/Projects%202011/Gopal%202011.pdf" rel="nofollow">http://biochem218.stanford.edu/Projects%202011/Gopal%202011.pdf</a></p>]]></description>
	<dc:creator>Rahul Agarwal</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/4208/latest-paper-on-comparison-of-mapping-tools</guid>
	<pubDate>Tue, 03 Sep 2013 18:00:38 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/4208/latest-paper-on-comparison-of-mapping-tools</link>
	<title><![CDATA[Latest paper on comparison of mapping tools]]></title>
	<description><![CDATA[<p>A. Hatem, D. Bozdag, A. E. Toland, U. V. Catalyurek "Benchmarking short sequence mapping tools" BMC Bioinformatics, 14(1):184, 2013.</p>
<p>http://bmi.osu.edu/hpc/software/benchmark/</p>
<p><a href="http://bmi.osu.edu/hpc/software/pmap/pmap.html">http://bmi.osu.edu/hpc/software/pmap/pmap.html</a></p>
<p>Other similiar papers:</p>
<p><a href="http://online.liebertpub.com/doi/pdf/10.1089/cmb.2012.0022">http://online.liebertpub.com/doi/pdf/10.1089/cmb.2012.0022</a></p>
<p><a href="http://bioinformatics.oxfordjournals.org/content/28/24/3169">http://bioinformatics.oxfordjournals.org/content/28/24/3169</a></p>
<p>Some new Mapping tool links:<a href="http://bmi.osu.edu/hpc/software/benchmark/"></a></p>
<p><strong>GSNAP</strong></p>
<p><a href="http://research-pub.gene.com/gmap/"></a><a href="http://research-pub.gene.com/gmap/">http://research-pub.gene.com/gmap/</a></p>
<p><strong>RMAP</strong></p>
<p><a href="http://rulai.cshl.edu/rmap/"></a><a href="http://rulai.cshl.edu/rmap/">http://rulai.cshl.edu/rmap/</a></p>
<p><strong>mrsFAST</strong></p>
<p><a href="http://mrsfast.sourceforge.net/Home"></a><a href="http://mrsfast.sourceforge.net/Home">http://mrsfast.sourceforge.net/Home</a></p>
<p><a href="http://sourceforge.net/projects/mrsfast/files/mrsfast-ultra-3.1.0/">http://sourceforge.net/projects/mrsfast/files/mrsfast-ultra-3.1.0/</a></p>
<p><strong>BFAST</strong></p>
<p><a href="http://sourceforge.net/apps/mediawiki/bfast/index.php?title=Main_Page">http://sourceforge.net/apps/mediawiki/bfast/index.php?title=Main_Page</a></p>
<p><strong>SHRiMP (for&nbsp;AB SOLiD color-space reads)</strong></p>
<p><a href="http://compbio.cs.toronto.edu/shrimp/">http://compbio.cs.toronto.edu/shrimp/</a></p>
<p><strong>RazerA 3</strong></p>
<p><a href="http://www.seqan.de/projects/razers/">http://www.seqan.de/projects/razers/</a></p><p>Address of the bookmark: <a href="http://www.biomedcentral.com/1471-2105/14/184" rel="nofollow">http://www.biomedcentral.com/1471-2105/14/184</a></p>]]></description>
	<dc:creator>Rahul Agarwal</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/9400/largest-genome-sequenced</guid>
	<pubDate>Fri, 21 Mar 2014 13:57:19 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/9400/largest-genome-sequenced</link>
	<title><![CDATA[Largest Genome Sequenced]]></title>
	<description><![CDATA[<p>The enormous size of the <strong>loblolly pine genome</strong> having <strong>22 billion base pairs</strong> compared to only 3 billion in the human genome. In other words, it is&nbsp;<strong>seven times</strong> larger than a human&rsquo;s and also the largest and the most complete&nbsp;<strong>conifer<a href="http://en.wikipedia.org/wiki/Pinophyta" target="_blank"></a></strong>&nbsp;genome ever sequenced.</p>
<p><strong>Related Paper:</strong></p>
<p>http://genomebiology.com/2014/15/3/R59/abstract</p>
<p>&nbsp;</p><p>Address of the bookmark: <a href="http://www.news.ucdavis.edu/search/news_detail.lasso?id=10859" rel="nofollow">http://www.news.ucdavis.edu/search/news_detail.lasso?id=10859</a></p>]]></description>
	<dc:creator>Rahul Agarwal</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/10243/new-rna-seq-tool</guid>
	<pubDate>Fri, 25 Apr 2014 10:59:04 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/10243/new-rna-seq-tool</link>
	<title><![CDATA[New RNA Seq tool]]></title>
	<description><![CDATA[<p>"<span>By removing the time-consuming step of read mapping, the authors reported, Sailfish able to provide quantification estimates 20&ndash;30 times faster than current methods without loss of accuracy."</span></p>
<p><span>Tool link:</span></p>
<p><span>http://www.cs.cmu.edu/~ckingsf/software/sailfish/</span></p>
<p><span></span></p><p>Address of the bookmark: <a href="http://www.genengnews.com/gen-news-highlights/lightweight-algorithms-sail-through-rna-sequencing-data/81249765/" rel="nofollow">http://www.genengnews.com/gen-news-highlights/lightweight-algorithms-sail-through-rna-sequencing-data/81249765/</a></p>]]></description>
	<dc:creator>Rahul Agarwal</dc:creator>
</item>

</channel>
</rss>