<?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/40792?offset=640</link>
	<atom:link href="https://bioinformaticsonline.com/related/40792?offset=640" 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/38012/cosine-non-seeding-method-for-mapping-long-noisy-sequences</guid>
	<pubDate>Fri, 26 Oct 2018 00:41:59 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38012/cosine-non-seeding-method-for-mapping-long-noisy-sequences</link>
	<title><![CDATA[COSINE: non-seeding method for mapping long noisy sequences]]></title>
	<description><![CDATA[<p><span>Third generation sequencing (TGS) are highly promising technologies but the long and noisy reads from TGS are difficult to align using existing algorithms. Here, we present COSINE, a conceptually new method designed specifically for aligning long reads contaminated by a high level of errors.</span></p><p>Address of the bookmark: <a href="https://github.com/SUwonglab/COSINE" rel="nofollow">https://github.com/SUwonglab/COSINE</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43384/lncpipea-nextflow-based-pipeline-for-comprehensive-analyses-of-long-non-coding-rnas-from-rna-seq-datasets</guid>
	<pubDate>Fri, 17 Sep 2021 01:57:02 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43384/lncpipea-nextflow-based-pipeline-for-comprehensive-analyses-of-long-non-coding-rnas-from-rna-seq-datasets</link>
	<title><![CDATA[LncPipe:A Nextflow-based pipeline for comprehensive analyses of long non-coding RNAs from RNA-seq datasets]]></title>
	<description><![CDATA[<p><span>The pipeline was developed based on a popular workflow framework&nbsp;</span><a href="https://github.com/nextflow-io/nextflow">Nextflow</a><span>, composed of four core procedures including reads alignment, assembly, identification and quantification. It contains various unique features such as well-designed lncRNAs annotation strategy, optimized calculating efficiency, diversified classification and interactive analysis report.&nbsp;</span><a href="https://github.com/likelet/LncPipe">LncPipe</a><span>&nbsp;allows users additional control in interuppting the pipeline, resetting parameters from command line, modifying main script directly and resume analysis from previous checkpoint.</span></p>
<p>Ref&nbsp;https://www.lncrnablog.com/lncpipe-a-nextflow-based-pipeline-for-identification-and-analysis-of-long-non-coding-rnas-from-rna-seq-data/</p>
<p><img src="https://ars.els-cdn.com/content/image/1-s2.0-S1673852718301176-gr1.jpg" alt="image" style="border: 0px;"></p><p>Address of the bookmark: <a href="https://github.com/likelet/LncPipe" rel="nofollow">https://github.com/likelet/LncPipe</a></p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34420/rita-rapid-identification-of-high-confidence-taxonomic-assignments-for-metagenomic-data</guid>
	<pubDate>Mon, 27 Nov 2017 08:25:33 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34420/rita-rapid-identification-of-high-confidence-taxonomic-assignments-for-metagenomic-data</link>
	<title><![CDATA[RITA: Rapid identification of high-confidence taxonomic assignments for metagenomic data]]></title>
	<description><![CDATA[<p>RITA is a standalone software package and Web server for taxonomic assignment of metagenomic sequence reads. By combining homology predictions from BLAST or UBLAST with compositional classifications from a Naive Bayes classifier, RITA is able to achieve very high accuracy on short reads. Unlike other hybrid approaches which combine these predictions for all sequences to be classified, RITA uses a pipeline to first identify cases where both types of classifier are in agreement, which constitute the highest-confidence set. Sequences not classified in this manner are subjected to a series of downstream classification steps.</p>
<p>This work has been accepted for publication:</p>
<p>MacDonald NJ, Parks DH, and Beiko RG. Rapid identification of taxonomic assignments. Accepted to&nbsp;<em>Nucleic Acids Research</em>&nbsp;April 4, 2012.</p>
<p>If you have any questions or bug reports, please let us know at &lt;beiko@cs.dal.ca&gt;.</p><p>Address of the bookmark: <a href="http://kiwi.cs.dal.ca/Software/RITA" rel="nofollow">http://kiwi.cs.dal.ca/Software/RITA</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/45212/assistant-professor-in-rapid-marine-adaptation-uvienna</guid>
  <pubDate>Mon, 03 Aug 2026 06:52:31 -0500</pubDate>
  <link></link>
  <title><![CDATA[Assistant Professor in Rapid Marine Adaptation @ UVienna]]></title>
  <description><![CDATA[
<p>The University of Vienna invites applications for a Tenure Track Professorship in the field of Rapid Marine Adaptation. We seek a scientist with an outstanding record in marine evolutionary genomics who investigates rapid evolutionary responsesâ€”such as evolutionary rescueâ€”through field studies and/or experimental evolution in the laboratory. Preferred model systems should be eukaryotic marine organisms that have vital roles in oceanic or coastal ecosystems. The successful candidate will cooperate with physiologists, ecologists, biochemists, systems biologists and evolutionary biologists in Vienna to link genomic targets of selection to organismal phenotypes and local environmental conditions. This integrative work will advance mechanistic understanding and predictive modeling of rapid adaptation to climate change in marine environments and inform effective marine conservation strategies across Europe.<br />For more information see: https://jobs.univie.ac.at/job/Tenure-Track-Professorship-in-Rapid-Marine-Adaptation/1417563233/</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/35899/reference-free-prediction-of-rearrangement-breakpoint-reads</guid>
	<pubDate>Thu, 08 Mar 2018 05:05:25 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/35899/reference-free-prediction-of-rearrangement-breakpoint-reads</link>
	<title><![CDATA[Reference-free prediction of rearrangement breakpoint reads]]></title>
	<description><![CDATA[<p><span>lideSort-BPR (&nbsp;</span><span>b</span><span>&nbsp;reak&nbsp;</span><span>p</span><span>&nbsp;oint&nbsp;</span><span>r</span><span>&nbsp;eads) is based on a fast algorithm for all-against-all comparisons of short reads and theoretical analyses of the number of neighboring reads. When applied to a dataset with a sequencing depth of 100&times;, it finds &sim;88% of the breakpoints correctly with no false-positive reads. Moreover, evaluation on a real prostate cancer dataset shows that the proposed method predicts more fusion transcripts correctly than previous approaches, and yet produces fewer false-positive reads. To our knowledge, this is the first method to detect breakpoint reads without using a reference genome.</span></p>
<p><span>https://github.com/ewijaya/slidesort-bpr</span></p><p>Address of the bookmark: <a href="https://code.google.com/archive/p/slidesort-bpr/" rel="nofollow">https://code.google.com/archive/p/slidesort-bpr/</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36921/breakpointer-using-local-mapping-artifacts-to-support-sequence-breakpoint-discovery-from-single-end-reads</guid>
	<pubDate>Tue, 12 Jun 2018 12:41:10 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36921/breakpointer-using-local-mapping-artifacts-to-support-sequence-breakpoint-discovery-from-single-end-reads</link>
	<title><![CDATA[Breakpointer: using local mapping artifacts to support sequence breakpoint discovery from single-end reads]]></title>
	<description><![CDATA[Breakpointer is a fast tool for locating sequence breakpoints from the alignment of single end reads (SE) produced by next generation sequencing (NGS). It adopts a heuristic method in searching for local mapping signatures created by insertion/deletions (indels) or more complex structural variants(SVs).<p>Address of the bookmark: <a href="https://github.com/ruping/Breakpointer" rel="nofollow">https://github.com/ruping/Breakpointer</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37959/rainbow-an-integrated-tool-for-efficient-clustering-and-assembling-rad-seq-reads</guid>
	<pubDate>Fri, 19 Oct 2018 08:23:42 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37959/rainbow-an-integrated-tool-for-efficient-clustering-and-assembling-rad-seq-reads</link>
	<title><![CDATA[Rainbow: an integrated tool for efficient clustering and assembling RAD-seq reads]]></title>
	<description><![CDATA[<p><span>Rainbow is developed to provide an ultra-fast and memory-efficient solution to clustering and assembling short reads produced by RAD-seq. First, Rainbow clusters reads using a spaced seed method. Then, Rainbow implements a heterozygote calling like strategy to divide potential groups into haplotypes in a top&ndash;down manner. And along a guided tree, it iteratively merges sibling leaves in a bottom&ndash;up manner if they are similar enough. Here, the similarity is defined by comparing the 2nd reads of a RAD segment. This approach tries to collapse heterozygote while discriminate repetitive sequences. At last, Rainbow uses a greedy algorithm to locally assemble merged reads into contigs. Rainbow not only outputs the optimal but also suboptimal assembly results. Based on simulation and a real guppy RAD-seq data, we show that Rainbow is more competent than the other tools in dealing with RAD-seq data</span></p><p>Address of the bookmark: <a href="https://sourceforge.net/projects/bio-rainbow/files/" rel="nofollow">https://sourceforge.net/projects/bio-rainbow/files/</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42130/shaman-a-user-friendly-website-for-metataxonomic-analysis-from-raw-reads-to-statistical-analysis</guid>
	<pubDate>Mon, 17 Aug 2020 05:21:09 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42130/shaman-a-user-friendly-website-for-metataxonomic-analysis-from-raw-reads-to-statistical-analysis</link>
	<title><![CDATA[SHAMAN: a user-friendly website for metataxonomic analysis from raw reads to statistical analysis]]></title>
	<description><![CDATA[<p><span>SHAMAN is a shiny application for differential analysis of metagenomic data (16S, 18S, 23S, 28S, ITS and WGS) including bioinformatics treatment of raw reads for targeted metagenomics, statistical analysis and results visualization with a large variety of plots (barplot, boxplot, heatmap, &hellip;).</span><br><span>The bioinformatics treatment is based on Vsearch [</span><a href="http://www.ncbi.nlm.nih.gov/pubmed/27781170">Rognes 2016</a><span>] which showed to be both accurate and fast [</span><a href="http://www.ncbi.nlm.nih.gov/pubmed/26664811">Wescott 2015</a><span>].The statistical analysis is based on DESeq2 R package [</span><a href="http://www.ncbi.nlm.nih.gov/pubmed/20979621">Anders and Huber 2010</a><span>] which robustly identifies the differential abundant features as suggested in [</span><a href="http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3974642/">McMurdie and Holmes 2014</a><span>] and [</span><a href="http://www.ncbi.nlm.nih.gov/pmc/articles/PMC4727335/">Jonsson2016</a><span>]. SHAMAN robustly identifies the differential abundant genera with the Generalized Linear Model implemented in DESeq2 [</span><a href="http://www.ncbi.nlm.nih.gov/pubmed/25516281">Love 2014</a><span>].</span><br><span>SHAMAN is compatible with standard formats for metagenomic analysis (.csv, .tsv, .biom) and figures can be downloaded in several formats. A presentation about SHAMAN is available&nbsp;</span><a href="https://github.com/aghozlane/shaman/blob/master/www/shaman_presentation.pdf">here</a><span>&nbsp;and a poster&nbsp;</span><a href="https://github.com/aghozlane/shaman/blob/master/www/shaman_poster.pdf">here</a><span>.&nbsp;</span></p>
<p><span>More at&nbsp;<a href="https://bmcbioinformatics.biomedcentral.com/articles/10.1186/s12859-020-03666-4">https://bmcbioinformatics.biomedcentral.com/articles/10.1186/s12859-020-03666-4</a></span></p><p>Address of the bookmark: <a href="https://github.com/aghozlane/shaman" rel="nofollow">https://github.com/aghozlane/shaman</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>

</channel>
</rss>