<?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/31382?offset=1370</link>
	<atom:link href="https://bioinformaticsonline.com/related/31382?offset=1370" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43374/reference-sequence-resource</guid>
	<pubDate>Wed, 15 Sep 2021 21:15:22 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43374/reference-sequence-resource</link>
	<title><![CDATA[Reference Sequence Resource!]]></title>
	<description><![CDATA[<p><span>The ENCODE project uses Reference Genomes from&nbsp;</span><a href="http://www.ncbi.nlm.nih.gov/genome/browse/reference/">NCBI</a><span>&nbsp;or&nbsp;</span><a href="http://hgdownload.cse.ucsc.edu/downloads.html">UCSC</a><span>&nbsp;to provide a consistent framework for mapping high-throughput sequencing data.&nbsp;In general, ENCODE data are mapped consistently to 2 human (GRCH38, hg19) and 2 mouse (mm9/mm10) genomes for historical comparability.&nbsp;</span><em>Drosophia melanogaster</em><span>&nbsp;experiments are mapped to either dm3 or dm6 and&nbsp;</span><em>Caenorhabdilis elegans&nbsp;</em><span>experiments are mapped to ce10 or ce11.&nbsp;T</span></p><p>Address of the bookmark: <a href="https://www.encodeproject.org/data-standards/reference-sequences/" rel="nofollow">https://www.encodeproject.org/data-standards/reference-sequences/</a></p>]]></description>
	<dc:creator>LEGE</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/43658/uniquekmer-generate-unique-kmers-for-every-contig-in-a-fasta-file</guid>
	<pubDate>Fri, 17 Dec 2021 00:08:15 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43658/uniquekmer-generate-unique-kmers-for-every-contig-in-a-fasta-file</link>
	<title><![CDATA[UniqueKmer: Generate unique KMERs for every contig in a FASTA file]]></title>
	<description><![CDATA[<p dir="auto">Generate unique k-mers for every contig in a FASTA file.</p>
<p dir="auto">Unique k-mer is consisted of k-mer keys (i.e. ATCGATCCTTAAGG) that are only presented in one contig, but not presented in any other contigs (for both forward and reverse strands).</p>
<p dir="auto">This tool accepts the input of a FASTA file consisting of many contigs, and extract unique k-mers for each contig.</p>
<p dir="auto">The output unique k-mer file and Genome file can be used for fastv:&nbsp;<a href="https://github.com/OpenGene/fastv">https://github.com/OpenGene/fastv</a>, which is an ultra-fast tool to identify and visualize microbial sequences from sequencing data.</p>
<p>https://github.com/OpenGene/UniqueKMER</p><p>Address of the bookmark: <a href="https://github.com/OpenGene/UniqueKMER" rel="nofollow">https://github.com/OpenGene/UniqueKMER</a></p>]]></description>
	<dc:creator>Abhi</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/43799/kast</guid>
	<pubDate>Wed, 23 Feb 2022 08:28:36 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43799/kast</link>
	<title><![CDATA[KAST]]></title>
	<description><![CDATA[<p><span>Perform Alignment-free k-tuple frequency comparisons from sequences. This can be in the form of two input files (e.g. a reference and a query) or a single file for pairwise comparisons to be made.</span></p><p>Address of the bookmark: <a href="https://github.com/martinjvickers/KAST" rel="nofollow">https://github.com/martinjvickers/KAST</a></p>]]></description>
	<dc:creator>Neel</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/44537/the-atcc-genome-portal</guid>
	<pubDate>Wed, 15 May 2024 14:24:16 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44537/the-atcc-genome-portal</link>
	<title><![CDATA[The ATCC Genome Portal]]></title>
	<description><![CDATA[<p><span>The ATCC Genome Portal (AGP,&nbsp;</span><a href="https://genomes.atcc.org/">https://genomes.atcc.org/</a><span>) is a database of authenticated genomes for bacteria, fungi, protists, and viruses held in ATCC&rsquo;s biorepository. It now includes 3,938 assemblies (253% increase) produced under ISO 9000 by ATCC. Here, we present new features and content added to the AGP for the research community.</span></p><p>Address of the bookmark: <a href="https://genomes.atcc.org/" rel="nofollow">https://genomes.atcc.org/</a></p>]]></description>
	<dc:creator>Abhi</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/blog/view/44503/entire-human-genome-sequencing</guid>
	<pubDate>Tue, 02 Apr 2024 01:19:29 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/44503/entire-human-genome-sequencing</link>
	<title><![CDATA[Entire Human Genome Sequencing !]]></title>
	<description><![CDATA[<p>Cost-effective whole human genome sequencing has revolutionized the landscape of genetic research and personalized medicine by making comprehensive genetic analysis accessible to a wider population. Through advancements in sequencing technologies, such as next-generation sequencing (NGS), costs have significantly decreased, enabling researchers and healthcare providers to analyze an individual's complete genetic makeup with greater efficiency and affordability. This has profound implications for disease diagnosis, prognosis, and treatment, as it allows for the identification of genetic predispositions and the customization of healthcare interventions based on an individual's unique genetic profile. Moreover, as the cost continues to decline, the potential for population-scale genomic studies and large-scale screening programs becomes increasingly feasible, promising to further enhance our understanding of human genetics and improve healthcare outcomes on a global scale.</p><p>Here are few companies:</p><p>https://mynucleus.com/</p><p>https://myome.com/</p><p>https://nebula.org/whole-genome-sequencing-dna-test/</p>]]></description>
	<dc:creator>LEGE</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>