<?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/2422?offset=270</link>
	<atom:link href="https://bioinformaticsonline.com/related/2422?offset=270" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/4197/bioinformatics-course-and-lectures</guid>
	<pubDate>Tue, 03 Sep 2013 16:41:02 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/4197/bioinformatics-course-and-lectures</link>
	<title><![CDATA[Bioinformatics course and lectures]]></title>
	<description><![CDATA[<p><a href="http://openwetware.org/wiki/User:Jarle_Pahr/Bioinformatics">http://openwetware.org/wiki/User:Jarle_Pahr/Bioinformatics</a></p><p>Address of the bookmark: <a href="http://gtpb.igc.gulbenkian.pt/bicourses/index.html" rel="nofollow">http://gtpb.igc.gulbenkian.pt/bicourses/index.html</a></p>]]></description>
	<dc:creator>Rahul Agarwal</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/5402/key-bioinformatics-scientists</guid>
	<pubDate>Wed, 09 Oct 2013 13:37:07 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/5402/key-bioinformatics-scientists</link>
	<title><![CDATA[Key Bioinformatics Scientists]]></title>
	<description><![CDATA[<p>Address of the bookmark: <a href="http://www.iscb.org/iscb-leadership-a-staff-/officers-and-board-directors" rel="nofollow">http://www.iscb.org/iscb-leadership-a-staff-/officers-and-board-directors</a></p>]]></description>
	<dc:creator>Rahul Agarwal</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/41394/ngsymposium-in-computational-biology</guid>
  <pubDate>Mon, 09 Mar 2020 06:00:30 -0500</pubDate>
  <link></link>
  <title><![CDATA[NGSymposium in Computational Biology]]></title>
  <description><![CDATA[
<p>We have a great pleasure to invite you to the NGSymposium in Computational Biology to celebrate the 5th anniversary of the NGSchool Summer Schools. This international conference will make way for exchanging knowledge and experiences between experienced and early-stage researchers as well as bioinformaticians. The meeting will be held on 31.07 - 1.08.2020 in Warsaw. It will be a satellite event to the #NGSchool2020: Statistical Learning in Genomics. It will cover a wide range of topics from basic and applied biomedical sciences: bioinformatics, genomics, transcriptomics, computational biology, Machine Learning.</p>

<p>Registration of active participants will be open from February, 27 12 PM CET to April 17, 23:59 CET. In registration forms you will be asked for providing us with some basic information about yourself. You will also be able to submit your abstract. You can save your registration form after filling it partially and come back later to supply more data e.g. upload an abstract. Your registration will be completed only with the payment of the registration fee reaching our accounts - please make sure to transfer the money in advance!</p>

<p>Registration of passive participants will be open after closing of registration of active participants.</p>

<p>Details an registration: https://ngschool.eu/conference/</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38678/upho-scripts-for-homology-and-orthology-assessment-from-genomic-sequences</guid>
	<pubDate>Mon, 14 Jan 2019 10:36:42 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38678/upho-scripts-for-homology-and-orthology-assessment-from-genomic-sequences</link>
	<title><![CDATA[UPhO: Scripts for homology and orthology assessment from genomic sequences.]]></title>
	<description><![CDATA[<p>UPhO finds orthologs with and without inparalogs from input gene family trees. Refer to the Documentation.pdf for more detailed explanations on its usage, installation and dependencies. Type UPhO.py -h for help.</p>
<p>The only input requierement for UPhO is a tree (or trees) in Newick format in which the leaves are named with a species idenfifier, a field separator, and sequence identifier. By default, the field separator is the character "|" but custom delimiters can be defined. Examples of trees to test UPhO are provided in the TestData folder.</p><p>Address of the bookmark: <a href="https://github.com/ballesterus/UPhO" rel="nofollow">https://github.com/ballesterus/UPhO</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44179/python-mini-projects</guid>
	<pubDate>Mon, 16 Jan 2023 02:14:03 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44179/python-mini-projects</link>
	<title><![CDATA[Python Mini Projects !]]></title>
	<description><![CDATA[<p><span>There is a directory for each chapter of the book. Each directory contains a&nbsp;</span><code>test.py</code><span>&nbsp;program you can use with&nbsp;</span><code>pytest</code><span>&nbsp;to check that you have written the program correctly. I have included a short README to describe each exercise. If you have problems writing code (or if you would like to support this project!), the book contains details about the skills you need.</span></p>
<p>https://github.com/kyclark/tiny_python_projects</p><p>Address of the bookmark: <a href="https://github.com/kyclark/tiny_python_projects" rel="nofollow">https://github.com/kyclark/tiny_python_projects</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38304/lordfast-sensitive-and-fast-alignment-search-tool-for-long-noisy-read-sequencing-data</guid>
	<pubDate>Tue, 27 Nov 2018 04:43:57 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38304/lordfast-sensitive-and-fast-alignment-search-tool-for-long-noisy-read-sequencing-data</link>
	<title><![CDATA[lordFAST: sensitive and Fast Alignment Search Tool for LOng noisy Read sequencing Data]]></title>
	<description><![CDATA[<p><span>lordFAST is a sensitive tool for mapping long reads with high error rates. lordFAST is specially designed for aligning reads from PacBio sequencing technology but provides the user the ability to change alignment parameters depending on the reads and application.</span></p>
<p>lordFAST, a novel long-read mapper that is specifically designed to align reads generated by PacBio and potentially other SMS technologies to a reference. lordFAST not only has higher sensitivity than the available alternatives, it is also among the fastest and has a very low memory footprint.</p>
<p>&nbsp;</p><p>Address of the bookmark: <a href="https://github.com/vpc-ccg/lordfast" rel="nofollow">https://github.com/vpc-ccg/lordfast</a></p>]]></description>
	<dc:creator>BioJoker</dc:creator>
</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>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37496/gsearch-a-fast-and-flexible-general-search-tool-for-whole-genome-sequencing</guid>
	<pubDate>Mon, 06 Aug 2018 17:19:15 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37496/gsearch-a-fast-and-flexible-general-search-tool-for-whole-genome-sequencing</link>
	<title><![CDATA[gSearch: a fast and flexible general search tool for whole-genome sequencing]]></title>
	<description><![CDATA[<p><span>gSearch compares sequence variants in the Genome Variation Format (GVF) or Variant Call Format (VCF) with a pre-compiled annotation or with variants in other genomes. Its search algorithms are subsequently optimized and implemented in a multi-threaded manner.&nbsp;</span></p><p>Address of the bookmark: <a href="http://ml.ssu.ac.kr/gSearch/index.html" rel="nofollow">http://ml.ssu.ac.kr/gSearch/index.html</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43439/mmseqs2-ultra-fast-and-sensitive-sequence-search-and-clustering-suite</guid>
	<pubDate>Wed, 06 Oct 2021 07:01:14 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43439/mmseqs2-ultra-fast-and-sensitive-sequence-search-and-clustering-suite</link>
	<title><![CDATA[MMseqs2: ultra fast and sensitive sequence search and clustering suite]]></title>
	<description><![CDATA[<p><span>MMseqs2 (Many-against-Many sequence searching) is a software suite to search and cluster huge protein and nucleotide sequence sets. MMseqs2 is open source GPL-licensed software implemented in C++ for Linux, MacOS, and (as beta version, via cygwin) Windows. The software is designed to run on multiple cores and servers and exhibits very good scalability. MMseqs2 can run 10000 times faster than BLAST. At 100 times its speed it achieves almost the same sensitivity. It can perform profile searches with the same sensitivity as PSI-BLAST at over 400 times its speed.</span></p><p>Address of the bookmark: <a href="https://github.com/soedinglab/MMseqs2" rel="nofollow">https://github.com/soedinglab/MMseqs2</a></p>]]></description>
	<dc:creator>Abhi</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/852/queensland-centre-for-medical-genomics-grimmond-lab</guid>
  <pubDate>Sun, 14 Jul 2013 11:58:34 -0500</pubDate>
  <link></link>
  <title><![CDATA[Queensland Centre for Medical Genomics, Grimmond Lab]]></title>
  <description><![CDATA[
<p>Queensland Centre for Medical Genomics</p>

<p>Research Area:<br />pancreatic cancer; ovarian cancer; prostate cancer; bowel cancer; brain cancer; endometrial cancer; breast cancer; personalised medicine; high-throughput genomics</p>

<p>Link @ http://www.imb.uq.edu.au/sean-grimmond</p>
]]></description>
</item>

</channel>
</rss>