<?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/34386?offset=10</link>
	<atom:link href="https://bioinformaticsonline.com/related/34386?offset=10" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34734/smash-an-alignment-free-tool-to-find-and-visualise-rearrangements-between-pairs-of-dna-sequences</guid>
	<pubDate>Thu, 21 Dec 2017 08:26:57 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34734/smash-an-alignment-free-tool-to-find-and-visualise-rearrangements-between-pairs-of-dna-sequences</link>
	<title><![CDATA[SMASH: An alignment-free tool to find and visualise rearrangements between pairs of DNA sequences]]></title>
	<description><![CDATA[<p style="text-align: justify;"><span>SMASH is a completely alignment-free method to find and visualise rearrangements between pairs of DNA sequences</span>. The detection is based on&nbsp;<span>relative compression</span>, namely using a FCM, also known as Markov model, of high context order (typically 20). The method has been approached with a tool (also called SMASH). For visualization, SMASH outputs a SVG image, with an ideogram output architecture, where the patterns are represented with several HSV values (only value varies). The following image, illustrating the information maps between human and chimpanzee for the several chromosomes, depicts an example:</p>
<p><a href="https://github.com/pratas/smash/blob/master/imgs/HC.png" target="_blank"><img src="https://github.com/pratas/smash/raw/master/imgs/HC.png" alt="ScreenShot" style="border: 0px;"></a></p>
<p>&nbsp;</p>
<h2>&nbsp;</h2><p>Address of the bookmark: <a href="https://github.com/pratas/smash" rel="nofollow">https://github.com/pratas/smash</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/35915/iupac-codes</guid>
	<pubDate>Tue, 13 Mar 2018 05:16:05 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/35915/iupac-codes</link>
	<title><![CDATA[IUPAC codes]]></title>
	<description><![CDATA[<p>IUPAC codes</p><p>DNA:</p><p>Nucleotide Code: Base:</p><p>---------------- -----</p><p>A.................Adenine</p><p>C.................Cytosine</p><p>G.................Guanine</p><p>T (or U)..........Thymine (or Uracil)</p><p>R.................A or G</p><p>Y.................C or T</p><p>S.................G or C</p><p>W.................A or T</p><p>K.................G or T</p><p>M.................A or C</p><p>B.................C or G or T</p><p>D.................A or G or T</p><p>H.................A or C or T</p><p>V.................A or C or G</p><p>N.................any base . or -............gap</p><p>Protein:</p><p>Amino Acid Code: Three letter Code: Amino Acid:</p><p>---------------- ------------------ -----------</p><p>A.................Ala.................Alanine</p><p>B.................Asx.................Aspartic acid or Asparagine</p><p>C.................Cys.................Cysteine</p><p>D.................Asp.................Aspartic Acid</p><p>E.................Glu.................Glutamic Acid</p><p>F.................Phe.................Phenylalanine</p><p>G.................Gly.................Glycine</p><p>H.................His.................Histidine</p><p>I.................Ile.................Isoleucine</p><p>K.................Lys.................Lysine</p><p>L.................Leu.................Leucine</p><p>M.................Met.................Methionine</p><p>N.................Asn.................Asparagine</p><p>P.................Pro.................Proline</p><p>Q.................Gln.................Glutamine</p><p>R.................Arg.................Arginine</p><p>S.................Ser.................Serine</p><p>T.................Thr.................Threonine</p><p>V.................Val.................Valine</p><p>W.................Trp.................Tryptophan</p><p>X.................Xaa.................Any amino acid</p><p>Y.................Tyr.................Tyrosine</p><p>Z.................Glx.................Glutamine or Glutamic acid</p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36905/d-genies-a-tool-for-dotplot-large-genomes-in-an-interactive-efficient-and-simple-way</guid>
	<pubDate>Mon, 11 Jun 2018 09:41:22 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36905/d-genies-a-tool-for-dotplot-large-genomes-in-an-interactive-efficient-and-simple-way</link>
	<title><![CDATA[D-GENIES: A tool for Dotplot large Genomes in an Interactive, Efficient and Simple way]]></title>
	<description><![CDATA[D-GENIES – for Dotplot large Genomes in an Interactive, Efficient and Simple way – is an online tool designed to compare two genomes. It supports large genome and you can interact with the dot plot to improve the visualisation.

We use minimap version 2 to align the two genomes. Then, the PAF file is parsed and plotted into an interactive plot written with d3.js library.

D-Genies also allows to display dot plots from other aligners by uploading their PAF or MAF alignment file.

http://dgenies.toulouse.inra.fr/<p>Address of the bookmark: <a href="http://dgenies.toulouse.inra.fr/" rel="nofollow">http://dgenies.toulouse.inra.fr/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/39872/miropeats-discovers-regions-of-sequence-similarity-amongst-any-set-of-dna-sequences</guid>
	<pubDate>Mon, 26 Aug 2019 17:55:24 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/39872/miropeats-discovers-regions-of-sequence-similarity-amongst-any-set-of-dna-sequences</link>
	<title><![CDATA[Miropeats: discovers regions of sequence similarity amongst any set of DNA sequences]]></title>
	<description><![CDATA[<p><span>Miropeats discovers regions of sequence similarity amongst any set of DNA sequences and then presents this similarity information graphically. Sequence similarity searching is a very general tool that forms the basis of many different biological sequence analyses but it is limited by the verbosity of traditional alignment presentation styles. Miropeats enhances the utility of conventional DNA sequence comparisons when looking at long lengths of sequence similarity by summarizing extensive large scale sequence similarities on a single page of graphics. The latest version of Miropeats can be used as a general pairwise alignment program or in its traditional role sorting out a big mess of overlapping or similar regions.</span></p><p>Address of the bookmark: <a href="http://www.littlest.co.uk/software/bioinf/old_packages/miropeats/" rel="nofollow">http://www.littlest.co.uk/software/bioinf/old_packages/miropeats/</a></p>]]></description>
	<dc:creator>Poonam Mahapatra</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40865/dminda2-an-integrated-web-server-for-dna-motif-identification-and-analyses</guid>
	<pubDate>Sun, 02 Feb 2020 14:26:01 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40865/dminda2-an-integrated-web-server-for-dna-motif-identification-and-analyses</link>
	<title><![CDATA[DMINDA2: an integrated web server for DNA motif identification and analyses]]></title>
	<description><![CDATA[<p><span>DMINDA (</span><strong>D</strong><span>NA&nbsp;</span><strong>m</strong><span>otif&nbsp;</span><strong>i</strong><span>dentification a</span><strong>nd a</strong><span>nalyses) is an integrated web server for DNA motif identification and analyses</span></p>
<p><span>More at&nbsp;http://bmbl.sdstate.edu/DMINDA2/</span></p>
<p><span><a href="https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4086085/">https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4086085/</a></span></p><p>Address of the bookmark: <a href="http://bmbl.sdstate.edu/DMINDA2/" rel="nofollow">http://bmbl.sdstate.edu/DMINDA2/</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44495/exrec-exclusion-of-recombined-dna</guid>
	<pubDate>Wed, 27 Mar 2024 20:48:26 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44495/exrec-exclusion-of-recombined-dna</link>
	<title><![CDATA[ExRec: Exclusion of Recombined DNA]]></title>
	<description><![CDATA[<p><span>ExRec (Exclusion of Recombined DNA) is a Python pipeline that implements the four-gamete test to filter out recombined DNA sites from up to thousands of DNA sequence loci. The pipeline consists of five standalone applications: the first two convert folders of NEXUS or PHYLIP files into the standard input file for the main program that conducts the four-gamete filtering procedures. The pipeline outputs recombination-filtered data in concatenated NEXUS and PHYLIP formats and a tab-delimited table containing descriptive statistics for all loci and the results. This software also allows the user to output the longest non-recombined sequence blocks from loci (current best practice) or randomly select non-recombined blocks from loci (a newer approach). Two other applications in the package convert the recombination-filtered data into single-locus NEXUS or PHYLIP files. The ExRec package can thus facilitate species delimitation, species tree, and historical demography studies by providing loci that better meet the no-recombination assumption in coalescent-based analyses.</span></p>
<p><span>Link to the article:&nbsp;</span><a href="https://academic.oup.com/bioinformaticsadvances/article/3/1/vbad174/7455250?searchresult=1" target="_blank">https://academic.oup.com/bioinformaticsadvances/article/3/1/vbad174/7455250?searchresult=1</a><br><br><span>Link to the software:</span><br><a href="https://github.com/Sammccarthypotter/ExRec" target="_blank">https://github.com/Sammccarthypotter/ExRec</a></p><p>Address of the bookmark: <a href="https://github.com/Sammccarthypotter/ExRec" rel="nofollow">https://github.com/Sammccarthypotter/ExRec</a></p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/45244/the-ghost-ancestors-hidden-in-our-dna</guid>
	<pubDate>Tue, 18 Aug 2026 22:16:24 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/45244/the-ghost-ancestors-hidden-in-our-dna</link>
	<title><![CDATA[The Ghost Ancestors Hidden in Our DNA]]></title>
	<description><![CDATA[<p>Imagine standing in a museum of human evolution.</p><p>There are Neanderthal bones. Denisovan remains. Fossils from ancient relatives of our species. Each specimen gives us another piece of the story of how Homo sapiens came to be.</p><p>But now imagine that one of the most important characters in that story has left behind no fossil, no skull, no bone, and no genome.</p><p>Nothing that a paleontologist could put behind glass.</p><p>And yet, somehow, that ancient population is still speaking.</p><p>It is speaking through us.</p><p>A fascinating new study published in Science (https://www.science.org/doi/10.1126/science.aef8874?) introduces a computational method called TRACE, which allows scientists to search modern human genomes for genetic traces of ancient populations that have never been directly identified.</p><p>For years, scientists have known that our ancestors interacted with Neanderthals and Denisovans. Their DNA still survives in modern human populations. But these may not have been the only ancient humans who crossed paths with our ancestors.</p><p>Using TRACE, researchers found evidence of an unknown archaic population that contributed DNA to the ancestors of modern humans before humans spread beyond Africa.</p><p>Even more surprisingly, they found evidence of a much older lineage&mdash;possibly around 1.8 million years old&mdash;whose genetic legacy may have reached some modern humans indirectly through Denisovans.</p><p>The extraordinary part is that researchers did not need DNA from these mysterious populations to detect them. Instead, they studied the ancestry of modern genomes and looked for genetic patterns that revealed unusually ancient branches of our family history.</p><p>It is almost like finding the footprints of someone who disappeared thousands of years ago&mdash;without ever finding the person themselves.</p><p>These discoveries suggest that human evolution was far more complicated than a simple family tree. Ancient human populations repeatedly separated, migrated, met and exchanged genes. Some eventually disappeared, but pieces of their genetic legacy survived.</p><p>And that means our DNA is more than a biological instruction manual.</p><p>It is also an archive of human history.</p><p>Some of the people recorded in that archive may never have a name or a fossil. But thanks to methods like TRACE, their genetic echoes are finally becoming visible.</p><p>The next big discovery about our ancient past may not come from a fossil in the ground.</p><p>It may already be inside us.</p><p>Reference: Zhang et al., &ldquo;Recovering signatures of archaic hominin introgression using ancestral recombination graphs,&rdquo; Science (2026), DOI: 10.1126/science.aef8874. Detail paper @&nbsp;https://www.science.org/doi/10.1126/science.aef8874?</p><p><br />The TRACE repository (https://github.com/YulinZhang9806/trace) contains the Python package and command-line tools used to infer archaic admixture tracts from ancestral recombination graphs.</p>]]></description>
	<dc:creator>Jitendra Narayan</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/file/view/42693/dna-rna-meme</guid>
	<pubDate>Thu, 28 Jan 2021 11:23:14 -0600</pubDate>
	<link>https://bioinformaticsonline.com/file/view/42693/dna-rna-meme</link>
	<title><![CDATA[DNA RNA MEME]]></title>
	<description><![CDATA[<p>Explain the DNA and RNA with picture ...</p>]]></description>
	<dc:creator>Neel</dc:creator>
	<enclosure url="https://bioinformaticsonline.com/file/download/42693" length="41627" type="image/jpeg" />
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/26537/destruct</guid>
	<pubDate>Mon, 29 Feb 2016 17:34:59 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/26537/destruct</link>
	<title><![CDATA[destruct]]></title>
	<description><![CDATA[<p>Destruct is a tool for joint prediction of rearrangement breakpoints from single or multiple tumour samples.</p>
<p>More at&nbsp;https://bitbucket.org/dranew/destruct</p><p>Address of the bookmark: <a href="https://bitbucket.org/dranew/destruct" rel="nofollow">https://bitbucket.org/dranew/destruct</a></p>]]></description>
	<dc:creator>Jitendra Prajapati</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41604/synteny-and-rearrangement-identifier-syri</guid>
	<pubDate>Tue, 05 May 2020 10:37:10 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41604/synteny-and-rearrangement-identifier-syri</link>
	<title><![CDATA[Synteny and Rearrangement Identifier (SyRI)]]></title>
	<description><![CDATA[<p>SyRI is a comprehensive tool for predicting genomic differences between related genomes using whole-genome assemblies (WGA). The assemblies are aligned using whole-genome alignment tools, and these alignments are then used as input to SyRI. SyRI identifies syntenic path (longest set of co-linear regions), structural rearrangements (inversions, translocations, and duplications), local variations (SNPs, indels, CNVs etc) within syntenic and structural rearrangements, and un-aligned regions.</p><p>Address of the bookmark: <a href="https://schneebergerlab.github.io/syri/" rel="nofollow">https://schneebergerlab.github.io/syri/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>