<?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/40395?</link>
	<atom:link href="https://bioinformaticsonline.com/related/40395?" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/2492/plos-computational-biology-translational-bioinformatics-educational-resources</guid>
	<pubDate>Fri, 16 Aug 2013 12:24:56 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/2492/plos-computational-biology-translational-bioinformatics-educational-resources</link>
	<title><![CDATA[PLOS Computational Biology: Translational Bioinformatics educational resources]]></title>
	<description><![CDATA[<p>PLOS present collection of Education articles:&nbsp; &ldquo;Translational Bioinformatics&rdquo;. This collection is presented as an online &ldquo;book&rdquo; which could serve as a reference tool for a graduate level introductory course, marking a step in an exciting new direction for the Education section of the journal.</p>
<p>Blog : http://blogs.plos.org/biologue/2012/12/28/translational-bioinformatics-plos-computational-biology-presents-an-educational-resource-for-an-emerging-field/</p>
<p>Educational Material : http://www.ploscollections.org/article/browseIssue.action?issue=info:doi/10.1371/issue.pcol.v03.i11</p><p>Address of the bookmark: <a href="http://www.ploscollections.org/article/browseIssue.action?issue=info:doi/10.1371/issue.pcol.v03.i11" rel="nofollow">http://www.ploscollections.org/article/browseIssue.action?issue=info:doi/10.1371/issue.pcol.v03.i11</a></p>]]></description>
	<dc:creator>Jitendra Narayan</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40489/machine-learning-training-and-courses-in-bioinformatics</guid>
	<pubDate>Tue, 31 Dec 2019 19:33:07 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40489/machine-learning-training-and-courses-in-bioinformatics</link>
	<title><![CDATA[Machine learning training and courses in bioinformatics !]]></title>
	<description><![CDATA[<p>Machine learning techniques have been successful in analyzing biological data because of their capabilities in handling randomness and uncertainty of data noise and in generalization. In this class, we will learn basics about probabilistic models and machine learning techniques. We will focus on probabilistic models (Markov models, Hidden Markov models, and Bayesian networks) for biological sequence analysis and systems biology. Other machine learning techniques, such as Naive bayes, neural networks and SVMs will only be covered briefly.</p>
<p>More at&nbsp;http://homes.sice.indiana.edu/yye/lab/teaching/spring2017-I529/</p>
<p>More tutorial at&nbsp;</p>
<p><a href="http://calla.rnet.missouri.edu/cheng_courses/mlbioinfo/mlbioinfo.htm">http://calla.rnet.missouri.edu/cheng_courses/mlbioinfo/mlbioinfo.htm</a></p>
<p><a href="http://www.raetschlab.org/lectures/MLBioinformatics">http://www.raetschlab.org/lectures/MLBioinformatics</a></p>
<p><a href="http://www.raetschlab.org/lectures/bertinoro08">http://www.raetschlab.org/lectures/bertinoro08</a></p>
<p>Book at&nbsp;</p>
<p><a href="https://personal.utdallas.edu/~pradiptaray/teaching/7_deep_learning_bioinfo.pdf">https://personal.utdallas.edu/~pradiptaray/teaching/7_deep_learning_bioinfo.pdf</a></p><p>Address of the bookmark: <a href="http://homes.sice.indiana.edu/yye/lab/teaching/spring2017-I529/" rel="nofollow">http://homes.sice.indiana.edu/yye/lab/teaching/spring2017-I529/</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/file/view/5684/systems-biology</guid>
	<pubDate>Thu, 17 Oct 2013 00:50:55 -0500</pubDate>
	<link>https://bioinformaticsonline.com/file/view/5684/systems-biology</link>
	<title><![CDATA[SYSTEMS BIOLOGY]]></title>
	<description><![CDATA[]]></description>
	<dc:creator>ROSHNI</dc:creator>
	<enclosure url="https://bioinformaticsonline.com/file/download/5684" length="" type="application/vnd.ms-powerpoint" />
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/44002/interesting-bioinformatics-resources</guid>
	<pubDate>Fri, 11 Nov 2022 06:30:46 -0600</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/44002/interesting-bioinformatics-resources</link>
	<title><![CDATA[Interesting Bioinformatics Resources !]]></title>
	<description><![CDATA[<p>1. a reproducible workflow.&nbsp;<a href="https://www.youtube.com/watch?v=s3JldKoA0zw">https://www.youtube.com/watch?v=s3JldKoA0zw</a>&nbsp;This two minute video will change your mind on reproducible research&nbsp;</p><p>2. Parallel sequencing lives, or what makes large sequencing projects successful&nbsp;<a href="https://academic.oup.com/gigascience/article/6/11/gix100/4557140?login=false">https://academic.oup.com/gigascience/article/6/11/gix100/4557140?login=false</a></p><p>3. Common-sense approaches to sharing tabular data alongside publication&nbsp;<a href="https://www.sciencedirect.com/science/article/pii/S2666389921002300">https://www.sciencedirect.com/science/article/pii/S2666389921002300</a></p><p>4. A Reproducible Data Analysis Workflow with R Markdown, Git, Make, and Docker&nbsp;<a href="https://psyarxiv.com/8xzqy/">https://psyarxiv.com/8xzqy/</a></p><p>5. Practical Computational Reproducibility in the Life Sciences&nbsp;<a href="https://www.cell.com/cell-systems/fulltext/S2405-4712(18)30140-6">https://www.cell.com/cell-systems/fulltext/S2405-4712(18)30140-6</a></p><p>6. A video by Dr.Keith A. Baggerly from MD Anderson [The Importance of Reproducible Research in High-Throughput Biology](<a href="https://www.youtube.com/watch?v=7gYIs7uYbMo">https://www.youtube.com/watch?v=7gYIs7uYbMo</a>) highly recommended.</p><p>7. Ten Simple Rules for Reproducible Computational Research&nbsp;<a href="http://journals.plos.org/ploscompbiol/article?id=10.1371/journal.pcbi.1003285">http://journals.plos.org/ploscompbiol/article?id=10.1371/journal.pcbi.1003285</a>)</p><p>8. Good Enough Practices in Scientific Computing&nbsp;<a href="http://arxiv.org/abs/1609.00037">http://arxiv.org/abs/1609.00037</a>&nbsp;</p><p>9. Best Practices for Scientific Computing&nbsp;<a href="https://journals.plos.org/plosbiology/article?id=10.1371/journal.pbio.1001745">https://journals.plos.org/plosbiology/article?id=10.1371/journal.pbio.1001745</a></p><p>10. A Quick Guide to Organizing Computational Biology Projects&nbsp;<a href="http://journals.plos.org/ploscompbiol/article?id=10.1371/journal.pcbi.100042">http://journals.plos.org/ploscompbiol/article?id=10.1371/journal.pcbi.100042</a>&nbsp; A must read for computational biologists!</p><p>11. Reproducibility of computational workflows is automated using continuous analysis&nbsp;<a href="https://www.nature.com/articles/nbt.3780">https://www.nature.com/articles/nbt.3780</a></p><p>12. Five selfish reasons to work reproducibly&nbsp;<a href="https://genomebiology.biomedcentral.com/articles/10.1186/s13059-015-0850-7">https://genomebiology.biomedcentral.com/articles/10.1186/s13059-015-0850-7</a></p>]]></description>
	<dc:creator>Abhi</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37576/lrcstats-a-tool-for-evaluating-long-reads-correction-methods</guid>
	<pubDate>Wed, 22 Aug 2018 11:05:04 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37576/lrcstats-a-tool-for-evaluating-long-reads-correction-methods</link>
	<title><![CDATA[LRCstats: a tool for evaluating long reads correction methods]]></title>
	<description><![CDATA[<p><span>LRCstats is an open-source pipeline for benchmarking DNA long read correction algorithms for long reads outputted by third generation sequencing technology such as machines produced by Pacific Biosciences. The reads produced by third generation sequencing technology, as the name suggests, are longer in length than reads produced by next generation sequencing technologies, such as those produced by Illumina. However, long reads are plagued by high error rates, which can cause issues in downstream analysis. Long read correction algorithms reduce the error rate of long reads either through self-correcting methods or using accurate, short reads outputted by next generation sequencing technologies to correct long reads.</span></p><p>Address of the bookmark: <a href="https://github.com/cchauve/lrcstats" rel="nofollow">https://github.com/cchauve/lrcstats</a></p>]]></description>
	<dc:creator>Aaryan Lokwani</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/44227/common-methods-to-discover-tandem-repeats</guid>
	<pubDate>Thu, 09 Mar 2023 02:40:52 -0600</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/44227/common-methods-to-discover-tandem-repeats</link>
	<title><![CDATA[Common methods to discover tandem repeats]]></title>
	<description><![CDATA[<div><div><div><div><div><div><div><div><div><div><p>Tandem repeats are DNA sequences that are repeated in a contiguous manner in the genome. These sequences are often used as genetic markers and are important in many areas of genetics and genomics research. Here are some methods for discovering tandem repeats in genomes:</p><ol>
<li>
<p>Tandem Repeat Finder: Tandem Repeat Finder is a software tool that identifies tandem repeats in DNA sequences. It is available for free download and can be used on both nucleotide and protein sequences. The tool uses a statistical algorithm to identify repeats based on their length, copy number, and overall composition.</p>
</li>
<li>
<p>RepeatMasker: RepeatMasker is another software tool that can identify tandem repeats in DNA sequences. It works by comparing the input sequence to a database of known repeats and then identifies any tandem repeats that match those in the database.</p>
</li>
<li>
<p>PCR-based methods: Polymerase chain reaction (PCR) can be used to amplify and detect tandem repeats in genomic DNA. PCR primers are designed to flank the tandem repeat region, and amplification of the target DNA fragment can be visualized on a gel. This method can be useful for detecting novel tandem repeats and for genotyping.</p>
</li>
<li>
<p>Southern blotting: Southern blotting is a classic method for detecting DNA fragments in a sample. It can be used to detect tandem repeats by digesting genomic DNA with a restriction enzyme, separating the fragments by gel electrophoresis, and then probing the blot with a tandem repeat-specific probe.</p>
</li>
</ol><p>Overall, a combination of these methods can be used to comprehensively identify tandem repeats in genomes.</p></div></div></div></div></div></div></div></div></div></div>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44327/homologizer-phylogenetic-phasing-of-gene-copies-into-polyploid-subgenomes</guid>
	<pubDate>Sat, 03 Jun 2023 19:19:10 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44327/homologizer-phylogenetic-phasing-of-gene-copies-into-polyploid-subgenomes</link>
	<title><![CDATA[homologizer: Phylogenetic phasing of gene copies into polyploid subgenomes]]></title>
	<description><![CDATA[<p dir="auto">This tutorial describes the usage of&nbsp;<code>homologizer</code>&nbsp;to phase gene copies into polyploid subgenomes. The tutorial is an abbreviated version of a soon-to-be published paper in Methods in Molecular Biology. Please see that paper for many more details and practical considerations for running&nbsp;<code>homologizer</code>&nbsp;analyses. If you use&nbsp;<code>homologizer</code>, please cite the paper in which we first describe the method:</p>
<ul dir="auto">
<li>Freyman, W.A., Johnson, M.G., and C.J. Rothfels. 2022. Homologizer: phylogenetic phasing of gene copies into polyploid subgenomes.&nbsp;<em>bioRxiv</em>&nbsp;<a href="https://www.biorxiv.org/content/10.1101/2020.10.22.351486v4">2020.10.22.351486v4</a></li>
</ul>
<p dir="auto"><code>homologizer</code>&nbsp;is implemented in&nbsp;<code>RevBayes</code>. Please see&nbsp;<a href="http://revbayes.com/">http://revbayes.com</a>&nbsp;to download and install&nbsp;<code>RevBayes</code>. For users without previous&nbsp;<code>RevBayes</code>&nbsp;experience, we recommend the tutorials at&nbsp;<a href="http://revbayes.com/">http://revbayes.com</a>.</p><p>Address of the bookmark: <a href="https://github.com/wf8/homologizer" rel="nofollow">https://github.com/wf8/homologizer</a></p>]]></description>
	<dc:creator>Abhi</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36360/dendropy-a-python-library-for-phylogenetic-computing</guid>
	<pubDate>Mon, 23 Apr 2018 05:49:50 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36360/dendropy-a-python-library-for-phylogenetic-computing</link>
	<title><![CDATA[DendroPy: a Python library for phylogenetic computing]]></title>
	<description><![CDATA[<p>DendroPy is a Python library for phylogenetic computing. It provides classes and functions for the simulation, processing, and manipulation of phylogenetic trees and character matrices, and supports the reading and writing of phylogenetic data in a range of formats, such as NEXUS, NEWICK, NeXML, Phylip, FASTA, etc. Application scripts for performing some useful phylogenetic operations, such as data conversion and tree posterior distribution summarization, are also distributed and installed as part of the libary. DendroPy can thus function as a stand-alone library for phylogenetics, a component of more complex multi-library phyloinformatic pipelines, or as a scripting &ldquo;glue&rdquo; that assembles and drives such pipelines.</p>
<p>The primary home page for DendroPy, with detailed tutorials and documentation, is at:</p>
<blockquote><div><a href="http://dendropy.org/">http://dendropy.org/</a></div></blockquote>
<p>DendroPy is also hosted in the official Python repository:</p>
<blockquote><div><a href="http://packages.python.org/DendroPy/">http://packages.python.org/DendroPy/</a></div></blockquote>
<div id="requirements-and-installation">
<h2>Requirements and Installation</h2>
<p>DendroPy 4.x runs under Python 3 (all versions &gt; 3.1) and Python 2 (Python 2.7 only).</p>
<p>You can install DendroPy by running:</p>
<pre>&nbsp;</pre>
<p>More information is available here:</p>
<blockquote><div><a href="http://dendropy.org/downloading.html">http://dendropy.org/downloading.html</a></div></blockquote>
</div>
<div id="documentation">
<h2>Documentation</h2>
<p>Full documentation is available here:</p>
<blockquote><div><a href="http://dendropy.org/">http://dendropy.org/</a></div></blockquote>
<p>This includes:</p>
<blockquote>
<ul>
<li><a href="http://dendropy.org/primer/index.html">A comprehensive &ldquo;getting started&rdquo; primer</a>&nbsp;.</li>
<li><a href="http://dendropy.org/library/index.html">API documentation</a>&nbsp;.</li>
<li><a href="http://dendropy.org/schemas/index.html">Descriptions of data formats supported for reading/writing</a>&nbsp;.</li>
</ul>
</blockquote>
<p>and more.</p>
</div><p>Address of the bookmark: <a href="https://pypi.org/project/DendroPy/" rel="nofollow">https://pypi.org/project/DendroPy/</a></p>]]></description>
	<dc:creator>Seema Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44513/mike-an-ultrafast-assembly-and-alignment-free-approach-for-phylogenetic-tree-construction</guid>
	<pubDate>Mon, 08 Apr 2024 06:19:52 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44513/mike-an-ultrafast-assembly-and-alignment-free-approach-for-phylogenetic-tree-construction</link>
	<title><![CDATA[MIKE: an ultrafast, assembly-, and alignment-free approach for phylogenetic tree construction]]></title>
	<description><![CDATA[<p><span>MIKE (MinHash-based&nbsp;</span><em>k</em><span>-mer algorithm). This algorithm is designed for the swift calculation of the Jaccard coefficient directly from raw sequencing reads and enables the construction of phylogenetic trees based on the resultant Jaccard coefficient. Simulation results highlight the superior speed of MIKE compared to existing state-of-the-art methods. We used MIKE to reconstruct a phylogenetic tree, incorporating 238 yeast, 303&nbsp;</span><em>Zea</em><span>, 141&nbsp;</span><em>Ficus</em><span>, 67&nbsp;</span><em>Oryza</em><span>, and 43&nbsp;</span><em>Saccharum spontaneum</em><span>&nbsp;samples. MIKE demonstrated accurate performance across varying evolutionary scales, reproductive modes, and ploidy levels, proving itself as a powerful tool for phylogenetic tree construction.</span></p><p>Address of the bookmark: <a href="https://github.com/Argonum-Clever2/mike" rel="nofollow">https://github.com/Argonum-Clever2/mike</a></p>]]></description>
	<dc:creator>Abhi</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37233/rna-seq-analysis-workshop-course-materials</guid>
	<pubDate>Tue, 03 Jul 2018 08:14:14 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37233/rna-seq-analysis-workshop-course-materials</link>
	<title><![CDATA[RNA-seq Analysis Workshop Course Materials]]></title>
	<description><![CDATA[RNAseq can be roughly divided into two "types":

Reference genome-based - an assembled genome exists for a species for which an RNAseq experiment is performed. It allows reads to be aligned against the reference genome and significantly improves our ability to reconstruct transcripts. This category would obviously include humans and most model organisms but excludes the majority of truly biologically intereting species (e.g., Hyacinth macaw);

Reference genome-free - no genome assembly for the species of interest is available. In this case one would need to assemble the reads into transcripts using de novo approaches. This type of RNAseq is as much of an art as well as science because assembly is heavily parameter-dependent and difficult to do well.
In this lesson we will focus on the Reference genome-based type of RNA seq.

http://chagall.med.cornell.edu/RNASEQcourse/<p>Address of the bookmark: <a href="http://chagall.med.cornell.edu/RNASEQcourse/" rel="nofollow">http://chagall.med.cornell.edu/RNASEQcourse/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>