<?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/32849?offset=920</link>
	<atom:link href="https://bioinformaticsonline.com/related/32849?offset=920" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36935/assemblytics-delta-file-to-analyze-alignments-of-an-assembly-to-another-assembly-or-a-reference-genome</guid>
	<pubDate>Thu, 14 Jun 2018 07:31:00 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36935/assemblytics-delta-file-to-analyze-alignments-of-an-assembly-to-another-assembly-or-a-reference-genome</link>
	<title><![CDATA[assemblytics: delta file to analyze alignments of an assembly to another assembly or a reference genome]]></title>
	<description><![CDATA[Download and install MUMmer
Align your assembly to a reference genome using nucmer (from MUMmer package)
$ nucmer -maxmatch -l 100 -c 500 REFERENCE.fa ASSEMBLY.fa -prefix OUT
Consult the MUMmer manual if you encounter problems

Optional: Gzip the delta file to speed up upload (usually 2-4X faster)
$ gzip OUT.delta
Then use the OUT.delta.gz file for upload.
Upload the .delta or delta.gz file (view example) to Assemblytics
Important: Use only contigs rather than scaffolds from the assembly. This will prevent false positives when the number of Ns in the scaffolded sequence does not match perfectly to the distance in the reference.

The unique sequence length required represents an anchor for determining if a sequence is unique enough to safely call variants from, which is an alternative to the mapping quality filter for read alignment.

http://assemblytics.com/<p>Address of the bookmark: <a href="http://assemblytics.com/" rel="nofollow">http://assemblytics.com/</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/36960/links-scaffolder-bloomfilter-setting</guid>
	<pubDate>Fri, 15 Jun 2018 10:39:54 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/36960/links-scaffolder-bloomfilter-setting</link>
	<title><![CDATA[LINKS scaffolder bloomfilter setting !]]></title>
	<description><![CDATA[
<p>➜  bin git:(master) ✗ ls -l<br />total 68<br />drwxrwxr-x 3 urbe urbe  4096 Jun 15 12:15 lib<br />-rwxrwxrwx 1 urbe urbe 65141 Jun 15 17:13 LINKS<br />➜  bin git:(master) ✗ pwd<br />/home/urbe/Tools/LINKS_1.8.6/bin</p>

<p>➜  bloomfilter git:(master) ✗ swig -Wall -c++ -perl5 BloomFilter.i<br />➜  bloomfilter git:(master) ✗ g++ -c BloomFilter_wrap.cxx -I/home/urbe/anaconda3/lib/perl5/5.22.0/x86_64-linux-thread-multi/CORE/ -fPIC -Dbool=char -O3<br />BloomFilter_wrap.cxx:1892:30: fatal error: ../BloomFilter.hpp: No such file or directory<br />compilation terminated.<br />➜  bloomfilter git:(master) ✗ cd swig <br />➜  swig git:(master) ✗ g++ -c BloomFilter_wrap.cxx -I/home/urbe/anaconda3/lib/perl5/5.22.0/x86_64-linux-thread-multi/CORE/ -fPIC -Dbool=char -O3<br />In file included from BloomFilter_wrap.cxx:1877:0:<br />../BloomFilter.hpp: In member function ‘void BloomFilter::loadHeader(FILE*)’:<br />../BloomFilter.hpp:141:59: warning: ignoring return value of ‘size_t fread(void*, size_t, size_t, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]<br />         fread(&amp;header, sizeof(struct FileHeader), 1, file);<br />                                                           ^<br />➜  swig git:(master) ✗ g++ -Wall -shared BloomFilter_wrap.o -o BloomFilter.so -O3<br />➜  swig git:(master) ✗ cd ..<br />➜  bloomfilter git:(master) ✗ cd ..<br />➜  lib git:(master) ✗ cd ..<br />➜  bin git:(master) ✗ ./LINKS  <br />Usage: ./LINKS [v1.8.6]<br />-f  sequences to scaffold (Multi-FASTA format, required)<br />-s  file-of-filenames, full path to long sequence reads or MPET pairs [see below] (Multi-FASTA/fastq format, required)<br />-m  MPET reads (default -m 1 = yes, default = no, optional)<br />	! DO NOT SET IF NOT USING MPET. WHEN SET, LINKS WILL EXPECT A SPECIAL FORMAT UNDER -s<br />	! Paired MPET reads in their original outward orientation &lt;- -&gt; must be separated by ":"<br />	  &gt;template_name<br />	  ACGACACTATGCATAAGCAGACGAGCAGCGACGCAGCACG:ATATATAGCGCACGACGCAGCACAGCAGCAGACGAC<br />-d  distance between k-mer pairs (ie. target distances to re-scaffold on. default -d 4000, optional)<br />	Multiple distances are separated by comma. eg. -d 500,1000,2000,3000<br />-k  k-mer value (default -k 15, optional)<br />-t  step of sliding window when extracting k-mer pairs from long reads (default -t 2, optional)<br />	Multiple steps are separated by comma. eg. -t 10,5<br />-o  offset position for extracting k-mer pairs (default -o 0, optional)<br />-e  error (%) allowed on -d distance   e.g. -e 0.1  == distance +/- 10% (default -e 0.1, optional)<br />-l  minimum number of links (k-mer pairs) to compute scaffold (default -l 5, optional)<br />-a  maximum link ratio between two best contig pairs (default -a 0.3, optional)<br />	 *higher values lead to least accurate scaffolding*<br />-z  minimum contig length to consider for scaffolding (default -z 500, optional)<br />-b  base name for your output files (optional)<br />-r  Bloom filter input file for sequences supplied in -s (optional, if none provided will output to .bloom)<br />	 NOTE: BLOOM FILTER MUST BE DERIVED FROM THE SAME FILE SUPPLIED IN -f WITH SAME -k VALUE<br />	 IF YOU DO NOT SUPPLY A BLOOM FILTER, ONE WILL BE CREATED (.bloom)<br />-p  Bloom filter false positive rate (default -p 0.001, optional; increase to prevent memory allocation errors)<br />-x  Turn off Bloom filter functionality (-x 1 = yes, default = no, optional)<br />-v  Runs in verbose mode (-v 1 = yes, default = no, optional)</p>

<p>Error: Missing mandatory options -f and -s.</p>

<p>ERROR fixed</p>

<p>perl: symbol lookup error: /home/urbe/Tools/LINKS_new/bin/./lib/bloomfilter/swig/BloomFilter.so: undefined symbol: Perl_Gthr_key_ptr</p>
]]></description>
	<dc:creator>Jit</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/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/37416/gfinisher-a-new-strategy-to-refine-and-finish-bacterial-genome-assemblies</guid>
	<pubDate>Thu, 26 Jul 2018 09:31:55 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37416/gfinisher-a-new-strategy-to-refine-and-finish-bacterial-genome-assemblies</link>
	<title><![CDATA[GFinisher: a new strategy to refine and finish bacterial genome assemblies]]></title>
	<description><![CDATA[<p>GFinisher is an application tools for refinement and finalization of prokaryotic genomes assemblies using the bias of GC Skew to identify assembly errors and organizes the contigs/scaffolds with genomes references.</p>
<pre>java -Xms2G -Xmx4G -jar GenomeFinisher.jar  \
    -i target_contigs.fasta  \
    -ds alternative_assemblies.fasta -ref reference.fasta  \
    -o outputDirectory</pre><p>Address of the bookmark: <a href="http://gfinisher.sourceforge.net" rel="nofollow">http://gfinisher.sourceforge.net</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>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/13338/protein-function-annotation-and-machine-learning-upmc-paris-france</guid>
  <pubDate>Sat, 02 Aug 2014 01:22:52 -0500</pubDate>
  <link></link>
  <title><![CDATA[Protein function annotation and machine learning - UPMC - Paris, France]]></title>
  <description><![CDATA[
<p>Protein function annotation and machine learning - UPMC - Paris, France</p>

<p>Job Description: We are interested in finding an excellent postdoc with interests in protein functional annotation, machine learning and computer grids. The position is open for 3.5 years at the Université Pierre et Marie Curie, in the heart of paris.</p>

<p>Research topic: Protein function annotation, multiple probabilistic models, domain architecture, machine learning, combinatorial optimization, computer grid.</p>

<p>Title: A novel integrative platform for large scale protein annotation that exploits a multitude of diversified probabilistic models in several protein signature databases.</p>

<p>We propose a novel integrated approach for large scale protein annotation that will exploit an unprecedented amount of genomic data as well as sophisticated machine learning techniques and combinatorial optimization approaches taking advantages of High Performance Computing (HPC) environments. The idea is to uncover as much as possible the evolutionary processes of protein sequences that took place throughout the whole tree of life and that affected the evolution of a protein family. We have already demonstrated in a previous work that the problem of functional annotation is inherent to the ability of uncovering such paths. Now, we shall extend this approach to large scale genome annotation by considering 11 different protein databases, constituted by about 10^9 protein sequences, and by producing a large pool of diversified probabilistic models coding for about 10^7 evolutionary protein pathways. Such models will be used to search for specific domains in genomes to be annotated. Our previous methodology needs to be fundamentally improved to deal with this large amount of biological data. In this project, we shall work on the algorithms to reduce the space of models and the search complexity, and we shall implement some important algorithmic changes towards the realization of a powerful integrated annotation tool.</p>

<p>Where: This project is run on the Laboratoire de Biologie Computationnelle et Quantitative UMR7238 CNRS-UPMC – Analytical Genomics team, headed by A.Carbone. It is co-advised with Pierre-Henri Wuillemin, Laboratoire d’Informatique de Paris 6 – Equipe DECISION.</p>

<p>Start date: September 1st, 2014<br />Contact Person: Alessandra Carbone<br />Contact: alessandra.carbone@lip6.fr</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38023/mitos-improved-de-novo-metazoan-mitochondrial-genome-annotation</guid>
	<pubDate>Fri, 26 Oct 2018 08:25:39 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38023/mitos-improved-de-novo-metazoan-mitochondrial-genome-annotation</link>
	<title><![CDATA[MITOS: improved de novo metazoan mitochondrial genome annotation]]></title>
	<description><![CDATA[<p><span>Allows automatic annotation of metazoan mitochondrial genomes. MITOS is a pipeline designed to compute a consistent de novo annotation of the mitogenomic sequences. The software allows for a systematic error screening, the standardisation of gene name and gene boundary designation, anticodon labelling of tRNAs, and provides the means for the assessment of the validity of a gene assignment.</span></p><p>Address of the bookmark: <a href="http://mitos.bioinf.uni-leipzig.de/index.py" rel="nofollow">http://mitos.bioinf.uni-leipzig.de/index.py</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38176/asciigenome-genome-browser-based-on-command-line-interface-and-designed-for-running-from-console-terminals</guid>
	<pubDate>Fri, 09 Nov 2018 13:50:04 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38176/asciigenome-genome-browser-based-on-command-line-interface-and-designed-for-running-from-console-terminals</link>
	<title><![CDATA[ASCIIGenome: genome browser based on command line interface and designed for running from console terminals.]]></title>
	<description><![CDATA[<p><code>ASCIIGenome</code>&nbsp;is a genome browser based on command line interface and designed for running from console terminals.</p>
<p>Since&nbsp;<code>ASCIIGenome</code>&nbsp;does not require a graphical interface it is particularly useful for quickly visualizing genomic data on remote servers while offering flexibility similar to popular GUI viewers like&nbsp;<a href="https://www.broadinstitute.org/igv/">IGV</a>.</p>
<p><span>Documentation</span>&nbsp;is at&nbsp;<a href="http://asciigenome.readthedocs.io/en/latest/">readthedocs/asciigenome</a>.</p>
<p>&nbsp;</p><p>Address of the bookmark: <a href="https://github.com/dariober/ASCIIGenome" rel="nofollow">https://github.com/dariober/ASCIIGenome</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>

</channel>
</rss>