<?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/901?offset=10</link>
	<atom:link href="https://bioinformaticsonline.com/related/901?offset=10" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/31881/gbtools-interactive-visualization-of-metagenome-bins-in-r</guid>
	<pubDate>Sun, 26 Mar 2017 15:41:31 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/31881/gbtools-interactive-visualization-of-metagenome-bins-in-r</link>
	<title><![CDATA[gbtools: Interactive Visualization of Metagenome Bins in R]]></title>
	<description><![CDATA[<p><span>We have developed gbtools, a software package that allows users to visualize metagenomic assemblies by plotting coverage (sequencing depth) and GC values of contigs, and also to annotate the plots with taxonomic information. Different sets of annotations, including taxonomic assignments from conserved marker genes or SSU rRNA genes, can be imported simultaneously; users can choose which annotations to plot. Bins can be manually defined from plots, or be imported from third-party binning tools and overlaid onto plots, such that results from different methods can be compared side-by-side. gbtools reports summary statistics of bins including marker gene completeness, and allows the user to add or subtract bins with each other.&nbsp;</span></p>
<p><span>Tool at&nbsp;https://github.com/kbseah/genome-bin-tools</span></p><p>Address of the bookmark: <a href="http://journal.frontiersin.org/article/10.3389/fmicb.2015.01451/full" rel="nofollow">http://journal.frontiersin.org/article/10.3389/fmicb.2015.01451/full</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/859/boku-chair-of-bioinformatics</guid>
  <pubDate>Sun, 14 Jul 2013 12:37:23 -0500</pubDate>
  <link></link>
  <title><![CDATA[Boku Chair of Bioinformatics]]></title>
  <description><![CDATA[
<p>The Bioinformatics group at Boku University has two main areas of interest, underpinning a common goal, the study of complex systems in living organisms. To overcome the engineered redundancies and combinatorial effects prevalent in higher eukaryotes, novel views augmenting the classical gene by gene approaches are required. We combine<br />Work to establish improved quantitative experimental assays (such as microarrays or differential in-gel electrophoresis) and<br />Development of modern computational methods (such as hierarchical probabilistic models or integration of heterogeneous data sources)</p>

<p>Link @ http://bioinf.boku.ac.at/</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/32048/json</guid>
	<pubDate>Tue, 04 Apr 2017 08:02:39 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32048/json</link>
	<title><![CDATA[JSON]]></title>
	<description><![CDATA[<p><strong>JSON</strong>&nbsp;(JavaScript Object Notation) is a lightweight data-interchange format. It is easy for humans to read and write. It is easy for machines to parse and generate. It is based on a subset of the&nbsp;<a href="http://javascript.crockford.com/">JavaScript Programming Language</a>,&nbsp;<a href="http://www.ecma-international.org/publications/files/ecma-st/ECMA-262.pdf">Standard ECMA-262 3rd Edition - December 1999</a>. JSON is a text format that is completely language independent but uses conventions that are familiar to programmers of the C-family of languages, including C, C++, C#, Java, JavaScript, Perl, Python, and many others. These properties make JSON an ideal data-interchange language.</p>
<p>JSON is built on two structures:</p>
<ul>
<li>A collection of name/value pairs. In various languages, this is realized as an&nbsp;<em>object</em>, record, struct, dictionary, hash table, keyed list, or associative array.</li>
<li>An ordered list of values. In most languages, this is realized as an&nbsp;<em>array</em>, vector, list, or sequence.</li>
</ul>
<p>These are universal data structures. Virtually all modern programming languages support them in one form or another. It makes sense that a data format that is interchangeable with programming languages also be based on these structures.</p><p>Address of the bookmark: <a href="http://json.org/" rel="nofollow">http://json.org/</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/870/6-phd-students-tu-dresden</guid>
  <pubDate>Sun, 14 Jul 2013 13:42:06 -0500</pubDate>
  <link></link>
  <title><![CDATA[6 PhD Students @ TU Dresden]]></title>
  <description><![CDATA[
<p>At TU Dresden, Faculty of Computer Science, the DFG Research Training Group GRK 1907 “Role-based Software Infrastructures for continuous-context-sensitive Systems” offers the positions of 6 PhD Students (E 13 TV-L)</p>

<p>for applicants interested in performing high-quality research on the connection between software engineering, database systems, and theoretical computer science as well as their applications in bioinformatics and business informatics. The research programme will start on October 1, 2013 until 30.09.2016. The period of employment is governed by the Fixed Term Research Contracts Act (Wissenschaftszeitvertragsgesetz – WissZeitVG).</p>

<p>This research programme is a joint activity of Professors Lehner, Assmann, Baader, Baier, Schill, Schlegel, Schroeder, and Strahringer at TU Dresden. Alongside their research, an individual mentoring and qualification approach are arranged with specialized courses that prepare them optimally for their research, a research seminar where they can meet internationally renowned researchers in the field, and soft skills and language courses.</p>

<p>Requirements: Applicants should have an excellent academic record, and hold a MSc (or an equivalent university degree) in computer science or related disciplines (such as mathematics, bioinformatics or business informatics). Fluency in spoken and written English is required. Applicants with a good knowledge of software engineering or one of the application areas mentioned above are preferred. TU Dresden is committed to increase the proportion of women in research.</p>

<p>Applications from women are particularly welcome. The same applies to disabled people.</p>

<p>Please send enquiries to: wolfgang.lehner@tu-dresden.de</p>

<p>Applications consist of a CV, the names of two referees, transcipts of documents summarizing their academic performance, and a statement of interest. Application by email in pdf format is preferred, and should be submitted to wolfgang.lehner@tu-dresden.de in an electronically signed and encrypted form by July 30, 2013 (stamped arrival date of the university central mail service applies). Alternatively, applications can be sent to: TU Dresden, Fakultät Informatik, Institut für Systemarchitektur, Prof.  Dr.-Ing.  Wolfgang Lehner, 01062 Dresden, Germany.</p>

<p>Shortlisted candidates will be invited to Dresden in the middle of August to give a presentation on their Master’s thesis and discuss their research interest with the participating professors. Candidates that have not yet finished their degree when they send in their application should send preliminary transcripts of their academic records as well as a letter by the thesis adviser that comments on their progress so far and on the expected date of completion of their MSc or equivalent degree.</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/32134/lifemap</guid>
	<pubDate>Mon, 10 Apr 2017 05:42:37 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32134/lifemap</link>
	<title><![CDATA[Lifemap]]></title>
	<description><![CDATA[<p><strong>Lifemap</strong> is an interactive tool to explore the WHOLE NCBI TAXONOMY. The concept used in <strong>Lifemap</strong> is similar to the one used in cartography with tools like Google Maps&copy; or Open Street Maps: exploring is done by zooming and panning.</p>
<div>
<p>&nbsp;The current tree contains ALL species present in NCBI taxonomy as of <span style="text-decoration: underline;">October 18th, 2016</span>: 1,135,169 species including 10,545 Archaea, 418,777 Bacteria and 705,847 Eukaryotes. The Lifemap tree is updated every two weeks.</p>
</div>
<p>&nbsp;All the nodes in the tree are clickable. This displays various information and options:</p>
<ul>
<li>The species name (and the associated common name if there is one)</li>
<li>The rank (kingdom, family, class, species...)</li>
<li>Ability to go to the corresponding node/species on NCBI web site (displayed in a new window)</li>
<li>Possibility to download the corresponding subtree in newick extended format</li>
<li>Possibilty to get the whole lineage from the current node/tip to the root of the tree.</li>
</ul><p>Address of the bookmark: <a href="http://lifemap-ncbi.univ-lyon1.fr/" rel="nofollow">http://lifemap-ncbi.univ-lyon1.fr/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/864/the-laboratoire-de-genomique-fonctionelle</guid>
  <pubDate>Sun, 14 Jul 2013 13:03:18 -0500</pubDate>
  <link></link>
  <title><![CDATA[The Laboratoire de genomique fonctionelle]]></title>
  <description><![CDATA[
<p>One persistent challenge of post genome biology remains the determination of the functions of all potential genes. In mammals this task is formidable given that a single gene can produce numerous protein isoforms through alternative pre-mRNA splicing. Protein isoforms from a single gene can have diverse, and in some cases antagonistic, functions. AS plays a pivotal biological role in protein diversity and developmental regulation. It is now believed that AS occurs in up to 74% of human genes, making it more of a rule than an exception.</p>

<p>Link @ http://lgfus.ca/public/</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/32187/chromhmm-chromatin-state-discovery-and-characterization</guid>
	<pubDate>Wed, 19 Apr 2017 04:06:23 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32187/chromhmm-chromatin-state-discovery-and-characterization</link>
	<title><![CDATA[ChromHMM: Chromatin state discovery and characterization]]></title>
	<description><![CDATA[<p><span>ChromHMM is software for learning and characterizing chromatin states. ChromHMM can integrate multiple chromatin datasets such as ChIP-seq data of various histone modifications to discover de novo the major re-occuring combinatorial and spatial patterns of marks. ChromHMM is based on a multivariate Hidden Markov Model that explicitly models the presence or absence of each chromatin mark. The resulting model can then be used to systematically annotate a genome in one or more cell types. By automatically computing state enrichments for large-scale functional and annotation datasets ChromHMM facilitates the biological characterization of each state. ChromHMM also produces files with genome-wide maps of chromatin state annotations that can be directly visualized in a genome browser.&nbsp;</span><br><br></p>
<ul>
<li><a href="http://compbio.mit.edu/ChromHMM/ChromHMM.zip">ChromHMM software v1.12</a>&nbsp;(<a href="http://compbio.mit.edu/ChromHMM/versionlog.txt">version log</a>)</li>
<li><a href="http://compbio.mit.edu/ChromHMM/ChromHMM_manual.pdf">ChromHMM manual</a></li>
</ul><p>Address of the bookmark: <a href="http://compbio.mit.edu/ChromHMM/" rel="nofollow">http://compbio.mit.edu/ChromHMM/</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/6420/studentship-and-traineeship-university-of-madras</guid>
  <pubDate>Sat, 16 Nov 2013 19:27:40 -0600</pubDate>
  <link></link>
  <title><![CDATA[STUDENTSHIP and TRAINEESHIP @ University of Madras]]></title>
  <description><![CDATA[
<p>Bioinformatics Infrastructure Facility<br />University of Madras<br />Chennai 600 025</p>

<p>Applications are invited for the STUDENTSHIP and TRAINEESHIP vacancies to carry out project/research work in the DBT - Bioinformatics Infrastructure Facility with consolidated stipend of Rs.5,000/- per month.</p>

<p>Essential Qualification</p>

<p>Student Trainee: Those who have completed M.Sc., Bioinformatics/Biophysics/Life sciences or Pursuing M.Tech., Bioinformatics/Biotechnology</p>

<p>Duration : 3-4 Months</p>

<p>Student Trainee: Those who are pursuing M.Sc Bioinformatics/Biophysics/ Life sciences/others</p>

<p>Duration : 2-3 Months</p>

<p>Mail your CV on or before 25th November 2013 to shirai2011@gmail.com and hard copy to "Dr. D. Velmurugan, Professor &amp; Head, CAS in Crystallography and Biophysics, University of Madras, Guindy Campus, Chennai 600 025". Also, the applicants are requested to attend the interview on 29th November, 2013 at 11 A.M.</p>

<p>Advertisement:</p>

<p>www.unom.ac.in/uploads/announcements/bifadvertisement_20131114080003_23240.pdf</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/32376/diamond</guid>
	<pubDate>Thu, 27 Apr 2017 04:21:54 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32376/diamond</link>
	<title><![CDATA[DIAMOND]]></title>
	<description><![CDATA[<p><span>DIAMOND is a sequence aligner for protein and translated DNA searches and functions as a drop-in replacement for the NCBI BLAST software tools. It is suitable for protein-protein search as well as DNA-protein search on short reads and longer sequences including contigs and assemblies, providing a speedup of BLAST ranging up to x20,000.</span></p>
<p><span>More at&nbsp;file:///home/urbe/Downloads/diamond_manual.pdf</span></p>
<p><span>http://www.nature.com/nmeth/journal/v12/n1/full/nmeth.3176.html</span></p><p>Address of the bookmark: <a href="https://github.com/bbuchfink/diamond" rel="nofollow">https://github.com/bbuchfink/diamond</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/918/data-mining-in-bioinformatics</guid>
	<pubDate>Tue, 16 Jul 2013 03:21:28 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/918/data-mining-in-bioinformatics</link>
	<title><![CDATA[Data Mining in Bioinformatics]]></title>
	<description><![CDATA[<p>Data mining, the extraction of hidden predictive information from large databases. Data mining is becoming an increasingly important tool to transform this data into information. It is commonly used in a wide range of profiling practices, such as marketing, surveillance, fraud detection and scientific discovery. Data Mining for Bioinformatics enables researchers to meet the challenge of mining vast amounts of biomolecular data to discover real knowledge. In other words, you&rsquo;re a bioinformatician, and data has been dumped in your lap. Find the patterns, trend, answers, or what ever meaningful knowledge the data is hiding. They scour databases for hidden patterns, finding predictive information that experts may miss because it lies outside their expectations.This page Covering theory, algorithms, and methodologies, as well as data mining technologies. Unfortunately life is never simple. In molecular biology, it&rsquo;s becoming more common to generate reams of data then ask someone in bioinformatics to produce an answer. This is exploratory data analysis, one of the most difficult things to do well. Especially if you&rsquo;re thrown in at the deep end.</p><p><strong>Data mining commonly involves four classes of tasks:</strong></p><ul>
<li>Classification - Arranges the data into predefined groups. For example, an email program might attempt to classify an email as legitimate or spam. Common algorithms include decision tree learning, nearest neighbor, naive Bayesian classification and neural networks.</li>
<li>Clustering - Is like classification but the groups are not predefined, so the algorithm will try to group similar items together.</li>
<li>Regression - Attempts to find a function which models the data with the least error.</li>
<li>Association rule learning - Searches for relationships between variables. For example a supermarket might gather data on customer purchasing habits. Using association rule learning, the supermarket can determine which products are frequently bought together and use this information for marketing purposes. This is sometimes referred to as market basket analysis.</li>
<li>From experience, I can say that is one of the most frustrating positions to be in. Data mining is a huge field and can easily be bewildering for a beginner. However, high through-put techniques in molecular biology require, more and more, that bioinformatics is required to interpret the data. Furthermore, people working in bioinformatics generally come from computer science, or biology backgrounds. Data mining, however, involves statistics to one degree or another, which means entering a field that is may not be your strong point.</li>
<li>Excel is fine for creating graphs. If you&rsquo;re serious about data mining though, you&rsquo;ll need something more heavy weight. I use R, free, and with good data mining packages such as vegan and labdsv. For beginners R can be impenetrable, I recommend this book an introduction to R as well as the underlying statistics.</li>
<li>Any of us can rush head on into a land of support vector machines, hidden markov models and neural networks. But coming back to the first point, what are you trying to prove? Always question what are you doing, how does it fit in to the wider picture? Try to regularly review, and keep track of where you are going? This will prevent you from falling into data mining despair.</li>
</ul><p><strong>Data Mining Resources on the net:</strong><br /><br />A laboratory of data mining and bioinformatics is headed by Prof. Ambuj Singh. There are currently seven graduate students in the research group. Our research focuses on image informatics and scalable querying and mining of graphs.For more detail visit:&nbsp;<a href="http://www.cs.ucsb.edu/~dbl/">http://www.cs.ucsb.edu/~dbl/</a></p><p>Here are the materials (Lecture notes) from several past courses on data mining and/or Web mining by Stanford: For detail visit:&nbsp;<a href="http://infolab.stanford.edu/~ullman/mining/mining.html">http://infolab.stanford.edu/~ullman/mining/mining.html</a><br />Statistical Data Mining Tutorial Slides by Andrew Moore The following links point to a set of tutorials on many aspects of statistical data mining, including the foundations of probability, the foundations of statistical data analysis, and most of the classic machine learning and data mining algorithms. For detail visit:&nbsp;<a href="http://www.autonlab.org/tutorials/">http://www.autonlab.org/tutorials/</a></p><p>A tutorial on Introduction to Data Mining for Discovering hidden value in your data warehouse:<a href="http://www.thearling.com/text/dmwhite/dmwhite.htm">http://www.thearling.com/text/dmwhite/dmwhite.htm</a>&nbsp;<br />Wiki Links:&nbsp;<a href="http://en.wikipedia.org/wiki/Data_mining">http://en.wikipedia.org/wiki/Data_mining</a><br />Bioinformatics with Clementine&nbsp;<a href="http://www.spss.ch/upload/1051192224_inseratClemBio.pdf">http://www.spss.ch/upload/1051192224_inseratClemBio.pdf</a>&nbsp;<br />Causal Data Mining in Bioinformatics by Ioannis Tsamardinos:&nbsp;<a href="http://www.forth.gr/ics/bmi/In_the_News/2007/EN69-4.pdf">http://www.forth.gr/ics/bmi/In_the_News/2007/EN69-4.pdf</a></p><p>Report on ACM Text Mining in Bioinformatics (TMBIO 006)&nbsp;<a href="http://www.sigir.org/forum/2007J/2007j_sigirforum_song.pdf">http://www.sigir.org/forum/2007J/2007j_sigirforum_song.pdf</a>&nbsp;<br />BIOKDD 2002: Recent Advances in Data Mining for&nbsp;<br />Bioinformatics:&nbsp;<a href="http://www.acm.org/sigs/sigkdd/explorations/issue4-2/zaki.pdf">http://www.acm.org/sigs/sigkdd/explorations/issue4-2/zaki.pdf</a></p><p><strong>Bioinformatics and Medical Informatics:</strong>&nbsp;<br /><br />Tools for Mining and Applying Genetic Information in Patient Care:<a href="http://www.biomedtechalliance.org/pdfs/03_03_05/03_03_05.pdf">http://www.biomedtechalliance.org/pdfs/03_03_05/03_03_05.pdf</a></p><p>DATA MINING OF MICROARRAY DATABASES FOR HUMAN LUNG CANCER:&nbsp;<a href="http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.106.385&amp;rep=rep1&amp;type=pdf">http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.106.385&amp;rep=rep1&amp;type=pdf</a></p><p>Towards knowledge-based gene expression data mining:&nbsp;<a href="http://www.ailab.si/blaz/papers/2007-JBI-BellazziZupan.pdf">http://www.ailab.si/blaz/papers/2007-JBI-BellazziZupan.pdf</a></p><p>DRAFT Accepted for publication in 'Data Mining in Bioinformatics'<br />Jason Wang, Mohammed Zaki, Hannu Toivonen, and Dennis Shasha (Eds.), Springer:<a href="http://www.cs.helsinki.fi/u/htoivone/pubs/gene_mapping_by_pattern_discovery.pdf">http://www.cs.helsinki.fi/u/htoivone/pubs/gene_mapping_by_pattern_discovery.pdf</a></p><p>Data Mining and Text Mining for Bioinformatics: Proceedings of the European Workshop:&nbsp;<a href="http://www.rok.informatik.hu-berlin.de/wbi/research/publications/2003/proceedings_ws_mining.pdf">http://www.rok.informatik.hu-berlin.de/wbi/research/publications/2003/proceedings_ws_mining.pdf</a></p><p><strong>Biological Network Analysis:<br /></strong><br />Graph Mining in Bioinformatics:&nbsp;<a href="http://agbs.kyb.tuebingen.mpg.de/wikis/bg/BNA-5.pdf">http://agbs.kyb.tuebingen.mpg.de/wikis/bg/BNA-5.pdf</a>.</p><p>Text mining in bioinformatics:&nbsp;<a href="http://agbs.kyb.tuebingen.mpg.de/wikis/bg/4.pdf">http://agbs.kyb.tuebingen.mpg.de/wikis/bg/4.pdf</a></p><p>Some datamining books that are available on google books:</p><p>Data mining and bioinformatics: first international workshop, VDMB 2006 By Mehmet M. Dalkilic</p><p>Data mining: concepts and techniques By Jiawei Han, Micheline Kamber</p>]]></description>
	<dc:creator>Jitendra Narayan</dc:creator>
</item>

</channel>
</rss>