<?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/26179?offset=220</link>
	<atom:link href="https://bioinformaticsonline.com/related/26179?offset=220" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42917/fings-filters-for-next-generation-sequencing</guid>
	<pubDate>Sat, 27 Feb 2021 01:18:35 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42917/fings-filters-for-next-generation-sequencing</link>
	<title><![CDATA[FiNGS: Filters for Next Generation Sequencing]]></title>
	<description><![CDATA[<h2>Key features</h2>
<ul>
<li><strong>Filters SNVs from any variant caller to remove false positives</strong></li>
<li><strong>Calculates metrics based on BAM files and provides filtering not possible with other tools</strong></li>
<li><strong>Fully user-configurable filtering (including which filters to use and their thresholds)</strong></li>
<li><strong>Option to use filters identical to ICGC recommendations</strong></li>
</ul>
<p>FiNGS provides researchers with a tool to reproducibly filter somatic variants that is simple to both deploy and use, with filters and thresholds that are fully configurable by the user. It ingests and emits standard variant call format (VCF) files and will slot into existing sequencing pipelines. It allows users to develop and implement their own filtering strategies and simple sharing of these with others.</p>
<p>FiNGS reliably improves upon the precision of default variant caller outputs and performs better than other tools designed for the same task.</p><p>Address of the bookmark: <a href="https://github.com/cpwardell/FiNGS" rel="nofollow">https://github.com/cpwardell/FiNGS</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/44672/libraries-or-management-tools-for-high-throughput-sequencing-data</guid>
	<pubDate>Fri, 04 Oct 2024 02:45:06 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/44672/libraries-or-management-tools-for-high-throughput-sequencing-data</link>
	<title><![CDATA[Libraries or management tools for high throughput sequencing data]]></title>
	<description><![CDATA[<ul>
<li><a href="http://gatb.inria.fr/"><span>GATB</span></a>&nbsp;Library.&nbsp;The&nbsp;<span>Genome Analysis Toolbox with de-Bruijn graph.&nbsp;</span>A large part of tools developed by the GenScale team are based on this library.<br />These methods enable the analysis of data sets of any size on multi-core desktop computers, including very huge amount of reads data coming from any kind of organisms such as bacteria, plants, animals and even complex samples (<em>e.g.</em>&nbsp;metagenomes). Among them are (the full is available here:&nbsp;<a href="https://gatb.inria.fr/software/">https://gatb.inria.fr/software/</a>):</li>
<li><a href="https://github.com/morispi/LRez"><span>LRez</span></a>: C++ Library and toolkit for the barcode-based management and indexation of linked-read datasets.</li>
</ul><h2>Variant calling and/or genotyping</h2><ul>
<li><a href="https://gatb.inria.fr/software/discosnp/" title="DiscoSNP">DiscoSNP++ and&nbsp;discoSnpRAD</a>: Reference-free small variant discovery (SNPs and indels)</li>
<li><a href="https://gatb.inria.fr/software/mind-the-gap/" title="MindTheGap">MindTheGap</a>: Detection and assembly of large insertion variants</li>
<li><a href="https://gatb.inria.fr/software/takeabreak/" title="TakeABreak">TakeABreak</a>:&nbsp;reference-free inversion discovery tool</li>
<li><a href="https://github.com/llecompte/SVJedi">SVJedi</a>: Structural Variant genotyper with long read data</li>
<li><a href="https://github.com/SandraLouise/SVJedi-graph">SVJedi-graph</a>: Structural Variant genotyper with long read data using a variation graph</li>
</ul><h2>Sequence assembly</h2><ul>
<li><a href="https://github.com/cguyomar/MinYS">MinYS</a>: reference-guided genome assembly in metagenomics data</li>
<li><a href="https://github.com/anne-gcd/MTG-Link">MTG-link</a>: local assembly tool for linked-read data</li>
<li><a href="https://gatb.inria.fr/software/minia/" title="Minia">Minia</a>: De novo short read assembler</li>
<li><a href="https://gatb.inria.fr/de-novo-genome-assembly/">de-novo pipeline</a>:&nbsp;<em>de-novo</em>&nbsp;assembly pipeline (error correction / contigs / scaffolding) for genomes and meta-genomes</li>
<li><a href="https://gatb.inria.fr/software/mapsembler/" title="Mapsembler2">Mapsembler2</a>: Targeted assembly (not maintained)</li>
</ul><h2>Managing k-mers &amp; indexation</h2><ul>
<li><a href="https://github.com/lrobidou/findere">findere</a>:&nbsp;simple strategy for speeding up queries and for reducing false positive calls from any Approximate Membership Query data structure.
<ul>
<li><a href="https://github.com/lrobidou/fimpera">fimpera</a>&nbsp;extends findere adding the abundance information.</li>
</ul>
</li>
<li><a href="https://github.com/tlemane/kmtricks">kmtricks</a>:&nbsp;modular tool suite for counting kmers, and constructing Bloom filters or kmer matrices, for large collections of sequencing data.</li>
<li><a href="https://github.com/tlemane/kmindex">kmindex&nbsp;</a>is a tool for indexing and querying sequencing samples. It is built on top of kmtricks.</li>
<li><a href="https://github.com/pierrepeterlongo/back_to_sequences">back to sequences</a>: Find sequences (reads, unitigs, genes) related to a set of kmers in large datasets, in a matter of seconds.</li>
<li><a href="https://github.com/vicLeva/bqf">Backpack Quotient Filter</a>:&nbsp;k-mer indexing data structure with abundance</li>
<li><a href="http://github.com/GATB/rconnector">short read connector</a>:&nbsp;Detect similar reads from potentially large read set</li>
<li><a href="https://gatb.inria.fr/software/dsk/" title="DSK">DSK</a>:&nbsp;Count K-mer in sequences</li>
</ul><h2>Pangenome graph manipulation</h2><ul>
<li><a href="https://github.com/Tharos-ux/pancat">Pancat</a>: Pangenome Comparison and Analysis Toolkit</li>
<li><a href="https://pypi.org/project/gfagraphs/">GFAGraphs</a>: a Python library to handle pangenome graph files in GFA format.</li>
</ul><h2>Comparative metagenomics with k-mers</h2><ul>
<li><a href="https://github.com/GATB/simka">Simka and SimkaMin</a>:&nbsp;Comparative metagenomics for large-scale datasets</li>
<li><a href="https://team.inria.fr/genscale/high-throughput-sequence-analysis/compreads-metagenomic-data-analysis/">Comparead &amp; Commet</a>:&nbsp;comparison of metagenomic datasets</li>
</ul><h2>Species and bacterial strains identification</h2><ul>
<li><a href="https://github.com/gsiekaniec/ORI">ORI</a>: software using long nanopore reads to identify bacteria present in a sample at the strain level</li>
<li><a href="https://github.com/kevsilva/StrainFLAIR">StrainFLAIR</a>:&nbsp;STRAIN-level proFiLing using vArIation gRaph</li>
</ul><h2>General-purpose sequencing data manipulation</h2><ul>
<li><a href="https://team.inria.fr/genscale/ngs-software/gassst/">GASSST</a>:&nbsp;long read mapper</li>
<li><a href="https://gatb.inria.fr/software/leon/" title="Leon">Leon</a>: short read compressor (now included in GATB-core)</li>
<li><a href="https://gatb.inria.fr/software/bloocoo/" title="Bloocoo">Bloocoo</a>:&nbsp;short read corrector</li>
<li><a href="https://github.com/GATB/bcalm">BCALM</a>:&nbsp;Construct compacted de Bruijn graphs (unitigs)</li>
</ul><h2>&nbsp;Protein Structure</h2><ul>
<li><a href="https://team.inria.fr/genscale/protein-structure/a-purva-contact-map-overlap-solver/">A_Purva</a>:&nbsp;Contact Map Overlap solver</li>
<li><a href="https://team.inria.fr/genscale/protein-structure/md-jeep-distance-geomtry-solver/">MD-Jeep</a>:&nbsp;Distance Geometry solver</li>
<li><a href="https://team.inria.fr/genscale/csa-comparative-structural-alignment/">CSA</a>:&nbsp;Comparative Structural Alignment</li>
</ul><h2>Workflow</h2><ul>
<li><a href="https://team.inria.fr/genscale/workflows/slicee/">SLICEE</a>:&nbsp;parallel execution of bioinformatics workflows</li>
</ul><h3>Comparative Genomics</h3><ul>
<li><a href="https://team.inria.fr/genscale/comparative-genomics/cassis/">CASSIS</a>:&nbsp;detection of rearrangement breakpoints</li>
<li><a href="https://team.inria.fr/genscale/high-throughput-sequence-analysis/plast-intensive-sequence-comparison/">PLAST</a>:&nbsp;intensive bank-to-bank sequence comparison</li>
<li><a href="https://github.com/stephanierobin/DrjBreakpointFinder">DRJBreakpointFinder</a>: detection and precise localization of excision sites in proviral segments</li>
</ul>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37674/qualimap2-evaluating-next-generation-sequencing-alignment-data</guid>
	<pubDate>Tue, 11 Sep 2018 04:44:29 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37674/qualimap2-evaluating-next-generation-sequencing-alignment-data</link>
	<title><![CDATA[Qualimap2: Evaluating next generation sequencing alignment data]]></title>
	<description><![CDATA[<p><strong>Qualimap 2</strong><span>&nbsp;is a platform-independent application written in Java and R that provides both a Graphical User Inteface (GUI) and a command-line interface to facilitate the quality control of alignment sequencing data and its derivatives like feature counts.&nbsp;</span><br><br><span>Supported types of experiments include:</span></p>
<ul>
<li>Whole-genome sequencing</li>
<li>Whole-exome sequencing</li>
<li>RNA-seq (speical mode available)</li>
<li>ChIP-seq</li>
</ul><p>Address of the bookmark: <a href="http://qualimap.bioinfo.cipf.es/" rel="nofollow">http://qualimap.bioinfo.cipf.es/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/39213/flye-fast-and-accurate-de-novo-assembler-for-single-molecule-sequencing-reads</guid>
	<pubDate>Tue, 02 Apr 2019 21:54:55 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/39213/flye-fast-and-accurate-de-novo-assembler-for-single-molecule-sequencing-reads</link>
	<title><![CDATA[Flye: Fast and accurate de novo assembler for single molecule sequencing reads]]></title>
	<description><![CDATA[<p><span>Flye is a de novo assembler for single molecule sequencing reads, such as those produced by PacBio and Oxford Nanopore Technologies. It is designed for a wide range of datasets, from small bacterial projects to large mammalian-scale assemblies. The package represents a complete pipeline: it takes raw PB / ONT reads as input and outputs polished contigs. Flye also includes a special mode for metagenome assembly.</span></p><p>Address of the bookmark: <a href="https://github.com/fenderglass/Flye" rel="nofollow">https://github.com/fenderglass/Flye</a></p>]]></description>
	<dc:creator>BioJoker</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40754/understanding-your-reads-and-mapping</guid>
	<pubDate>Wed, 29 Jan 2020 06:29:55 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40754/understanding-your-reads-and-mapping</link>
	<title><![CDATA[Understanding your reads and mapping !]]></title>
	<description><![CDATA[<p>One of the best tutorial for beginners ...</p>
<p>https://bioinformatics-core-shared-training.github.io/cruk-summer-school-2017/Day1/Session4-seqIntro.html</p><p>Address of the bookmark: <a href="https://bioinformatics-core-shared-training.github.io/cruk-summer-school-2017/Day1/Session4-seqIntro.html" rel="nofollow">https://bioinformatics-core-shared-training.github.io/cruk-summer-school-2017/Day1/Session4-seqIntro.html</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42313/crbhits-from-conditional-reciprocal-best-hits-to-codon-alignments-and-kaks-in-r</guid>
	<pubDate>Wed, 11 Nov 2020 23:06:03 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42313/crbhits-from-conditional-reciprocal-best-hits-to-codon-alignments-and-kaks-in-r</link>
	<title><![CDATA[CRBHits: From Conditional Reciprocal Best Hits to Codon Alignments and Ka/Ks in R]]></title>
	<description><![CDATA[<p>CRBHits is a coding sequence (CDS) analysis pipeline in R (R Core Team, 2019). It reimplements the Conditional Reciprocal Best Hit (CRBH) algorithm crb-blast and covers all necessary steps from sequence similarity searches, codon alignments to Ka/Ks calculations and synteny. The new R package targets ecology, population and evolutionary biologists working in the field of comparative genomics.</p><p>Address of the bookmark: <a href="https://gitlab.gwdg.de/mpievolbio-it/crbhits" rel="nofollow">https://gitlab.gwdg.de/mpievolbio-it/crbhits</a></p>]]></description>
	<dc:creator>Shruti Paniwala</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38389/blast-options-setting-and-defaults</guid>
	<pubDate>Mon, 10 Dec 2018 08:29:37 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38389/blast-options-setting-and-defaults</link>
	<title><![CDATA[BLAST options, setting and defaults]]></title>
	<description><![CDATA[<p>BLAST stands for Basic Local Alignment Search Tool and was developed by Altschul et al. (1990) and significantly improved by&nbsp;<a href="http://www3.oup.co.uk/nar/Volume_25/Issue_17/freepdf/">Altschul et al. (1997).</a>&nbsp;It is a very fast search algorithm that is used to separately search protein or DNA databases. BLAST is best used for sequence similarity searching, rather than for motif searching. For searches using a query sequence of fewer than twenty residues,&nbsp;<a href="https://www.arabidopsis.org/servlets/tools/patmatch/">PatMatch</a>&nbsp;is the best choice. Another sequence alignment tool that may yield different results from BLAST, and may be useful for motif searching, is&nbsp;<a href="https://www.arabidopsis.org/cgi-bin/fasta/TAIRfasta.pl">FASTA</a>. To search nonplant datasets, try&nbsp;<a href="http://seqsim.ncgr.org/newBlast.html">NCGR BLAST</a>&nbsp;or&nbsp;<a href="http://www.ncbi.nlm.nih.gov/blast/blast.cgi?Jform=0">NCBI BLAST</a>.</p>
<p>A fairly complete on-line guide to BLAST searching can be found at the&nbsp;<a href="http://www.ncbi.nlm.nih.gov/BLAST/blast_help.html">NCBI BLAST Help Manual</a>. For a theoretical overview of BLAST, see the&nbsp;<a href="http://www.ncbi.nlm.nih.gov/BLAST/tutorial/Altschul-1.html">NCBI BLAST Course</a>. Additional information can be found in the&nbsp;<a href="https://www.arabidopsis.org/blast/aboutblast2.htm">BLAST 2.0 Release Notes</a></p>
<table border="1">
<tbody>
<tr><th>&nbsp;</th><th><a href="https://www.arabidopsis.org/Blast/BLAST_help.jsp#methods">BLASTN</a></th><th><a href="https://www.arabidopsis.org/Blast/BLAST_help.jsp#methods">BLASTP</a></th><th><a href="https://www.arabidopsis.org/Blast/BLAST_help.jsp#methods">BLASTX</a></th><th><a href="https://www.arabidopsis.org/Blast/BLAST_help.jsp#methods">TBLASTN</a></th><th><a href="https://www.arabidopsis.org/Blast/BLAST_help.jsp#methods">TBLASTX</a></th><th><a href="https://www.arabidopsis.org/Blast/BLAST_help.jsp#methods">PSIBLAST</a></th></tr>
<tr>
<td><a name="open" id="open"></a><a href="https://www.arabidopsis.org/Blast/BLAST_help.jsp#open"><strong>Gap opening penalty</strong></a>:<br>cost to open a gap [integer]</td>
<td align="center">default = 5</td>
<td align="center">default = 11<br>limited&nbsp;values&nbsp;are supported</td>
<td align="center">default = 11<br>limited&nbsp;values&nbsp;are supported</td>
<td align="center">default = 11<br>limited&nbsp;values&nbsp;are supported</td>
<td align="center">default = 11<br>limited&nbsp;values&nbsp;are supported</td>
<td align="center">default = 5</td>
</tr>
<tr>
<td><a name="extend" id="extend"></a><a href="https://www.arabidopsis.org/Blast/BLAST_help.jsp#extend"><strong>Gap extension penalty</strong></a>:<br>cost to extend a gap [integer]</td>
<td align="center">default = 2</td>
<td align="center">default = 1<br>a 0 in this field means to use the default</td>
<td align="center">default = 1<br>a 0 in this field means to use the default</td>
<td align="center">default = 1<br>a 0 in this field means to use the default</td>
<td align="center">default = 1<br>a 0 in this field means to use the default</td>
<td align="center">default = 2</td>
</tr>
<tr>
<td><a name="match" id="match"></a><a href="https://www.arabidopsis.org/Blast/BLAST_help.jsp#match"><strong>Nucleic match</strong></a>:<br>reward for a match in the BLAST portion of run [integer]</td>
<td align="center">default = 1</td>
<td align="center">n/a</td>
<td align="center">n/a</td>
<td align="center">n/a</td>
<td align="center">n/a</td>
<td align="center">default = 1</td>
</tr>
<tr>
<td><a name="mismatch" id="mismatch"></a><a href="https://www.arabidopsis.org/Blast/BLAST_help.jsp#mismatch"><strong>Nucleic mismatch</strong></a>:<br>penalty for a mismatch in the blast portion of run [integer]</td>
<td align="center">default = -3</td>
<td align="center">n/a</td>
<td align="center">n/a</td>
<td align="center">n/a</td>
<td align="center">n/a</td>
<td align="center">default = -3</td>
</tr>
<tr>
<td><strong><a name="expect" id="expect"></a><a href="https://www.arabidopsis.org/Blast/BLAST_help.jsp#expect">Expectation value</a></strong>:<br>(E) [real]</td>
<td align="center">default = 10.0</td>
<td align="center">default = 10.0</td>
<td align="center">default = 10.0</td>
<td align="center">default = 10.0</td>
<td align="center">default = 10.0</td>
<td align="center">default = 10.0</td>
</tr>
<tr>
<td><a name="word" id="word"></a><a href="https://www.arabidopsis.org/Blast/BLAST_help.jsp#word"><strong>Word size</strong></a>:<br>the size of the initial word that must be matched between the database and the query sequence</td>
<td align="center">default = 11</td>
<td align="center">default = 3</td>
<td align="center">default = 3</td>
<td align="center">default = 3</td>
<td align="center">default = 3</td>
<td align="center">default = 11</td>
</tr>
<tr>
<td><a name="descriptions" id="descriptions"></a><a href="https://www.arabidopsis.org/Blast/BLAST_help.jsp#descriptions"><strong>Max scores</strong></a>:<br>Number of one-line descriptions (V) [Integer]</td>
<td align="center">default = 25</td>
<td align="center">default = 25</td>
<td align="center">default = 25</td>
<td align="center">default = 25</td>
<td align="center">default = 25</td>
<td align="center">default = 25</td>
</tr>
<tr>
<td><strong><a name="alignments" id="alignments"></a><a href="https://www.arabidopsis.org/Blast/BLAST_help.jsp#alignments">Max alignments</a></strong>:<br>number of alignments to show (B) [integer]</td>
<td align="center">default = 15</td>
<td align="center">default = 15</td>
<td align="center">default = 15</td>
<td align="center">default = 15</td>
<td align="center">default = 15</td>
<td align="center">default = 15</td>
</tr>
<tr>
<td><strong>Query filter</strong>:<br>filter applied to the query sequence</td>
<td align="center">default = DUST</td>
<td align="center">default = SEG</td>
<td align="center">default = SEG</td>
<td align="center">default = SEG</td>
<td align="center">default = SEG</td>
<td align="center">default = DUST</td>
</tr>
<tr>
<td><strong><a name="gencodes" id="gencodes"></a><a href="https://www.arabidopsis.org/Blast/BLAST_help.jsp#gencodes">Query genetic code</a></strong>:<br>genetic code to be used in BLASTX translation of the query</td>
<td align="center">n/a</td>
<td align="center">n/a</td>
<td align="center">default = universal</td>
<td align="center">default = universal</td>
<td align="center">default = universal</td>
<td align="center">n/a</td>
</tr>
<tr>
<td><strong><a name="matrix" id="matrix"></a><a href="http://twod.med.harvard.edu/seqanal/matrices.html">Matrix</a></strong>:<br>substitution matrix to be used for amino acid comparisons</td>
<td align="center">no default</td>
<td align="center">default = blosum62</td>
<td align="center">default = blosum62</td>
<td align="center">default = blosum62</td>
<td align="center">default = blosum62</td>
<td align="center">no default</td>
</tr>
</tbody>
</table>
<p>Supported and Suggested&nbsp;Values&nbsp;for Gap Open and Extension in BLASTP, BLASTX, TBLASTN, and TBLASTX</p>
<table border="1">
<tbody>
<tr><th>Gaps Open</th><th>Gap Extension</th></tr>
<tr>
<td align="center">10</td>
<td align="center">1</td>
</tr>
<tr>
<td align="center">10</td>
<td align="center">2</td>
</tr>
<tr>
<td align="center">11</td>
<td align="center">1</td>
</tr>
<tr>
<td align="center">8</td>
<td align="center">2</td>
</tr>
<tr>
<td align="center">9</td>
<td align="center">2</td>
</tr>
</tbody>
</table><p>Address of the bookmark: <a href="https://www.arabidopsis.org/Blast/BLASToptions.jsp" rel="nofollow">https://www.arabidopsis.org/Blast/BLASToptions.jsp</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44904/termal-a-fast-and-interactive-terminal-based-viewer-for-multiple-sequence-alignments</guid>
	<pubDate>Mon, 22 Sep 2025 23:51:02 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44904/termal-a-fast-and-interactive-terminal-based-viewer-for-multiple-sequence-alignments</link>
	<title><![CDATA[Termal: a fast and interactive terminal-based viewer for multiple sequence alignments]]></title>
	<description><![CDATA[<p>termal, a fast, interactive, terminal-based viewer for multiple sequence alignments (MSAs), designed for use on remote systems such as high-performance computing (HPC) clusters.</p>
<p>https://academic.oup.com/bioinformaticsadvances/advance-article/doi/10.1093/bioadv/vbaf208/8257678?login=true</p><p>Address of the bookmark: <a href="https://github.com/sib-swiss/termal" rel="nofollow">https://github.com/sib-swiss/termal</a></p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/914/welch-lab</guid>
  <pubDate>Mon, 15 Jul 2013 18:21:13 -0500</pubDate>
  <link></link>
  <title><![CDATA[Welch Lab]]></title>
  <description><![CDATA[
<p>They are based in the Department of Genetics at the University of Cambridge. </p>

<p>The research covers diverse areas of evolutionary biology, and molecular evolution in particular. It combines theoretical and empirical approaches, and particularly evolutionary inference from genome sequence data.</p>

<p>Links @ http://www.gen.cam.ac.uk/research/welch/GroupPage/Home.html</p>
]]></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>