<?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/36830?offset=120</link>
	<atom:link href="https://bioinformaticsonline.com/related/36830?offset=120" 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/32129/lordec-a-hybrid-error-correction-program-for-long-pacbio-reads</guid>
	<pubDate>Mon, 10 Apr 2017 04:16:09 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32129/lordec-a-hybrid-error-correction-program-for-long-pacbio-reads</link>
	<title><![CDATA[LoRDEC: a hybrid error correction program for long, PacBio reads]]></title>
	<description><![CDATA[<p>LoRDEC is a program to correct sequencing errors in long reads from 3rd generation sequencing with high error rate, and is especially intended for PacBio reads. It uses a hybrid strategy, meaning that it uses two sets of reads: the reference read set, whose error rate is assumed to be small, and the PacBio read set, which is then corrected using the reference set. Typically, the reference set contains Illumina reads.</p>
<p><br> Usually, errors in PacBio reads include many insertions and deletions, and comparatively less substitutions. LoRDEC can correct errors of all these types.<br> After correction, a larger portion of the sequence of PacBio reads is usable for detection of region of similarity with other sequences, for aligning them to the contigs of an assembly, etc.</p>
<p>Why is LoRDEC different?</p>
<ul>
<li>It is efficient and can process large read data sets, included from eukaryotic or vertebrate species, on a usual computing server, and even works on desktop/laptop computers.</li>
<li>It adopts a novel graph based approach: it builds a succinct De Bruijn Graph (DBG) representing the short reads, and seeks a corrective sequence for each erroneous region of a long read by traversing chosen paths in the graph.</li>
</ul><p>Address of the bookmark: <a href="http://www.atgc-montpellier.fr/lordec/" rel="nofollow">http://www.atgc-montpellier.fr/lordec/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38501/fgenesh-program-for-predicting-multiple-genes-in-genomic-dna-sequences</guid>
	<pubDate>Thu, 20 Dec 2018 11:55:08 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38501/fgenesh-program-for-predicting-multiple-genes-in-genomic-dna-sequences</link>
	<title><![CDATA[FGENESH - Program for predicting multiple genes in genomic DNA sequences]]></title>
	<description><![CDATA[<p>FGENESH is the fastest (50-100 times faster than GenScan) and most accurate gene finder available - see the figure and the table below. In recent rice genome sequencing projects, it was cited "the most successful (gene finding) program (Yu&nbsp;<em>et al</em>. (2002) Science 296:79) and was used to produce 87% of all high-evidence predicted genes (Goff&nbsp;<em>et al</em>. (2002) Science 296:79).</p><p>Address of the bookmark: <a href="http://www.softberry.com/berry.phtml?topic=fgenesh&amp;group=help&amp;subgroup=gfind" rel="nofollow">http://www.softberry.com/berry.phtml?topic=fgenesh&amp;group=help&amp;subgroup=gfind</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/33223/tbl2asn-a-command-line-program-that-automates-the-creation-of-sequence-records-for-submission-to-genbank</guid>
	<pubDate>Mon, 29 May 2017 07:37:08 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/33223/tbl2asn-a-command-line-program-that-automates-the-creation-of-sequence-records-for-submission-to-genbank</link>
	<title><![CDATA[Tbl2asn: a command-line program that automates the creation of sequence records for submission to GenBank]]></title>
	<description><![CDATA[<p>Tbl2asn is a command-line program that automates the creation of sequence records for submission to GenBank. It uses many of the same functions as Sequin but is driven generally by data files. Tbl2asn generates .sqn files for submission to GenBank. Additional manual editing is not required before submission.</p>
<p>Tbl2asn is available by anonymous&nbsp;<a href="ftp://ftp.ncbi.nih.gov/toolbox/ncbi_tools/converters/by_program/tbl2asn/">FTP</a>. Copy the right version for your platform, then uncompress the file, rename it to "tbl2asn", and set the permissions, as necessary for the platform.</p>
<p>&nbsp;</p><p>Address of the bookmark: <a href="https://www.ncbi.nlm.nih.gov/genbank/tbl2asn2/" rel="nofollow">https://www.ncbi.nlm.nih.gov/genbank/tbl2asn2/</a></p>]]></description>
	<dc:creator>Poonam Mahapatra</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37737/rebaler-program-for-conducting-reference-based-assemblies-using-long-reads</guid>
	<pubDate>Tue, 18 Sep 2018 07:52:41 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37737/rebaler-program-for-conducting-reference-based-assemblies-using-long-reads</link>
	<title><![CDATA[Rebaler: program for conducting reference-based assemblies using long reads.]]></title>
	<description><![CDATA[<p>Rebaler is a program for conducting reference-based assemblies using long reads. It relies mainly on&nbsp;<a href="https://github.com/lh3/minimap2">minimap2</a>&nbsp;for alignment and&nbsp;<a href="https://github.com/isovic/racon">Racon</a>&nbsp;for making consensus sequences.</p>
<p>I made Rebaler for bacterial genomes (specifically for the task of&nbsp;<a href="https://github.com/rrwick/Basecalling-comparison">testing basecallers</a>). It should in principle work for non-bacterial genomes as well, but I haven't tested it.</p><p>Address of the bookmark: <a href="https://github.com/rrwick/Rebaler" rel="nofollow">https://github.com/rrwick/Rebaler</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/39187/distruct-a-program-for-the-graphical-display-of-population-structure</guid>
	<pubDate>Mon, 25 Mar 2019 03:33:44 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/39187/distruct-a-program-for-the-graphical-display-of-population-structure</link>
	<title><![CDATA[DISTRUCT: a program for the graphical display of population structure]]></title>
	<description><![CDATA[<p><em>distruct</em><span>&nbsp;is a program that can be used to graphically display results produced by the genetic clustering program&nbsp;</span><em><a href="http://pritch.bsd.uchicago.edu/">structure</a></em><span>&nbsp;or by other similar programs. The figures produced by&nbsp;</span><em>distruct</em><span>display individual membership coefficients in the same form as used in&nbsp;</span><a href="https://rosenberglab.stanford.edu/papers/popstruct.pdf">"Genetic structure of human populations"&nbsp;<em>Science</em>&nbsp;298: 2381-2385 (2002)</a><span>. Various options enable the user to control left-to-right printing order of populations, bottom-to-top printing order of clusers, colors, and other graphical details. [</span><a href="https://rosenberglab.stanford.edu/distructExample.html">Example</a><span>]</span></p>
<p>[<a href="https://rosenberglab.stanford.edu/distructForms/distructRegistration.html">Download software package (includes the manual)</a>] (you will be directed first to a registration page and we would very much appreciate if you register)&nbsp;<br>[<a href="https://rosenberglab.stanford.edu/software/distructManual.pdf">Download manual</a>]&nbsp;<br>[<a href="https://rosenberglab.stanford.edu/papers/distructNote.pdf">Download software note from&nbsp;<em>Molecular Ecology Notes</em>&nbsp;4: 137-138 (2004)</a>]</p>
<p>To use the UNIX versions, unzip and untar the files in an appropriate directory using</p>
<pre>gunzip filename.tar.gz; tar xvf filename.tar</pre>
<p><span>where "filename.tar.gz" is the downloaded file. Winzip will unzip the Windows version. Run the program by typing</span></p>
<pre>./distruct</pre>
<p><span>in UNIX or</span></p>
<pre>distruct</pre>
<p><span>from a Dos prompt in Windows. It will produce a figure using the data that are represented in the Central/South Asia&nbsp;</span><em>K=5</em><span>&nbsp;plot in&nbsp;</span><em>Science</em><span>&nbsp;298: 2381-2385 (2002).</span></p>
<p>Please send comments or problems with&nbsp;<em>distruct</em>&nbsp;to Noah Rosenberg.</p>
<h4><em>October 15, 2014 &mdash; Users of Distruct may also find&nbsp;<a href="https://rosenberglab.stanford.edu/clumpp.html">CLUMPP</a>&nbsp;and&nbsp;<a href="http://clumpak.tau.ac.il/">CLUMPAK</a>&nbsp;of interest.</em></h4><p>Address of the bookmark: <a href="https://rosenberglab.stanford.edu/distruct.html" rel="nofollow">https://rosenberglab.stanford.edu/distruct.html</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41485/chromosight-computer-vision-based-program-for-pattern-recognition-in-chromosome-hi-c-contact-maps</guid>
	<pubDate>Mon, 23 Mar 2020 06:20:04 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41485/chromosight-computer-vision-based-program-for-pattern-recognition-in-chromosome-hi-c-contact-maps</link>
	<title><![CDATA[chromosight: Computer vision based program for pattern recognition in chromosome (Hi-C) contact maps]]></title>
	<description><![CDATA[<p>Python package to detect chromatin loops (and other patterns) in Hi-C contact maps.</p>
<p>Stable version with pip:</p>
<div>
<pre>pip3 install --user chromosight</pre>
</div>
<p>Stable version with conda:</p>
<div>
<pre>conda install -c bioconda -c conda-forge chromosight</pre>
</div>
<p>or, if you want to get the latest development version:</p>
<pre><code>pip3 install --user -e git+https://github.com/koszullab/chromosight.git@master#egg=chromosight</code></pre><p>Address of the bookmark: <a href="https://github.com/koszullab/Chromosight" rel="nofollow">https://github.com/koszullab/Chromosight</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/35351/sam-to-bam-conversion</guid>
	<pubDate>Fri, 26 Jan 2018 02:36:18 -0600</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/35351/sam-to-bam-conversion</link>
	<title><![CDATA[sam to bam conversion !!]]></title>
	<description><![CDATA[<p>To do sam to bam conversion, follow the following commands :-&nbsp;</p><div><div>Code:</div><pre dir="ltr">$ samtools view -b -S file.sam &gt; file.bam</pre></div><p>Then you will need to use&nbsp;<br /><br /></p><div><div>Code:</div><pre dir="ltr">$ samtools sort file.bam file-sorted</pre></div><p>followed by<br /><br /></p><div><div>Code:</div><pre dir="ltr">$ samtools index  file-sorted.bam</pre></div><p>in order to get an indexed file.<br /><br />If you just type&nbsp;<br /><br /></p><div><div>Code:</div><pre dir="ltr">$ samtools</pre></div><p>or samtools followed by the name of one of the samtools commands, you will get a few lines of help giving the correct syntax for that command,</p>]]></description>
	<dc:creator>Jit</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>

</channel>
</rss>