<?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/10664?offset=900</link>
	<atom:link href="https://bioinformaticsonline.com/related/10664?offset=900" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/view/1926</guid>
	<pubDate>Sun, 11 Aug 2013 11:42:32 -0500</pubDate>
	<link>https://bioinformaticsonline.com/view/1926</link>
	<title><![CDATA[Want to Know which genome assembler rule the world ?]]></title>
	<description><![CDATA[<p><span><strong>Assemblathon 2</strong>: evaluating de novo methods of genome assembly&nbsp;</span></p><p><span><a href="http://www.gigasciencejournal.com/content/2/1/10/abstract">http://www.gigasciencejournal.com/content/2/1/10/abstract</a></span></p><p><span><a href="http://blogs.nature.com/news/2013/07/genome-assembly-contest-prompts-soul-searching.html">http://blogs.nature.com/news/2013/07/genome-assembly-contest-prompts-soul-searching.html</a></span></p><p><a href="http://assemblathon.org/post/44431915644/feedback-and-analysis-of-the-assemblathon-2-p">http://assemblathon.org/post/44431915644/feedback-and-analysis-of-the-assemblathon-2-p</a></p><p>&nbsp;</p>]]></description>
	<dc:creator>Rahul Agarwal</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/4590/tigers-genome-sequenced</guid>
	<pubDate>Tue, 17 Sep 2013 16:48:24 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/4590/tigers-genome-sequenced</link>
	<title><![CDATA[Tigers genome sequenced]]></title>
	<description><![CDATA[<p>Fifteen scientists led by Dr Jong Bhak of Genome Research Foundation, South Korea, decoded as many as 3 billion nucleotides (organic molecules that form the basic building blocks of nucleic acids, such as DNA). They identified 20,000 genes related to various functions of the tiger.&nbsp;</p><p>The biggest and perhaps most fearsome of the world's big cats, the tiger, shares 95.6 percent of its DNA with humans' cute and furry companions, domestic cats.</p><p>The new research showed that big cats have genetic mutations that enabled them to be carnivores. The team also identified mutations that allow snow leopards to thrive at high altitudes.</p><p>Reference:</p><p><a href="http://www.nbcnews.com/science/your-cat-ferocious-tigers-share-lot-95-6-percent-their-4B11182690">http://www.nbcnews.com/science/your-cat-ferocious-tigers-share-lot-95-6-percent-their-4B11182690</a></p><p><a href="http://timesofindia.indiatimes.com/home/environment/flora-fauna/Gene-mapping-of-tiger-completed/articleshow/22671681.cms">http://timesofindia.indiatimes.com/home/environment/flora-fauna/Gene-mapping-of-tiger-completed/articleshow/22671681.cms</a></p><p>Paper:</p><p><a href="http://www.nature.com/ncomms/2013/130917/ncomms3433/full/ncomms3433.html">http://www.nature.com/ncomms/2013/130917/ncomms3433/full/ncomms3433.html</a></p>]]></description>
	<dc:creator>Rahul Agarwal</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/5898/an-entire-genome-written-in-lab</guid>
	<pubDate>Fri, 25 Oct 2013 09:43:03 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/5898/an-entire-genome-written-in-lab</link>
	<title><![CDATA[An entire genome written in lab]]></title>
	<description><![CDATA[<p>This is the first time ever the genetic code has been fundamentally changed. The breakthrough is a huge step forward in synthetic biology and opens up the possibility of turning re-coded bacteria into biofactories, capable of producing potent new forms of protein that could fight disease or generate sustainable materials.</p><p>More @ <a href="http://news.yale.edu/2013/10/17/researchers-rewrite-entire-genome-and-add-healthy-twist">http://news.yale.edu/2013/10/17/researchers-rewrite-entire-genome-and-add-healthy-twist</a></p><p>News Reference:&nbsp;Yale news</p><p><img src="http://images.sciencedaily.com/2011/07/110714142130-large.jpg" alt="image" width="800" height="530" style="border: 0px; border: 0px;"></p><p>Image Source: Sciencedaily.</p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/file/view/23838/scripted-dna</guid>
	<pubDate>Mon, 17 Aug 2015 17:44:04 -0500</pubDate>
	<link>https://bioinformaticsonline.com/file/view/23838/scripted-dna</link>
	<title><![CDATA[Scripted DNA !!!]]></title>
	<description><![CDATA[<p>As per bioinformatician DNA is partially scripted ;) You dont believe in it. Please have a look at image carefully:)</p>]]></description>
	<dc:creator>Jit</dc:creator>
	<enclosure url="https://bioinformaticsonline.com/file/download/23838" length="13498" type="image/gif" />
</item>
<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>

</channel>
</rss>