<?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/35635?offset=320</link>
	<atom:link href="https://bioinformaticsonline.com/related/35635?offset=320" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/37586/julia-programming-language-a-python-and-r-rival</guid>
	<pubDate>Sat, 25 Aug 2018 04:46:39 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/37586/julia-programming-language-a-python-and-r-rival</link>
	<title><![CDATA[Julia Programming Language, a Python and R rival]]></title>
	<description><![CDATA[<p>Big data has grown to become one of the most lucrative fields. In fact, data scientists are some of the most sought people. They are usually hired to analyze, control and parse large chunks of data. Implementing these actions using traditional techniques is not a walk in the park. This is why most data scientists prefer using programming languages such as R and Python. However, there is one more programming language that can do the job. That is Julia programming language.</p><p>What Is Julia Language?</p><p>Julia is a programming language that came into the limelight in 2012. It is a general-purpose programming language that was designed for solving scientific computations. Julia was meant to be an alternative to Python, R and other programming languages that were mainly used for manipulating data. This is because it has numerous features that can minimize the complexities of numerical computations.&nbsp;</p><p>Julia optimizes on the best features of Python and R while at the same time overlooks their weaknesses. This explains why it is viewed as an alternative to these programming languages. For instance, it utilizes the readability and simplicity of Python then performs faster.</p><p>Julia is the most preferred programming language for data scientists and mathematicians. This is because its core features are similar to the ones that are used on most data software. Also, the language is ideal for these two subjects because its syntax is similar to the standard mathematical formulas.</p><p>Key Features Of Julia Language<br />Uses JIT Compilation<br />Parallelism<br />Dynamic Typing<br />Simple Syntax<br />Allows Metaprogramming<br />Accessible to Libraries<br />-1-Array Indexing</p><p>Julia Vs Python And R Programming Languages<br />1. Speed<br />Julia is faster than both Python and R. This is a very critical aspect that is given special attention in the big data programming. The high speed of Julia is because of JIT compilers. You will need to install external libraries on Python to achieve similar speed.</p><p>2. Syntax<br />Julia has a math-friendly syntax. The syntax of this programming language is similar to the mathematical formulas hence can be used to perform mathematical and scientific computations. This syntax makes it easier to learn than Python.</p><p>3. Parallelism<br />Although both Python and R use parallelism, Julia uses a top-level parallelism. Julia allows the processor to perform to the optimum level than what Python and R can achieve.</p><p>4. Versatility<br />Julia programming language is more versatile than Python and R. It allows a programmer to move from different codes and functions with ease.</p><p>The only area that Python and R are superior to Julia is in terms of community. Given that Julia is a new programming language, it has a small community as compared to others which have been around for years.</p><p>In overall Julia programming language is a better alternative that you can use to handle Big data projects. Despite having a small community, it is one of those programming languages that you can easily learn.</p>]]></description>
	<dc:creator>Radha Agarkar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38634/eyechrom-visualizing-chromosome-count-data-from-plants</guid>
	<pubDate>Tue, 08 Jan 2019 10:20:54 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38634/eyechrom-visualizing-chromosome-count-data-from-plants</link>
	<title><![CDATA[EyeChrom: Visualizing Chromosome Count Data From Plants]]></title>
	<description><![CDATA[<p><span>It's goal is to show chromosmal data per genus. Select the genus, and the plot will show the records found for it in the Chromosome Counts Database. note: Report an issue via Gihub: github.com/roszenil/CCDBcurator and github.com/RodrigoRivero/EyeChrom</span></p>
<p>https://bsapubs.onlinelibrary.wiley.com/doi/pdf/10.1002/aps3.1207</p><p>Address of the bookmark: <a href="http://eyechrom.com:3838/EyeChrom/" rel="nofollow">http://eyechrom.com:3838/EyeChrom/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42581/autogluon-automl-for-text-image-and-tabular-data</guid>
	<pubDate>Thu, 07 Jan 2021 05:33:17 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42581/autogluon-automl-for-text-image-and-tabular-data</link>
	<title><![CDATA[AutoGluon: AutoML for Text, Image, and Tabular Data]]></title>
	<description><![CDATA[<p><span>AutoGluon automates machine learning tasks enabling you to easily achieve strong predictive performance in your applications. With just a few lines of code, you can train and deploy high-accuracy machine learning and deep learning models on text, image, and tabular data.</span></p><p>Address of the bookmark: <a href="https://github.com/awslabs/autogluon" rel="nofollow">https://github.com/awslabs/autogluon</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44742/nasa-open-science-data-repository</guid>
	<pubDate>Wed, 18 Dec 2024 11:54:47 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44742/nasa-open-science-data-repository</link>
	<title><![CDATA[NASA Open Science Data Repository]]></title>
	<description><![CDATA[<p><span>The NASA Open Science Data Repository (OSDR) enables access to space-related data from experiments and missions that investigate biological and health responses of terrestrial life to spaceflight. The goal of OSDR is to enable multi-modal and multi-hierarchical fundamental space life science data be reused toward basic science, applied science, and operational outcomes for space exploration and knowledge discovery. These data include &lsquo;omics, phenotypic, physiological, behavioral, hardware, environmental telemetry; raw, processed; tabular, text, code, bioimaging, and video.</span></p>
<p><span>https://www.nasa.gov/reference/osdr-data-processing/</span></p><p>Address of the bookmark: <a href="https://www.nasa.gov/osdr/" rel="nofollow">https://www.nasa.gov/osdr/</a></p>]]></description>
	<dc:creator>Abhi</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36017/alpha-a-toolkit-for-automated-local-phylogenomic-analyses</guid>
	<pubDate>Wed, 21 Mar 2018 18:12:06 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36017/alpha-a-toolkit-for-automated-local-phylogenomic-analyses</link>
	<title><![CDATA[ALPHA: A Toolkit for Automated Local Phylogenomic Analyses]]></title>
	<description><![CDATA[<p><span>Automated Local Phylogenomic Analyses, or ALPHA, is a python-based application that provides an intuitive user interface for phylogenetic analyses and data visualization. It has four distinct modes that are useful for different types of phylogenetic analysis: RAxML, File Converter, MS Comparison, and D-statistic.</span></p><p>Address of the bookmark: <a href="https://github.com/chilleo/ALPHA" rel="nofollow">https://github.com/chilleo/ALPHA</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/32849/car-reconstructing-contiguous-regions-of-an-ancestral-genome</guid>
	<pubDate>Thu, 18 May 2017 05:24:01 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32849/car-reconstructing-contiguous-regions-of-an-ancestral-genome</link>
	<title><![CDATA[CAR: Reconstructing Contiguous Regions of an Ancestral Genome]]></title>
	<description><![CDATA[<div id="abstract-1">
<p id="p-5">We describe a new method for predicting the ancestral order and orientation of those intervals from their observed adjacencies in modern species. We combine the results from this method with data from chromosome painting experiments to produce a map of an early mammalian genome that accounts for 96.8% of the available human genome sequence data. The precision is further increased by mapping inversions as small as 31 bp. Analysis of the predicted evolutionary breakpoints in the human lineage confirms certain published observations but disagrees with others. Although only a few mammalian genomes are currently sequenced to high precision, our theoretical analyses and computer simulations indicate that our results are reasonably accurate and that they will become highly accurate in the foreseeable future. Our methods were developed as part of a project to reconstruct the genome sequence of the last ancestor of human, dogs, and most other placental mammals;</p>
</div><p>Address of the bookmark: <a href="http://www.bx.psu.edu/miller_lab/car/" rel="nofollow">http://www.bx.psu.edu/miller_lab/car/</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40505/decostar-reconstructing-the-ancestral-organization-of-genes-or-genomes-using-reconciled-phylogenies</guid>
	<pubDate>Fri, 03 Jan 2020 13:28:19 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40505/decostar-reconstructing-the-ancestral-organization-of-genes-or-genomes-using-reconciled-phylogenies</link>
	<title><![CDATA[DeCoSTAR: Reconstructing the Ancestral Organization of Genes or Genomes Using Reconciled Phylogenies]]></title>
	<description><![CDATA[<p>DeCoSTAR computes adjacency evolutionary scenarios using a scoring scheme based on a weighted sum of adjacency gains and breakages. Solutions, both optimal and near-optimal, are sampled according to the Boltzmann&ndash;Gibbs distribution centered around parsimonious solutions, and statistical supports on ancestral and extant adjacencies are provided. DeCoSTAR supports the features of previously contributed tools that reconstruct ancestral adjacencies, namely DeCo, DeCoLT, ART-DeCo, and DeClone. In a few minutes, DeCoSTAR can reconstruct the evolutionary history of domains inside genes, of gene fusion and fission events, or of gene order along chromosomes, for large data sets including dozens of whole genomes from all kingdoms of life.</p><p>Address of the bookmark: <a href="https://github.com/YoannAnselmetti/DeCoSTAR_pipeline" rel="nofollow">https://github.com/YoannAnselmetti/DeCoSTAR_pipeline</a></p>]]></description>
	<dc:creator>Shruti Paniwala</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/36711/ancestral-sequence-reconstruction-steps</guid>
	<pubDate>Fri, 18 May 2018 08:28:26 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/36711/ancestral-sequence-reconstruction-steps</link>
	<title><![CDATA[Ancestral sequence reconstruction steps !]]></title>
	<description><![CDATA[<div><strong>Ancestral sequence reconstruction</strong>&nbsp;(<strong>ASR</strong>) &ndash; also known as&nbsp;<strong>ancestral gene</strong>/<strong>sequence reconstruction</strong>/<strong>resurrection</strong>&nbsp;&ndash; is a technique used in the study of&nbsp;molecular evolution. The method consists of the synthesis of an ancestral&nbsp;gene&nbsp;and expression of the corresponding ancestral&nbsp;protein.&nbsp;<a href="https://en.wikipedia.org/wiki/Ancestral_sequence_reconstruction#cite_note-thornton-1"></a>The idea of protein 'resurrection' was suggested in 1963 by Pauling and Zuckerkandl.<a href="https://en.wikipedia.org/wiki/Ancestral_sequence_reconstruction#cite_note-2"></a>&nbsp;Some early efforts were made in the eighties-nineties, led by the laboratory of&nbsp;Steven A. Benner, showing the potential of this technique &ndash; one that only started to be fulfilled in the post-genomic era.<a href="https://en.wikipedia.org/wiki/Ancestral_sequence_reconstruction#cite_note-3"></a>&nbsp;Thanks to the improvement of algorithms and of better sequencing and synthesis techniques, the method was developed further in the early 2000s to allow the resurrection of a greater variety of and much more ancient genes.<a href="https://en.wikipedia.org/wiki/Ancestral_sequence_reconstruction#cite_note-4"></a>&nbsp;Over the last decade, ancestral protein resurrection has developed as a strategy to reveal the mechanisms and dynamics of protein evolution.&nbsp;</div><div>&nbsp;</div><div>BEAST is the best way to predict the ancestral structure. but, I suggest following steps?</div><div>&nbsp;</div><div>1- Alignments "Mafft -&nbsp;<a href="https://www.researchgate.net/deref/http%3A%2F%2Fmafft.cbrc.jp%2Falignment%2Fsoftware%2Fsource.html" target="_blank">http://mafft.cbrc.jp/alignment/software/source.html</a>"</div><div>mafft --maxiterate 1000 --reorder --thread 24 --genafpair Dataset.fasta &gt; Dataset_Alig.fasta</div><div>&nbsp;</div><div>2- Your dataset has a good phylogenetic signal, is possible to perform with Tree-Puzzle "<a href="https://www.researchgate.net/deref/http%3A%2F%2Fwww.tree-puzzle.de" target="_blank">http://www.tree-puzzle.de</a>";</div><div>&nbsp;</div><div id="yui_3_14_1_1_1526649596608_1443">3 - This dataset which the saturation index, I perform with "<a href="https://www.researchgate.net/deref/http%3A%2F%2Fdambe.bio.uottawa.ca%2Fdambe.asp" target="_blank">http://dambe.bio.uottawa.ca/dambe.asp</a>";</div><div>&nbsp;</div><div>4- Has evidence of possible recombination in your dataset, the evaluate if this presence or absence, because this may to influence the grouping of clades, I perform with</div><div>---recombination</div><div>&nbsp;</div><div>4.1- Phi-test, implemented in SplitTree4"<a href="https://www.researchgate.net/deref/http%3A%2F%2Fwww.splitstree.org" target="_blank">http://www.splitstree.org</a>", (.nex file)</div><div>&nbsp;</div><div>4.2- GARD deployed in webserver in the DataMonkey "<a href="https://www.researchgate.net/deref/http%3A%2F%2Fwww.datamonkey.org%2F" target="_blank">http://www.datamonkey.org/</a>" - turning to the amino acid seaview -&gt; view proteins -&gt; save as ...) Ideally do a tree-based groups.</div><div>&nbsp;</div><div>4.3- RDP4 for download and installation on Windows in "<a href="https://www.researchgate.net/deref/http%3A%2F%2Fweb.cbio.uct.ac.za%2F~darren%2Frdp.html" target="_blank">http://web.cbio.uct.ac.za/~darren/rdp.html</a>"</div><div>&nbsp;</div><div>4.4- Hyphy (Mac, Windows, Linux) in "<a href="https://www.researchgate.net/deref/http%3A%2F%2Fhyphy.org%2Fw%2Findex.php%2FDownload" target="_blank">http://hyphy.org/w/index.php/Download</a>"</div><div>&nbsp;</div><div>4.5- Path-o-Gen (temporal structure of a tree input file -&gt; arquivo.tre)</div><div>These steps above, I call of pre-processing to inferences phylogenetic...</div><div>&nbsp;</div><div>5- Perform phylogenetic tree, used Bayesian Inference with Molecular Clock, but is necessary Clock Testing:</div><div>&nbsp;</div><div>- This step is performed with program Beast (Beauti, Beast and TreeAnnotator), and Tracer_v1.5 more FigTree to inspection.</div><div>&nbsp;</div><div>- Tutorials:&nbsp;<a href="https://www.researchgate.net/deref/http%3A%2F%2Fbeast.bio.ed.ac.uk%2Ftutorials" target="_blank">http://beast.bio.ed.ac.uk/tutorials</a></div><div>- Downloads:&nbsp;<a href="https://www.researchgate.net/deref/http%3A%2F%2Fbeast.bio.ed.ac.uk%2Fdownloads" target="_blank">http://beast.bio.ed.ac.uk/downloads</a></div>]]></description>
	<dc:creator>Surabhi Chaudhary</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/8504/update-genome-workbench-2715-released</guid>
	<pubDate>Wed, 26 Feb 2014 16:12:17 -0600</pubDate>
	<link>https://bioinformaticsonline.com/news/view/8504/update-genome-workbench-2715-released</link>
	<title><![CDATA[Update Genome Workbench 2.7.15 released]]></title>
	<description><![CDATA[<p>NCBI Genome Workbench is an integrated application for viewing and analyzing sequence data. With Genome Workbench, you can view data in publically available sequence databases at NCBI, and mix this data with your own private data.</p><p><img src="http://www.ncbi.nlm.nih.gov/core/assets/gbench/images/firstscreen_still.gif" alt="Introductory screen shot" style="border: 0px; border: 0px;"></p><p>Genome Workbench can display sequence data in many ways, including graphical sequence views, various alignment views, phylogenetic tree views, and tabular views of data. It can also align your private data to data in public databases, display your data in the context of public data, and retrieve BLAST results.</p><p>Genome Workbench is built on the NCBI C++ ToolKit and uses cross-platform APIs for graphics. It runs on your local machine, and is available for Windows 2000/XP, Linux, MacOS X, and various flavors of Unix.</p><p>NCBI Genome Workbench is an integrated application for viewing and analyzing sequence data. Genome Workbench was developed entirely in-house at NCBI and makes use of the NCBI C++ ToolKit. The C++ ToolKit provides a convenient and flexible cross-platform API for managing system internals, database connections, network sockets, and the NCBI data model. In addition, the C++ ToolKit provides the Object Manager, which abstracts handling of sequences and sequence-related objects.</p><p>&nbsp;New Features in Genome Workbench 2.7.15 <br /><br /></p><ul>
<li>Multiple Alignment View: implemented adaptive feature display when zooming in</li>
<li>Active Objects Inspector replaces Selection Inspector. New View should offer an improved selection context examination. See Using Active Objects Inspector tutorial for more details.</li>
<li>Binary packages for Linux OpenSUSE 13.1 are now available</li>
</ul><p><br />Bug Fixes and Improvements in Genome Workbench 2.7.15 <br /><br /></p><ul>
<li>Fixed major issue with OpenGL overlay/scrolling. Could cause crashes or view scrolling irregularities</li>
<li>Multiple Pane View: fixed crash on loading BLAST results</li>
<li>Graphical Sequence View: fixed crash on zooming in and out, related to SNP track</li>
<li>Graphical Sequence View: fixed Go To Position dialog to give better diagnostics in case of a user error</li>
<li>Graphical Sequence View: PDF export fixed rendering of Markers with commas in the name</li>
<li>Text View / Flat File: fixed Mac OS rendering issues</li>
<li>Text View / Flat File: performance optimization, extended capabilities of real-time rendering of molecules to tens of thousands</li>
<li>File Import: optimization improvement to speed up load of files containing multiple project items</li>
<li>File Import: remapping stage now shows accession.version and description of molecules, instead of plain GI numbers</li>
<li>Mac OS: improved tooltips for toolbar buttons</li>
<li>Phylogenetic Tree Builder Tool: improved diagnostics of errors</li>
<li>Multiple Alignment View: optimizations to avoid main GUI freezes</li>
<li>Open Dialog: removed duplicate elements in table of genomes (load Genome)</li>
<li>PDF export: fixed issue with XREF table errors</li>
<li>Tree View: fixed issues with showing Force Layout progress on Mac OS</li>
<li>Tree View: PDF export fixed issues for showing labels of collapsed nodes</li>
<li>Tree View: added an option to stop layout</li>
<li>Tree View: broadcasting mechanism fixed not to accumulate selected nodes</li>
</ul><p>Reference:</p><p>NCBI news</p><p>http://www.ncbi.nlm.nih.gov/tools/gbench/</p>]]></description>
	<dc:creator>Surabhi Chaudhary</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/videolist/watch/19555/a-3d-map-of-the-human-genome</guid>
	<pubDate>Fri, 12 Dec 2014 22:27:55 -0600</pubDate>
	<link>https://bioinformaticsonline.com/videolist/watch/19555/a-3d-map-of-the-human-genome</link>
	<title><![CDATA[A 3D Map of the Human Genome]]></title>
	<description><![CDATA[<iframe width="" height="" src="https://www.youtube-nocookie.com/embed/dES-ozV65u4" frameborder="0" allowfullscreen></iframe>Suhas Rao and Miriam Huntley (of the Aiden Lab) describe a 3D map of the human genome at kilobase resolution, revealing the principles of chromatin looping. Guest Origami Folding: Sarah Nyquist.

Suhas S.P. Rao*, Miriam H. Huntley*, Neva C. Durand, Elena K. Stamenova, Ivan D. Bochkov, James T. Robinson, Adrian L. Sanborn, Ido Machol, Arina D. Omer, Eric S. Lander, Erez Lieberman Aiden. (2014). A 3D Map of the Human Genome at Kilobase Resolution Reveals Principles of Chromatin Looping. Cell.]]></description>
	
</item>

</channel>
</rss>