<?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/13415?offset=50</link>
	<atom:link href="https://bioinformaticsonline.com/related/13415?offset=50" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38762/katuali-is-a-flexible-consensus-pipeline-implemented-in-snakemake-to-basecall-assemble-and-polish-oxford-nanopore-technologies-sequencing-data</guid>
	<pubDate>Tue, 22 Jan 2019 06:26:55 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38762/katuali-is-a-flexible-consensus-pipeline-implemented-in-snakemake-to-basecall-assemble-and-polish-oxford-nanopore-technologies-sequencing-data</link>
	<title><![CDATA[Katuali is a flexible consensus pipeline implemented in Snakemake to basecall, assemble, and polish Oxford Nanopore Technologies&#039; sequencing data]]></title>
	<description><![CDATA[<ul>
<li>Run a pipeline processing fast5s to a consensus in a single command.</li>
<li>Recommended fixed "standard" and "fast" pipelines.</li>
<li>Interchange basecaller, assembler, and consensus components of the pipelines simply by changing the target filepath.</li>
<li>Seemless distribution of tasks over local or distributed compute.</li>
<li>Highly configurable.</li>
<li>Open source (Mozilla Public License 2.0).</li>
</ul>
<p>Documentation can be found at&nbsp;<a href="https://nanoporetech.github.io/katuali/">https://nanoporetech.github.io/katuali/</a>.</p><p>Address of the bookmark: <a href="https://github.com/nanoporetech/katuali" rel="nofollow">https://github.com/nanoporetech/katuali</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40251/mosdepth-fast-bamcram-depth-calculation-for-wgs-exome-or-targeted-sequencing</guid>
	<pubDate>Wed, 13 Nov 2019 22:20:19 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40251/mosdepth-fast-bamcram-depth-calculation-for-wgs-exome-or-targeted-sequencing</link>
	<title><![CDATA[mosdepth: fast BAM/CRAM depth calculation for WGS, exome, or targeted sequencing]]></title>
	<description><![CDATA[<p>mosdepth can output:</p>
<p>per-base depth about 2x as fast samtools depth--about 25 minutes of CPU time for a 30X genome.<br>mean per-window depth given a window size--as would be used for CNV calling.<br>the mean per-region given a BED file of regions.<br>a distribution of proportion of bases covered at or above a given threshold for each chromosome and genome-wide.<br>quantized output that merges adjacent bases as long as they fall in the same coverage bins e.g. (10-20)<br>threshold output to indicate how many bases in each region are covered at the given thresholds.<br>A summary of mean depths per chromosome and within specified regions per chromosome.</p><p>Address of the bookmark: <a href="https://github.com/brentp/mosdepth" rel="nofollow">https://github.com/brentp/mosdepth</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40701/fastgt-an-alignment-free-method-for-calling-common-snvs-directly-from-raw-sequencing-reads</guid>
	<pubDate>Tue, 28 Jan 2020 03:27:33 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40701/fastgt-an-alignment-free-method-for-calling-common-snvs-directly-from-raw-sequencing-reads</link>
	<title><![CDATA[FastGT: an alignment-free method for calling common SNVs directly from raw sequencing reads]]></title>
	<description><![CDATA[<p>FastGT is a program package for whole-genome genotyping of genome variants directly from raw sequencing reads. It is written in C and runs in Linux. FastGT uses a list of variant-specific k-mer pairs that are unique in human genome, counts the frequency of k-mers in sequencing data and predicts the genotype. All this takes less than 1 hour on average low-cost Linux server.</p>
<p><a href="http://bioinfo.ut.ee/FastGT/">http://bioinfo.ut.ee/FastGT/</a></p>
<p><strong><a href="https://github.com/bioinfo-ut/GenomeTester4/">https://github.com/bioinfo-ut/GenomeTester4/</a></strong></p><p>Address of the bookmark: <a href="http://bioinfo.ut.ee/FastGT/" rel="nofollow">http://bioinfo.ut.ee/FastGT/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41599/haslr-a-hybrid-assembler-which-uses-both-second-and-third-generation-sequencing-reads</guid>
	<pubDate>Mon, 04 May 2020 02:04:03 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41599/haslr-a-hybrid-assembler-which-uses-both-second-and-third-generation-sequencing-reads</link>
	<title><![CDATA[HASLR: a hybrid assembler which uses both second and third generation sequencing reads]]></title>
	<description><![CDATA[<p><span>HASLR, a hybrid assembler which uses both second and third generation sequencing reads to efficiently generate accurate genome assemblies. Our experiments show that HASLR is not only the fastest assembler but also the one with the lowest number of misassemblies on all the samples compared to other tested assemblers. Furthermore, the generated assemblies in terms of contiguity and accuracy are on par with the other tools on most of the samples. Availability. HASLR is an open source tool available at https://github.com/vpc-ccg/haslr.</span></p><p>Address of the bookmark: <a href="https://github.com/vpc-ccg/haslr" rel="nofollow">https://github.com/vpc-ccg/haslr</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42826/ktrim-an-extra-fast-and-accurate-adapter-and-quality-trimmer-for-sequencing-data</guid>
	<pubDate>Thu, 11 Feb 2021 21:39:05 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42826/ktrim-an-extra-fast-and-accurate-adapter-and-quality-trimmer-for-sequencing-data</link>
	<title><![CDATA[Ktrim: an extra-fast and accurate adapter- and quality-trimmer for sequencing data]]></title>
	<description><![CDATA[<p>Ktrim&nbsp;is written in&nbsp;<code style="font-size: 13.6px; padding: 0.2em 0.4em; margin: 0px; background-color: var(--color-markdown-code-bg);">C++</code>&nbsp;for GNU Linux/Unix platforms. After uncompressing the source package, you can find an executable file&nbsp;<code style="font-size: 13.6px; padding: 0.2em 0.4em; margin: 0px; background-color: var(--color-markdown-code-bg);">ktrim</code>&nbsp;under&nbsp;<code style="font-size: 13.6px; padding: 0.2em 0.4em; margin: 0px; background-color: var(--color-markdown-code-bg);">bin/</code>&nbsp;directory compiled using&nbsp;<code style="font-size: 13.6px; padding: 0.2em 0.4em; margin: 0px; background-color: var(--color-markdown-code-bg);">g++ v4.8.5</code>&nbsp;and linked with&nbsp;<code style="font-size: 13.6px; padding: 0.2em 0.4em; margin: 0px; background-color: var(--color-markdown-code-bg);">libz v1.2.7</code>&nbsp;for Linux x86_64 system. If you could not run it (which is usually caused by low version of&nbsp;<code style="font-size: 13.6px; padding: 0.2em 0.4em; margin: 0px; background-color: var(--color-markdown-code-bg);">libc++</code>&nbsp;or&nbsp;<code style="font-size: 13.6px; padding: 0.2em 0.4em; margin: 0px; background-color: var(--color-markdown-code-bg);">libz</code>&nbsp;library) or you want to build a version optimized for your system, you can re-compile the programs:</p>
<p>user@linux$ make clean &amp;&amp; make</p><p>Address of the bookmark: <a href="https://github.com/hellosunking/Ktrim" rel="nofollow">https://github.com/hellosunking/Ktrim</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/853/ragan-lab</guid>
  <pubDate>Sun, 14 Jul 2013 12:03:43 -0500</pubDate>
  <link></link>
  <title><![CDATA[Ragan Lab]]></title>
  <description><![CDATA[
<p>Computational systems biology</p>

<p>Research Area: <br />breast cancer; pancreatic cancer; prostate cancer; gastrointestinal disorders; urohaemolytic disorders; staphylococcal diseases</p>
]]></description>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/4004/33rd-annual-convention-of-indian-association-for-cancer-research-from-13th-to-15th-february-2014</guid>
  <pubDate>Tue, 27 Aug 2013 10:37:08 -0500</pubDate>
  <link></link>
  <title><![CDATA[33rd Annual Convention of Indian Association for Cancer Research from 13th to 15th February 2014]]></title>
  <description><![CDATA[
<p>RGCB is organizing the 33rd Annual Convention of Indian Association for Cancer Research from 13th to 15th February 2014 with the theme "Discovery, Innovation and Translation in Cancer Research"</p>

<p>Kindly log on to conference website http://rgcb.res.in/IACR2014 for further details and timely updates and registration. We shall truly appreciate if the same be circulated among your friends, scholars and students encouraging them to participate in the meet.</p>

<p>http://210.212.237.38/iacrconference/</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/2645/dna-bending-propensity-in-the-presence-of-base-mismatches-implications-for-dna-repair</guid>
	<pubDate>Mon, 19 Aug 2013 16:01:44 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/2645/dna-bending-propensity-in-the-presence-of-base-mismatches-implications-for-dna-repair</link>
	<title><![CDATA[DNA Bending Propensity in the Presence of Base Mismatches: Implications for DNA Repair]]></title>
	<description><![CDATA[<p>Understanding how the human body recognizes damaged DNA and initiates repair fascinates Michael Feig, professor of biochemistry and molecular biology at Michigan State University. Feig studies the proteins MutS and MSH2-MSH6, which recognize defective DNA and initiate DNA repair. Natural DNA repair occurs when proteins like MutS (the primary protein responsible for recognizing a variety of DNA mismatches) scan the DNA, identify a defect, and recruit other enzymes to carry out the actual repair.</p><p><em>Results from computer simulations show that it is energetically less expensive to bend mismatch-containing, defective DNA (G:T, C:C, C:T, G:A, G:G, T:T, A:A, A+:C) vs. non-defective DNA (containing A:T or G:C base pairs). DNA repair mechanisms likely take advantage of this feature to detect defective DNA based on an increased bending propensity.</em></p><p>http://www.tacc.utexas.edu/news/feature-stories/2013/how-dna-repair-helps-prevent-cancer</p><p>http://pubs.acs.org/doi/abs/10.1021/jp403127a</p>]]></description>
	<dc:creator>Jitendra Narayan</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/videolist/watch/4633/cancer-growth-animation</guid>
	<pubDate>Fri, 20 Sep 2013 06:16:51 -0500</pubDate>
	<link>https://bioinformaticsonline.com/videolist/watch/4633/cancer-growth-animation</link>
	<title><![CDATA[Cancer Growth Animation]]></title>
	<description><![CDATA[<iframe width="" height="" src="https://www.youtube-nocookie.com/embed/WXTsxPPcTEs" frameborder="0" allowfullscreen></iframe>This video demonstrates how cancer growth happens in human body.]]></description>
	
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/videolist/watch/4959/evolution-and-cancer</guid>
	<pubDate>Fri, 27 Sep 2013 11:28:49 -0500</pubDate>
	<link>https://bioinformaticsonline.com/videolist/watch/4959/evolution-and-cancer</link>
	<title><![CDATA[Evolution and Cancer]]></title>
	<description><![CDATA[<iframe width="" height="" src="https://www.youtube-nocookie.com/embed/j3uKOcNwYBw" frameborder="0" allowfullscreen></iframe>Air date:  Wednesday, January 04, 2012, 3:00:00 PM
Time displayed is Eastern Time, Washington DC Local  
 
Category:  Wednesday Afternoon Lectures  
Description:  There is a broad consensus that cancer is the result of somatic cells having serially gained, by a series of mutations, the ability to grow independently, to recruit resources from the circulation and the stroma, to invade local tissues, and to found anatomically distant metastases, ultimately killing the host. From the point of view of the cancer-causing somatic cell population, this is evolution driven by mutation and selection. Genomics has resulted in a parallel consensus that the central functions of all eukaryotes are highly conserved, not only at the level of individual protein functions, but also complex biological pathways and systems. These ideas motivated a comparison between results of molecular genetic studies of experimental evolution in yeast and the molecular genetic phenomena associated with tumorigenesis and tumor progression. We find some very striking similarities, including recurring genomic rearrangements, alterations of the regulation of specific growth-promoting genes, population-genetic features that affect the fitness trajectories of growth rate variants in evolving populations, and physiological and metabolic similarities derived from the conservation of the basic plan of growth and cell multiplication among all eukaryotes. It is hoped that some of the insights from yeast will aid the interpretation of sequence changes found in tumors, especially in the urgent necessity to distinguish 'driver' from 'passenger' mutations." 

David Botstein's fundamental contributions to modern genetics include the development of genetic methods for understanding biological functions and the discovery of the functions of many yeast and bacterial genes. In 1980, Botstein and three colleagues proposed a method for mapping human genes that laid the groundwork for the Human Genome Project. The basic principle of the mapping scheme was to develop, by recombinant DNA techniques, random single-copy DNA probes capable of detecting DNA sequence polymorphisms when hybridized to restriction digests, or specific fragments, of an individual's DNA. The method was used in subsequent years to identify several human disease genes, such as Huntington's and BRCA1. Variations of this method enabled the sequencing phase of the Human Genome Project. 

In the 1990s Botstein, having moved to Stanford University School of Medicine, collaborated with Patrick O. Brown of Stanford in exploiting DNA microarrays to study genome-wide gene expression patterns in yeast and in human cancers. This required developing a new statistical method and graphical interface, widely used today to interpret genomic data. Botstein also has helped to create, with Michael Ashburner and Gerald Rubin, a bioinformatics initiative to unify the representation of gene and gene product attributes across all species, called Gene Ontology. He graduated from Harvard College and earned his doctorate from the University of Michigan. He worked at Massachusetts Institute of Technology from 1967 to 1988; served as vice president for science at Genentech from 1988 to 1990; chaired the Department of Genetics at the Stanford University School of Medicine from 1990 to 2003; and joined the Princeton University faculty in 2003. He has sat on numerous editorial boards and was the founding editor of Molecular Biology of the Cell. Among recent major awards, Bostein won the Peter Gruber Foundation Prize in Genetics in 2003, the Apple Science Innovator Award in 2008, and the Albany Medical Center Prize in 2010. 

The NIH Wednesday Afternoon Lecture Series includes weekly scientific talks by some of the top researchers in the biomedical sciences worldwide. 

For more information, visit: The NIH Director's Wednesday Afternoon Lecture Series  
Author:  Dr. David Botstein, Princeton University  
Runtime:  00:59:58  

Permanent link:  http://videocast.nih.gov/launch.asp?17046]]></description>
	
</item>

</channel>
</rss>