<?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/30459?offset=560</link>
	<atom:link href="https://bioinformaticsonline.com/related/30459?offset=560" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/36398/tools-for-protein-protein-docking</guid>
	<pubDate>Wed, 25 Apr 2018 05:15:53 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/36398/tools-for-protein-protein-docking</link>
	<title><![CDATA[Tools for Protein-Protein Docking !]]></title>
	<description><![CDATA[<p>Predicting the structure of protein&ndash;protein complexes using docking approaches is a difficult problem whose major challenges include identifying correct solutions, and properly dealing with molecular flexibility and conformational changes. Following are the tools to predict&nbsp;<span>the structure of protein&ndash;protein complexes:</span></p><p><a href="http://www.sbg.bio.ic.ac.uk/docking/index.html" target="_blank">3D-Dock Suite</a></p><p>Global rigid search: FFTShape complementarity and electrostatics</p><p>Re-scoring and clustering. Refinement of interface side-chains</p><p><a href="http://www.sbg.bio.ic.ac.uk/~3dgarden/" target="_blank">3D-Garden</a></p><p>Global rigid search in ensamble</p><p>Shape complementarity and Lennard&ndash;Jones potential</p><p>Side chain and backbone dihedral refinement</p><p><a href="http://www.sdsc.edu/CCMS/DOT/" target="_blank">DOT</a></p><p>Global rigid search: FFTShape complementarity, electrostatics and VDWNone</p><p><a href="http://users.unimi.it/~ddl/escherng/index.htm" target="_blank">Escher NG</a></p><p>Global rigid searchShape complementarity, hydrogen bonds and electrostatic</p><p>Integrated in&nbsp;<a href="http://users.unimi.it/~ddl/vega/download.htm" target="_blank">VEGA</a></p><p><a href="http://vakser.bioinformatics.ku.edu/resources/gramm/gramm1" target="_blank">GRAMM</a>&nbsp;</p><p>Global rigid search: FFT. smooth protein surface representation for soft docking</p><p>Shape complementarity and Lennard-Jones potential</p><p>Clustering of conformations</p><p><a href="http://vakser.bioinformatics.ku.edu/resources/gramm/grammx/" target="_blank">GRAMM-X</a>&nbsp;</p><p>Global rigid search: FFT. smooth protein surface representation for soft docking</p><p>Shape complementarity and Lennard-Jones potentialminimization and re-scoring with multiple filters</p><p><a href="http://www.loria.fr/~ritchied/hex_server/" target="_blank">HEX</a></p><p>Global rigid search: Fourier correlation of spherical harmonics</p><p>Shape complementarity</p><p><a href="http://www.csd.abdn.ac.uk/hex/" target="_blank"></a><a href="http://haddock.chem.uu.nl/Haddock/haddock.php" target="_blank">HADDOCK</a></p><p>Global rigid searchElectrostatic ,VDW and desolvation energy termsMD simulated annealing refinement . Filtering based on external data.&nbsp;</p><p><a href="http://www.molsoft.com/docking.html">ICM</a></p><p>Global rigid search: Monte CarloEmpirical scoring function</p><p>Clustering and selection of conformations. Refinement of interface side-chains and re-scoring</p><p><a href="http://www.weizmann.ac.il/Chemical_Research_Support/molfit/" target="_blank">MolFit&nbsp;</a></p><p>Global rigid search: FFTShape complementarity</p><p>Clustering of good solutions, filtering using&nbsp;<em>a priori&nbsp;</em>information and small, local rigid rotations around selected conformations</p><p><a href="http://bioinfo3d.cs.tau.ac.il/PatchDock/" target="_blank">PatchDock</a></p><p>Global rigid searchShape complementarity and atomic desolvation energy</p><p>Clustering of conformations</p><p><a href="http://inb.bsc.es/gn6/PyDock" target="_blank">PyDock</a></p><p>Global rigid search:FFTShape complementarity</p><p>rescoring by binding electrostatics and desolvation energy</p><p><a href="http://bioinfo3d.cs.tau.ac.il/PatchDock/" target="_blank"></a><a href="http://rosettadock.graylab.jhu.edu/" target="_blank">RosettaDock</a></p><p>Local rigid search: Monte Carlo with low and high resolution structure representation levels</p><p>Different scoring parameters for the different resolutions&nbsp;</p><p><a href="http://zlab.bu.edu/zdock/" target="_blank">ZDOCK</a></p><p>Global rigid search: FFTShape complementarity, desolvation energy, and electrostatics.</p><p>Energy minimization and re-scoringFree for academics</p><p>&nbsp;</p><p>Point to note:</p><p>The proper treatment of flexibility in protein&ndash;protein docking is still an active field of research. You first should analyzed your proteins in order to define their conformational space and then choose the most suitable method for your docking problem.</p>]]></description>
	<dc:creator>Poonam Mahapatra</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/6835/roslin-bioinformatics-group</guid>
  <pubDate>Mon, 25 Nov 2013 23:55:25 -0600</pubDate>
  <link></link>
  <title><![CDATA[Roslin Bioinformatics Group]]></title>
  <description><![CDATA[
<p>Roslin Bioinformatics Group</p>

<p>The Law group provides internal Institute-specific development, training and support roles for data manipulation, sequence analysis and any other aspect of the analysis of biological data using computer systems. Additionally we provide databases and applications supporting the international animal science community, particularly tools and resources for genome mapping.</p>

<p>Head: Andy Law. Members: John Bowman (animal facility database applications), Zen Lu (bioinformatics support), Trevor Paterson (software development)</p>

<p>More @ http://www.bioinformatics.ed.ac.uk/groups/roslin-bioinformatics-group</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/26252/recombination-detection-tool</guid>
	<pubDate>Tue, 02 Feb 2016 10:11:14 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/26252/recombination-detection-tool</link>
	<title><![CDATA[Recombination detection tool]]></title>
	<description><![CDATA[<p>A program to detect recombination hotspots using population genetic data.</p>
<p>More at https://github.com/auton1/LDhot</p><p>Address of the bookmark: <a href="https://github.com/auton1/LDhot" rel="nofollow">https://github.com/auton1/LDhot</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/7569/phd-at-university-of-calgary</guid>
  <pubDate>Fri, 27 Dec 2013 20:24:39 -0600</pubDate>
  <link></link>
  <title><![CDATA[PhD at University of Calgary]]></title>
  <description><![CDATA[
<p>Institution/Company: <br />University of Calgary<br />Location: <br />Calgary, AB<br />Job Description: </p>

<p>Novel diagnostic platform for detection of Osteoarthritis</p>

<p>I invite applications from highly motivated individuals to join my laboratory as a PhD student in Systems Biology at the University of Calgary McCaig Institute for Bone and Joint Health. This project is aimed at characterizing the networks of physical (protein-protein) interactions underlying inflammatory processes in patients with Osteoarthritis and how this differs from patients with Rheumatoid Arthritis and normal individuals. This work will eventually lead to the development of a novel diagnostic platform for the non-invasive and accurate detection of early Osteoarthritis. The selected candidate will use state-of-the-art computational methodologies to systematically analyze proteomic data, and develop /implement new algorithms to identify protein and functional interaction networks from high throughput experimental data. The individual will also benefit by working closely with experts at the UofC and UofA through an AIHS Alberta Osteoarthritis Team Grant which includes experts from all pillars of health research. The candidate will also be supported to attend bioinformatics workshops and conferences to advance and disseminate their research.<br />Qualifications: The ideal candidate will have a Master’s degree in Computational Biology, Bioinformatics, or equivalent with strong background knowledge of the Biological Sciences, Biochemistry, and Microbiology. The individual should additionally have experience in handling high-throughput data sets as well as programming skills. The candidate will be registered as a PhD student in Dr. Krawetz’s laboratory, located in the new state-of-the-art Health Research Innovation Centre at the UofC. The individual will have strong verbal and written skills and the ability to work efficiently in a team environment.</p>

<p>In addition to the outstanding research opportunities available in this setting, students also enjoy the many cultural and sporting amenities provided in the city of Calgary, and can take advantage of the unparalleled skiing and hiking in the Rocky Mountains that are less than an hour away.</p>

<p>Candidates must be academically competitive and will be expected to apply for external funding. The stipend is $25,000/yr. For outstanding PhD students, internal top-up award opportunities are available on a competitive basis. If interested in joining the lab, please contact Dr. Krawetz directly at rkrawetz@ucalgary.ca and provide the following information:</p>

<p>- Short cover letter explaining your interest in the lab<br />- Resume<br />- Scanned copy of transcript or listing of course grades<br />- Names and contact information for two individuals who will be willing to provide letters of reference</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/35033/bbsplit-read-binning-tool-for-metagenomes-and-contaminated-libraries</guid>
	<pubDate>Wed, 03 Jan 2018 00:25:27 -0600</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/35033/bbsplit-read-binning-tool-for-metagenomes-and-contaminated-libraries</link>
	<title><![CDATA[BBSplit: Read Binning Tool for Metagenomes and Contaminated Libraries]]></title>
	<description><![CDATA[<p>BBSplit internally uses BBMap to map reads to multiple genomes at once, and determine which genome they match best. This is different than with ordinary mapping. If a genome (say, human) contains an exact repeat somewhere, reads mapping to it will be mapped ambiguously. But if you want to determine whether reads are mouse or human, it does not matter whether they map ambiguously within human, only whether they are ambiguous between human and mouse. BBSplit tracks this additional ambiguity information and decides how to use it based on the &ldquo;ambig2&rdquo; flag. The normal use of BBSplit is like Seal, either quantifying how many reads go to each reference, or splitting the reads into multiple output files, one per reference. BBSplit can only be run using references indexed with BBSplit, as they contain additional information regarding which sequences came from which reference file.</p><p><span>BBSplit is a tool that bins reads by mapping to multiple references simultaneously, using&nbsp;</span><a href="http://seqanswers.com/forums/showthread.php?t=41057" target="_blank">BBMap</a><span>. The reads go to the bin of the reference they map to best. There are also disambiguation options, such that reads that map to multiple references can be binned with all of them, none of them, one of them, or put in a special "ambiguous" file for each of them. Paired reads will always be kept together.</span><br /><br /><span>For example, if you had a library of something that was contaminated with e.coli and salmonella, you could do this:</span><br /><br /><strong>bbsplit.sh in=reads.fq ref=ecoli.fa,salmonella.fa basename=out_%.fq outu=clean.fq int=t</strong><br /><br /><span>This will produce 3 output files:</span><br /><strong>out_ecoli.fq</strong><span>&nbsp;(ecoli reads)</span><br /><strong>out_salmonella.fq</strong><span>&nbsp;(salmonella reads)</span><br /><strong>clean.fq</strong><span>&nbsp;(unmapped reads)</span><br /><br /><span>In this case, "int=t" means that the input file is paired and interleaved. For single-end reads you would leave that out. For paired reads in 2 files, you would do this:</span><br /><strong>bbsplit.sh in1=reads1.fq in2=reads2.fq ref=ecoli.fa,salmonella.fa basename=out_%.fq outu1=clean1.fq outu2=clean2.fq</strong></p><p><strong><span>BBSplit is available here:</span><br /><a href="https://sourceforge.net/projects/bbmap/" target="_blank">https://sourceforge.net/projects/bbmap/</a></strong></p><p><span>The sensitivity can be raised to be equivalent to BBMap with these flags: "minratio=0.56 minhits=1 maxindel=16000"</span></p>]]></description>
	<dc:creator>Poonam Mahapatra</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/7215/postdoc-positions-in-computational-biology-center-for-genomic-science-milan-italy</guid>
  <pubDate>Thu, 12 Dec 2013 18:34:47 -0600</pubDate>
  <link></link>
  <title><![CDATA[Postdoc positions in computational biology - Center for Genomic Science - Milan, Italy]]></title>
  <description><![CDATA[
<p>Job Description: three postdoc positions in computational biology are available at the Center for Genomic Science in Milan (Italy):</p>

<p>- Development of computational methods to investigate the interplay between epigenetic and genetic layers and their role in tumor progression, by integrating genomic, epigenomic and transcriptional data. PI: Mattia Pelizzola (http://tiny.cc/comEpi)<br />- Epigenome and transcriptome analysis in mouse models of Hepatocellular Carcinoma. PI: Bruno Amati - Small and long non-coding RNAs in cancer stem cells. PI: Francesco Nicassio</p>

<p>All projects will benefit from the availability of both in-house and publicly available next-generation sequencing datasets. Familiarity with Linux environment, programming skills (especially in R) and a background in either computational biology, or physics/engineering/math will be advantageous.</p>

<p>Deadline for the application January 6th, to apply: http://genomics.iit.it/resources.html</p>

<p>Start date: March 1st, 2014</p>

<p>Duration: 1+2 years</p>

<p>Contact Person (Referent): Mattia Pelizzola</p>

<p>Ref. E-Mail: mattia.pelizzola@iit.it</p>

<p>Tel: 0039-02-94375058<br />Group Web Page: http://genomics.iit.it</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38581/cvit-chromosome-viewing-tool</guid>
	<pubDate>Wed, 02 Jan 2019 04:10:09 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38581/cvit-chromosome-viewing-tool</link>
	<title><![CDATA[CViT: Chromosome Viewing Tool]]></title>
	<description><![CDATA[<p><span>CViT - Chromosome Viewing Tool. A collection of Perl scripts that enable quick visualizations of features on linkage groups, psuedochromosomes or cytogenetic maps. Intended for whole-genome views of data but can be used to create images of single chromosomes/linkage groups, contigs, or BACs, or even proteins -- any feature that has a location on a backbone. Handles most standard genetic/genomic coordinate systems. Reads GFF3 data and produces a PNG or SVG image.</span></p>
<p><span>https://www.hindawi.com/journals/ijpg/2011/373875/</span></p><p>Address of the bookmark: <a href="https://sourceforge.net/projects/cvit/" rel="nofollow">https://sourceforge.net/projects/cvit/</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/7383/embo-practical-course-on-bioinformatics-and-genomes-analyses-at-hellenic-pasteur-institute-athens-greece</guid>
  <pubDate>Sat, 21 Dec 2013 10:00:24 -0600</pubDate>
  <link></link>
  <title><![CDATA[EMBO practical Course on  "Bioinformatics and Genomes Analyses" at Hellenic Pasteur Institute, Athens, Greece]]></title>
  <description><![CDATA[
<p>The main objectives of this Practical Course are to strengthen skills <br />of PhD students and young researchers in the domain of Bioinformatics <br />and Genome Data Analyses on the use of advanced fundamental algorithms <br />and their applications in genome studies.</p>

<p>The course topics will include theoretical and practical aspects in:<br />- Genomes comparisons,<br />- Evolutionary analyses (orthologs, paralogs and ancestral genomes <br />inference),<br />- RNAseq and Next Generation Sequencing (including algorithms, methods <br />and sequence mapping tools, data analyses and applications).</p>

<p>The course programme will be centred on theoretical presentations <br />followed by practical sessions. Practical sessions in a Linux <br />environment will involve Unix shell and Perl scripting. Participants <br />are assumed to be familiar with this environment.</p>

<p>A series of lectures delivered by prominent scientists on recent hot <br />topics in genome (Viruses, Prokaryotes, Eukaryotes) studies will be <br />included in the programme and future research perspectives will be <br />highlighted.</p>

<p>The topics that will be included in the course programme are similar <br />to those included in previously organized courses:http://www.pasteur.fr/~tekaia/BGA_courses.html</p>

<p>The course is aimed at motivated Ph.D students and Post-Doctoral <br />Researchers in Academic Institutions, with background in Mathematics, <br />Statistics, Biology or Computer Science and who are involved in <br />Bioinformatics and Genomes studies.</p>

<p>Selection of participants will be based on their background, running <br />research projects and on expressed motivations.<br />Selected students will have free accommodation and meals and are <br />expected to contribute with 200 euros and to pay for their travel <br />expenses.<br />All participants (students and invited speakers) will stay in the same <br />hotel.</p>

<p>Detailed indications are available on the course web site: http://events.embo.org/14-comparative-genomics/index.html</p>

<p>Candidates are advised to complete carefully the application form, <br />together with an abstract of at least one of their running projects, a <br />"one-page CV" and a personal Identity Picture (Photo).</p>

<p>The application deadline is March 14, 2014.</p>

<p>The organizers:<br />Menelaos Manoussakis, Hellenic Pasteur Institute, Athens, Greece.<br />Evdokia Karagouni, Hellenic Pasteur Institute, Athens - Greece.<br />Evie Melanitou,  Institut Pasteur Paris - France.<br />Fredj Tekaia ( Institut Pasteur Paris France)<br />URL: http://www.pasteur.fr/~tekaia/BGA_courses.html</p>

<p>Date: 5 – 17 May, 2014. <br />More at http://events.embo.org/14-comparative-genomics/index.html<br />will take place in the ,</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44487/r-package-for-pca-analysis</guid>
	<pubDate>Sun, 24 Mar 2024 20:06:24 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44487/r-package-for-pca-analysis</link>
	<title><![CDATA[R Package for PCA Analysis]]></title>
	<description><![CDATA[<p><span>An R package for performing principal component analysis (PCA) of genomics data. The package performs PCA, generates the publication-ready plots, and identifies population-specific outlier individuals. The package can be accessed on GitHub:&nbsp;https://github.com/Devashish13/PopulationStructure</span></p><p>Address of the bookmark: <a href="https://rpubs.com/Devashish13/PCAGenomics" rel="nofollow">https://rpubs.com/Devashish13/PCAGenomics</a></p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/7568/oldest-hominin-dna-sequenced</guid>
	<pubDate>Fri, 27 Dec 2013 19:58:31 -0600</pubDate>
	<link>https://bioinformaticsonline.com/news/view/7568/oldest-hominin-dna-sequenced</link>
	<title><![CDATA[Oldest Hominin DNA Sequenced]]></title>
	<description><![CDATA[<p>Matthias Meyer and his team from the Max Planck Institute for Evolutionary Anthropology in Leipzig, Germany, have developed new techniques for retrieving and sequencing highly degraded ancient DNA. They then joined forces with Juan-Luis Arsuaga and applied the new techniques to a cave bear from the Sima de los Huesos site. After this success, the researchers sampled two grams of bone powder from a hominin thigh bone from the cave. They extracted its DNA and sequenced the genome of the mitochondria or mtDNA, a small part of the genome that is passed down along the maternal line and occurs in many copies per cell. The researchers then compared this ancient mitochondrial DNA with Neandertals, Denisovans, present-day humans, and apes.<br /><br />From the missing mutations in the old DNA sequences the researchers calculated that the Sima hominin lived about 400,000 years ago. They also found that it shared a common ancestor with the Denisovans, an extinct archaic group from Asia related to the Neandertals, about 700,000 years ago. "The fact that the mtDNA of the Sima de los Huesos hominin shares a common ancestor with Denisovan rather than Neandertal mtDNAs is unexpected since its skeletal remains carry Neandertal-derived features," says Matthias Meyer. Considering their age and Neandertal-like features, the Sima hominins were likely related to the population ancestral to both Neandertals and Denisovans. Another possibility is that gene flow from yet another group of hominins brought the Denisova-like mtDNA into the Sima hominins or their ancestors.<br /><br /></p><p>Reference</p><p>http://www.sciencedaily.com/releases/2013/12/131204132018.htm</p>]]></description>
	<dc:creator>Surajeet</dc:creator>
</item>

</channel>
</rss>