<?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/44616?offset=220</link>
	<atom:link href="https://bioinformaticsonline.com/related/44616?offset=220" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44329/metabuli-%EB%B6%84%EB%A6%AC-improves-metagenomic-read-classification</guid>
	<pubDate>Sat, 03 Jun 2023 20:15:04 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44329/metabuli-%EB%B6%84%EB%A6%AC-improves-metagenomic-read-classification</link>
	<title><![CDATA[Metabuli 분리 improves metagenomic read classification]]></title>
	<description><![CDATA[<p><span>Metabuli 분리 improves metagenomic read classification through metamers, DNA-AA k-mers, to be sensitive and specific, recovering 99% and 98% of DNA or AA classifiers.</span></p>
<p>&nbsp;</p>
<p><span><span>Metabuli is metagenomic classifier that jointly analyze both DNA and amino acid (AA) sequences. DNA-based classifiers can make specific classifications, exploiting point mutations to distinguish close taxa. AA-based classifiers have higher sensitivity in detecting homology between query and reference sequences, leverageing higher conservation of AA sequences. Metabuli combines the information of both sequence types using a novel k-mer structure,&nbsp;</span><em>metamer</em><span>, to enable both specific and sensitive characterization of metagenomic samples. In addition, it can classify reads against a database of any size as long as it fits in the hard disk.</span> </span></p><p>Address of the bookmark: <a href="https://github.com/steineggerlab/Metabuli" rel="nofollow">https://github.com/steineggerlab/Metabuli</a></p>]]></description>
	<dc:creator>Abhi</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40994/biological-databases</guid>
	<pubDate>Wed, 12 Feb 2020 01:16:29 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40994/biological-databases</link>
	<title><![CDATA[Biological databases !]]></title>
	<description><![CDATA[<p>Now a days there are a lots of genomics databases available around the world. This bookmark is created to provide all links in one place ...</p>
<p>ftp://ftp.ncbi.nih.gov/genomes/</p>
<p>https://hgdownload.soe.ucsc.edu/downloads.html</p><p>Address of the bookmark: <a href="ftp://ftp.ncbi.nih.gov/genomes/" rel="nofollow">ftp://ftp.ncbi.nih.gov/genomes/</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37984/baum-%E2%80%93-improving-genome-assembly-by-adaptive-unique-mapping-and-local-overlap-layout-consensus</guid>
	<pubDate>Wed, 24 Oct 2018 23:35:09 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37984/baum-%E2%80%93-improving-genome-assembly-by-adaptive-unique-mapping-and-local-overlap-layout-consensus</link>
	<title><![CDATA[BAUM – Improving Genome Assembly by Adaptive Unique Mapping and Local Overlap-Layout-Consensus]]></title>
	<description><![CDATA[<p><span>BAUM, breaks the whole genome into regions by adaptive unique mapping; then the local OLC is used to assemble each region in parallel. BAUM can: (1) perform reference-assisted assembly based on the genome of a close species; (2) or improve the results of existing assemblies that are obtained based on short or long sequencing reads.&nbsp;</span></p><p>Address of the bookmark: <a href="http://www.zhanyuwang.xin/wordpress/index.php/2017/07/21/baum-improving-genome-assembly-by-adaptive-unique-mapping-and-local-overlap-layout-consensus/" rel="nofollow">http://www.zhanyuwang.xin/wordpress/index.php/2017/07/21/baum-improving-genome-assembly-by-adaptive-unique-mapping-and-local-overlap-layout-consensus/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41397/svaba-structural-variation-and-indel-detection-by-local-assembly</guid>
	<pubDate>Tue, 10 Mar 2020 07:52:15 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41397/svaba-structural-variation-and-indel-detection-by-local-assembly</link>
	<title><![CDATA[SvABA: Structural variation and indel detection by local assembly]]></title>
	<description><![CDATA[<p><span>SvABA is a method for detecting structural variants in sequencing data using genome-wide local assembly. Under the hood, SvABA uses a custom implementation of&nbsp;</span><a href="https://github.com/jts/sga">SGA</a><span>&nbsp;(String Graph Assembler) by Jared Simpson, and&nbsp;</span><a href="https://github.com/lh3/bwa">BWA-MEM</a><span>&nbsp;by Heng Li. Contigs are assembled for every 25kb window (with some small overlap) for every region in the genome. The default is to use only clipped, discordant, unmapped and indel reads, although this can be customized to any set of reads at the command line using&nbsp;</span><a href="https://github.com/walaj/VariantBam">VariantBam</a><span>&nbsp;rules. These contigs are then immediately aligned to the reference with BWA-MEM and parsed to identify variants. Sequencing reads are then realigned to the contigs with BWA-MEM, and variants are scored by their read support.</span></p><p>Address of the bookmark: <a href="https://github.com/walaj/svaba" rel="nofollow">https://github.com/walaj/svaba</a></p>]]></description>
	<dc:creator>Jit</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/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/news/view/4295/rcsb-pdb-sept13-release</guid>
	<pubDate>Thu, 05 Sep 2013 15:07:48 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/4295/rcsb-pdb-sept13-release</link>
	<title><![CDATA[RCSB PDB Sept'13 Release]]></title>
	<description><![CDATA[<p>RCSB PDB Sept'13 Release offers following new features:</p><p>- New tools to search for drugs and drug targets<br />- Improved interface for 3D visualisation using Jmol/JSmol<br />- An update to the representation of protein symmetry and stoichiometry.<br />- Improvements when performing sequence searches.</p><p>Reference</p><p><a href="http://www.rcsb.org/pdb/static.do?p=general_information/whats_new.jsp?b=1308">http://www.rcsb.org/pdb/static.do?p=general_information/whats_new.jsp?b=1308</a></p><p>&nbsp;</p>]]></description>
	<dc:creator>Jitendra Narayan</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/6562/molecular-bioinformatics-lab-mbl</guid>
  <pubDate>Tue, 19 Nov 2013 18:23:27 -0600</pubDate>
  <link></link>
  <title><![CDATA[Molecular Bioinformatics Lab (MBL)]]></title>
  <description><![CDATA[
<p>The main subject of interest in our laboratory is the study of the relationship among sequence, structure, and function in proteins and nucleic acids. Our research can be divided in two major topics:</p>

<p>the study of the sequence-structure relationship<br />(application -&gt; structure prediction)<br />the study of the structure-function relationship<br />(application -&gt; function prediction)</p>

<p>Therefore, anything related to the configuration (sequence) and conformation (structure) in atomic systems of proteins and nucleic acids, and the interaction of these with other elements (function) is of our major interest.</p>

<p>Lab page @ http://melolab.org/mbl/</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/10260/%E2%80%9Con%E2%80%9D-and-%E2%80%9Coff%E2%80%9D-the-neuron</guid>
	<pubDate>Fri, 25 Apr 2014 19:31:13 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/10260/%E2%80%9Con%E2%80%9D-and-%E2%80%9Coff%E2%80%9D-the-neuron</link>
	<title><![CDATA[“On” and “Off” the neuron !!!]]></title>
	<description><![CDATA[<p><span>Optogenetics is a recent innovation in neuroscience that gives researchers the ability to control the activity of neurons with light. With this powerful tool, researchers are teasing apart the biological basis of memory, behavior, and disease (see &ldquo;<a href="http://www.technologyreview.com/news/517226/scientists-make-mice-remember-things-that-didnt-happen/"><span>Scientists Make Mice &lsquo;Remember&rsquo; Things That Didn&rsquo;t Happen</span></a>&rdquo; and &ldquo;<a href="http://www.technologyreview.com/news/423254/an-on-off-switch-for-anxiety/"><span>An On-Off Switch for Anxiety</span></a>,&rdquo;). But for the first several years of this technology&rsquo;s existence, the proteins that scientists added to neurons to make them react to light were only good at activating neurons. That limited researchers&rsquo; ability to understand neuronal circuits, sets of interconnected neurons that are thought to control behavior and, when misfiring, to underlie many brain conditions. Problems can arise from any imbalance in circuit activity, whether too much or too little.&nbsp;</span></p><p><span>Now, two research groups have engineered new optogenetic proteins that can be used to efficiently silence neurons.&nbsp;<span><span>One of the two new proteins comes from the lab of<span>&nbsp;</span><a href="http://www.stanford.edu/group/dlab/about_pi.html" target="_blank">Karl Deisseroth</a>, a psychiatrist and neuroscientist at Stanford University who helped develop optogenetics as a research tool.&nbsp;His group&rsquo;s new &ldquo;off&rdquo; switch for neurons was created by changing 10 of the 333 amino acids in an existing optogenetic protein, which itself had been engineered by combining natural proteins from<span>&nbsp;</span></span></span><a href="http://genome.jgi-psf.org/Chlre3/Chlre3.home.html" target="_blank"><span>green algae</span></a><span><span>. That advance&nbsp;</span><span>&ldquo;creates a powerful tool that allows neuroscientists to apply a brake in any specific circuit with millisecond precision,&rdquo; said Thomas&nbsp;Insel, director of the National Institute of Mental Health, in a released statement.&nbsp;</span><a href="http://www.sciencemag.org/content/344/6182/409" target="_blank"><span>The other new silencing protein</span></a>, developed by scientists at the H</span><span>umboldt University of Berlin and collaborators, was created by changing amino acids in the same existing optogenetic protein.&nbsp;</span></span></p><p><span><span>Some researchers are also looking to optogenetics as a potential treatment for patients with a variety of conditions (see &ldquo;</span></span><span><a href="http://www.technologyreview.com/news/524771/for-mice-and-maybe-men-pain-is-gone-in-a-flash/"><span>For Mice, and Maybe Men, Pain Is Gone in a Flash</span></a><span><span>,&rdquo; and &ldquo;</span></span><a href="http://www.technologyreview.com/news/506981/flipping-on-the-lights-to-halt-seizures/"><span>Flipping on the Lights to Halt Seizures</span></a><span><span>&rdquo;) but there are huge challenges to overcome. The method requires genetic modification of cells to make them light-sensitive. It also requires implanted light sources for all but the shallowest of nerve endings. <br /></span></span></span></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/13523/megadock-40</guid>
	<pubDate>Thu, 07 Aug 2014 18:08:54 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/13523/megadock-40</link>
	<title><![CDATA[MEGADOCK 4.0]]></title>
	<description><![CDATA[<p>An ultra&ndash;high-performance protein&ndash;protein docking software for heterogeneous supercomputers</p>
<p id="p-4"><strong>Summary:</strong> The application of protein&ndash;protein docking in large-scale interactome analysis is a major challenge in structural bioinformatics and requires huge computing resources. In this work, we present MEGADOCK 4.0, an FFT-based docking software that makes extensive use of recent heterogeneous supercomputers and shows powerful, scalable performance of over 97% strong scaling.</p>
<p id="p-5"><strong>Availability and Implementation:</strong> MEGADOCK 4.0 is written in C++ with OpenMPI and NVIDIA CUDA 5.0 (or later) and is freely available to all academic and non-profit users at: <a href="http://www.bi.cs.titech.ac.jp/megadock">http://www.bi.cs.titech.ac.jp/megadock</a>.</p>
<p id="p-6"><strong>Contact:</strong> <a href="mailto:akiyama@cs.titech.ac.jp">akiyama@cs.titech.ac.jp</a></p><p>Address of the bookmark: <a href="http://bioinformatics.oxfordjournals.org/content/early/2014/08/06/bioinformatics.btu532.short" rel="nofollow">http://bioinformatics.oxfordjournals.org/content/early/2014/08/06/bioinformatics.btu532.short</a></p>]]></description>
	<dc:creator>Suleman Khan</dc:creator>
</item>

</channel>
</rss>