<?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/36806?offset=30</link>
	<atom:link href="https://bioinformaticsonline.com/related/36806?offset=30" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/29282/cosmic</guid>
	<pubDate>Sat, 01 Oct 2016 15:04:10 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/29282/cosmic</link>
	<title><![CDATA[COSMIC]]></title>
	<description><![CDATA[<p>The accurate description and annotation of structural variants can be complex. &nbsp;This is due to the different resolution that variants are reported from traditional&nbsp;cytogenetic coordinates down to the actual base pair positions. Furthermore, multiple&nbsp;rearrangements in a single area of the genome can make cataloguing and interpreting&nbsp;their effects challenging.&nbsp;</p>
<p>The Rearrangement Overview page describes the one or more breakpoints which make up a structural&nbsp;variant. A breakpoint is defined as a region or point where the sample sequence has altered&nbsp;from the reference sequence. Minimum interpretation is made of this data. One variant event&nbsp;can consist of one or multiple breakpoints. The Syntax (shown above the table) gives a detailed description of the variant and its location &nbsp;(e.g. chr11:g.36585230_76606619del, a deletion of&nbsp;roughly 40Mb on chromosome 11). Syntax is based on HGVS mutation nomenclature recommendations&nbsp;[http://www.hgvs.org/rec.html].&nbsp;</p>
<p>http://cancer.sanger.ac.uk/cosmic/help/rearrangement/overview</p><p>Address of the bookmark: <a href="http://cancer.sanger.ac.uk/cosmic/help/rearrangement/overview" rel="nofollow">http://cancer.sanger.ac.uk/cosmic/help/rearrangement/overview</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41020/cancer-dependency-map</guid>
	<pubDate>Thu, 13 Feb 2020 04:38:47 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41020/cancer-dependency-map</link>
	<title><![CDATA[Cancer Dependency Map]]></title>
	<description><![CDATA[<p><span>The consequences of alterations in the DNA of cancer cells and subsequent vulnerabilities are not fully understood. This project aims to assign a dependency to every cancer cell in a patient which could be exploited to develop new therapies. This knowledge is foundational for precision cancer medicine.</span></p><p>Address of the bookmark: <a href="https://depmap.sanger.ac.uk/" rel="nofollow">https://depmap.sanger.ac.uk/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/28036/prof-chandrasekhar-kanduri-laboratory</guid>
  <pubDate>Fri, 24 Jun 2016 16:59:43 -0500</pubDate>
  <link></link>
  <title><![CDATA[Prof. Chandrasekhar Kanduri Laboratory]]></title>
  <description><![CDATA[
<p>Our lab has been interested in understanding how long noncoding RNAs control tumor initiation and progression, in addition to use them as potential biomarkers in diagnosis and therapy. We have been using neuroblastoma, a childhood cancer, as a model system to understand the functional role of long noncoding RNAs in cancer development and progression. By using new RNA sequencing technology on neuroblastoma tumors from a large group of Swedish children including both high-risk and low-risk neuroblastomas (108), we have identified several long noncoding RNAs that could have potential role in diagnosis and therapy. We are currently exploring the functional role of these differentially expressed long noncoding RNA in nuroblastoma progression and development.</p>
]]></description>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/40881/liu-lab</guid>
  <pubDate>Tue, 04 Feb 2020 06:27:02 -0600</pubDate>
  <link></link>
  <title><![CDATA[Liu Lab]]></title>
  <description><![CDATA[
<p>Shirley is a computational biologist with expertise in cancer epigenetics. Her research focuses on algorithm development and integrative mining from big data generated on microarrays, massively parallel sequencing, and other high throughput techniques to model the specificity and function of transcription factors, chromatin regulators and lncRNAs in tumor development, progression, drug response and resistance.</p>

<p>https://liulab-dfci.github.io/software/</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/32154/decostar-detection-of-co-evolution</guid>
	<pubDate>Fri, 14 Apr 2017 06:27:25 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32154/decostar-detection-of-co-evolution</link>
	<title><![CDATA[DeCoSTAR - Detection of Co-evolution]]></title>
	<description><![CDATA[<p><span>DeCoSTAR is a software which aims at reconstructing ancestral gene or genome organizations, in the form of sets of neighborhood relations -adjacencies- between pairs of ancestral genes or gene domains.</span><br><span>Ancestral genes or domains are deduced from reconciled gene trees in a context of birth, speciation, duplication, loss, transfer, which are either given as input or computed with the&nbsp;</span><a href="http://mbb.univ-montp2.fr/MBB/download_sources/16__TERA">ecceTERA package</a><span>, to which DeCoSTAR is integrated. DeCoSTAR constructs parsimonious scenarios of gains and breakages of adjacencies, and contains in particular all the features of previous software DeCo, DeCoLT, ArtDeCo and DeClone. It provides statistical supports on ancestral adjacencies, or the possibility to handle badly assembled genomes.&nbsp;</span><br><span>DeCoSTAR is able to reconstruct the histories of domains inside genes, including gene fusion and fission events, as well as ancestral genome structures for dozens of whole genomes from all kingdoms of life in a few minutes.</span></p><p>Address of the bookmark: <a href="http://pbil.univ-lyon1.fr/software/DeCoSTAR/" rel="nofollow">http://pbil.univ-lyon1.fr/software/DeCoSTAR/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/35559/computational-resources-for-te-discovery-and-te-detection</guid>
	<pubDate>Mon, 12 Feb 2018 10:29:18 -0600</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/35559/computational-resources-for-te-discovery-and-te-detection</link>
	<title><![CDATA[Computational resources for TE discovery and TE detection]]></title>
	<description><![CDATA[<p><span>Transposable Elements (TEs) to genome structure and evolution as well as their impact on genome sequencing, assembly, annotation and alignment has generated increasing interest in developing new methods for their computational analysis. </span></p><p><span>Following are the list of r</span><span>esource and location for TE discovery and TE detection:</span></p><p>BLASTER suite&nbsp;http://urgi.versailles.inra.fr/development/blaster/&nbsp;</p><p>Censor&nbsp;http://www.girinst.org/censor/download.php&nbsp;</p><p>find_ltr&nbsp;http://darwin.informatics.indiana.edu/cgi-bin/evolution/ltr.pl&nbsp;</p><p>FINDMITE http://jaketu.biochem.vt.edu/dl_software.htm </p><p>HMMER http://hmmer.janelia.org/ </p><p>LTR_FINDER http://tlife.fudan.edu.cn/ltr_finder/ </p><p>LTR_STRUC http://www.genetics.uga.edu/retrolab/data/LTR_Struc.html </p><p>LTR_MINER http://genomebiology.com/2004/5/10/R79/suppl/s7 </p><p>LTR_par http://www.eecs.wsu.edu/~ananth/software.htm </p><p>MAK http://wesslercluster.plantbio.uga.edu/mak06.html </p><p>MaskerAid http://blast.wustl.edu/maskeraid/ </p><p>mer-engine http://mer-engine.cshl.edu/mer-home.php </p><p>mreps http://bioinfo.lifl.fr/mreps/ </p><p>PILER http://www.drive5.com/piler/ </p><p>PLOTREP http://repeats.abc.hu/cgi-bin/plotrep.pl </p><p>RepBase http://www.girinst.org/ </p><p>RepeatFinder http://cbcb.umd.edu/software/RepeatFinder/ </p><p>RepeatGluer http://nbcr.sdsc.edu/euler/intro_tmp.htm </p><p>RepeatMasker http://www.repeatmasker.org/ </p><p>RepeatRunner http://www.yandell-lab.org/repeat_runner/index.html </p><p>RepeatScout http://repeatscout.bioprojects.org/ </p><p>repeat-match http://mummer.sourceforge.net/ </p><p>REPuter http://www.genomes.de/ </p><p>RetroMap http://www.burchsite.com/bioi/RetroMapHome.html </p><p>SMaRTFinder http://bioinf.dimi.uniud.it/software/software/smartfinder </p><p>Tandem Repeats Finder http://tandem.bu.edu/trf/trf.html </p><p>Transposon Cluster Finder http://www.mssm.edu/labs/warbup01/paper/files.html </p><p>TE nest http://www.plantgdb.org/prj/TE_nest/TE_nest.html </p><p>TRANSPO http://alggen.lsi.upc.es/recerca/search/transpo/transpo.html </p><p>TSDfinder http://www.ncbi.nlm.nih.gov/CBBresearch/Landsman/TSDfinder/ </p><p>Tu Lab TE tools http://jaketu.biochem.vt.edu/dl_software.htm </p><p>WU-BLAST http://blast.wustl.edu</p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42299/platypus-%E2%80%93-r-package-for-object-detection-and-image-segmentation</guid>
	<pubDate>Mon, 09 Nov 2020 02:56:25 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42299/platypus-%E2%80%93-r-package-for-object-detection-and-image-segmentation</link>
	<title><![CDATA[Platypus – R package for object detection and image segmentation.]]></title>
	<description><![CDATA[<p><a href="https://github.com/maju116/platypus" target="_blank">platypus</a>&nbsp;is an R package for object detection and semantic segmentation. Currently using&nbsp;</p>
<div>platypus&nbsp;you can perform:</div>
<ul>
<li>multi-class semantic segmentation using&nbsp;U-Net&nbsp;architecture</li>
<li>multi-class object detection using&nbsp;YOLOv3&nbsp;architecture</li>
</ul>
<p>You can install the latest version of&nbsp;platypus&nbsp;with&nbsp;remotes&nbsp;package:</p>
<div>
<div>
<div>
<div>remotes::install_github("maju116/platypus")</div>
</div>
</div>
</div>
<p>Note that in order to install&nbsp;platypus&nbsp;you need to install&nbsp;keras&nbsp;and&nbsp;tensorflow&nbsp;packages and&nbsp;Tensorflow&nbsp;version&nbsp;&gt;= 2.0.0&nbsp;(&nbsp;Tensorflow 1.x&nbsp;will not be supported!)</p><p>Address of the bookmark: <a href="https://github.com/maju116/platypus" rel="nofollow">https://github.com/maju116/platypus</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40986/cismuton-caller-that-detects-snvsindels-by-comparing-target-foreground-and-control-background-samples</guid>
	<pubDate>Tue, 11 Feb 2020 05:55:00 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40986/cismuton-caller-that-detects-snvsindels-by-comparing-target-foreground-and-control-background-samples</link>
	<title><![CDATA[cisMuton: caller that detects SNVs/indels by comparing target (foreground) and control (background) samples]]></title>
	<description><![CDATA[<p>cisMuton is a caller that detects SNVs/indels by comparing target (foreground) and control (background) samples.</p>
<p>cisMuton calls mutations from target capture regions, which are defined by the overlapping regions of&nbsp;<code>${GROUP}.target.bed</code>&nbsp;and&nbsp;<code>${GROUP}.gene.bed</code>.</p>
<p>Please read the&nbsp;<a href="https://static.ciscall.org/cisCall5_doc/doc/quick_start.html">Quick Start Guide for cisCall</a>&nbsp;first for an outline of how to run cisMuton.</p><p>Address of the bookmark: <a href="https://static.ciscall.org/cisCall5_doc/index.html" rel="nofollow">https://static.ciscall.org/cisCall5_doc/index.html</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34420/rita-rapid-identification-of-high-confidence-taxonomic-assignments-for-metagenomic-data</guid>
	<pubDate>Mon, 27 Nov 2017 08:25:33 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34420/rita-rapid-identification-of-high-confidence-taxonomic-assignments-for-metagenomic-data</link>
	<title><![CDATA[RITA: Rapid identification of high-confidence taxonomic assignments for metagenomic data]]></title>
	<description><![CDATA[<p>RITA is a standalone software package and Web server for taxonomic assignment of metagenomic sequence reads. By combining homology predictions from BLAST or UBLAST with compositional classifications from a Naive Bayes classifier, RITA is able to achieve very high accuracy on short reads. Unlike other hybrid approaches which combine these predictions for all sequences to be classified, RITA uses a pipeline to first identify cases where both types of classifier are in agreement, which constitute the highest-confidence set. Sequences not classified in this manner are subjected to a series of downstream classification steps.</p>
<p>This work has been accepted for publication:</p>
<p>MacDonald NJ, Parks DH, and Beiko RG. Rapid identification of taxonomic assignments. Accepted to&nbsp;<em>Nucleic Acids Research</em>&nbsp;April 4, 2012.</p>
<p>If you have any questions or bug reports, please let us know at &lt;beiko@cs.dal.ca&gt;.</p><p>Address of the bookmark: <a href="http://kiwi.cs.dal.ca/Software/RITA" rel="nofollow">http://kiwi.cs.dal.ca/Software/RITA</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/view/982</guid>
	<pubDate>Wed, 17 Jul 2013 15:25:09 -0500</pubDate>
	<link>https://bioinformaticsonline.com/view/982</link>
	<title><![CDATA[Is reference genome necessary for gene expression study in transcriptome sequencing or for variant discovery in genome sequencing?]]></title>
	<description><![CDATA[<p><span>Like in case of plant genomes where nature of genome is too complex and huge in size to accomplish complete<em> de novo</em> assembly by current sequencing technology. What would be alternate solution? Can we live in reference free world?</span></p>]]></description>
	<dc:creator>Rahul Agarwal</dc:creator>
</item>

</channel>
</rss>