<?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/44472?offset=40</link>
	<atom:link href="https://bioinformaticsonline.com/related/44472?offset=40" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/44707/rna-seq-analysis-a-guide-for-bioinformaticians</guid>
	<pubDate>Sat, 07 Dec 2024 22:22:24 -0600</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/44707/rna-seq-analysis-a-guide-for-bioinformaticians</link>
	<title><![CDATA[RNA-Seq Analysis: A Guide for Bioinformaticians]]></title>
	<description><![CDATA[<p>RNA sequencing (RNA-Seq) has revolutionized transcriptomics, offering unprecedented insights into gene expression, splicing, and transcript diversity. For bioinformaticians, RNA-Seq analysis is a gateway to exploring the complexity of RNA biology and its implications in health and disease. This blog post provides an overview of RNA-Seq analysis, key computational steps, and tools for bioinformaticians eager to delve into this powerful technique.</p><h3>What is RNA-Seq?</h3><p>RNA-Seq is a next-generation sequencing (NGS) technology used to study the transcriptome&mdash;the complete set of RNA molecules in a cell. It quantifies gene expression, detects novel transcripts, and captures alternative splicing events with high sensitivity and resolution.</p><h3>Workflow for RNA-Seq Analysis</h3><p>RNA-Seq analysis involves several stages, each requiring computational tools and expertise.</p><h4>1. <strong>Experimental Design and Data Acquisition</strong></h4><p>Before diving into analysis, bioinformaticians should consider:</p><ul>
<li><strong>Biological Replicates</strong>: Ensure statistical power to detect meaningful differences.</li>
<li><strong>Sequencing Depth</strong>: Align sequencing depth to study objectives (e.g., higher depth for low-abundance transcripts).</li>
<li><strong>Paired-End vs. Single-End</strong>: Paired-end sequencing provides more detailed information on transcript structure.</li>
</ul><p>Once sequencing is complete, raw data is provided in FASTQ format, containing sequence reads and quality scores.</p><h4>2. <strong>Quality Control and Preprocessing</strong></h4><p>Quality control (QC) ensures data integrity. Tools such as <strong>FastQC</strong> evaluate metrics like base quality, GC content, and adapter contamination.</p><p><strong>Preprocessing Steps</strong>:</p><ul>
<li><strong>Trimming</strong>: Tools like <strong>Trimmomatic</strong> or <strong>Cutadapt</strong> remove low-quality bases and adapter sequences.</li>
<li><strong>Filtering</strong>: Discard reads below a certain quality threshold or length.</li>
</ul><h4>3. <strong>Read Alignment</strong></h4><p>Reads are mapped to a reference genome or transcriptome to determine their origin. Alignment tools include:</p><ul>
<li><strong>HISAT2</strong>: Handles large genomes efficiently and supports spliced alignments.</li>
<li><strong>STAR</strong>: High-speed aligner optimized for RNA-Seq.</li>
<li><strong>Bowtie2</strong>: Suitable for short-read alignment.</li>
</ul><p><strong>Output</strong>: A SAM/BAM file containing aligned reads.</p><h4>4. <strong>Transcript Assembly and Quantification</strong></h4><p>This step involves identifying transcripts and quantifying their expression levels. Tools used include:</p><ul>
<li><strong>StringTie</strong>: Assembles and quantifies transcripts from aligned reads.</li>
<li><strong>Salmon/Kallisto</strong>: Perform pseudo-alignment for rapid and accurate quantification.</li>
</ul><p>Expression levels are typically measured as TPM (transcripts per million) or FPKM (fragments per kilobase of transcript per million mapped reads).</p><h4>5. <strong>Differential Expression Analysis</strong></h4><p>To identify genes with altered expression between conditions, bioinformaticians use tools such as:</p><ul>
<li><strong>DESeq2</strong>: Accounts for data normalization and variability.</li>
<li><strong>edgeR</strong>: Handles overdispersed count data efficiently.</li>
<li><strong>Limma-voom</strong>: Combines linear modeling with RNA-Seq count data.</li>
</ul><p>The output includes a list of differentially expressed genes (DEGs) with statistical significance and fold-change values.</p><h4>6. <strong>Functional Annotation and Pathway Analysis</strong></h4><p>Understanding the biological significance of DEGs involves:</p><ul>
<li><strong>Gene Ontology (GO) Analysis</strong>: Tools like <strong>DAVID</strong> or <strong>clusterProfiler</strong> categorize genes based on their biological functions.</li>
<li><strong>Pathway Enrichment Analysis</strong>: Identifies pathways enriched in DEGs using tools like <strong>KEGG</strong>, <strong>Reactome</strong>, or <strong>GSEA</strong>.</li>
</ul><h4>7. <strong>Visualization</strong></h4><p>Visualizing results enhances interpretability. Common visualizations include:</p><ul>
<li><strong>Heatmaps</strong>: Show expression patterns across samples (e.g., <strong>pheatmap</strong>).</li>
<li><strong>Volcano Plots</strong>: Highlight significant DEGs (e.g., <strong>ggplot2</strong>).</li>
<li><strong>PCA/UMAP</strong>: Assess sample clustering and variability (e.g., <strong>Seurat</strong>).</li>
</ul><h3>Challenges in RNA-Seq Analysis</h3><ol>
<li><strong>Batch Effects</strong>: Technical variability can confound biological signals. Combat this with normalization techniques or batch-correction tools like <strong>ComBat</strong>.</li>
<li><strong>Low-Quality Samples</strong>: Poor-quality RNA impacts downstream analyses.</li>
<li><strong>Computational Complexity</strong>: RNA-Seq generates massive datasets, requiring robust computing resources and optimized pipelines.</li>
</ol><h3>Key Tools and Resources</h3><ul>
<li><strong>Bioconductor</strong>: A treasure trove of R packages for RNA-Seq analysis.</li>
<li><strong>Galaxy</strong>: A web-based platform for running RNA-Seq workflows.</li>
<li><strong>Nextflow/Snakemake</strong>: Workflow management tools to streamline analyses.</li>
</ul><h3>Applications of RNA-Seq</h3><p>RNA-Seq is used in diverse research areas, including:</p><ul>
<li><strong>Cancer Transcriptomics</strong>: Identifying tumor-specific expression profiles.</li>
<li><strong>Developmental Biology</strong>: Studying dynamic transcriptome changes.</li>
<li><strong>Drug Discovery</strong>: Screening genes modulated by therapeutic compounds.</li>
</ul><h3>Conclusion</h3><p>RNA-Seq analysis is a cornerstone of modern transcriptomics, offering bioinformaticians a versatile toolkit for unraveling gene expression and regulation. Mastering RNA-Seq workflows and tools empowers researchers to transform raw sequencing data into biological discoveries.</p><p>Whether you&rsquo;re investigating disease mechanisms, exploring cellular pathways, or developing new therapeutics, RNA-Seq is a powerful ally in your bioinformatics arsenal.</p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/34916/bioinformatics-tools-developed-for-oxford-nanopore-data-analysis</guid>
	<pubDate>Wed, 27 Dec 2017 20:47:30 -0600</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/34916/bioinformatics-tools-developed-for-oxford-nanopore-data-analysis</link>
	<title><![CDATA[Bioinformatics tools developed for Oxford Nanopore data analysis !]]></title>
	<description><![CDATA[<p><span>MinION is the only portable real-time device for DNA and RNA&nbsp;</span><span>sequencing</span><span>. Each consumable flow cell can now generate 10&ndash;20 Gb of DNA&nbsp;</span><span>sequence</span><span>&nbsp;data. Ultra-</span><span>long read lengths are possible (hundreds of kb) as you can choose your fragment length.&nbsp;</span>One of the technical advantages of ONT data is the read length, which offers great prospects for genome assembly. Generally, assemblers are based on several different types of algorithms, such as greedy, overlap-layout-consensus (OLC), de Bruijn graph (DBG), and string graph.</p><p><span>List of analysis tools developed for Oxford Nanopore data</span></p><p>BWA <br />Fast nanopore data tuned alignment tool <br />https://github.com/lh3/bwa</p><p>GraphMap<br />Mapper for long and error-prone reads<br />https://github.com/isovic/graphmap</p><p>LAST<br />Nanopore tuned alignment tool<br />http://last.cbrc.jp/</p><p>LINKS<br />Software tool for long read scaffolding <br />https://github.com/warrenlr/LINKS/</p><p>marginAlign<br />Tools to align nanopore reads to a reference<br />https://github.com/benedictpaten/marginAlign</p><p>minoTour<br />Real time analysis tools<br />http://minotour.nottingham.ac.uk/</p><p>nanoCORR<br />Error-correction tool for nanopore sequence data<br />https://github.com/jgurtowski/nanocorr</p><p>NanoOK<br />Software for nanopore data, quality and error profiles<br />https://documentation.tgac.ac.uk/display/NANOOK/NanoOK</p><p>Nanopolish<br />Nanopore analysis and genome assembly software<br />https://github.com/jts/nanopolish</p><p>nanopore<br />Variant-detection tool for nanopore sequence data<br />https://github.com/mitenjain/nanopore</p><p>Nanocorrect<br />Error-correction tool for nanopore sequence data<br />https://github.com/jts/nanocorrect/</p><p>npReader<br />Real-time conversion and analysis of nanopore reads<br />https://github.com/mdcao/npReader</p><p>poRe<br />Tool for analyzing and visualizing nanopore data<br />https://sourceforge.net/p/rpore/wiki/Home/</p><p>PoreSeq<br />Error-correction and variant-calling software<br />https://github.com/tszalay/poreseq</p><p>Poretools<br />Nanopore sequence analysis and visualization software <br />https://github.com/arq5x/poretools</p><p>SSPACE-LongRead<br />Genome scaffolding tool <br />http://www.baseclear.com/genomics/bioinformatics/basetools/SSPACE-longread</p><p>SMIS<br />Genome scaffolding tool <br />https://sourceforge.net/projects/phusion2/files/smis/</p><p>&nbsp;</p><p>List of assemblers for Oxford Nanopore MinION long reads</p><p>LQS<br />DALIGNER, Celera OLC Nanocorrect, <br />Nanopolish corrector<br />https://github.com/jts/nanopolish</p><p>PBcR<br />HGAP or BLASR, Celera OLC <br />PBcR corrector<br />http://wgs-assembler.sourceforge.net/wiki/index.php/PBcR<br /> &ndash;<br />Canu<br />MHAP, Celera OLC <br />Canu corrector<br />https://github.com/marbl/canu</p><p>Falcon<br />String graph, Celera OLC <br />Falcon corrector<br />https://github.com/PacificBiosciences/falcon</p><p>Miniasm <br />OLC<br />https://github.com/lh3/miniasm</p><p>ra-integrate<br />OLC<br />https://github.com/mariokostelac/ra-integrate/</p><p>ALLPATHS-LG<br />de Bruijn graph <br />ALLPATHS-L corrector<br />https://www.broadinstitute.org/software/allpaths-lg/blog/?page_id=12</p><p>SPAdes <br />de Bruijn graph <br />SPAdes corrector<br />http://bioinf.spbau.ru/spades</p>]]></description>
	<dc:creator>biogeek</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/40882/troyanskaya-lab</guid>
  <pubDate>Tue, 04 Feb 2020 06:40:36 -0600</pubDate>
  <link></link>
  <title><![CDATA[Troyanskaya Lab]]></title>
  <description><![CDATA[
<p>The goal of our research is to interpret and distill this complexity through accurate analysis and modeling of molecular pathways, particularly those in which malfunctions lead to the manifestation of disease. We are inventing integrative methods for systems-level pathway modeling through integrative analysis of genome-scale datasets. We apply these approaches in studying challenging biological problems, such as how pathways function in diverse cell types and how they change dynamically.</p>

<p>https://function.princeton.edu/</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42130/shaman-a-user-friendly-website-for-metataxonomic-analysis-from-raw-reads-to-statistical-analysis</guid>
	<pubDate>Mon, 17 Aug 2020 05:21:09 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42130/shaman-a-user-friendly-website-for-metataxonomic-analysis-from-raw-reads-to-statistical-analysis</link>
	<title><![CDATA[SHAMAN: a user-friendly website for metataxonomic analysis from raw reads to statistical analysis]]></title>
	<description><![CDATA[<p><span>SHAMAN is a shiny application for differential analysis of metagenomic data (16S, 18S, 23S, 28S, ITS and WGS) including bioinformatics treatment of raw reads for targeted metagenomics, statistical analysis and results visualization with a large variety of plots (barplot, boxplot, heatmap, &hellip;).</span><br><span>The bioinformatics treatment is based on Vsearch [</span><a href="http://www.ncbi.nlm.nih.gov/pubmed/27781170">Rognes 2016</a><span>] which showed to be both accurate and fast [</span><a href="http://www.ncbi.nlm.nih.gov/pubmed/26664811">Wescott 2015</a><span>].The statistical analysis is based on DESeq2 R package [</span><a href="http://www.ncbi.nlm.nih.gov/pubmed/20979621">Anders and Huber 2010</a><span>] which robustly identifies the differential abundant features as suggested in [</span><a href="http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3974642/">McMurdie and Holmes 2014</a><span>] and [</span><a href="http://www.ncbi.nlm.nih.gov/pmc/articles/PMC4727335/">Jonsson2016</a><span>]. SHAMAN robustly identifies the differential abundant genera with the Generalized Linear Model implemented in DESeq2 [</span><a href="http://www.ncbi.nlm.nih.gov/pubmed/25516281">Love 2014</a><span>].</span><br><span>SHAMAN is compatible with standard formats for metagenomic analysis (.csv, .tsv, .biom) and figures can be downloaded in several formats. A presentation about SHAMAN is available&nbsp;</span><a href="https://github.com/aghozlane/shaman/blob/master/www/shaman_presentation.pdf">here</a><span>&nbsp;and a poster&nbsp;</span><a href="https://github.com/aghozlane/shaman/blob/master/www/shaman_poster.pdf">here</a><span>.&nbsp;</span></p>
<p><span>More at&nbsp;<a href="https://bmcbioinformatics.biomedcentral.com/articles/10.1186/s12859-020-03666-4">https://bmcbioinformatics.biomedcentral.com/articles/10.1186/s12859-020-03666-4</a></span></p><p>Address of the bookmark: <a href="https://github.com/aghozlane/shaman" rel="nofollow">https://github.com/aghozlane/shaman</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/44734/data-visualization-in-bioinformatics-useful-and-eye-catching-plots-for-data-analysis</guid>
	<pubDate>Sat, 14 Dec 2024 12:41:53 -0600</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/44734/data-visualization-in-bioinformatics-useful-and-eye-catching-plots-for-data-analysis</link>
	<title><![CDATA[Data Visualization in Bioinformatics: Useful and Eye-Catching Plots for Data Analysis]]></title>
	<description><![CDATA[<p>Data visualization is a cornerstone of bioinformatics, enabling researchers to interpret complex datasets effectively. With a plethora of data types&mdash;genomic sequences, expression profiles, protein interactions, and more&mdash;the right visualizations can make or break an analysis. This blog highlights some of the most useful and visually compelling plots for bioinformatics data analysis, along with tools to create them.</p><h4><strong>1. Heatmaps: Exploring Patterns in High-Dimensional Data</strong></h4><p>Heatmaps are a go-to visualization for representing high-dimensional datasets, such as gene expression or metabolomics data. They use color gradients to display data intensity, making patterns and clusters easily detectable.</p><ul>
<li>
<p><strong>Applications</strong>: Gene expression analysis, pathway enrichment, methylation studies.</p>
</li>
<li>
<p><strong>Tools</strong>: Seaborn (Python), ComplexHeatmap (R), Morpheus (web-based).</p>
</li>
</ul><p><strong>Tip</strong>: Add dendrograms to visualize clustering of rows and columns for hierarchical relationships.</p><h4><strong>2. Volcano Plots: Highlighting Differential Features</strong></h4><p>Volcano plots are indispensable for identifying significantly differentially expressed genes or proteins. They plot the log2 fold change against &ndash;log10(p-value), making it easy to spot statistically significant changes.</p><ul>
<li>
<p><strong>Applications</strong>: RNA-seq, proteomics, and metabolomics.</p>
</li>
<li>
<p><strong>Tools</strong>: ggplot2 (R), EnhancedVolcano (R), Plotly (Python).</p>
</li>
</ul><p><strong>Tip</strong>: Use color to highlight significant features and label key genes or proteins.</p><h4><strong>3. PCA Plots: Reducing Complexity with Principal Component Analysis</strong></h4><p>Principal Component Analysis (PCA) plots are used to reduce dimensionality and uncover trends or clusters in data. They provide insights into sample variability and grouping.</p><ul>
<li>
<p><strong>Applications</strong>: Transcriptomics, metabolomics, microbiome studies.</p>
</li>
<li>
<p><strong>Tools</strong>: scikit-learn + Matplotlib (Python), prcomp (R), ClustVis (web-based).</p>
</li>
</ul><p><strong>Tip</strong>: Annotate clusters with metadata to enhance interpretability.</p><h4><strong>4. Manhattan Plots: Genome-Wide Association Studies</strong></h4><p>Manhattan plots visualize p-values across the genome, making it easy to identify significant associations in genome-wide studies. They resemble city skylines, with the highest peaks indicating loci of interest.</p><ul>
<li>
<p><strong>Applications</strong>: GWAS, QTL mapping.</p>
</li>
<li>
<p><strong>Tools</strong>: qqman (R), Matplotlib (Python).</p>
</li>
</ul><p><strong>Tip</strong>: Use alternating colors for chromosomes and highlight significant SNPs for clarity.</p><h4><strong>5. Circular Plots (Circos): Visualizing Genomic Relationships</strong></h4><p>Circular plots are ideal for visualizing relationships across the genome, such as structural variations, gene duplications, or synteny.</p><ul>
<li>
<p><strong>Applications</strong>: Comparative genomics, structural variation studies.</p>
</li>
<li>
<p><strong>Tools</strong>: Circos (standalone), Rcircos (R), pyCircos (Python).</p>
</li>
</ul><p><strong>Tip</strong>: Keep the plot clean and avoid overcrowding to maintain readability.</p><h4><strong>6. Sankey Diagrams: Tracking Data Flows</strong></h4><p>Sankey diagrams visualize flows or relationships between categories, often used to track changes in gene expression or pathway enrichment across conditions.</p><ul>
<li>
<p><strong>Applications</strong>: Pathway analysis, gene set enrichment analysis.</p>
</li>
<li>
<p><strong>Tools</strong>: Plotly (Python), networkD3 (R).</p>
</li>
</ul><p><strong>Tip</strong>: Use gradients or distinct colors to highlight key transitions.</p><h4><strong>7. Network Graphs: Mapping Interactions</strong></h4><p>Network graphs represent relationships between entities, such as protein-protein interactions or gene regulatory networks. Nodes represent entities, and edges represent relationships.</p><ul>
<li>
<p><strong>Applications</strong>: Systems biology, interactomics.</p>
</li>
<li>
<p><strong>Tools</strong>: Cytoscape (standalone), igraph (R), NetworkX (Python).</p>
</li>
</ul><p><strong>Tip</strong>: Use edge thickness or node size to represent interaction strength or centrality.</p><h4><strong>8. Violin Plots: Visualizing Data Distribution</strong></h4><p>Violin plots combine a boxplot with a density plot, showing the distribution and variability of data.</p><ul>
<li>
<p><strong>Applications</strong>: Single-cell RNA-seq, quantitative trait analysis.</p>
</li>
<li>
<p><strong>Tools</strong>: Seaborn (Python), ggplot2 (R).</p>
</li>
</ul><p><strong>Tip</strong>: Split violins by groups for side-by-side comparisons.</p><h4><strong>9. Time-Series Plots: Monitoring Changes Over Time</strong></h4><p>Time-series plots display changes in variables across time points, useful for tracking gene expression dynamics or metabolic fluxes.</p><ul>
<li>
<p><strong>Applications</strong>: Time-course experiments, cell cycle studies.</p>
</li>
<li>
<p><strong>Tools</strong>: Matplotlib (Python), ggplot2 (R).</p>
</li>
</ul><p><strong>Tip</strong>: Smooth the data to highlight trends while avoiding overfitting.</p><h4><strong>10. Genome Tracks: Visualizing Genomic Features</strong></h4><p>Genome tracks display multiple layers of genomic data, such as gene annotations, sequencing coverage, and epigenetic marks.</p><ul>
<li>
<p><strong>Applications</strong>: ChIP-seq, ATAC-seq, whole-genome sequencing.</p>
</li>
<li>
<p><strong>Tools</strong>: IGV (standalone), pyGenomeTracks (Python).</p>
</li>
</ul><p><strong>Tip</strong>: Stack related tracks for direct comparisons.</p><h4><strong>11. UpSet Plots: Visualizing Set Intersections</strong></h4><p>UpSet plots are a powerful alternative to Venn diagrams for visualizing intersections between multiple datasets.</p><ul>
<li>
<p><strong>Applications</strong>: Overlap analysis for gene sets, pathways, or variants.</p>
</li>
<li>
<p><strong>Tools</strong>: UpSetR (R), ComplexUpset (Python).</p>
</li>
</ul><p><strong>Tip</strong>: Use bar plots to represent the size of each intersection for added clarity.</p><h4><strong>12. Ridge Plots: Comparing Distributions</strong></h4><p>Ridge plots visualize the distributions of multiple datasets, stacked for easy comparison.</p><ul>
<li>
<p><strong>Applications</strong>: Transcriptomics, single-cell RNA-seq.</p>
</li>
<li>
<p><strong>Tools</strong>: ggridges (R), Matplotlib (Python).</p>
</li>
</ul><p><strong>Tip</strong>: Use transparency and consistent scaling for better readability.</p><h4><strong>13. Chord Diagrams: Visualizing Connections Between Groups</strong></h4><p>Chord diagrams illustrate relationships between categories, such as shared genes between pathways or overlaps in regulatory elements.</p><ul>
<li>
<p><strong>Applications</strong>: Pathway overlap, synteny, co-expression networks.</p>
</li>
<li>
<p><strong>Tools</strong>: Circlize (R), Holoviews (Python).</p>
</li>
</ul><p><strong>Tip</strong>: Use distinct colors for each group to emphasize relationships.</p><h4><strong>14. Treemaps: Hierarchical Data Representation</strong></h4><p>Treemaps visualize hierarchical data as nested rectangles, with area proportional to data size.</p><ul>
<li>
<p><strong>Applications</strong>: Ontology enrichment, pathway analysis.</p>
</li>
<li>
<p><strong>Tools</strong>: Treemapify (R), Plotly (Python).</p>
</li>
</ul><p><strong>Tip</strong>: Use colors to represent additional variables, like significance or enrichment scores.</p><h4><strong>15. T-SNE/UMAP Plots: Dimensionality Reduction for Clustering</strong></h4><p>T-SNE and UMAP plots are great for visualizing high-dimensional data in two dimensions while preserving local or global structure.</p><ul>
<li>
<p><strong>Applications</strong>: Single-cell transcriptomics, clustering analyses.</p>
</li>
<li>
<p><strong>Tools</strong>: scikit-learn (Python), Seurat (R).</p>
</li>
</ul><p><strong>Tip</strong>: Combine with metadata annotations for better cluster interpretation.</p><h4><strong>Bringing It All Together</strong></h4><p>The choice of visualization can significantly impact the insights gained from bioinformatics data. By selecting plots tailored to your data type and analysis goals, you can effectively communicate your findings and make your research more impactful. Whether you&rsquo;re a seasoned bioinformatician or a beginner, mastering these visualizations will elevate your analyses and presentations.</p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/33306/ancestral-sequence-reconstruction-asr-or-ancestral-genesequence-reconstructionresurrection-tools-to-study-molecular-evolution</guid>
	<pubDate>Tue, 30 May 2017 04:20:05 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/33306/ancestral-sequence-reconstruction-asr-or-ancestral-genesequence-reconstructionresurrection-tools-to-study-molecular-evolution</link>
	<title><![CDATA[Ancestral sequence reconstruction (ASR) or ancestral gene/sequence reconstruction/resurrection tools to study molecular evolution]]></title>
	<description><![CDATA[<p><span><strong>Ancestral sequence reconstruction</strong><span>&nbsp;(</span><strong>ASR</strong><span>) &ndash; also known as&nbsp;</span><strong>ancestral gene</strong><span>/</span><strong>sequence reconstruction</strong><span>/</span><strong>resurrection</strong><span>&nbsp;&ndash; is a technique used in the study of&nbsp;</span>molecular evolution<span>. The method consists of the synthesis of an ancestral&nbsp;</span>gene<span>&nbsp;and expression of the corresponding ancestral&nbsp;</span>protein<span>.&nbsp;</span><sup id="cite_ref-thornton_1-0"><a href="https://en.wikipedia.org/wiki/Ancestral_sequence_reconstruction#cite_note-thornton-1"></a></sup><span>The idea of protein 'resurrection' was suggested in 1963 by Pauling and Zuckerkandl.</span><sup id="cite_ref-2"><a href="https://en.wikipedia.org/wiki/Ancestral_sequence_reconstruction#cite_note-2"></a></sup><span>&nbsp;Some early efforts were made in the eighties-nineties, led by the laboratory of&nbsp;</span>Steven A. Benner<span>, showing the potential of this technique &ndash; one that only started to be fulfilled in the post-genomic era.</span><sup id="cite_ref-3"><a href="https://en.wikipedia.org/wiki/Ancestral_sequence_reconstruction#cite_note-3"></a></sup><span>&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.</span><sup id="cite_ref-4"><a href="https://en.wikipedia.org/wiki/Ancestral_sequence_reconstruction#cite_note-4"></a></sup><span>&nbsp;Over the last decade, ancestral protein resurrection has developed as a strategy to reveal the mechanisms and dynamics of protein evolution.&nbsp;</span></span></p><p><img src="https://upload.wikimedia.org/wikipedia/commons/thumb/e/e4/ASR_phylogeny.png/510px-ASR_phylogeny.png" alt="image" width="610" height="435" style="border: 0px; border: 0px;"></p><p><span>Following are the list of&nbsp;</span><strong style="font-size: 12.8px;">Ancestral /sequence/ reconstruction</strong><span>&nbsp;(</span><strong style="font-size: 12.8px;">ASR</strong><span>) tools:&nbsp;</span></p><p><a href="http://www.bx.psu.edu/miller_lab/car/" target="_blank" title="To inferCars official website"><span>inferCars</span></a></p><p><span><span><span><span><span>Reconstructs contiguous regions of an ancestral genome. Given information about adjacencies between conserved segments in each modern species, our goal is to infer segment order in the ancestral genome. To get a clean and precise statement of the problem, we formalize it using graph theory. We develop an algorithm that identifies a most parsimonious scenario for the history of each individual adjacency, although the whole-genome prediction is not guaranteed to optimize traditional measures like the number of breakpoints. We introduce weights to the graph edges to model the reliability of each adjacency.</span></span></span></span></span></p><p><span><span><a href="http://paleogenomics.irmacs.sfu.ca/ANGES/" target="_blank" title="To ANGES official website">ANGES</a>:</span><a href="http://paleogenomics.irmacs.sfu.ca/ANGES/" target="_blank" title="To ANGES official website">reconstructing ANcestral GEnomeS maps</a></span></p><p><span><span><span><span><span><span>A suite of Python programs that allows reconstructing ancestral genome maps from the comparison of the organization of extant-related genomes. ANGES can reconstruct ancestral genome maps for multichromosomal linear genomes and unichromosomal circular genomes. It implements methods inspired from techniques developed to compute physical maps of extant genomes.</span></span></span></span></span></span></p><p><a href="http://virulence.molgen.mpg.de/cocos/" target="_blank" title="To Cocos official website"><span>Cocos</span></a></p><p><span><span><span><span><span><span><span>Constructs phylogenies of multi-domain proteins. With a given species tree and domain phylogenies, the procedure infers the composition of ancestral multi-domain proteins. Cocos implements and extend a suggested algorithmic approach by Behzadi and Vingron in an easy-to-use program. Such method could be applied to reconstruction of partial homologous units such as bacterial operons or protein complexes.</span></span></span></span></span></span></span></p><p><a href="https://github.com/msrosenberg/MySSP" target="_blank" title="To MySSP official website"><span>MySSP</span></a></p><p><span><span><span><span><span><span><span><span>Constructs an initial DNA sequence at the root of the tree and simulates evolution across the tree using a variety of common models of DNA evolution. MySSP is a program for the simulation of DNA sequence evolution across a phylogenetic tree. It is designed for large-scale studies, including simulation of multiple replicates and outputs sequences into NEXUS, MEGA, or FASTA formats. MySSP has a fairly simple graphical user interface (GUI) for basic use, but also has a specialized batch script interpreter to allow for more complicated or large-scale simulations.</span></span></span></span></span></span></span></span></p><p><span><span><a href="http://www.cs.cmu.edu/~ckingsf/software/parana/" target="_blank" title="To PARANA official website">PARANA</a>:&nbsp;</span><a href="http://www.cs.cmu.edu/~ckingsf/software/parana/" target="_blank" title="To PARANA official website">Parsimonious Ancestral Reconstruction And Network Analysis</a></span></p><p><span><span><span><span><span><span><span><span><span>Performs parsimony based inference of ancestral biological networks. Given multiple extant networks and phylogenetic information relating extant nodes, PARANA finds a parsimonious set of ancestral interaction events (edge gains and losses) which explain the extant networks. The framework adopted by PARANA is able to represent network evolution under models that support gene duplication and loss and independent interaction gain and loss. The method works on both directed and undirected networks and can incorporate asymmetric interaction gain and loss costs. In contrast to previous approaches, PARANA does not require knowing the relative ordering of unrelated duplication events and thus, works on phylogenetic trees even where branch lengths are not provided.</span></span></span></span></span></span></span></span></span></p><p><span><span><a href="http://www-labs.iro.umontreal.ca/~mabrouk/" target="_blank" title="To GapAdj official website">GapAdj</a>:&nbsp;</span><a href="http://www-labs.iro.umontreal.ca/~mabrouk/" target="_blank" title="To GapAdj official website">Gapped Adjacencies</a></span></p><p><span><span><span><span><span><span><span><span><span><span>A synteny-based method that is flexible enough to handle a model of evolution involving whole genome duplication events, in addition to rearrangements, gene insertions, and losses. Ancestral relationships between markers are defined in term of Gapped Adjacencies, i.e. pairs of markers separated by up to a given number of markers. It improves on a previous restricted to direct adjacencies, which revealed a high accuracy for adjacency prediction, but with the drawback of being overly conservative, i.e. of generating a large number of contiguous ancestral regions (CARs).</span></span></span></span></span></span></span></span></span></span></p><p><a href="http://ancestors.bioinfo.uqam.ca/"><span><span><span><span><span><span><span><span><span><span>ANCESTOR</span></span></span></span></span></span></span></span></span></span></a></p><p><span><span><span><span><span><span><span><span><span><span><span>A web server allowing one to easily and quickly perform the last three steps of the ancestral genome reconstruction procedure. Ancestors implements several alignment algorithms, an indel maximum likelihood solver and a context-dependent maximum likelihood substitution inference algorithm. The results presented by the server include the posterior probabilities for the last two steps of the ancestral genome reconstruction and the expected error rate of each ancestral base prediction.</span></span></span></span></span></span></span></span></span></span></span></p><p><a href="http://bioinfo.lifl.fr/procars/" target="_blank" title="To ProCARs official website"><span>ProCARs</span></a></p><p>Reconstructs ancestral gene orders as contiguous ancestral regions (CARs) with a progressive homology-based method. ProCARs runs from a phylogeny tree (without branch lengths needed) with a marked ancestor and a block file. This homology-based method is based on iteratively detecting and assembling ancestral adjacencies, while allowing some micro-rearrangements of synteny blocks at the extremities of the progressively assembled CARs. The method starts with a set of blocks as the initial set of CARs, and detects iteratively the potential ancestral adjacencies between extremities of CARs, while building up the CARs progressively by adding, at each step, new non-conflicting adjacencies that induce the less homoplasy phenomenon. The species tree is used, in some additional internal steps, to compute a score for the remaining conflicting adjacencies, and to detect other reliable adjacencies, in order to reach completely assembled ancestral genomes.</p><p><a href="http://fastml.tau.ac.il/" target="_blank" title="To FastML official website"><span>FastML</span></a></p><p>A user-friendly tool for the reconstruction of ancestral sequences. FastML implements various novel features that differentiate it from existing tools: (i) FastML uses an indel-coding method, in which each gap, possibly spanning multiples sites, is coded as binary data. FastML then reconstructs ancestral indel states assuming a continuous time Markov process. FastML provides the most likely ancestral sequences, integrating both indels and characters; (ii) FastML accounts for uncertainty in ancestral states: it provides not only the posterior probabilities for each character and indel at each sequence position, but also a sample of ancestral sequences from this posterior distribution, and a list of the k-most likely ancestral sequences; (iii) FastML implements a large array of evolutionary models, which makes it generic and applicable for nucleotide, protein and codon sequences; and (iv) a graphical representation of the results is provided, including, for example, a graphical logo of the inferred ancestral sequences.</p><p><a href="http://rth.dk/resources/maxAlike/" target="_blank" title="To maxAlike official website"><span>maxAlike</span></a></p><p>Reconstructs a genomic sequence for a specific taxon based on sequence homologs in other species. The input is a multiple sequence alignment and a phylogenetic tree that also contains the target species. For this target species, the algorithm computes nucleotide probabilities at each sequence position. Consensus sequences are then reconstructed based on a certain confidence level.</p><p><span><span><a href="http://www.geneorder.org/server.php" target="_blank" title="To MLGO official website">MLGO</a>:&nbsp;</span><a href="http://www.geneorder.org/server.php" target="_blank" title="To MLGO official website">Maximum Likelihood for Gene Order Analysis</a></span></p><p>A web tool for the reconstruction of phylogeny and/or ancestral genomes from gene-order data. MLGO was designed for analysis of large-scale genomic changes including not only rearrangements but also gene insertions, deletions and duplications. MLGO can be used to infer a phylogeny from genome rearrangement and gene order data, and can also obtain an estimation of ancestral genomes, given an input tree. MLGO takes the advantage of binary encoding on gene-order data, supports a fairly general model of genomic evolution (rearrangements plus duplications, insertions, and losses of genomic regions), and successfully accommodates itself into the framework of maximized likelihood.</p><p>Image Reference : Wiki</p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/26303/maker</guid>
	<pubDate>Sun, 07 Feb 2016 15:59:24 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/26303/maker</link>
	<title><![CDATA[MAKER]]></title>
	<description><![CDATA[<p>MAKER is a portable and easily configurable genome annotation pipeline.Its purpose is to allow smaller eukaryotic and prokaryotic genome projects to independently annotate their genomes and to create genome databases. MAKER identifies repeats, aligns ESTs and proteins to a genome, produces ab-initio gene predictions and automatically synthesizes these data into gene annotations having evidence-based quality values.</p>
<p>More at http://www.yandell-lab.org/software/maker.html</p><p>Address of the bookmark: <a href="http://www.yandell-lab.org/software/maker.html" rel="nofollow">http://www.yandell-lab.org/software/maker.html</a></p>]]></description>
	<dc:creator>Jitendra Narayan</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27463/bpipe-a-tool-for-running-and-managing-bioinformatics-pipelines</guid>
	<pubDate>Sat, 21 May 2016 22:42:16 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27463/bpipe-a-tool-for-running-and-managing-bioinformatics-pipelines</link>
	<title><![CDATA[Bpipe - a tool for running and managing bioinformatics pipelines]]></title>
	<description><![CDATA[<p>Bpipe provides a platform for running big bioinformatics jobs that consist of a series of processing stages - known as 'pipelines'.</p>
<ul>
<li>January 20th, 2016 - New! Bpipe 0.9.9 released!</li>
<li>Download <a href="http://download.bpipe.org/versions/bpipe-0.9.9.tar.gz">latest</a>, <a href="http://download.bpipe.org">all</a></li>
<li><a href="http://docs.bpipe.org">Documentation</a></li>
<li><a href="https://groups.google.com/forum/#%21forum/bpipe-discuss">Mailing List</a> (Google Group)</li>
</ul>
<p>Bpipe has been published in <a href="http://bioinformatics.oxfordjournals.org/content/early/2012/04/11/bioinformatics.bts167.abstract">Bioinformatics</a>! If you use Bpipe, please cite:</p>
<p><em>Sadedin S, Pope B &amp; Oshlack A, Bpipe: A Tool for Running and Managing Bioinformatics Pipelines, Bioinformatics</em></p><p>Address of the bookmark: <a href="http://docs.bpipe.org/" rel="nofollow">http://docs.bpipe.org/</a></p>]]></description>
	<dc:creator>Radha Agarkar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/17176/arvados</guid>
	<pubDate>Sat, 20 Sep 2014 16:54:21 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/17176/arvados</link>
	<title><![CDATA[Arvados]]></title>
	<description><![CDATA[<p>Arvados is a free and open&nbsp;source bioinformatics&nbsp;platform for genomic and&nbsp;biomedical data. User can&nbsp;Store | Organize | Compute | Share the data for free.&nbsp;</p>
<p><img src="https://arvados.org/images/dax.png" width="400" height="535" alt="image" style="border: 0px;"></p><p>Address of the bookmark: <a href="https://arvados.org/" rel="nofollow">https://arvados.org/</a></p>]]></description>
	<dc:creator>Martin Jones</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27696/methylkit</guid>
	<pubDate>Fri, 03 Jun 2016 10:09:29 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27696/methylkit</link>
	<title><![CDATA[methylKit]]></title>
	<description><![CDATA[<p><em>methylKit</em> is an <a href="http://en.wikipedia.org/wiki/R_%28programming_language%29">R</a> package for DNA methylation analysis and annotation from high-throughput bisulfite sequencing. The package is designed to deal with sequencing data from <a href="http://www.nature.com/nprot/journal/v6/n4/abs/nprot.2010.190.html">RRBS</a> and its variants, but also target-capture methods such as <a href="http://www.halogenomics.com/sureselect/methyl-seq">Agilent SureSelect methyl-seq</a>. In addition, methylKit can deal with base-pair resolution data for 5hmC obtained from Tab-seq or oxBS-seq. It can also handle whole-genome bisulfite sequencing data if proper input format is provided.</p><p>Address of the bookmark: <a href="https://github.com/al2na/methylKit" rel="nofollow">https://github.com/al2na/methylKit</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>