<?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/31881?offset=480</link>
	<atom:link href="https://bioinformaticsonline.com/related/31881?offset=480" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/12206/bioinformatics-algorithms-tutorials</guid>
	<pubDate>Tue, 24 Jun 2014 00:10:45 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/12206/bioinformatics-algorithms-tutorials</link>
	<title><![CDATA[Bioinformatics algorithms tutorials]]></title>
	<description><![CDATA[<p>Useful bioinformatics tutorial, such as</p>
<p>De Bruijn Graphs for NGS Assembly<br>Algorithms for PacBio Reads<br>Software and Hardware Concepts for Bioinformatics<br>Finding us in Homolog.us (Search Algorithms)<br>NGS Genome and RNAseq Assembly - a Hands on Primer<br>Introduction to PERL, Python, R and C/C++ for Bioinformatics</p><p>Address of the bookmark: <a href="http://www.homolog.us/Tutorials/" rel="nofollow">http://www.homolog.us/Tutorials/</a></p>]]></description>
	<dc:creator>John Parker</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/12567/workshop-on-molecular-modeling-and-dynamics-simulation-analyses</guid>
  <pubDate>Fri, 04 Jul 2014 13:38:13 -0500</pubDate>
  <link></link>
  <title><![CDATA[Workshop On Molecular Modeling and Dynamics Simulation Analyses]]></title>
  <description><![CDATA[
<p>Workshop On Molecular Modeling and Dynamics Simulation Analyses</p>

<p>August1-2, 2014</p>

<p>Organised By</p>

<p>Centre of Excellence in Bioinformatics<br />Bioinformatics Infrastructure Facility<br />Department of Biochemistry<br />University of Lucknow<br />Lucknow-226007</p>

<p>Course Contents</p>

<p>Molecular Modeling<br /> Homology Modeling<br />Molecular Docking<br />Post-structural Analyses</p>

<p>Molecular Dynamics (MD)<br />Simulation<br />Linux Introduction<br />Gromacs Installation</p>

<p>MD Simulation of Protein ligand complex<br />Analyses of MD<br />Trajectories<br />Visualization of Dynamic<br />complexes</p>

<p>Important Dates</p>

<p>Registration Begins June 25, 2014<br />Registration Closes July 25, 2014</p>

<p>Brochure : www.lkouniv.ac.in/conference/Brochure_August,%202014.pdf</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37239/kat-a-k-mer-analysis-toolkit-to-quality-control-ngs-datasets-and-genome-assemblies</guid>
	<pubDate>Fri, 06 Jul 2018 03:36:45 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37239/kat-a-k-mer-analysis-toolkit-to-quality-control-ngs-datasets-and-genome-assemblies</link>
	<title><![CDATA[KAT: a K-mer analysis toolkit to quality control NGS datasets and genome assemblies]]></title>
	<description><![CDATA[<p>KAT is a suite of tools that analyse jellyfish hashes or sequence files (fasta or fastq) using kmer counts. The following tools are currently available in KAT:</p>
<ul>
<li><span>hist</span>: Create an histogram of k-mer occurrences from a sequence file. Adds metadata in output for easy plotting.</li>
<li><span>gcp:</span>&nbsp;K-mer GC Processor. Creates a matrix of the number of K-mers found given a GC count and a K-mer count.</li>
<li><span>comp</span>: K-mer comparison tool. Creates a matrix of shared K-mers between two (or three) sequence files or hashes.</li>
<li><span>sect</span>: SEquence Coverage estimator Tool. Estimates the coverage of each sequence in a file using K-mers from another sequence file.</li>
<li><span>blob</span>: Given, reads and an assembly, calculates both the read and assembly K-mer coverage along with GC% for each sequence in the assembly.SEquence Coverage estimator Tool.</li>
<li><span>filter</span>: Filtering tools. Contains tools for filtering k-mer hashes and FastQ/A files:
<ul>
<li><span>kmer</span>: Produces a k-mer hash containing only k-mers within specified coverage and GC tolerances.</li>
<li><span>seq</span>: Filters a sequence file based on whether or not the sequences contain k-mers within a provided hash.</li>
</ul>
</li>
<li><span>plot</span>: Plotting tools. Contains several plotting tools to visualise K-mer and compare distributions. The following plot tools are available:
<ul>
<li><span>density</span>: Creates a density plot from a matrix created with the "comp" tool. Typically this is used to compare two K-mer hashes produced by different NGS reads.</li>
<li><span>profile</span>: Creates a K-mer coverage plot for a single sequence. Takes in fasta coverage output coverage from the "sect" tool</li>
<li><span>spectra-cn</span>: Creates a stacked histogram using a matrix created with the "comp" tool. Typically this is used to compare a jellyfish hash produced from a read set to a jellyfish hash produced from an assembly. The plot shows the amount of distinct K-mers absent, as well as the copy number variation present within the assembly.</li>
<li><span>spectra-hist</span>: Creates a K-mer spectra plot for a set of K-mer histograms produced either by jellyfish-histo or kat-histo.</li>
<li><span>spectra-mx</span>: Creates a K-mer spectra plot for a set of K-mer histograms that are derived from selected rows or columns in a matrix produced by the "comp".</li>
</ul>
</li>
</ul>
<p>In addition, KAT contains a python script for analysing the mathematical distributions present in the K-mer spectra in order to determine how much content is present in each peak.</p>
<p>This README only contains some brief details of how to install and use KAT. For more extensive documentation please visit:&nbsp;<a href="https://kat.readthedocs.org/en/latest/">https://kat.readthedocs.org/en/latest/</a></p>
<p><a href="https://academic.oup.com/bioinformatics/article/33/4/574/2664339">https://academic.oup.com/bioinformatics/article/33/4/574/2664339&nbsp;</a></p><p>Address of the bookmark: <a href="https://github.com/TGAC/KAT" rel="nofollow">https://github.com/TGAC/KAT</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/12944/orione-%E2%80%93-a-web-based-framework-for-ngs-analysis-in-microbiology</guid>
	<pubDate>Wed, 23 Jul 2014 06:43:03 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/12944/orione-%E2%80%93-a-web-based-framework-for-ngs-analysis-in-microbiology</link>
	<title><![CDATA[Orione – a web-based framework for NGS analysis in microbiology]]></title>
	<description><![CDATA[<p>End-to-end NGS microbiology data analysis requires a diversity of tools covering bacterial resequencing, de novo assembly, scaffolding, bacterial RNA-Seq, gene annotation and metagenomics. However, the construction of computational pipelines that use different software packages is difficult due to a lack of interoperability, reproducibility, and transparency. To overcome these limitations researchers at <a href="http://www.crs4.it/" target="_blank">CRS4</a>, Italy have developed Orione, a Galaxy-based framework consisting of publicly available research software and specifically designed pipelines to build complex, reproducible workflows for NGS microbiology data analysis. Enabling microbiology researchers to conduct their own custom analysis and data manipulation without software installation or programming, Orione provides new opportunities for data-intensive computational analyses in microbiology and metagenomics.</p>
<p>Reference</p>
<p>Cuccuru G1, Orsini M, Pinna A, Sbardellati A, Soranzo N, Travaglione A, Uva P, Zanetti G, Fotia G. (2014)<strong> Orione, a web-based framework for NGS analysis in microbiology.</strong> <em>Bioinformatics</em> [Epub ahead of print]. [<a href="http://bioinformatics.oxfordjournals.org/content/early/2014/03/10/bioinformatics.btu135.long" target="_blank">article</a>]</p><p>Address of the bookmark: <a href="http://orione.crs4.it/" rel="nofollow">http://orione.crs4.it/</a></p>]]></description>
	<dc:creator>Martin Jones</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/37411/my-commonly-used-commands-in-bioinformatics</guid>
	<pubDate>Thu, 26 Jul 2018 04:58:45 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/37411/my-commonly-used-commands-in-bioinformatics</link>
	<title><![CDATA[My commonly used commands in Bioinformatics]]></title>
	<description><![CDATA[<p>FYI, I've found it useful to use MUMmer to extract the specific changes that Racon makes, so I can evaluate them individually:</p><pre><code>minimap -t 24 assembly.fasta long_reads.fastq.gz | racon -t 24 long_reads.fastq.gz - assembly.fasta racon_assembly.fasta
nucmer -p nucmer assembly.fasta racon_assembly.fasta
show-snps -C -T -r nucmer.delta
</code></pre><p>This reports Racon's changes in a table. You can exclude indels with the&nbsp;<code>-I</code>&nbsp;option in&nbsp;<code>show-snps</code>.&nbsp;</p><p>This process (Racon -&gt; MUMmer -&gt; SNP table) solves the problem I originally raised in this issue. So as far as I'm concerned, you can close this issue (or keep it open if you still want to implement some kind of variant table).</p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/12883/breaking-chromosomes-to-study-cancer</guid>
	<pubDate>Fri, 18 Jul 2014 05:42:09 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/12883/breaking-chromosomes-to-study-cancer</link>
	<title><![CDATA[Breaking chromosomes to study cancer !!!]]></title>
	<description><![CDATA[<p>Chromosomes are present in every cell of our body and they contain the information the body needs to develop and function properly. This information is carried in genes that are arranged along the chromosomes. There are usually 46 chromosomes in every cell. These chromosomes come in pairs, one from our mother and one from our father. The chromosomes can be sorted into 23 pairs by looking at them down a microscope.</p><p>Most people who have a balanced translocation have the right amount of chromosome material but it has been rearranged in some way. This may happen if two chromosomes swap pieces (a reciprocal translocation). In other cases two whole chromosomes may become stuck together (a Robertsonian translocation). This page describes what happens when someone has a reciprocal translocation. <br /><br />Reciprocal chromosomal translocations occur following double-strand breaks (DSBs) in DNA when a section of one chromosome is exchanged with that of another, non-homologous chromosome. These exchanges may produce a dysfunctional fusion gene that disrupts cell growth and survival pathways, such as the translocations seen in leukemia and childhood sarcomas. <br /><br />Chromosomal translocations have been well studied in cancer cell lines which are associated with two types of cancer, acute myeloid leukemia and Ewing's sarcoma, but determining how they contribute to cancer development is complicated by additional mutations and altered gene expression profiles in these cultured cells. Now, Juan Carlos Ramirez, head of the Viral Vector Facility at the Fundacion Centro Nacional de Investigaciones Cardiovasculares (CNIC) and his colleagues Raul Torres at CNIC and Sandra Rodriguez-Peralez at the Spanish National Cancer Center (CNIO) in Madrid, Spain have used a new genome editing tool, CRISPR-Cas9, to induce chromosomal translocations for the first time in a human cell line and in primary cells. The study's authors conclude by stating that the use of this technology will allow for the clarification of how and why chromosomal translocation occurs, which without doubt will allow new anti-cancer therapeutic strategies to be tackled.</p><p>Using RNA-Guided Endonuclease (RGEN) technology or CRISPR/Cas9 genome engineering technology, CNIO and CNIC researchers have shown that it is possible to obtain such chromosomal translocations. The CRISPR-Cas9 system is extremely simple to introduce a cut at the desired locus, easier to design, and cheaper than many other systems. Using the CRISPR-Cas9 system, Ramirez and his colleagues reproduced the translocations observed in Ewing&rsquo;s Sarcoma (ES) and Acute Myeloid Leukemia (AML) patient cell lines in HEK293 cells and also generated the ES translocation in human mesenchymal stem cells and the AML translocation in umbilical cord blood cells.</p><p>By focusing on chromosomal translocation without the confounding characteristics of established cell lines, these new cells lines should help answer the fundamental question of what causes a cell to become cancerous. Ramirez and his team now look forward to modeling other chromosome translocations in a variety of cell types.</p><p>Reference:</p><p>http://en.wikipedia.org/wiki/Chromosomal_translocation</p><p>http://www.nature.com/ncomms/2014/140603/ncomms4964/abs/ncomms4964.html<br /><br /></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37785/haplomerger2-rebuilding-both-haploid-sub-assemblies-from-high-heterozygosity-diploid-genome-assembly</guid>
	<pubDate>Thu, 27 Sep 2018 07:08:47 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37785/haplomerger2-rebuilding-both-haploid-sub-assemblies-from-high-heterozygosity-diploid-genome-assembly</link>
	<title><![CDATA[HaploMerger2: rebuilding both haploid sub-assemblies from high-heterozygosity diploid genome assembly]]></title>
	<description><![CDATA[<p><span><span>HM2 can process any diploid assemblies, but it is especially suitable for diploid assemblies with high heterozygosity (&ge;3%), which can be difficult for other tools. This pipeline also implements flexible and sensitive assembly error detection, a hierarchical scaffolding procedure and a reliable gap-closing method for haploid sub-assemblies.</span></span></p>
<p><span>Source code, executables and the testing dataset are freely available at&nbsp;</span><a href="https://github.com/mapleforest/HaploMerger2/releases/" target="">https://github.com/mapleforest/HaploMerger2/releases/</a><span>.</span></p><p>Address of the bookmark: <a href="https://github.com/mapleforest/HaploMerger2/releases/" rel="nofollow">https://github.com/mapleforest/HaploMerger2/releases/</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/12940/ra-at-iiser-kolkata-computational-biologybioinformatics</guid>
  <pubDate>Wed, 23 Jul 2014 06:24:28 -0500</pubDate>
  <link></link>
  <title><![CDATA[RA at IISER Kolkata Computational Biology/Bioinformatics]]></title>
  <description><![CDATA[
<p>Applications are invited from suitable candidates for research associate (post-doc; Rs. 22000-32000)/research fellow (16000-18000)/project assistant (Rs. 10000-14000) positions in the Department of Biological Sciences, Indian Institute for Science Education and Research Kolkata in the extramural project. Condition to satisfactory performance, the positions is for a period of upto 2 years (or funding of the project).</p>

<p>Brief description: We are looking for suitable candidates in the area o computational biology/bioinformatics/genomics or related field for next-generation sequencing (NGS) data analysis for small-RNAs, RNA-Seq and targeted resequencing of plants and associated organisms. We are an interdisciplinary group where projects equally involve bioinformatics and systems biology (specially microarrays and next-generation sequencing (NGS) data analysis and its use), along with plant molecular biology, genetic engineering, field biology, and analytical plant chemistry for understanding response of plants to biotic stresses.</p>

<p>Essential qualification: MSc/BTech/MTech/PhD (or other suitable qualification) in disciplines preferable to bioinformatics, computational biology, computer application (or equivalent)/ ‘Advance Post-Graduate Diploma in Bioinformatics’. Proficiency in programming languages (such as Perl, C++) and/or statistics (proficient in R for example) is compulsory.</p>

<p>Desirable qualification: Experience in the field of genomics e.g. microarray analysis, NGS, genome annotation, database development and management, software development, systems and network biology (or related fields) will be preferred.</p>

<p>Application process: Applications should contain CV along with brief description (maximum 1 page) of research conducted (highlighting skills and experience) till now. Applications should be sent by e-mail to Shree Prakash Pandey, Department of Biological Sciences, Indian Institute of Science Education and Research Kolkata, Mohanpur Campus, WB, India within 14 days of this advertisement.</p>

<p>E-mail: sppiiserkol@gmail.com, sppandey@iiserkol.ac.in</p>

<p>Advertisement:</p>

<p>http://www.iiserkol.ac.in/announcements/adverts/671-advt_ra_shree_prakash_july_2014</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38008/quast-lg-versatile-genome-assembly-evaluation</guid>
	<pubDate>Thu, 25 Oct 2018 10:46:55 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38008/quast-lg-versatile-genome-assembly-evaluation</link>
	<title><![CDATA[QUAST-LG: Versatile genome assembly evaluation]]></title>
	<description><![CDATA[<p>QUAST-LG-a tool that compares large genomic de novo assemblies against reference sequences and computes relevant quality metrics. Since genomes generally cannot be reconstructed completely due to complex repeat patterns and low coverage regions, we introduce a concept of upper bound assembly for a given genome and set of reads, and compute theoretical limits on assembly correctness and completeness. Using QUAST-LG, we show how close the assemblies are to the theoretical optimum, and how far this optimum is from the finished reference.</p>
<h4>AVAILABILITY AND IMPLEMENTATION:</h4>
<p>http://cab.spbu.ru/software/quast-lg</p><p>Address of the bookmark: <a href="http://cab.spbu.ru/software/quast-lg/" rel="nofollow">http://cab.spbu.ru/software/quast-lg/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/13226/you-and-your-friend-have-similar-dna</guid>
	<pubDate>Sun, 27 Jul 2014 20:44:05 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/13226/you-and-your-friend-have-similar-dna</link>
	<title><![CDATA[You and your friend have similar DNA !!!]]></title>
	<description><![CDATA[<p>New research out of Massachusetts claims that people often choose friends that are similar to them in genetics and they are more accurate than you might suppose. A study published on PNAS&nbsp;http://www.pnas.org/content/111/Supplement_3/10796.full found that people are apt to pick friends who are genetically similar to themselves - so much so that friends tend to be as alike at the genetic level as a person's fourth cousin.</p><div style="text-align: center;"><img src="http://i.kinja-img.com/gawker-media/image/upload/s--CwLwHa43--/18fbmlokxcmqcjpg.jpg" alt="image" width="300" height="271" style="border: 0px; border: 0px;"></div><p>Scientists with a long-running Framingham Heart Study looked at 1,932 people (examination of about 1.5 million markers of genetic variations), comparing unrelated friends to unrelated strangers. They found that friends shared about 1% of their genes &mdash; a percentage much higher than those shared with strangers.This new findings made it clear that people have more DNA in common with those who are selected as friends than with strangers in the same population.&nbsp;</p><p>The genes that lined up the most were olfactory genes, which deal with smell. The ones that lined up the least were immune system genes. The researchers weren't sure why that happened :/. Olfactory genes might be a straightforward explanation: People who like the same smells tend to be drawn to similar environments, where they meet others with the same tendencies.</p><p>Reference:</p><p>http://www.pnas.org/content/111/Supplement_3/10796.full</p><p>Image : http://i.kinja-img.com</p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>