<?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/27459?offset=850</link>
	<atom:link href="https://bioinformaticsonline.com/related/27459?offset=850" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<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/news/view/42296/igblast-117-is-now-available-with-improved-identification-of-productive-v-gene-sequences</guid>
	<pubDate>Sun, 01 Nov 2020 16:52:58 -0600</pubDate>
	<link>https://bioinformaticsonline.com/news/view/42296/igblast-117-is-now-available-with-improved-identification-of-productive-v-gene-sequences</link>
	<title><![CDATA[IgBLAST 1.17 is now available with improved identification of productive V gene sequences]]></title>
	<description><![CDATA[<p>A new release of&nbsp;<a href="https://go.usa.gov/x7WMc" target="_blank">IgBLAST</a>&nbsp;(1.17), the popular package for classifying and analyzing immunoglobulin and T cell receptor sequences, is now available on the&nbsp;<a href="https://go.usa.gov/x7WMc" target="_blank">web</a>&nbsp;and from the&nbsp;<a href="https://ftp.ncbi.nih.gov/blast/executables/igblast/release/LATEST" target="_blank">FTP site</a>. The updated package is better at identifying productive V gene sequences. We added a new field , &ldquo;V frame shift&rdquo;, to the IgBLAST output to indicate whether the V gene translation frame contains a frame-shift. We have also updated the definition of a productive V(D)J sequence to now exclude those with internal frame shifts.</p><p>See the&nbsp;<a href="https://ncbi.github.io/igblast/" target="_blank">new IgBLAST manual</a>&nbsp;on the NCBI GitHub site for more information on setting up and running IgBLAST.</p><p>If you have any questions or concerns, please email us at&nbsp;<a href="mailto:blast-help@ncbi.nlm.nih.gov" target="_blank">blast-help@ncbi.nlm.nih.gov</a></p><p>&nbsp;</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/44479/doubletrouble-identify-duplicated-genes-from-whole-genome-protein-sequences-and-classify</guid>
	<pubDate>Tue, 05 Mar 2024 00:23:49 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44479/doubletrouble-identify-duplicated-genes-from-whole-genome-protein-sequences-and-classify</link>
	<title><![CDATA[doubletrouble: identify duplicated genes from whole-genome protein sequences and classify]]></title>
	<description><![CDATA[<p><span>doubletrouble aims to identify duplicated genes from whole-genome protein sequences and classify them based on their modes of duplication. The duplication modes are i. segmental duplication (SD); ii. tandem duplication (TD); iii. proximal duplication (PD); iv. transposed duplication (TRD) and; v. dispersed duplication (DD). Transposon-derived duplicates (TRD) can be further subdivided into rTRD (retrotransposon-derived duplication) and dTRD (DNA transposon-derived duplication). If users want a simpler classification scheme, duplicates can also be classified into SD- and SSD-derived (small-scale duplication) gene pairs. Besides classifying gene pairs, users can also classify genes, so that each gene is assigned a unique mode of duplication. Users can also calculate substitution rates per substitution site (i.e., Ka and Ks) from duplicate pairs, find peaks in Ks distributions with Gaussian Mixture Models (GMMs), and classify gene pairs into age groups based on Ks peaks.</span></p><p>Address of the bookmark: <a href="https://bioconductor.org/packages/release/bioc/html/doubletrouble.html" rel="nofollow">https://bioconductor.org/packages/release/bioc/html/doubletrouble.html</a></p>]]></description>
	<dc:creator>LEGE</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/bookmarks/view/39017/macse-multiple-alignment-of-coding-sequences-accounting-for-frameshifts-and-stop-codons</guid>
	<pubDate>Mon, 18 Feb 2019 04:21:50 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/39017/macse-multiple-alignment-of-coding-sequences-accounting-for-frameshifts-and-stop-codons</link>
	<title><![CDATA[MACSE: Multiple Alignment of Coding SEquences Accounting for Frameshifts and Stop Codons]]></title>
	<description><![CDATA[<p>MACSE aligns coding NT sequences with respect to their AA translation while allowing NT sequences to contain multiple frameshifts and/or stop codons. MACSE is hence the first automatic solution to align protein-coding gene datasets containing non-functional sequences (pseudogenes) without disrupting the underlying codon structure. It has also proved useful in detecting undocumented frameshifts in public database sequences and in aligning next-generation sequencing reads/contigs against a reference coding sequence.</p>
<p>For further details about the underlying algorithm see the original publication:<br><a href="http://www.plosone.org/article/info:doi/10.1371/journal.pone.0022594" target="_new">MACSE: Multiple Alignment of Coding SEquences accounting for frameshifts and stop codons.<br>Vincent Ranwez, S&eacute;bastien Harispe, Fr&eacute;d&eacute;ric Delsuc, Emmanuel JP Douzery<br>PLoS One 2011, 6(9): e22594</a>.</p><p>Address of the bookmark: <a href="https://bioweb.supagro.inra.fr/macse/index.php?menu=releases" rel="nofollow">https://bioweb.supagro.inra.fr/macse/index.php?menu=releases</a></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/34579/moss-a-system-for-detecting-software-similarity</guid>
	<pubDate>Sat, 09 Dec 2017 08:59:07 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34579/moss-a-system-for-detecting-software-similarity</link>
	<title><![CDATA[MOSS: A System for Detecting Software Similarity]]></title>
	<description><![CDATA[<p><span>Moss (for a Measure Of Software Similarity) is an automatic system for determining the similarity of programs. To date, the main application of Moss has been in detecting plagiarism in programming classes. Since its development in 1994, Moss has been very effective in this role. The algorithm behind moss is a significant improvement over other cheating detection algorithms (at least, over those known to us).</span></p>
<p><span><span>Moss can currently analyze code written in the following languages:</span></span></p>
<p>C, C++, Java, C#, Python, Visual Basic, Javascript, FORTRAN, ML, Haskell, Lisp, Scheme, Pascal, Modula2, Ada, Perl, TCL, Matlab, VHDL, Verilog, Spice, MIPS assembly, a8086 assembly, a8086 assembly, MIPS assembly, HCL2.</p><p>Address of the bookmark: <a href="https://theory.stanford.edu/~aiken/moss/" rel="nofollow">https://theory.stanford.edu/~aiken/moss/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/13842/swabs-to-genomes-a-comprehensive-workflow</guid>
	<pubDate>Sun, 10 Aug 2014 03:01:21 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/13842/swabs-to-genomes-a-comprehensive-workflow</link>
	<title><![CDATA[Swabs to Genomes: A Comprehensive Workflow]]></title>
	<description><![CDATA[<p>The sequencing, assembly, and basic analysis of microbial genomes, once a painstaking and expensive undertaking, has become almost trivial for research labs with access to standard molecular biology and computational tools. However, there are a wide variety of options available for DNA library preparation and sequencing, and inexperience with bioinformatics can pose a significant barrier to entry for many who may be interested in microbial genomics. The objective of the present study was to design, test, troubleshoot, and publish a simple, comprehensive workflow from the collection of an environmental sample (a swab) to a published microbial genome; empowering even a lab or classroom with limited resources and bioinformatics experience to perform it.</p><p>Address of the bookmark: <a href="https://peerj.com/preprints/453.pdf" rel="nofollow">https://peerj.com/preprints/453.pdf</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37813/evidentialgene-tr2aacds-mrna-transcript-assembly-software</guid>
	<pubDate>Mon, 01 Oct 2018 13:13:24 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37813/evidentialgene-tr2aacds-mrna-transcript-assembly-software</link>
	<title><![CDATA[EvidentialGene: tr2aacds, mRNA Transcript Assembly Software]]></title>
	<description><![CDATA[<p><span>Quality assessment of this mRNA Transcript Assembly Software is described in&nbsp;</span><a href="http://arthropods.eugenes.org/EvidentialGene/about/EvidentialGene_quality.html">EvidentialGene_quality</a><span>.</span></p>
<p>Too many transcript assemblies is much better than too few. It allows one then to apply biological criteria to pick out the best ones. Don't be misled by the "right number" of transcripts that one or other transcript assembler may produce. It is the "right sequence" you want, and now the only way to get it is to produce way too many assemblies on a good RNA data set, with several methods and several parameter settings.</p><p>Address of the bookmark: <a href="https://sourceforge.net/p/evidentialgene/blog/" rel="nofollow">https://sourceforge.net/p/evidentialgene/blog/</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>

</channel>
</rss>