<?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/37965?offset=100</link>
	<atom:link href="https://bioinformaticsonline.com/related/37965?offset=100" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42204/g-nest-the-gene-neighborhood-scoring-tool</guid>
	<pubDate>Fri, 25 Sep 2020 20:09:18 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42204/g-nest-the-gene-neighborhood-scoring-tool</link>
	<title><![CDATA[G-NEST: The Gene NEighborhood Scoring Tool]]></title>
	<description><![CDATA[<p><span>The Gene NEighborhood Scoring Tool (G-NEST) combines genomic location, gene expression, and evolutionary sequence conservation data to score putative gene neighborhoods across all window sizes. Primary author of final code = William F. Martin. Example data files are in the separate repository.</span></p><p>Address of the bookmark: <a href="https://github.com/dglemay/G-NEST" rel="nofollow">https://github.com/dglemay/G-NEST</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/4590/tigers-genome-sequenced</guid>
	<pubDate>Tue, 17 Sep 2013 16:48:24 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/4590/tigers-genome-sequenced</link>
	<title><![CDATA[Tigers genome sequenced]]></title>
	<description><![CDATA[<p>Fifteen scientists led by Dr Jong Bhak of Genome Research Foundation, South Korea, decoded as many as 3 billion nucleotides (organic molecules that form the basic building blocks of nucleic acids, such as DNA). They identified 20,000 genes related to various functions of the tiger.&nbsp;</p><p>The biggest and perhaps most fearsome of the world's big cats, the tiger, shares 95.6 percent of its DNA with humans' cute and furry companions, domestic cats.</p><p>The new research showed that big cats have genetic mutations that enabled them to be carnivores. The team also identified mutations that allow snow leopards to thrive at high altitudes.</p><p>Reference:</p><p><a href="http://www.nbcnews.com/science/your-cat-ferocious-tigers-share-lot-95-6-percent-their-4B11182690">http://www.nbcnews.com/science/your-cat-ferocious-tigers-share-lot-95-6-percent-their-4B11182690</a></p><p><a href="http://timesofindia.indiatimes.com/home/environment/flora-fauna/Gene-mapping-of-tiger-completed/articleshow/22671681.cms">http://timesofindia.indiatimes.com/home/environment/flora-fauna/Gene-mapping-of-tiger-completed/articleshow/22671681.cms</a></p><p>Paper:</p><p><a href="http://www.nature.com/ncomms/2013/130917/ncomms3433/full/ncomms3433.html">http://www.nature.com/ncomms/2013/130917/ncomms3433/full/ncomms3433.html</a></p>]]></description>
	<dc:creator>Rahul Agarwal</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36583/eugi-a-novel-resource-for-studying-genomic-islands-to-facilitate-horizontal-gene-transfer-detection-in-eukaryotes</guid>
	<pubDate>Sat, 12 May 2018 07:26:59 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36583/eugi-a-novel-resource-for-studying-genomic-islands-to-facilitate-horizontal-gene-transfer-detection-in-eukaryotes</link>
	<title><![CDATA[EuGI: a novel resource for studying genomic islands to facilitate horizontal gene transfer detection in eukaryotes]]></title>
	<description><![CDATA[<p><span>SWGIS v2.0 along with the EuGI database, which houses GIs identified in 66 different eukaryotic species, and the EuGI web-resource, provide the first comprehensive resource for studying HGT in eukaryotes.</span></p>
<p>https://bmcgenomics.biomedcentral.com/articles/10.1186/s12864-018-4724-8</p><p>Address of the bookmark: <a href="https://bmcgenomics.biomedcentral.com/articles/10.1186/s12864-018-4724-8" rel="nofollow">https://bmcgenomics.biomedcentral.com/articles/10.1186/s12864-018-4724-8</a></p>]]></description>
	<dc:creator>Surabhi Chaudhary</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38692/geneck-gene-network-construction-kit-is-a-comprehensive-online-tool-kit-that-integrate-various-statistical-methods-to-construct-gene-networks</guid>
	<pubDate>Tue, 15 Jan 2019 09:39:30 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38692/geneck-gene-network-construction-kit-is-a-comprehensive-online-tool-kit-that-integrate-various-statistical-methods-to-construct-gene-networks</link>
	<title><![CDATA[GeNeCK (Gene Network Construction Kit) is a comprehensive online tool kit that integrate various statistical methods to construct gene networks]]></title>
	<description><![CDATA[<p><strong>GeNeCK</strong><span>&nbsp;(Gene Network Construction Kit) is a comprehensive online tool kit that integrate various statistical methods to construct gene networks based on gene expression data and optional hub gene information.</span></p>
<p><span><span>It efficiently constructs gene networks from expression data. It allows the user to use ten different network construction methods (such as partial correlation-, likelihood-, Bayesian- and mutual information-based methods) and integrates the resulting networks from multiple methods. Hub gene information, if available, can be incorporated to enhance performance.</span></span></p>
<p><span><span><span>GeNeCK is an efficient and easy-to-use web application for gene regulatory network construction. It can be accessed at&nbsp;</span><span><a href="http://lce.biohpc.swmed.edu/geneck" target="_blank"><span>http://lce.biohpc.swmed.edu/geneck</span></a></span></span></span></p><p>Address of the bookmark: <a href="http://lce.biohpc.swmed.edu/geneck/" rel="nofollow">http://lce.biohpc.swmed.edu/geneck/</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44476/omark-software-for-proteome-protein-coding-gene-repertoire-quality-assessment</guid>
	<pubDate>Wed, 21 Feb 2024 15:01:20 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44476/omark-software-for-proteome-protein-coding-gene-repertoire-quality-assessment</link>
	<title><![CDATA[OMArk: software for proteome (protein-coding gene repertoire) quality assessment]]></title>
	<description><![CDATA[<p><span>OMArk is a software for proteome (protein-coding gene repertoire) quality assessment. It provides measures of proteome completeness, characterizes the consistency of all protein coding genes with regard to their homologs, and identifies the presence of contamination from other species. OMArk relies on the OMA orthology database, from which it exploits orthology relationships, and on the OMAmer software for fast placement of all proteins into gene families.</span></p><p>Address of the bookmark: <a href="https://github.com/DessimozLab/OMArk" rel="nofollow">https://github.com/DessimozLab/OMArk</a></p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38447/kegg-mapper-%E2%80%93-reconstruct-pathway</guid>
	<pubDate>Wed, 12 Dec 2018 09:14:29 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38447/kegg-mapper-%E2%80%93-reconstruct-pathway</link>
	<title><![CDATA[KEGG Mapper – Reconstruct Pathway]]></title>
	<description><![CDATA[<p><strong>Reconstruct Pathway</strong><span>&nbsp;is a KEGG PATHWAY mapping tool that assists genome and metagenome annotations. The input data is a single gene list (for a single organism) or multiple gene lists (for multiple organisms) annotated with KEGG Orthology (KO) identifiers or K numbers. Each line of the gene list contains the user-defined gene identifier followed by, if any, the assigned K number. The mapping is performed through the K numbers against the KEGG reference pathways.&nbsp;</span></p><p>Address of the bookmark: <a href="https://www.kegg.jp/kegg/tool/map_pathway.html" rel="nofollow">https://www.kegg.jp/kegg/tool/map_pathway.html</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/11798/phd-scholarship-denmark</guid>
  <pubDate>Fri, 13 Jun 2014 13:44:07 -0500</pubDate>
  <link></link>
  <title><![CDATA[PHD SCHOLARSHIP DENMARK]]></title>
  <description><![CDATA[
<p>ne PhD position is available at the Bioinformatics Center, Department of Biology, University of Copenhagen, Denmark. The PhD position concerns protein structure prediction, and will be in the Structural Bioinformatics group of Associate professor Thomas Hamelryck. The group is an integrated part of the Bioinformatics Center, which is headed by Professor Anders Krogh, employs around sixty scientists (including PhD students) and focuses on non-coding RNA, eukaryotic gene regulation and protein structure prediction. The center provides a modern, pleasant, international working environment with excellent modern facilities, in the heart of Copenhagen.<br />The project will be supervised by Associate Professor Thomas Hamelryck.</p>

<p>The protein folding problem is of enormous practical, theoretical and medical importance - and in addition forms a fascinating intellectual challenge. The aim of this project is to develop and implement a probabilistic method to infer the structure of proteins, building on various probabilistic models of protein structure developed by the Hamelryck group. The method will also take the dynamic nature of proteins into account, and involves a close collaboration with the statistics department at the university within the interdisciplinary project "Dynamical Systems: Mathematical Modeling and Statistical Methods for the Social, Health, and Natural Sciences" (http://dsin.ku.dk/).</p>

<p>Qualifications<br />Knowledge of programming (C++) and statistics or machine learning. Knowledge of biology, physics or biophysics is a plus, but not a requirement.</p>

<p>The deadline for applications is June 15, 2014</p>

<p>More at : https://job.jobnet.dk/CV/FindJob/details.aspx/3695051%20</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36846/gblocks-eliminates-poorly-aligned-positions-and-divergent-regions-of-a-dna-or-protein-alignment</guid>
	<pubDate>Sat, 02 Jun 2018 07:36:05 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36846/gblocks-eliminates-poorly-aligned-positions-and-divergent-regions-of-a-dna-or-protein-alignment</link>
	<title><![CDATA[Gblocks: eliminates poorly aligned positions and divergent regions of a DNA or protein alignment]]></title>
	<description><![CDATA[<p><a href="http://molevol.cmima.csic.es/castresana/Gblocks.html">Gblocks</a><span>&nbsp;eliminates poorly aligned positions and divergent regions of a DNA or protein alignment so that it becomes more suitable for phylogenetic analysis. This server implements the most important features of the Gblocks program to make its use as simple as possible without loosing the functionality that it is necessary in most of the cases. Other options can be changed in the stand-alone program. You can see here an&nbsp;</span><a href="http://molevol.cmima.csic.es/castresana/Gblocks_server/nad3.pir-gb.htm">example output file</a><span>&nbsp;showing the blocks selected from a protein alignment. Further information can be found in the&nbsp;</span><a href="http://molevol.cmima.csic.es/castresana/Gblocks/Gblocks_documentation.html">online documentation</a><span>.&nbsp;</span></p><p>Address of the bookmark: <a href="http://molevol.cmima.csic.es/castresana/Gblocks_server.html" rel="nofollow">http://molevol.cmima.csic.es/castresana/Gblocks_server.html</a></p>]]></description>
	<dc:creator>Poonam Mahapatra</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/41231/phd-student-bio-informatician-in-computational-protein-modeling</guid>
  <pubDate>Sun, 23 Feb 2020 03:46:46 -0600</pubDate>
  <link></link>
  <title><![CDATA[PhD student / Bio-informatician in computational protein modeling]]></title>
  <description><![CDATA[
<p>PhD student / Bio-informatician in computational protein modeling<br />Job Profile<br />You will perform research on drug/protein interaction analysis in the context of lung cancer, using computational protein modeling. You will implement existing models predicting drug efficacy, related to EGFR-driven cancer. You will translate these models to novel oncogenes, including ROS1. You will validate these models against experimental data from a parallel project, with the final goal of deployment of your methods into clinical decision making. Your work will be embedded in an international network consisting of both academic partners and ROS1-NSCLC patient organizations.</p>

<p>Requirements</p>

<p>You are (or soon will be) a master in bio-informatics. You have strong ICT skills and you are eager to fully submerge into the world of protein modeling. You have good experience with Linux and one or more programming languages as well as knowledge of tertiary structure analysis. Candidates with a Master degree in one of the life sciences (Biomedical sciences, Biochemistry, Bio-engineering, Biostatistics, …), with relevant interest and extended experience in this field are also welcome. A general background cancer biology and genetics is needed. You are willing and eligible to apply for a personal PhD fellowship with the Flemish FWO (FWO.be). Therefore, it is required that you hold a master degree from a European university, and have not obtained your master diploma more than three years ago (see FWO website for detailed conditions). Proficiency in English, and good communication skills, both oral and written, are required. You are highly motivated, and you like to work in an interactive research team. You are willing to work on a 4-year PhD project starting beginning of 2020.</p>

<p>What we offer</p>

<p>We offer a one year position, as a PhD student, which can be extended up to 4 year upon positive evaluation, even if a personal fellowship application is not successful. Wages are according to the standard Flemish bursary levels for PhD students.</p>

<p>Interested?<br />For additional information please contact dr. Geert Vandeweyer. To apply, send a copy of your CV including details of your relevant skills and a motivation letter by e-mail to dr. Geert Vandeweyer (geert.vandeweyer@uantwerpen.be) before March 15, 2020.</p>

<p>Source:https://academicpositions.be/ad/university-of-antwerp/2020/phd-student-bio-informatician-in-computational-protein-modeling/141252?utm_source=jooble&amp;utm_medium=cpc&amp;utm_campaign=jooble</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/44616/basics-of-blast-programs</guid>
	<pubDate>Fri, 26 Jul 2024 06:04:26 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/44616/basics-of-blast-programs</link>
	<title><![CDATA[Basics of BLAST Programs !]]></title>
	<description><![CDATA[<p>The Basic Local Alignment Search Tool (BLAST) is a powerful bioinformatics program used to compare an input sequence (such as DNA, RNA, or protein sequences) against a database of sequences to find regions of similarity. Developed by the National Center for Biotechnology Information (NCBI), BLAST is widely used for identifying species, finding functional and evolutionary relationships between sequences, and predicting the function of novel sequences.</p><p>Key Features of BLAST:<br />1. Sequence Comparison: BLAST searches for local alignments between the query sequence and sequences in a database. It identifies regions of similarity, which can help infer functional and evolutionary relationships.</p><p>2. Speed and Efficiency: BLAST uses heuristic algorithms, making it faster than exhaustive search methods, suitable for large-scale database searches.</p><p>3. Versatility: There are several versions of BLAST for different types of sequence comparisons:<br /> - blastn: Compares a nucleotide query sequence against a nucleotide sequence database.<br /> - blastp: Compares a protein query sequence against a protein sequence database.<br /> - blastx: Compares a nucleotide query sequence translated in all reading frames against a protein sequence database.<br /> - tblastn: Compares a protein query sequence against a nucleotide sequence database translated in all reading frames.<br /> - tblastx: Compares the six-frame translations of a nucleotide query sequence against the six-frame translations of a nucleotide sequence database.</p><p>4. Scoring and E-value: BLAST results are scored based on the quality and length of the alignments. The E-value (expect value) indicates the number of alignments one can expect to find by chance, with lower E-values representing more significant matches.</p><p>5. Output Formats: BLAST provides results in various formats, including plain text, HTML, XML, and JSON, making it adaptable for different types of analyses and integrations with other tools.</p><p>Applications of BLAST:<br />- Genomic Research: Identifying genes, understanding genetic diversity, and mapping genome sequences.<br />- Protein Function Prediction: Inferring the function of unknown proteins by comparing them to known protein sequences.<br />- Evolutionary Studies: Exploring evolutionary relationships between organisms by comparing their genetic material.<br />- Medical Research: Identifying pathogens, understanding disease mechanisms, and developing treatments by comparing sequences of interest.</p><p>Overall, BLAST is an essential tool in bioinformatics, offering a reliable and efficient way to analyze and interpret biological sequence data.</p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>

</channel>
</rss>