<?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/43856?offset=50</link>
	<atom:link href="https://bioinformaticsonline.com/related/43856?offset=50" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41452/apollo-a-sequencing-technology-independent-scalable-and-accurate-assembly-polishing-algorithm</guid>
	<pubDate>Mon, 16 Mar 2020 10:09:26 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41452/apollo-a-sequencing-technology-independent-scalable-and-accurate-assembly-polishing-algorithm</link>
	<title><![CDATA[Apollo: A Sequencing-Technology-Independent, Scalable, and Accurate Assembly Polishing Algorithm]]></title>
	<description><![CDATA[<p><span>Apollo is an assembly polishing algorithm that attempts to correct the errors in an assembly. It can take multiple set of reads in a single run and polish the assemblies of genomes of any size. Described by Firtina et al. (preliminary version at&nbsp;</span><a href="https://arxiv.org/pdf/1902.04341.pdf">https://arxiv.org/pdf/1902.04341.pdf</a></p>
<p>More at&nbsp;<a href="https://academic.oup.com/bioinformatics/advance-article/doi/10.1093/bioinformatics/btaa179/5804978?rss=1">https://academic.oup.com/bioinformatics/advance-article/doi/10.1093/bioinformatics/btaa179/5804978?rss=1</a></p><p>Address of the bookmark: <a href="https://github.com/CMU-SAFARI/Apollo" rel="nofollow">https://github.com/CMU-SAFARI/Apollo</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/44848/trust-but-verify-sequencing-your-cell-lines-might-reveal-an-uninvited-guest</guid>
	<pubDate>Wed, 04 Jun 2025 00:07:57 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/44848/trust-but-verify-sequencing-your-cell-lines-might-reveal-an-uninvited-guest</link>
	<title><![CDATA[Trust But Verify: Sequencing Your Cell Lines Might Reveal an Uninvited Guest]]></title>
	<description><![CDATA[<p>High-throughput sequencing has become indispensable in cell biology, enabling detailed insights into chromatin structure, gene expression, and regulatory dynamics. Yet, when faced with unexpectedly low mapping rates to the human genome, researchers often rush to troubleshoot technical parameters&mdash;sequencer quality, adapter trimming, or aligner settings.</p><p>Before you go down that path, consider this critical biological question:<br /> <strong>Are you sequencing human cells&mdash;or bacterial contamination?</strong></p><h2>The Silent Saboteur: Mycoplasma in Cell Cultures</h2><p><em>Mycoplasma</em> contamination remains one of the most widespread and underdiagnosed issues in tissue culture work. Studies suggest that <strong>15&ndash;35% of cell lines in use may be contaminated</strong>, often without visible signs. Unlike other microbial infections, <em>Mycoplasma</em> does not produce cloudiness, odor, or a change in pH. Many researchers won&rsquo;t detect it unless they specifically test for it.</p><p>The consequences, however, are profound. <em>Mycoplasma</em> can significantly alter:</p><ul>
<li>
<p>Host gene expression patterns</p>
</li>
<li>
<p>Cell proliferation rates</p>
</li>
<li>
<p>Epigenetic profiles and chromatin accessibility</p>
</li>
<li>
<p>Cytokine signaling and immune responses</p>
</li>
</ul><p>In short, it can skew your results, compromise your biological conclusions, and invalidate weeks or months of research.</p><h2>A Simple Diagnostic Step: Map Against <em>Mycoplasma</em> Genomes</h2><p>If you encounter poor alignment rates to the human genome, consider mapping your reads to a <em>Mycoplasma</em> reference genome&mdash;or better yet, use a <strong>combined human + <em>Mycoplasma</em></strong> reference. There have been cases where over half of all reads, initially assumed to be from human cells, were in fact bacterial in origin. This check is fast, easy, and could save your project.</p><h2>How Contamination Happens&mdash;and Persists</h2><p><em>Mycoplasma</em> is small (0.1&ndash;0.3 &mu;m), lacks a cell wall, and can pass through standard filters undetected. Common sources include:</p><ul>
<li>
<p>Contaminated reagents (e.g., FBS)</p>
</li>
<li>
<p>Infected cell lines obtained from other labs</p>
</li>
<li>
<p>Poor aseptic technique or shared equipment</p>
</li>
</ul><p>Once present, it spreads quickly between cultures and can persist for months, silently affecting results.</p><h2>Why Treatment Is Difficult</h2><p>While antibiotics such as Plasmocin or BM-Cyclin are sometimes used, they often offer only partial resolution and may themselves alter cell behavior. In many cases, the best course of action is to <strong>discard the contaminated culture</strong> and start with a fresh, verified stock.</p><h2>Practical Recommendations for Researchers</h2><ul>
<li>
<p><strong>Routinely test for <em>Mycoplasma</em></strong> using PCR, qPCR, or fluorescence-based assays</p>
</li>
<li>
<p><strong>Incorporate contamination screens into your sequencing QC pipeline</strong></p>
</li>
<li>
<p><strong>Use combined reference genomes</strong> when mapping ambiguous reads</p>
</li>
<li>
<p><strong>Practice strict aseptic technique</strong> and monitor all incoming cell lines</p>
</li>
<li>
<p><strong>Don&rsquo;t ignore unexplained data anomalies</strong>&mdash;they might point to contamination</p>
</li>
</ul><h2>Closing Thought: Contamination Is a Biological Variable</h2><p>It&rsquo;s easy to view poor mapping as a technical issue, but sometimes the problem lies deeper&mdash;in the biology itself. <em>Mycoplasma</em> contamination doesn&rsquo;t just interfere with sequencing; it interferes with science. As a research community, we must treat contamination not as an afterthought, but as a key variable to control.</p><p>So next time your reads won&rsquo;t align, don&rsquo;t just tune the aligner. Ask if your cells are telling the truth&mdash;or if they're hiding something.</p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/39019/iq-tree-efficient-software-for-phylogenomic-inference</guid>
	<pubDate>Mon, 18 Feb 2019 04:25:11 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/39019/iq-tree-efficient-software-for-phylogenomic-inference</link>
	<title><![CDATA[IQ-TREE: Efficient software for phylogenomic inference]]></title>
	<description><![CDATA[<p><span>A fast and effective stochastic algorithm to infer phylogenetic trees by maximum likelihood.&nbsp;</span><em>IQ-TREE compares favorably to RAxML and PhyML</em><span>&nbsp;in terms of likelihoods with similar computing time</span></p>
<p><span><span>IQ-TREE found higher likelihoods between 62.2% and 87.1% of the studied alignments, thus efficiently exploring the tree-space. If we use the IQ-TREE stopping rule, RAxML and PhyML are faster in 75.7% and 47.1% of the DNA alignments and 42.2% and 100% of the protein alignments, respectively. However, the range of obtaining higher likelihoods with IQ-TREE improves to 73.3&ndash;97.1%. IQ-TREE is freely available at&nbsp;</span><a href="http://www.cibiv.at/software/iqtree" target="">http://www.cibiv.at/software/iqtree</a></span></p><p>Address of the bookmark: <a href="http://www.iqtree.org/" rel="nofollow">http://www.iqtree.org/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34565/fogsaa-fast-optimal-global-sequence-alignment-algorithm</guid>
	<pubDate>Fri, 08 Dec 2017 14:41:08 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34565/fogsaa-fast-optimal-global-sequence-alignment-algorithm</link>
	<title><![CDATA[FOGSAA: Fast Optimal Global Sequence Alignment Algorithm]]></title>
	<description><![CDATA[<p>Sequence alignment algorithms are widely used to infer similarirty and the point of differences between pair of sequences. FOGSAA is a fast Global alignment algorithm. It is basically a branch and bound approach which starts branch expansion in a greedy way taking the symbols from the given pair of sequences (protein or nucleotide) and results in an optimal alignment faster than conventional dymanic programming techniques. It is also better than the heuristic methods with respect to alignment quality.</p><p>Address of the bookmark: <a href="http://www.isical.ac.in/~bioinfo_miu/FOGSAA.htm" rel="nofollow">http://www.isical.ac.in/~bioinfo_miu/FOGSAA.htm</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34618/mashmap-a-fast-and-approximate-software-for-mapping-long-reads-pacbioont-or-assembly-to-reference-genomes</guid>
	<pubDate>Tue, 12 Dec 2017 17:23:31 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34618/mashmap-a-fast-and-approximate-software-for-mapping-long-reads-pacbioont-or-assembly-to-reference-genomes</link>
	<title><![CDATA[MashMap: a fast and approximate software for mapping long reads (PacBio/ONT) or assembly to reference genome(s)]]></title>
	<description><![CDATA[<p><span>MashMap is a fast and approximate software for mapping long reads (PacBio/ONT) or assembly to reference genome(s). It maps a query sequence against a reference region if and only if its estimated alignment identity is above a specified threshold. It does not compute the alignments explicitly, but rather estimates a&nbsp;</span><em>k</em><span>-mer based&nbsp;</span><a href="https://en.wikipedia.org/wiki/Jaccard_index">Jaccard similarity</a><span>&nbsp;using a combination of&nbsp;</span><a href="http://www.cs.princeton.edu/courses/archive/spr05/cos598E/bib/p76-schleimer.pdf">Winnowing</a><span>&nbsp;and&nbsp;</span><a href="https://en.wikipedia.org/wiki/MinHash">MinHash</a><span>. This is then converted to an estimate of sequence identity using the&nbsp;</span><a href="http://mash.readthedocs.org/">Mash</a><span>&nbsp;distance. An appropriate&nbsp;</span><em>k</em><span>-mer sampling rate is automatically determined given minimum local alignment length and identity thresholds. The efficiency of the algorithm improves as both of these thresholds are increased.</span></p><p>Address of the bookmark: <a href="https://github.com/marbl/MashMap" rel="nofollow">https://github.com/marbl/MashMap</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36512/hisat2-a-fast-and-sensitive-alignment-program-for-mapping-next-generation-sequencing-reads</guid>
	<pubDate>Tue, 08 May 2018 04:27:22 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36512/hisat2-a-fast-and-sensitive-alignment-program-for-mapping-next-generation-sequencing-reads</link>
	<title><![CDATA[HISAT2: a fast and sensitive alignment program for mapping next-generation sequencing reads]]></title>
	<description><![CDATA[<p><strong>HISAT2</strong><span>&nbsp;is a fast and sensitive alignment program for mapping next-generation sequencing reads (both DNA and RNA) to a population of human genomes (as well as to a single reference genome). Based on an extension of BWT for graphs&nbsp;</span><a href="http://dl.acm.org/citation.cfm?id=2674828">[Sir&eacute;n et al. 2014]</a><span>, we designed and implemented a graph FM index (GFM), an original approach and its first implementation to the best of our knowledge. In addition to using one global GFM index that represents a population of human genomes, HISAT2 uses a large set of small GFM indexes that collectively cover the whole genome (each index representing a genomic region of 56 Kbp, with 55,000 indexes needed to cover the human population). These small indexes (called local indexes), combined with several alignment strategies, enable rapid and accurate alignment of sequencing reads. This new indexing scheme is called a Hierarchical Graph FM index (HGFM).&nbsp;</span></p>
<p><span>more at&nbsp;https://ccb.jhu.edu/software/hisat2/index.shtml</span></p><p>Address of the bookmark: <a href="https://github.com/infphilo/hisat2" rel="nofollow">https://github.com/infphilo/hisat2</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<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/38208/anitools-web-a-web-tool-for-fast-genome-comparison-within-multiple-bacterial-strains</guid>
	<pubDate>Wed, 14 Nov 2018 04:34:23 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38208/anitools-web-a-web-tool-for-fast-genome-comparison-within-multiple-bacterial-strains</link>
	<title><![CDATA[ANItools web: a web tool for fast genome comparison within multiple bacterial strains]]></title>
	<description><![CDATA[<p><span>ANItools is a software package written by PERL scripts that can be run in a Linux/Unix system. If you want to compare bacterial genomes and calculate their average nucleotide identity (ANI), you could download and run this program directly. Or you could send us the genome sequence by email. Then we will do the analysis work for you.</span></p>
<p><span>https://academic.oup.com/database/article/doi/10.1093/database/baw084/2630454</span></p><p>Address of the bookmark: <a href="http://ani.mypathogen.cn/" rel="nofollow">http://ani.mypathogen.cn/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40389/sequila-cov-a-fast-and-scalable-library-for-depth-of-coverage-calculations</guid>
	<pubDate>Sun, 15 Dec 2019 10:19:35 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40389/sequila-cov-a-fast-and-scalable-library-for-depth-of-coverage-calculations</link>
	<title><![CDATA[SeQuiLa-cov: A fast and scalable library for depth of coverage calculations]]></title>
	<description><![CDATA[<p><span>The Docker image is available at&nbsp;</span><a href="https://hub.docker.com/r/biodatageeks/" target="">https://hub.docker.com/r/biodatageeks/</a><span>. Supplementary information on benchmarking procedure as well as test data are publicly accessible at the project documentation site&nbsp;</span><a href="http://biodatageeks.org/sequila/benchmarking/benchmarking.html#depth-of-coverage" target="">http://biodatageeks.org/sequila/benchmarking/benchmarking.html#depth-of-coverage</a><span>. An archival copy of the code and supporting data is also available via the GigaScience database GigaDB</span></p>
<p>&bull; Project name: SeQuiLa-cov</p>
<p>&bull; Project home page:&nbsp;<a href="http://biodatageeks.org/sequila/" target="">http://biodatageeks.org/sequila/</a></p>
<p>&bull; Source code repository:&nbsp;<a href="https://github.com/ZSI-Bio/bdg-sequila" target="">https://github.com/ZSI-Bio/bdg-sequila</a></p>
<p>&bull; Operating system: Platform independent</p>
<p>&bull; Programming language: Scala</p>
<p>&bull; Other requirements: Docker</p>
<p>&bull; License: Apache License 2.0</p><p>Address of the bookmark: <a href="https://academic.oup.com/gigascience/article/8/8/giz094/5543653" rel="nofollow">https://academic.oup.com/gigascience/article/8/8/giz094/5543653</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43439/mmseqs2-ultra-fast-and-sensitive-sequence-search-and-clustering-suite</guid>
	<pubDate>Wed, 06 Oct 2021 07:01:14 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43439/mmseqs2-ultra-fast-and-sensitive-sequence-search-and-clustering-suite</link>
	<title><![CDATA[MMseqs2: ultra fast and sensitive sequence search and clustering suite]]></title>
	<description><![CDATA[<p><span>MMseqs2 (Many-against-Many sequence searching) is a software suite to search and cluster huge protein and nucleotide sequence sets. MMseqs2 is open source GPL-licensed software implemented in C++ for Linux, MacOS, and (as beta version, via cygwin) Windows. The software is designed to run on multiple cores and servers and exhibits very good scalability. MMseqs2 can run 10000 times faster than BLAST. At 100 times its speed it achieves almost the same sensitivity. It can perform profile searches with the same sensitivity as PSI-BLAST at over 400 times its speed.</span></p><p>Address of the bookmark: <a href="https://github.com/soedinglab/MMseqs2" rel="nofollow">https://github.com/soedinglab/MMseqs2</a></p>]]></description>
	<dc:creator>Abhi</dc:creator>
</item>

</channel>
</rss>