<?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/43057?offset=430</link>
	<atom:link href="https://bioinformaticsonline.com/related/43057?offset=430" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/45273/a-subway-map-for-the-genome</guid>
	<pubDate>Fri, 04 Sep 2026 04:14:14 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/45273/a-subway-map-for-the-genome</link>
	<title><![CDATA[A Subway Map for the Genome]]></title>
	<description><![CDATA[<p>Maya was looking at a genome graph on her computer. There were nodes, branches, and paths going in every direction.</p><p>&ldquo;It&rsquo;s like a subway map,&rdquo; she said, &ldquo;but for DNA.&rdquo;</p><p>That idea is exactly what Sequence Tube Map brings to life.</p><p>Instead of showing a genome as one long, confusing sequence, it displays different genomic paths like routes on a metro map. Where sequences are shared, the paths travel together. Where genetic variation occurs, they branch into different routes and may join again later.</p><p>This makes complex genome graphs much easier to explore.</p><p>Maya could now see how different haplotypes moved through the same genomic region and where they took different paths. She could even view sequencing reads mapped onto the graph, helping her understand what was happening in regions with genetic variation.</p><p>What once looked like a tangled network now looked like a journey.</p><p>Sequence Tube Map turns the complexity of graph genomes into a visual story&mdash;making it easier for scientists to see how DNA can take different routes.</p><p>Read more at&nbsp; https://github.com/vgteam/sequencetubemap&nbsp;</p><p>and</p><p>https://academic.oup.com/bioinformatics/article/35/24/5318/5542397</p><p>Demo at&nbsp;https://vgteam.github.io/sequenceTubeMap/</p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/45306/the-genes-that-travel-together-a-genomic-detective-story</guid>
	<pubDate>Fri, 11 Sep 2026 13:00:36 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/45306/the-genes-that-travel-together-a-genomic-detective-story</link>
	<title><![CDATA[The Genes That Travel Together: A Genomic Detective Story]]></title>
	<description><![CDATA[<p>Imagine looking through thousands of microbial genomes and discovering two genes that repeatedly appear together. The obvious conclusion is that they must somehow be connected&mdash;that perhaps they work together, participate in the same pathway, or depend on each other. But evolution has a way of leaving misleading clues. What if these two genes are found together simply because they were inherited from the same ancient ancestor? In that case, their apparent association may have little to do with their biological function; it may simply be a reflection of shared evolutionary history. This is the intriguing problem addressed by CORGIAS (https://github.com/ynishimuraLv/corgias), a computational framework developed to distinguish genuine gene associations from correlations created by common ancestry.</p><p>Instead of asking only whether two genes occur together across genomes, CORGIAS asks a deeper question: did these genes actually evolve together, repeatedly gaining or losing their presence in concert, or are they merely travelling together because of their inherited history? The framework introduces two complementary approaches, Ancestral State Adjustment (ASA) and the Simultaneous EVolution test (SEV), which incorporate evolutionary information into the search for gene associations. This distinction becomes increasingly important as genome sequencing continues to uncover enormous numbers of microbial genomes, many from organisms that have never been cultured and whose genes remain functionally mysterious. In this growing genomic landscape, simply finding a gene is no longer enough&mdash;we need clues about what that gene might be doing. CORGIAS approaches this problem almost like a genomic detective: rather than treating every association as evidence, it reconstructs the evolutionary story behind the association and asks whether the evidence survives that history. By doing so, it offers a way to separate coincidence from biological connection and potentially uncover functional relationships hidden within the vast microbial genomic landscape. The broader message is beautifully simple: genes do not evolve in isolation, and understanding what they do may require us to look beyond where they are today and reconstruct how they arrived there. Sometimes, the most important clue in a genome is not the gene itself, but the evolutionary journey it has taken.</p><p>More at&nbsp;https://academic.oup.com/nargab/article/7/4/lqaf182/8377910?</p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37205/afterqc-automatic-filtering-trimming-error-removing-and-quality-control-for-fastq-data</guid>
	<pubDate>Fri, 29 Jun 2018 03:26:03 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37205/afterqc-automatic-filtering-trimming-error-removing-and-quality-control-for-fastq-data</link>
	<title><![CDATA[AfterQC: Automatic Filtering, Trimming, Error Removing and Quality Control for fastq data]]></title>
	<description><![CDATA[Automatic Filtering, Trimming, Error Removing and Quality Control for fastq data
AfterQC can simply go through all fastq files in a folder and then output three folders: good, bad and QC folders, which contains good reads, bad reads and the QC results of each fastq file/pair.
Currently it supports processing data from HiSeq 2000/2500/3000/4000, Nextseq 500/550, MiniSeq...and other Illumina 1.8 or newer formats

The author has reimplemented this tool in C++ with multithreading support to make it much faster. The new tool is called fastp and can be found at: https://github.com/OpenGene/fastp . If you prefer a C++ based tool, please use fastp instead.

https://github.com/OpenGene/AfterQC<p>Address of the bookmark: <a href="https://github.com/OpenGene/AfterQC" rel="nofollow">https://github.com/OpenGene/AfterQC</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/32943/npscarf-scaffolding-and-completing-assemblies-in-real-time-fashion</guid>
	<pubDate>Tue, 23 May 2017 04:53:29 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32943/npscarf-scaffolding-and-completing-assemblies-in-real-time-fashion</link>
	<title><![CDATA[npScarf: Scaffolding and Completing Assemblies in Real-time Fashion]]></title>
	<description><![CDATA[<p><em>npScarf</em>&nbsp;(jsa.np.npscarf) is a program that scaffolds and completes draft genomes assemblies in real-time with Oxford Nanopore sequencing. The pipeline can run on a computing cluster as well as on a laptop computer for microbial datasets. It also facilitates the real-time analysis of positional information such as gene ordering and the detection of genes from mobile elements (plasmids and genomic islands).</p>
<p>Complete paper at&nbsp;https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5321748/</p><p>Address of the bookmark: <a href="https://github.com/mdcao/npScarf" rel="nofollow">https://github.com/mdcao/npScarf</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36015/repeat-aware-repeat-aware-scaffolding-evaluation-framework-by-igor-mandric</guid>
	<pubDate>Wed, 21 Mar 2018 18:10:00 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36015/repeat-aware-repeat-aware-scaffolding-evaluation-framework-by-igor-mandric</link>
	<title><![CDATA[repeat-aware: Repeat aware scaffolding evaluation framework by Igor Mandric]]></title>
	<description><![CDATA[<p>Genome scaffolding is a classical challenging problem in bioinformatics. It refers to joining assembly contigs into chains (called scaffolds). The join between two contigs A and B is considered correct if:</p>
<ul>
<li>Their relative orientation is correct</li>
<li>Their relative order is correct</li>
<li>The gap estimate is similar to the true distance on the reference</li>
</ul>
<p>The problem of scaffolding validation is also a challenging one. One of the main issues which hinders from an adequate scaffolding evaluation are genome repeats. The previous standard for evaluation&nbsp;<a href="https://genomebiology.biomedcentral.com/articles/10.1186/gb-2014-15-3-r42">(Hunt et al.,&nbsp;<em>Genome Biology</em>, 2014)</a>&nbsp;did not take into account repeats. In this evaluation framework, repeats are taken into account.</p>
<p style="text-align: center;"><a href="https://camo.githubusercontent.com/9675b90205e5bc0dc0b6b84b321b00bc87d8d88e/687474703a2f2f616c616e2e63732e6773752e6564752f7265706561742d61776172652f6669677572652e706e67" target="_blank"><img src="https://camo.githubusercontent.com/9675b90205e5bc0dc0b6b84b321b00bc87d8d88e/687474703a2f2f616c616e2e63732e6773752e6564752f7265706561742d61776172652f6669677572652e706e67" width="75%" alt="image" style="border: 0px;"></a></p>
<p>The new evaluation framework considers the optimal assignment of contigs in the output scaffolding to contigs in the reference scaffolding in the sense of the number of correct links.</p>
<p>&nbsp;</p>
<p>https://github.com/mandricigor/repeat-aware</p><p>Address of the bookmark: <a href="https://github.com/mandricigor/repeat-aware" rel="nofollow">https://github.com/mandricigor/repeat-aware</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/39302/understanding-reads-mapping-and-flags</guid>
	<pubDate>Thu, 25 Apr 2019 09:06:20 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/39302/understanding-reads-mapping-and-flags</link>
	<title><![CDATA[Understanding reads mapping and flags !]]></title>
	<description><![CDATA[<p><strong>Linear Alignment:</strong>&nbsp;An alignment of a read to a single reference sequence that may&nbsp;<q>include insertions, deletions, skips and clipping</q>,&nbsp;<span style="text-decoration: underline;">but may not include direction changes</span>&nbsp;(i.e. one portion of the alignment on forward strand and another portion of alignment on reverse strand).<sup id="fnref:1"><a href="https://yulijia.net/en/bioinformatics/2015/12/21/Linear-Chimeric-Supplementary-Primary-and-Secondary-Alignments.html#fn:1"><br /></a></sup></p><p><strong>Chimeric Alignment:</strong>&nbsp;An alignment of a read that cannot be represented as a linear alignment. Typically, one of the linear alignments in a chimeric alignment is considered the &ldquo;representative&rdquo; alignment, and the others are called &ldquo;supplementary&rdquo; and are distinguished by the supplementary alignment flag.<sup id="fnref:1:1"><a href="https://yulijia.net/en/bioinformatics/2015/12/21/Linear-Chimeric-Supplementary-Primary-and-Secondary-Alignments.html#fn:1"><br /></a></sup></p><p>Chimeric reads are indicative of structural variation in DNA-seq and it may indicate the presence of&nbsp;<a href="https://en.wikipedia.org/wiki/Chimeric_gene">chimeric genes</a>&nbsp;in RNA-seq.<sup id="fnref:2"><a href="https://yulijia.net/en/bioinformatics/2015/12/21/Linear-Chimeric-Supplementary-Primary-and-Secondary-Alignments.html#fn:2"><br /></a></sup></p><p>In short, chimeric reads can be split in to two or more parts, each part would be mapped to reference(it&rsquo;s not&nbsp;<a href="https://www.biostars.org/p/119537/">hard-clipped</a>), the total length of the mapped part is longger than read length.<sup id="fnref:3"><a href="https://yulijia.net/en/bioinformatics/2015/12/21/Linear-Chimeric-Supplementary-Primary-and-Secondary-Alignments.html#fn:3"><br /></a></sup></p><p><strong>Representative alignment:</strong>&nbsp;A chimeric alignment that is represented as a set of linear alignments that do not have large overlaps typically has one linear alignment that is considered the representative alignment.<sup id="fnref:4"><a href="https://yulijia.net/en/bioinformatics/2015/12/21/Linear-Chimeric-Supplementary-Primary-and-Secondary-Alignments.html#fn:4"><br /></a></sup></p><p>One read can align to multiple positions, we can find one alignmnet position which sequence do not have large overlaps, it called representative alighment, for other alignment positions, we called them supplementary alignment.</p><p>It seems that GATK can realignment those representative reads to the correctly position via&nbsp;<q>RealignerTargetCreator and IndelRealigner</q>. (WARNING: I am not quite sure if I understand this correctly. If someone could help me, please leave me a message below, thanks, thanks.)</p><p><strong>Supplementary Alignment:</strong>&nbsp;A chimeric reads but not a representative reads.</p><p><strong>Primary Alignment and Secondary Alignment:</strong>&nbsp;A read may map ambiguously to multiple locations, e.g. due to repeats.&nbsp;<strong>Only one of the multiple read alignments is considered primary</strong>,<span style="text-decoration: underline;">&nbsp;and this decision may be arbitrary</span>. All other alignments have the secondary alignment flag.<sup id="fnref:5"><a href="https://yulijia.net/en/bioinformatics/2015/12/21/Linear-Chimeric-Supplementary-Primary-and-Secondary-Alignments.html#fn:5"><br /></a></sup></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37550/mirem-an-expectation-maximization-approach-for-prioritizing-mirnas-associated-with-gene-set</guid>
	<pubDate>Thu, 16 Aug 2018 04:48:07 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37550/mirem-an-expectation-maximization-approach-for-prioritizing-mirnas-associated-with-gene-set</link>
	<title><![CDATA[miREM: an expectation-maximization approach for prioritizing miRNAs associated with gene-set]]></title>
	<description><![CDATA[<p>From list of genes... ... to microRNAs</p>
<p>Using established miRNA-interaction databases, miREM combines hypergeometric and expectation-maximization algorithms to sieve through your genetic data for microRNA signatures</p>
<p>https://bioinfo-csi.nus.edu.sg/mirem2/</p><p>Address of the bookmark: <a href="https://bioinfo-csi.nus.edu.sg/mirem2/" rel="nofollow">https://bioinfo-csi.nus.edu.sg/mirem2/</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34398/ont-assembly-and-illumina-polishing-pipeline</guid>
	<pubDate>Thu, 23 Nov 2017 10:13:42 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34398/ont-assembly-and-illumina-polishing-pipeline</link>
	<title><![CDATA[ONT assembly and Illumina polishing pipeline]]></title>
	<description><![CDATA[<p>This pipeline performs the following steps:</p>
<ul>
<li>Assembly of nanopore reads using&nbsp;<a href="http://canu.readthedocs.io/">Canu</a>.</li>
<li>Polish canu contigs using&nbsp;<a href="https://github.com/isovic/racon">racon</a>&nbsp;(<em>optional</em>).</li>
<li>Map a paired-end Illumina dataset onto the contigs obtained in the previous steps using&nbsp;<a href="http://bio-bwa.sourceforge.net/">BWA</a>&nbsp;mem.</li>
<li>Perform correction of contigs using&nbsp;<a href="https://github.com/broadinstitute/pilon/wiki">pilon</a>&nbsp;and the Illumina dataset.</li>
</ul><p>Address of the bookmark: <a href="https://github.com/nanoporetech/ont-assembly-polish" rel="nofollow">https://github.com/nanoporetech/ont-assembly-polish</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34501/dnapipete-de-novo-assembly-annotation-pipeline-for-transposable-elements</guid>
	<pubDate>Sat, 02 Dec 2017 18:25:44 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34501/dnapipete-de-novo-assembly-annotation-pipeline-for-transposable-elements</link>
	<title><![CDATA[dnaPipeTE: de-novo assembly &amp; annotation Pipeline for Transposable Elements]]></title>
	<description><![CDATA[<p>dnaPipeTE (for de-novo assembly &amp; annotation Pipeline for Transposable Elements), is a pipeline designed to find, annotate and quantify Transposable Elements in small samples of NGS datasets. It is very useful to quantify the proportion of TEs in newly sequenced genomes since it does not require genome assembly and works on small datasets (&lt; 1X).</p>
<ul>
<li>
<p>dnaPipeTE is developped by Cl&eacute;ment Goubert, Laurent Modolo and the TREEP team of the LBBE:&nbsp;<a href="http://lbbe.univ-lyon1.fr/-Equipe-Elements-transposables-.html?lang=en">http://lbbe.univ-lyon1.fr/-Equipe-Elements-transposables-.html?lang=en</a></p>
</li>
<li>
<p>You can find the original publication in GBE here:&nbsp;<a href="https://academic.oup.com/gbe/article/7/4/1192/533768">https://academic.oup.com/gbe/article/7/4/1192/533768</a></p>
</li>
</ul>
<p><a href="https://github.com/clemgoub/dnaPipeTE/blob/dev/dnaPipefront.png" target="_blank"><img src="https://github.com/clemgoub/dnaPipeTE/raw/dev/dnaPipefront.png" alt="Front" style="border: 0px;"></a><em>output examples of quantification and TE landscape (relative age) produced by dnaPipeTE</em></p>
<p><em>&nbsp;</em></p><p>Address of the bookmark: <a href="https://github.com/clemgoub/dnaPipeTE" rel="nofollow">https://github.com/clemgoub/dnaPipeTE</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34914/ra-assembler-a-de-novo-dna-assembler-for-third-generation-sequencing-data</guid>
	<pubDate>Wed, 27 Dec 2017 20:36:54 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34914/ra-assembler-a-de-novo-dna-assembler-for-third-generation-sequencing-data</link>
	<title><![CDATA[Ra assembler - a de novo DNA assembler for third generation sequencing data]]></title>
	<description><![CDATA[<p>Integration of the Ra assembler - a de novo DNA assembler for third generation sequencing data developed on Faculty of Electrical Engineering and Computing (FER), Ruder Boskovic Institute (RBI) and Genome Institute of Singapore (GIS).</p>
<p>Ra is in development since 2014 in the form of several separate components that used to be run individually.<br>This project aims to ease the usage of Ra by integrating it into a complete de novo assembly tool.</p>
<p>Unlike other state-of-the-art assemblers,&nbsp;<span>Ra does not have an error correction step.</span>&nbsp;Instead, it relies on detecting overlaps using a very sensitive and specific overlapper ("graphmap -w owler",&nbsp;<a href="https://github.com/isovic/graphmap">https://github.com/isovic/graphmap</a>) and constructing and reducing an overlap graph (Ra layout,&nbsp;<a href="https://github.com/mariokostelac/ra">https://github.com/mariokostelac/ra</a>).</p><p>Address of the bookmark: <a href="https://github.com/mariokostelac/ra-integrate/" rel="nofollow">https://github.com/mariokostelac/ra-integrate/</a></p>]]></description>
	<dc:creator>biogeek</dc:creator>
</item>

</channel>
</rss>