<?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/30149?offset=610</link>
	<atom:link href="https://bioinformaticsonline.com/related/30149?offset=610" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	
<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/30747/11th-international-joint-conference-on-biomedical-engineering-systems-and-technologies</guid>
  <pubDate>Wed, 01 Feb 2017 17:39:27 -0600</pubDate>
  <link></link>
  <title><![CDATA[11th International Joint Conference on Biomedical Engineering Systems and Technologies]]></title>
  <description><![CDATA[
<p>BIOSTEC, the 11th International Joint Conference on Biomedical Engineering Systems and Technologies.<br /> Registration to BIOINFORMATICS allows free access to all other BIOSTEC conferences. </p>

<p>Upcoming Deadlines<br />Regular Paper Submission: July 31, 2017 <br />Regular Paper Authors Notification: October 16, 2017 <br />Regular Paper Camera Ready and Registration: October 30, 2017 </p>

<p>The purpose of the International Conference on Bioinformatics Models, Methods and Algorithms is to bring together researchers and practitioners interested in the application of computational systems, algorithmic concepts and information technologies to address challenging problems in Biomedical research with a particular focus on the emerging problems in Bioinformatics and computational biology. There is a tremendous need to explore how mathematical, statistical and computational models can be used to better understand biological processes and systems, while developing new methodologies and tools to analysis the massive currently-available biological data. Areas of interest to this community include systems biology, sequence analysis, biostatistics, image analysis, network and graph models, scientific data management and data mining, machine learning, pattern recognition, computational evolutionary biology, computational genomics and proteomics, and related areas.</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30831/fsa-fast-statistical-alignment</guid>
	<pubDate>Mon, 06 Feb 2017 04:26:01 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30831/fsa-fast-statistical-alignment</link>
	<title><![CDATA[FSA: Fast Statistical Alignment]]></title>
	<description><![CDATA[<p><span>FSA is a probabilistic multiple sequence alignment algorithm which uses a "distance-based" approach to aligning homologous protein, RNA or DNA sequences. Much as distance-based phylogenetic reconstruction methods like Neighbor-Joining build a phylogeny using only pairwise divergence estimates, FSA builds a multiple alignment using only pairwise estimations of homology. This is made possible by the sequence annealing technique for constructing a multiple alignment from pairwise comparisons, developed by Ariel Schwartz in&nbsp;</span><a href="http://www.eecs.berkeley.edu/Pubs/TechRpts/2007/EECS-2007-39.html">"Posterior Decoding Methods for Optimization and Control of Multiple Alignments</a><span>."</span></p>
<p>FSA brings the high accuracies previously available only for small-scale analyses of proteins or RNAs to large-scale problems such as aligning thousands of sequences or megabase-long sequences. FSA introduces several novel methods for constructing better alignments:</p>
<ul>
<li>FSA uses machine-learning techniques to estimate gap and substitution parameters on the fly for each set of input sequences. This "query-specific learning" alignment method makes FSA very robust: it can produce superior alignments of sets of homologous sequences which are subject to very different evolutionary constraints.</li>
<li>FSA is capable of aligning hundreds or even thousands of sequences using a randomized inference algorithm to reduce the computational cost of multiple alignment. This randomized inference can be over ten times faster than a direct approach with little loss of accuracy.</li>
<li>FSA can quickly align very long sequences using the "anchor annealing" technique for resolving anchors and projecting them with transitive anchoring. It then stitches together the alignment between the anchors using the methods described above.</li>
<li>The included GUI, MAD (Multiple Alignment Display), can display the intermediate alignments produced by FSA, where each character is colored according to the probability that it is correctly aligned (see the picture and&nbsp;<a href="http://fsa.sourceforge.net/images/Suchard_SIV.fsa.mov">movie</a>&nbsp;at the top of the page).</li>
</ul>
<p><span>You can see more information on the&nbsp;</span><a href="http://fsa.sourceforge.net/FAQ.html">FAQ</a><span>.&nbsp;</span></p>
<p>&nbsp;</p><p>Address of the bookmark: <a href="http://fsa.sourceforge.net/" rel="nofollow">http://fsa.sourceforge.net/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30897/finestructure-v2-globetrotter</guid>
	<pubDate>Mon, 13 Feb 2017 08:40:23 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30897/finestructure-v2-globetrotter</link>
	<title><![CDATA[fineSTRUCTURE v2 &amp; GLOBETROTTER]]></title>
	<description><![CDATA[<p>Software available at this site</p>
<div>
<ul>
<li><a href="https://people.maths.bris.ac.uk/%7Emadjl/finestructure/finestructure_info.html">FineSTRUCTURE version 2</a>, a pipeline for running ChromoPainter and FineSTRUCTURE for population inference. A GUI is available for interpretation. Download from the <a href="https://people.maths.bris.ac.uk/%7Emadjl/finestructure/finestructure.html">Downloads</a> page.</li>
<li><a href="https://people.maths.bris.ac.uk/%7Emadjl/finestructure/finestructureR.html">FineSTRUCTURE R scripts</a>, a facility for exploring the results when the GUI is unavailable.</li>
<li><a href="https://people.maths.bris.ac.uk/%7Emadjl/finestructure/globetrotter.html">GLOBETROTTER</a>, the admixture dating method based on ChromoPainter. Download from the <a href="https://people.maths.bris.ac.uk/%7Emadjl/finestructure/finestructure.html">Downloads</a> page.</li>
<li><a href="https://people.maths.bris.ac.uk/%7Emadjl/finestructure/admixture.html">AdmixturePainting</a>, A set of R tools to inmterpret the results of ADMIXTURE and STRUCTURE-like mixture models.</li>
<li><a href="https://people.maths.bris.ac.uk/%7Emadjl/finestructure/radpainter.html">RADpainter</a>, finestructure and ChromoPainter for RAD tag data used for non-model organisms.</li>
<li>Scripts to perform many types of conversion. Included in the main software download from the <a href="https://people.maths.bris.ac.uk/%7Emadjl/finestructure/finestructure.html">Downloads</a> page.</li>
</ul>
What this page is This page provides information about and downloads for <strong>methodology for Chromosome Painting</strong>. It is not a facility to analyse your genome. Sorry if you were misled by the punchy name!<br> About Chromosome Painting Painting is an efficient way of identifying important haplotype information from dense genotype data. It describes ancestry in an efficient way suitable for a range of further analyses, including population identification and admixture dating.</div><p>Address of the bookmark: <a href="http://paintmychromosomes.com/" rel="nofollow">http://paintmychromosomes.com/</a></p>]]></description>
	<dc:creator>Shruti Paniwala</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/39453/fuma-gwas-functional-mapping-and-annotation-of-genome-wide-association-studies</guid>
	<pubDate>Sat, 01 Jun 2019 03:11:16 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/39453/fuma-gwas-functional-mapping-and-annotation-of-genome-wide-association-studies</link>
	<title><![CDATA[FUMA GWAS: Functional Mapping and Annotation of Genome-Wide Association Studies]]></title>
	<description><![CDATA[<p><span>FUMA is a platform that can be used to annotate, prioritize, visualize and interpret GWAS results.&nbsp;</span><br><span>The&nbsp;</span><a href="https://fuma.ctglab.nl/snp2gene">SNP2GENE</a><span>&nbsp;function takes GWAS summary statistics as an input, and provides extensive functional annotation for all SNPs in genomic areas identified by lead SNPs.&nbsp;</span><br><span>The&nbsp;</span><a href="https://fuma.ctglab.nl/gene2func">GENE2FUNC</a><span>&nbsp;function takes a list of gene IDs (as identified by SNP2GENE or as provided manually) and annotates genes in biological context&nbsp;</span></p><p>Address of the bookmark: <a href="https://fuma.ctglab.nl/" rel="nofollow">https://fuma.ctglab.nl/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/31207/laj-viewing-and-manipulating-the-output-from-pairwise-alignment-programs</guid>
	<pubDate>Wed, 01 Mar 2017 08:35:40 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/31207/laj-viewing-and-manipulating-the-output-from-pairwise-alignment-programs</link>
	<title><![CDATA[Laj: viewing and manipulating the output from pairwise alignment programs]]></title>
	<description><![CDATA[<p>Laj is a tool for viewing and manipulating the output from pairwise alignment programs such as <a href="http://bio.cse.psu.edu/">blastz</a>. It can display interactive dotplot, pip, and text representations of the alignments, a diagram showing the locations of exons and repeats, and annotation links to other web sites containing additional information about particular regions.</p>
<p>The program is written in Java in order to provide a graphical user interface that is portable across a variety of computer platforms; indeed its name stands for "Local Alignments with Java". Currently it exists in two forms, a stand-alone application and a web-based applet, with slightly different capabilities.</p><p>Address of the bookmark: <a href="http://www.bx.psu.edu/~ratan/" rel="nofollow">http://www.bx.psu.edu/~ratan/</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44892/grannot</guid>
	<pubDate>Sun, 31 Aug 2025 06:21:50 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44892/grannot</link>
	<title><![CDATA[GrAnnoT]]></title>
	<description><![CDATA[<p>GrAnnoT is an annotation transfer tool for pangenome graphs. It can transfer linear genome annotations to a pangenome graph containing the genome, and also transfer the pangenome graph's annotations on the genomes it contains. It also outputs complementary information such as the alignments of the transfered genes, or a presence-absence matrix.</p><p>Address of the bookmark: <a href="https://forge.ird.fr/diade/dynadiv/grannot" rel="nofollow">https://forge.ird.fr/diade/dynadiv/grannot</a></p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42491/eukulele-taxonomic-annotation-of-the-unsung-eukaryotic-microbes</guid>
	<pubDate>Sat, 26 Dec 2020 12:10:17 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42491/eukulele-taxonomic-annotation-of-the-unsung-eukaryotic-microbes</link>
	<title><![CDATA[EUKulele: Taxonomic annotation of the unsung eukaryotic microbes]]></title>
	<description><![CDATA[<p><span><span>&nbsp;</span>EUKulele, an open-source software tool designed to assign taxonomy to microeukaryotes detected in meta-omic samples, and complement analysis approaches in other domains by accommodating assembly output and providing concrete metrics reporting the taxonomic completeness of each sample.</span></p><p>Address of the bookmark: <a href="https://github.com/AlexanderLabWHOI/EUKulele" rel="nofollow">https://github.com/AlexanderLabWHOI/EUKulele</a></p>]]></description>
	<dc:creator>Shruti Paniwala</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/31564/htslib</guid>
	<pubDate>Wed, 15 Mar 2017 11:38:05 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/31564/htslib</link>
	<title><![CDATA[HTSlib]]></title>
	<description><![CDATA[<p>Samtools is a suite of programs for interacting with high-throughput sequencing data. It consists of three separate repositories:</p>
<dl><dt>Samtools</dt><dd>Reading/writing/editing/indexing/viewing SAM/BAM/CRAM format</dd><dt>BCFtools</dt><dd>Reading/writing BCF2/VCF/gVCF files and calling/filtering/summarising SNP and short indel sequence variants</dd><dt>HTSlib</dt><dd>A C library for reading/writing high-throughput sequencing data</dd></dl>
<p>Samtools and BCFtools both use HTSlib internally, but these source packages contain their own copies of htslib so they can be built independently.</p><p>Address of the bookmark: <a href="http://www.htslib.org/" rel="nofollow">http://www.htslib.org/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/file/view/87/linux-cheat-sheet</guid>
	<pubDate>Tue, 09 Jul 2013 17:30:04 -0500</pubDate>
	<link>https://bioinformaticsonline.com/file/view/87/linux-cheat-sheet</link>
	<title><![CDATA[Linux Cheat Sheet]]></title>
	<description><![CDATA[<p><span>In an attempt to find a good Linux reference for bioinformatician and BOL readers, I was unsuccessful at finding a decent one on the Internet. So, we decided to make a cheat sheet for biological programmers.</span></p>]]></description>
	<dc:creator>Jitendra Narayan</dc:creator>
	<enclosure url="https://bioinformaticsonline.com/file/download/87" length="81260" type="application/pdf" />
</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>

</channel>
</rss>