<?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/5898?offset=60</link>
	<atom:link href="https://bioinformaticsonline.com/related/5898?offset=60" 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/file/view/991/master-thesis-trans-membrane-topology-prediction-through-markov-based-decoders</guid>
	<pubDate>Wed, 17 Jul 2013 16:16:17 -0500</pubDate>
	<link>https://bioinformaticsonline.com/file/view/991/master-thesis-trans-membrane-topology-prediction-through-markov-based-decoders</link>
	<title><![CDATA[Master Thesis: Trans-membrane topology prediction through Markov based decoders]]></title>
	<description><![CDATA[<p dir="ltr"><span>Abstract:</span></p><p dir="ltr"><span></span><span>Background/Motivation: </span></p><p dir="ltr"><span>The dearth of structural information on alpha helical membrane protein (MPs) has hindered thus far the development of reliable knowledge &ndash;based potentials that can be used for automatic prediction of trans-membrane (TM) protein structure. While algorithm for identification of TM segments is available, modelling of the domains of alpha helical MPs involves assembling the segments into a bundle. This requires the correct assignment of the buried and lipid-exposed faces of the TM domains.</span><span>&nbsp;</span></p><p dir="ltr"><span>Results: </span><span><span><span>In a cross validated test on single sequences, our trans-membrane MM, correctly predicts the entire topology for 77% of the sequences in a standard dataset of 86 proteins with supervised topology. These results compare favorably with existing methods.</span></span></span><span>&nbsp;</span></p><p dir="ltr"><span><strong>Source Code</strong>: Matlab</span></p><p dir="ltr"><span></span><span>Conclusion/Implementation</span><span><span><span>: Here discriminant data mining approach was used to predict the location and orientation of alpha helices in membrane-spanning proteins. It is based on a first order Markov model (MM) with an architecture that corresponds closely to the biological systems. The model is enriched with three types of states for the loop on the cytoplasmic side (outer loop), loop for the non-cytoplasmic side (inner side), and trans-membrane part. The closed association between the biological and Markov states allows us to infer which part of the model architecture are important to capture the information which encodes the membrane topology, and gain a better understanding of the mechanism and constraints involved. Predictor Model was established by various &nbsp;Markov decoder , and assignment of the membrane helix boundaries was apparent.</span></span></span></p>]]></description>
	<dc:creator>Rahul Agarwal</dc:creator>
	<enclosure url="https://bioinformaticsonline.com/file/download/991" length="161792" type="application/vnd.ms-powerpoint" />
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36026/mmseqs20-ultra-fast-and-sensitive-protein-search-and-clustering-suite</guid>
	<pubDate>Thu, 22 Mar 2018 10:40:51 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36026/mmseqs20-ultra-fast-and-sensitive-protein-search-and-clustering-suite</link>
	<title><![CDATA[MMseqs2.0: ultra fast and sensitive protein search and clustering suite]]></title>
	<description><![CDATA[<p>MMseqs2 (Many-against-Many sequence searching) is a software suite to search and cluster huge protein sequence sets. MMseqs2 is open source GPL-licensed software implemented in C++ for Linux, MacOS, and (as beta version, via cygwin) Windows. The software is designed to run on multiple cores and servers and exhibits very good scalability. MMseqs2 can run 10000 times faster than BLAST. At 100 times its speed it achieves almost the same sensitivity. It can perform profile searches with the same sensitivity as PSI-BLAST at over 400 times its speed.</p>
<p>The MMseqs2 user guide is available as&nbsp;<a href="https://github.com/soedinglab/mmseqs2/wiki">Github Wiki</a>&nbsp;or as&nbsp;<a href="https://mmseqs.com/latest/userguide.pdf">PDF file</a>&nbsp;(Thanks to&nbsp;<a href="https://github.com/jgm/pandoc">pandoc</a>!)</p>
<p>Please cite:&nbsp;<a href="https://www.nature.com/nbt/journal/vaop/ncurrent/full/nbt.3988.html">Steinegger M and Soeding J. MMseqs2 enables sensitive protein sequence searching for the analysis of massive data sets. Nature Biotechnology, doi: 10.1038/nbt.3988 (2017)</a>.</p><p>Address of the bookmark: <a href="https://github.com/soedinglab/MMseqs2" rel="nofollow">https://github.com/soedinglab/MMseqs2</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37965/kobas-a-web-server-for-geneprotein-functional-annotation-and-functional-gene-set-enrichment</guid>
	<pubDate>Fri, 19 Oct 2018 09:36:11 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37965/kobas-a-web-server-for-geneprotein-functional-annotation-and-functional-gene-set-enrichment</link>
	<title><![CDATA[KOBAS: a web server for gene/protein functional annotation and functional gene set enrichment]]></title>
	<description><![CDATA[<p><span>KOBAS 3.0 is a web server for gene/protein functional annotation (</span><a href="http://kobas.cbi.pku.edu.cn/annotate.php">Annotate</a><span>&nbsp;module) and functional gene set enrichment(Enrichment module). For Annotate module, it accepts gene list as input, including IDs or sequences, and generates annotations for each gene based on multiple databases about pathways, diseases, and Gene Ontology. For Enrichment module, it can accept either gene list or gene expression data as input, and generates enriched gene sets, corresponding name, p-value or a probability of enrichment and enrichment score based on results of multiple methods.</span></p><p>Address of the bookmark: <a href="http://kobas.cbi.pku.edu.cn/" rel="nofollow">http://kobas.cbi.pku.edu.cn/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44479/doubletrouble-identify-duplicated-genes-from-whole-genome-protein-sequences-and-classify</guid>
	<pubDate>Tue, 05 Mar 2024 00:23:49 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44479/doubletrouble-identify-duplicated-genes-from-whole-genome-protein-sequences-and-classify</link>
	<title><![CDATA[doubletrouble: identify duplicated genes from whole-genome protein sequences and classify]]></title>
	<description><![CDATA[<p><span>doubletrouble aims to identify duplicated genes from whole-genome protein sequences and classify them based on their modes of duplication. The duplication modes are i. segmental duplication (SD); ii. tandem duplication (TD); iii. proximal duplication (PD); iv. transposed duplication (TRD) and; v. dispersed duplication (DD). Transposon-derived duplicates (TRD) can be further subdivided into rTRD (retrotransposon-derived duplication) and dTRD (DNA transposon-derived duplication). If users want a simpler classification scheme, duplicates can also be classified into SD- and SSD-derived (small-scale duplication) gene pairs. Besides classifying gene pairs, users can also classify genes, so that each gene is assigned a unique mode of duplication. Users can also calculate substitution rates per substitution site (i.e., Ka and Ks) from duplicate pairs, find peaks in Ks distributions with Gaussian Mixture Models (GMMs), and classify gene pairs into age groups based on Ks peaks.</span></p><p>Address of the bookmark: <a href="https://bioconductor.org/packages/release/bioc/html/doubletrouble.html" rel="nofollow">https://bioconductor.org/packages/release/bioc/html/doubletrouble.html</a></p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>

</channel>
</rss>