<?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/31351?offset=720</link>
	<atom:link href="https://bioinformaticsonline.com/related/31351?offset=720" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40549/mgse-mapping-based-genome-size-estimation</guid>
	<pubDate>Fri, 17 Jan 2020 02:11:43 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40549/mgse-mapping-based-genome-size-estimation</link>
	<title><![CDATA[MGSE: Mapping-based Genome Size Estimation]]></title>
	<description><![CDATA[<p>MGSE can harness the power of files generated in genome sequencing projects to predict the genome size. Required are the FASTA file containing a high continuity assembly and a BAM file with all available reads mapped to this assembly. The script construct_cov_file.py (https://doi.org/10.1186/s12864-018-5360-z) allows the generation of a COV file based on the (sorted) BAM file (also possible via MGSE directly). Next, this COV file can be used by MGSE to calculate the coverage in provided reference regions and to calculate the total number of mapped bases. Both values are subjected to the genome size estimation. Providing accurate reference regions is crucial for this genome size estimation.</p><p>Address of the bookmark: <a href="https://github.com/bpucker/MGSE" rel="nofollow">https://github.com/bpucker/MGSE</a></p>]]></description>
	<dc:creator>Shruti Paniwala</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/9341/gerstein-lab</guid>
  <pubDate>Wed, 19 Mar 2014 12:48:20 -0500</pubDate>
  <link></link>
  <title><![CDATA[Gerstein Lab]]></title>
  <description><![CDATA[
<p>The focus of the Gerstein Lab is interpreting personal genomes, particularly in relation to disorders, such as cancer. This endeavor has a number of related aspects described below. Moreover, the approaches we take have broad connections to a variety of data-intensive fields, within the emerging discipline of data science. </p>

<p>Personal Genome Variation: SVs<br />Human Genome Annotation: Processing Next-Gen Sequencing Data<br />Comparative Genomics: Pseudogenes as Molecular Fossils<br />Protein Structure and Function: Macromolecular Motions<br />Analysis of Diverse Networks<br />Genomics at the Forefront of Data Science</p>

<p>Lab page: http://www.gersteinlab.org/</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42415/sneakysnake-a-fast-and-accurate-universal-genome-pre-alignment-filter-for-cpus-gpus-and-fpgas</guid>
	<pubDate>Sun, 20 Dec 2020 01:39:54 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42415/sneakysnake-a-fast-and-accurate-universal-genome-pre-alignment-filter-for-cpus-gpus-and-fpgas</link>
	<title><![CDATA[SneakySnake: A Fast and Accurate Universal Genome Pre-Alignment Filter for CPUs, GPUs, and FPGAs]]></title>
	<description><![CDATA[<p><span>The first and the only pre-alignment filtering algorithm that works efficiently and fast on modern CPU, FPGA, and GPU architectures. SneakySnake greatly (by more than two orders of magnitude) expedites sequence alignment calculation for both short (Illumina) and long (ONT and PacBio) reads. Described by Alser et al. (preliminary version at&nbsp;</span><a href="https://arxiv.org/abs/1910.09020">https://arxiv.org/abs/1910.09020</a><span>).</span></p><p>Address of the bookmark: <a href="https://github.com/CMU-SAFARI/SneakySnake" rel="nofollow">https://github.com/CMU-SAFARI/SneakySnake</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/9519/bioinformatics-phd-at-university-of-calcutta</guid>
  <pubDate>Mon, 31 Mar 2014 08:41:04 -0500</pubDate>
  <link></link>
  <title><![CDATA[Bioinformatics PhD at University of Calcutta]]></title>
  <description><![CDATA[
<p>University of Calcutta<br />Department of Biophysics, Molecular Biology &amp; Bioinformatics</p>

<p>Applications are invited for admission to the Ph.D. programme in the Department of Biophysics, Molecular Biology &amp; Bioinformatics, University of Calcutta for the year 2014 from eligible candidates who would be placed under the departmental teachers or affiliated research supervisors for the pursuance of their Ph.D. programme.</p>

<p>Candidates are requested to download the Ph.D. admission test application form from the University website and apply in the prescribed proforma by paying Rs. 100/- through a challan available through different University Cash counters. The challan is to be duly forwarded through the Head, Department of Biophysics, Molecular Biology &amp; Bioinformatics, University of Calcutta.</p>

<p>The completed application form with a copy of the paid challan is to be submitted to the office of the Department by April 16, 2014.</p>

<p>Syllabus for the Test: The questions for the admission test and interview will be based on topics in the following areas:</p>

<p>Mathematical methods, Molecular and Cellular Biophysics, Molecular and Cell Biology, Biochemistry, Genetics, Plant Biology, Developmental biology, Neurobiology, Biotechnology and Bioinformatics.</p>

<p>However, the interview will be primarily based on the research emphasis of the candidate. Candidates must clearly indicate the program in which they want to apply.</p>

<p>Date of Admission test : April 22, 2014 (Tuesday)</p>

<p>Date of publication of selection list for the interview : April 22, 2014(Tuesday)</p>

<p>Date of Interview : April 23, 2014 (Wednesday)</p>

<p>Number of vacancies for the Ph.D. programme : 12</p>

<p>Reservation policy will be followed as per rules.</p>

<p>Candidates with valid NET/GATE/M.Phil. or equivalent qualifications are not required to appear at the admission test but would need to qualify in the interview.</p>

<p>Advertisement:</p>

<p>http://www.caluniv.ac.in/admission%20notice/PHD_BIO_PHYSICS.pdf</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43427/ogdraw-draw-organelle-genome-maps</guid>
	<pubDate>Tue, 05 Oct 2021 03:34:35 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43427/ogdraw-draw-organelle-genome-maps</link>
	<title><![CDATA[OGDRAW - Draw Organelle Genome Maps]]></title>
	<description><![CDATA[<p>OrganellarGenomeDRAW converts annotations in the&nbsp;<a href="https://www.ncbi.nlm.nih.gov/genbank/">GenBank</a>&nbsp;or&nbsp;<a href="https://www.ebi.ac.uk/ena">EMBL/ENA</a>&nbsp;format into graphical maps. The input has to be a&nbsp;<a href="https://www.ncbi.nlm.nih.gov/Sitemap/samplerecord.html">GenBank&nbsp;</a>or&nbsp;<a href="https://www.ebi.ac.uk/ena/submit/flat-file">EMBL/ENA flat file</a>&nbsp;wherase the output can vary among several types of files. The application is optimized to create detailed high-quality maps of organellar genomes (plastid and mitochondria). Nevertheless, you can upload most<span style="color: #0b0118;">&nbsp;database</span>&nbsp;entries.</p>
<p>&nbsp;</p>
<p>Please take a look at our&nbsp;<a href="https://chlorobox.mpimp-golm.mpg.de/OGDraw-FAQ.html">FAQ section</a>&nbsp;and do not hesitate to report bugs or suggestions for improvements by&nbsp;<a href="mailto:chlorobox@mpimp-golm.mpg.de?subject=OGDRAW">email</a>.</p><p>Address of the bookmark: <a href="https://chlorobox.mpimp-golm.mpg.de/OGDraw.html" rel="nofollow">https://chlorobox.mpimp-golm.mpg.de/OGDraw.html</a></p>]]></description>
	<dc:creator>Abhi</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/9666/phylogenomicsphylogenetic-website</guid>
	<pubDate>Mon, 07 Apr 2014 02:17:18 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/9666/phylogenomicsphylogenetic-website</link>
	<title><![CDATA[Phylogenomics/Phylogenetic website]]></title>
	<description><![CDATA[<div>
<p>Welcome to phylobabble.org, a discussion forum for phylogenetic theory and applications. The primary goal of this forum is to discuss best practice and new developments in phylogenetics. Although we do have a Troubleshooting category for getting feedback on analyses, this is not a help site for running phylogenetics programs.</p>
<p>A great place to chat about phylogenetics for researchers and the broader community of students and science-interested citizens. </p>
</div><p>Address of the bookmark: <a href="http://phylobabble.org/" rel="nofollow">http://phylobabble.org/</a></p>]]></description>
	<dc:creator>Aaryan Lokwani</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43714/hiv-genome-database</guid>
	<pubDate>Fri, 21 Jan 2022 05:40:15 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43714/hiv-genome-database</link>
	<title><![CDATA[HIV genome database !]]></title>
	<description><![CDATA[<p>HIV resources</p>
<p>https://www.hiv.lanl.gov/components/sequence/HIV/search/search.html</p><p>Address of the bookmark: <a href="https://www.hiv.lanl.gov/components/sequence/HIV/search/search.html" rel="nofollow">https://www.hiv.lanl.gov/components/sequence/HIV/search/search.html</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/14191/scalpel</guid>
	<pubDate>Wed, 20 Aug 2014 02:07:58 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/14191/scalpel</link>
	<title><![CDATA[Scalpel]]></title>
	<description><![CDATA[<p>A team from Cold Spring Harbor Laboratory has released an algorithm, called Scalpel, for finding insertions and deletions in next generation sequencing data sets. Scalpel, which is open source and <a href="http://scalpel.sourceforge.net/" title="available for download">available for download</a> on SourceForge,&nbsp;<span>outperformed the popular tools GATK HaplotypeCaller and SOAPindel in test runs on both simulated and real whole human exomes.</span></p><p>Like other indel callers, Scalpel works by performing <em>de novo</em>&nbsp;assembly of regions of interest, so that misalignment to the reference genome cannot obscure the presence of an insertion or deletion. Scalpel's innovation is to repeatedly check its assembly before comparing to the reference genome, to account for simple sequence repeats that are a regular source of error in indel calling. When Scalpel assembles an exon, it collects reads that map to that exon (including partial matches), splits them into k-mers, and creates a de Bruijn graph to span the exon; however, if it detects repeats in the map, it iteratively increases the size of the k-mers by one base until the repeats are eliminated. This ensures that the final assembly of the exon is highly accurate while minimizing compute time.</p><p>The Cold Spring Harbor team's validation of Scalpel, <a href="http://www.nature.com/nmeth/journal/vaop/ncurrent/full/nmeth.3069.html" title="published over the weekend in Nature Methods">published over the weekend in <em>Nature Methods</em></a>, compares Scalpel's performance on a live whole exome against HaplotypeCaller and SOAPindel. The donor is an individual with serious neurological disorders, which may be linked to a high incidence of indels. One thousand indels from this individual's exome, called by one or more of the informatics pipelines, were selected for focused resequencing. This resequencing revealed a 77% true positive rate for Scalpel calls, dramatically better than the rates for either of the competing tools; Scalpel performed especially well with indels longer than five base pairs, a traditional weak point for indel callers.</p><p>Finally, the authors demonstrate Scalpel's use on a large set of genetic data from nearly 600 families who donated samples to the Simons Simplex Collection, a project of the Simons Foundation Autism Research Initiative. Scalpel found a very high enrichment for indels in children affected by autism, compared with their unaffected siblings, a pattern that persisted even after excluding common variants.</p>]]></description>
	<dc:creator>Shruti Paniwala</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43909/human-complete-genome</guid>
	<pubDate>Wed, 06 Jul 2022 06:42:55 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43909/human-complete-genome</link>
	<title><![CDATA[Human Complete Genome]]></title>
	<description><![CDATA[<h1 dir="auto">Telomere-to-telomere consortium</h1>
<p dir="auto">We have sequenced the CHM13hTERT human cell line with a number of technologies. Human genomic DNA was extracted from the cultured cell line. As the DNA is native, modified bases will be preserved. The data includes 30x&nbsp;<a href="https://www.pacb.com/">PacBio</a>&nbsp;<a href="https://www.ncbi.nlm.nih.gov/sra/?term=SRX789768*+CHM13">HiFi</a>, 120x coverage of&nbsp;<a href="https://nanoporetech.com/">Oxford Nanopore</a>, 70x&nbsp;<a href="https://www.pacb.com/">PacBio</a>&nbsp;CLR, 50x&nbsp;<a href="https://www.10xgenomics.com/">10X Genomics</a>, as well as&nbsp;<a href="https://bionanogenomics.com/technology/dls-technology/">BioNano DLS</a>&nbsp;and&nbsp;<a href="https://arimagenomics.com/kit/">Arima Genomics HiC</a>. Most raw data is available from this site, with the exception of the PacBio data which was generated by the University of Washington/PacBio and is available from&nbsp;<a href="https://www.ncbi.nlm.nih.gov/sra?linkname=bioproject_sra_all&amp;from_uid=269593">NCBI SRA</a>.</p>
<p dir="auto">A UCSC browser is available for&nbsp;<a href="https://genome.ucsc.edu/h/GCA_009914755.4">v2.0</a>&nbsp;(as well as legacy&nbsp;<a href="http://genome.ucsc.edu/cgi-bin/hgTracks?genome=t2t-chm13-v1.0&amp;hubUrl=http://t2t.gi.ucsc.edu/chm13/hub/hub.txt">v1.0</a>&nbsp;and&nbsp;<a href="http://genome.ucsc.edu/cgi-bin/hgTracks?genome=t2t-chm13-v1.1&amp;hubUrl=http://t2t.gi.ucsc.edu/chm13/hub/hub.txt">v1.1</a>&nbsp;versions). An interactive dotplot visualization of all genomic repeats is also available from&nbsp;<a href="https://resgen.io/paper-data/T2T-Nurk-et-al-2021/views/t2t-identity-v2">resgen.io</a>. Known issues identified in the assembly are tracked at&nbsp;<a href="https://github.com/marbl/CHM13-issues">CHM13 issues</a>.</p>
<p dir="auto">&nbsp;</p>
<p dir="auto">MORE at&nbsp;https://github.com/marbl/CHM13</p><p>Address of the bookmark: <a href="https://www.science.org/doi/10.1126/science.abj6987" rel="nofollow">https://www.science.org/doi/10.1126/science.abj6987</a></p>]]></description>
	<dc:creator>Shruti Paniwala</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/10182/biocodesbioscripts</guid>
	<pubDate>Tue, 22 Apr 2014 20:53:33 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/10182/biocodesbioscripts</link>
	<title><![CDATA[BioCodes/BioScripts]]></title>
	<description><![CDATA[<p>Over the years most bioinformatics people amass a collection of small utility scripts which make their lives easier. Too often they are kept either in private repositories or as part of a public collection to which noone else can contribute. Biocode is a curated repository of general-use utility scripts.</p>
<p>Algorithms scripts @ https://github.com/jschendel/bioinformatics-algorithms-coursera</p><p>Address of the bookmark: <a href="https://github.com/jorvis/biocode" rel="nofollow">https://github.com/jorvis/biocode</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>